/[bfilter]/trunk/bfilter.js
This is repository of my old source code which isn't updated any more. Go to git.rot13.org for current projects!
ViewVC logotype

Contents of /trunk/bfilter.js

Parent Directory Parent Directory | Revision Log Revision Log


Revision 12 - (show annotations)
Sat Sep 11 08:21:57 2004 UTC (19 years, 7 months ago) by dpavlin
File MIME type: application/javascript
File size: 4721 byte(s)
separate debug div

1 /*
2 Fast filtering function using pre-sorted list elements
3 Dobrica Pavlinusic, dpavlin@rot13.org 2004-09-06
4 Matko Andjelinic, matko.andjelinic@gmail.com 2004-09-09 (contributed OO implementation)
5 */
6
7
8 function BFilter(arr) {
9 this.id_cache = Array();
10 // total number of hits
11 this.hits = 0;
12 this.html_pre = '<a href="';
13 this.html_mid = '">';
14 this.html_post = '</a><br/>';
15 this.html_full_pre = '';
16 this.html_full_post = '';
17
18 if (! arr) {
19 this.debug("ERROR: can't search empty array");
20 return;
21 }
22
23 this.arr = arr;
24 this.debug("index has "+this.arr.length+" parts");
25
26 if (! arr.min_len) {
27 this.results("ERROR: index structure problem");
28 return;
29 } else {
30 this.min_len = arr.min_len;
31 }
32
33 this.debug("index part has "+this.min_len+" parts");
34
35 this.show_status();
36
37 }
38
39 BFilter.prototype.element_id = function (id,no_alert) {
40 if (this.id_cache[id]) {
41 return this.id_cache[id];
42 } else {
43 var el = document.getElementById(id);
44 if (el) {
45 this.id_cache[id] = el;
46 return el;
47 } else {
48 if (! no_alert) {
49 alert("can't find element id: "+id);
50 } else {
51 // don't look it up again
52 this.id_cache[id] = null;
53 }
54 }
55 }
56 }
57
58
59 BFilter.prototype.show_status = function (status) {
60 var html;
61 if (this.hits > 0) {
62 html = "shown "+this.hits+" entries";
63 } else {
64 html = "no results";
65 }
66 if (! status) {
67 html = "Enter "+this.min_len+" letter"+(this.min_len == 1 ? '' : 's')+" to filter entries";
68 status = "";
69 }
70
71 var el = this.element_id("status");
72 el.innerHTML = html+status+"\n";
73 }
74
75 BFilter.prototype.results = function (html,clean) {
76
77 if (! html) { html = ""; }
78
79 // results_div.style.cursor = 'wait'; // 'auto'
80 var results_div = this.element_id("results");
81 if (clean) {
82 results_div.innerHTML = html + "\n";
83 } else {
84 results_div.innerHTML += this.html_full_pre + html +"\n" + this.html_full_post;
85 }
86 }
87
88
89 BFilter.prototype.debug = function (html) {
90
91 //return;
92
93 // check if debugging is on
94 if (! html) { return 1; }
95
96 var debug_div = this.element_id("debug",1);
97 if (! debug_div) { return; }
98
99 debug_div.innerHTML += html + "<br>\n";
100 }
101
102
103 // modified binary search to find first element with substring
104 BFilter.prototype.binarySearch = function (arr, find) {
105 if (!arr || typeof (find) == "undefined" || !arr.length) {
106 return null;
107 }
108 var low = 0;
109 var high = arr.length - 1;
110 var middlearr = parseInt(arr.length / 2);
111 var lastTry;
112 while (low <= high) {
113 var mid = (low + high) / 2;
114 var aTry = (mid < 1) ? 0 : parseInt(mid);
115
116 var curr = arr[aTry][1].substr(0,find.length).toLowerCase();
117 this.debug("low="+low+" high="+high+" lastTry="+lastTry+" "+aTry+": "+curr);
118 if (curr < find) {
119 low = aTry + 1;
120 continue;
121 }
122 if (curr > find) {
123 high = aTry - 1;
124 continue;
125 }
126 if (curr == find) {
127 high = aTry - 1;
128 lastTry = aTry;
129 continue;
130 }
131 return aTry;
132 }
133 this.debug("lastTry="+lastTry);
134
135 if (typeof (lastTry) != "undefined") {
136 return lastTry;
137 } else {
138 return null;
139 }
140 }
141
142 BFilter.prototype.filter = function (document, find) {
143
144 this.results('',1);
145 this.hits = 0;
146
147 if (find.length < this.min_len) {
148 this.show_status();
149 return;
150 }
151
152 this.debug("filter: '"+find+"'");
153
154 var find_lc = find.toLowerCase();
155
156 var part = find_lc.substr(0,this.min_len);
157
158 // no part found
159 if (! this.arr[part]) {
160 this.show_status(" for <em>"+find+"</em><br>");
161 this.debug("no part "+part);
162 return;
163 }
164
165 // start anim icon
166 //results("<img src=\"pie.gif\">&nbsp;Please wait, filtering...\n",1);
167
168 // full part? (optimization)
169 if (find.length == this.min_len) {
170 var html = '';
171 for (var i = 0; i < this.arr[part].length; i++) {
172 html += this.html_pre +
173 this.arr[part][i][0] +
174 this.html_mid +
175 (this.hits % 2 == 0 ? '<span style="background: #e0e0e0">' : '');
176 //if (this.debug()) { html += i+": "; }
177 html += this.arr[part][i][1] +
178 (this.hits % 2 == 0 ? '</span>' : '') +
179 this.html_post + "\n";
180 this.hits++;
181 }
182 this.results(html);
183 } else {
184
185 var from = this.binarySearch(this.arr[part], find_lc);
186
187 if (from != null) {
188
189 this.debug("loop "+from+" ... "+this.arr[part].length);
190
191 var html = '';
192
193 for(var i = from ; i < this.arr[part].length ; i++) {
194 if (this.arr[part][i][1].substring(0,find.length).toLowerCase() != find_lc) {
195 this.debug("loop exit at "+i);
196 break;
197 }
198 html += this.html_pre +
199 this.arr[part][i][0] +
200 this.html_mid +
201 (this.hits % 2 == 0 ? '<span style="background: #e0e0e0">' : '');
202 //if (this.debug()) { html += i+": "; }
203 html += this.arr[part][i][1] +
204 (this.hits % 2 == 0 ? '</span>' : '') +
205 this.html_post + "\n";
206 this.hits++;
207 }
208
209 this.results(html);
210 }
211
212 }
213
214 this.show_status(" for <em>"+find+"</em>");
215
216 }
217
218

  ViewVC Help
Powered by ViewVC 1.1.26