1 // Copyright 2010 Wincent Colaiuta. All rights reserved.
3 // Redistribution and use in source and binary forms, with or without
4 // modification, are permitted provided that the following conditions are met:
6 // 1. Redistributions of source code must retain the above copyright notice,
7 // this list of conditions and the following disclaimer.
8 // 2. Redistributions in binary form must reproduce the above copyright notice,
9 // this list of conditions and the following disclaimer in the documentation
10 // and/or other materials provided with the distribution.
12 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
13 // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
14 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
15 // ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE
16 // LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
17 // CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
18 // SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
19 // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
20 // CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
21 // ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
22 // POSSIBILITY OF SUCH DAMAGE.
24 #include <stdlib.h> /* for qsort() */
25 #include <string.h> /* for strcmp() */
28 #include "ruby_compat.h"
30 // comparison function for use with qsort
31 int comp_alpha(const void *a
, const void *b
)
33 VALUE a_val
= *(VALUE
*)a
;
34 VALUE b_val
= *(VALUE
*)b
;
35 ID to_s
= rb_intern("to_s");
37 VALUE a_str
= rb_funcall(a_val
, to_s
, 0);
38 VALUE b_str
= rb_funcall(b_val
, to_s
, 0);
39 char *a_p
= RSTRING_PTR(a_str
);
40 long a_len
= RSTRING_LEN(a_str
);
41 char *b_p
= RSTRING_PTR(b_str
);
42 long b_len
= RSTRING_LEN(b_str
);
46 order
= strncmp(a_p
, b_p
, b_len
);
48 order
= 1; // shorter string (b) wins
50 else if (a_len
< b_len
)
52 order
= strncmp(a_p
, b_p
, a_len
);
54 order
= -1; // shorter string (a) wins
57 order
= strncmp(a_p
, b_p
, a_len
);
61 // comparison function for use with qsort
62 int comp_score(const void *a
, const void *b
)
64 VALUE a_val
= *(VALUE
*)a
;
65 VALUE b_val
= *(VALUE
*)b
;
66 ID score
= rb_intern("score");
67 double a_score
= RFLOAT_VALUE(rb_funcall(a_val
, score
, 0));
68 double b_score
= RFLOAT_VALUE(rb_funcall(b_val
, score
, 0));
69 if (a_score
> b_score
)
70 return -1; // a scores higher, a should appear sooner
71 else if (a_score
< b_score
)
72 return 1; // b scores higher, a should appear later
74 return comp_alpha(a
, b
);
77 VALUE
CommandTMatcher_initialize(int argc
, VALUE
*argv
, VALUE self
)
79 // process arguments: 1 mandatory, 1 optional
80 VALUE scanner
, options
;
81 if (rb_scan_args(argc
, argv
, "11", &scanner
, &options
) == 1)
84 rb_raise(rb_eArgError
, "nil scanner");
85 rb_iv_set(self
, "@scanner", scanner
);
87 // check optional options hash for overrides
88 VALUE always_show_dot_files
= CommandT_option_from_hash("always_show_dot_files", options
);
89 if (always_show_dot_files
!= Qtrue
)
90 always_show_dot_files
= Qfalse
;
91 VALUE never_show_dot_files
= CommandT_option_from_hash("never_show_dot_files", options
);
92 if (never_show_dot_files
!= Qtrue
)
93 never_show_dot_files
= Qfalse
;
94 rb_iv_set(self
, "@always_show_dot_files", always_show_dot_files
);
95 rb_iv_set(self
, "@never_show_dot_files", never_show_dot_files
);
99 VALUE
CommandTMatcher_sorted_matches_for(VALUE self
, VALUE abbrev
, VALUE options
)
101 // process optional options hash
102 VALUE limit_option
= CommandT_option_from_hash("limit", options
);
104 // get unsorted matches
105 VALUE matches
= CommandTMatcher_matches_for(self
, abbrev
);
107 abbrev
= StringValue(abbrev
);
108 if (RSTRING_LEN(abbrev
) == 0 ||
109 (RSTRING_LEN(abbrev
) == 1 && RSTRING_PTR(abbrev
)[0] == '.'))
110 // alphabetic order if search string is only "" or "."
111 qsort(RARRAY_PTR(matches
), RARRAY_LEN(matches
), sizeof(VALUE
), comp_alpha
);
113 // for all other non-empty search strings, sort by score
114 qsort(RARRAY_PTR(matches
), RARRAY_LEN(matches
), sizeof(VALUE
), comp_score
);
116 // apply optional limit option
117 long limit
= NIL_P(limit_option
) ? 0 : NUM2LONG(limit_option
);
118 if (limit
== 0 || RARRAY_LEN(matches
) < limit
)
119 limit
= RARRAY_LEN(matches
);
121 // will return an array of strings, not an array of Match objects
122 for (long i
= 0; i
< limit
; i
++)
124 VALUE str
= rb_funcall(RARRAY_PTR(matches
)[i
], rb_intern("to_s"), 0);
125 RARRAY_PTR(matches
)[i
] = str
;
128 // trim off any items beyond the limit
129 if (limit
< RARRAY_LEN(matches
))
130 (void)rb_funcall(matches
, rb_intern("slice!"), 2, LONG2NUM(limit
),
131 LONG2NUM(RARRAY_LEN(matches
) - limit
));
135 VALUE
CommandTMatcher_matches_for(VALUE self
, VALUE abbrev
)
138 rb_raise(rb_eArgError
, "nil abbrev");
139 VALUE matches
= rb_ary_new();
140 VALUE scanner
= rb_iv_get(self
, "@scanner");
141 VALUE always_show_dot_files
= rb_iv_get(self
, "@always_show_dot_files");
142 VALUE never_show_dot_files
= rb_iv_get(self
, "@never_show_dot_files");
143 VALUE options
= Qnil
;
144 if (always_show_dot_files
== Qtrue
)
146 options
= rb_hash_new();
147 rb_hash_aset(options
, ID2SYM(rb_intern("always_show_dot_files")), always_show_dot_files
);
149 else if (never_show_dot_files
== Qtrue
)
151 options
= rb_hash_new();
152 rb_hash_aset(options
, ID2SYM(rb_intern("never_show_dot_files")), never_show_dot_files
);
154 abbrev
= rb_funcall(abbrev
, rb_intern("downcase"), 0);
155 VALUE paths
= rb_funcall(scanner
, rb_intern("paths"), 0);
156 for (long i
= 0, max
= RARRAY_LEN(paths
); i
< max
; i
++)
158 VALUE path
= RARRAY_PTR(paths
)[i
];
159 VALUE match
= rb_funcall(cCommandTMatch
, rb_intern("new"), 3, path
, abbrev
, options
);
160 if (rb_funcall(match
, rb_intern("matches?"), 0) == Qtrue
)
161 rb_funcall(matches
, rb_intern("push"), 1, match
);