]> git.r.bdr.sh - rbdr/dotfiles/blame - vim/tmp/command_t/ruby/command-t/matcher.c
Relative line numbers for vim
[rbdr/dotfiles] / vim / tmp / command_t / ruby / command-t / matcher.c
CommitLineData
0d23b6e5
BB
1// Copyright 2010 Wincent Colaiuta. All rights reserved.
2//
3// Redistribution and use in source and binary forms, with or without
4// modification, are permitted provided that the following conditions are met:
5//
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.
11//
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.
23
24#include <stdlib.h> /* for qsort() */
25#include <string.h> /* for strcmp() */
26#include "matcher.h"
27#include "ext.h"
28#include "ruby_compat.h"
29
30// comparison function for use with qsort
31int comp_alpha(const void *a, const void *b)
32{
33 VALUE a_val = *(VALUE *)a;
34 VALUE b_val = *(VALUE *)b;
35 ID to_s = rb_intern("to_s");
36
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);
43 int order = 0;
44 if (a_len > b_len)
45 {
46 order = strncmp(a_p, b_p, b_len);
47 if (order == 0)
48 order = 1; // shorter string (b) wins
49 }
50 else if (a_len < b_len)
51 {
52 order = strncmp(a_p, b_p, a_len);
53 if (order == 0)
54 order = -1; // shorter string (a) wins
55 }
56 else
57 order = strncmp(a_p, b_p, a_len);
58 return order;
59}
60
61// comparison function for use with qsort
62int comp_score(const void *a, const void *b)
63{
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
73 else
74 return comp_alpha(a, b);
75}
76
77VALUE CommandTMatcher_initialize(int argc, VALUE *argv, VALUE self)
78{
79 // process arguments: 1 mandatory, 1 optional
80 VALUE scanner, options;
81 if (rb_scan_args(argc, argv, "11", &scanner, &options) == 1)
82 options = Qnil;
83 if (NIL_P(scanner))
84 rb_raise(rb_eArgError, "nil scanner");
85 rb_iv_set(self, "@scanner", scanner);
86
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);
96 return Qnil;
97}
98
99VALUE CommandTMatcher_sorted_matches_for(VALUE self, VALUE abbrev, VALUE options)
100{
101 // process optional options hash
102 VALUE limit_option = CommandT_option_from_hash("limit", options);
103
104 // get unsorted matches
105 VALUE matches = CommandTMatcher_matches_for(self, abbrev);
106
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);
112 else
113 // for all other non-empty search strings, sort by score
114 qsort(RARRAY_PTR(matches), RARRAY_LEN(matches), sizeof(VALUE), comp_score);
115
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);
120
121 // will return an array of strings, not an array of Match objects
122 for (long i = 0; i < limit; i++)
123 {
124 VALUE str = rb_funcall(RARRAY_PTR(matches)[i], rb_intern("to_s"), 0);
125 RARRAY_PTR(matches)[i] = str;
126 }
127
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));
132 return matches;
133}
134
135VALUE CommandTMatcher_matches_for(VALUE self, VALUE abbrev)
136{
137 if (NIL_P(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)
145 {
146 options = rb_hash_new();
147 rb_hash_aset(options, ID2SYM(rb_intern("always_show_dot_files")), always_show_dot_files);
148 }
149 else if (never_show_dot_files == Qtrue)
150 {
151 options = rb_hash_new();
152 rb_hash_aset(options, ID2SYM(rb_intern("never_show_dot_files")), never_show_dot_files);
153 }
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++)
157 {
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);
162 }
163 return matches;
164}