@@ -74,7 +74,7 @@ discard block |
||
74 | 74 | $select = ''; |
75 | 75 | $count = count($args); |
76 | 76 | |
77 | - for ($i = 0; $i < $count; $i++) { |
|
77 | + for ($i = 0; $i<$count; $i++) { |
|
78 | 78 | switch ($args[$i]) { |
79 | 79 | case '-h': |
80 | 80 | case '--host': |
@@ -168,7 +168,7 @@ discard block |
||
168 | 168 | } |
169 | 169 | break; |
170 | 170 | default: |
171 | - $q .= $args[$i] . ' '; |
|
171 | + $q .= $args[$i].' '; |
|
172 | 172 | } |
173 | 173 | } |
174 | 174 | |
@@ -199,7 +199,7 @@ discard block |
||
199 | 199 | $cl->setSelect($select); |
200 | 200 | } |
201 | 201 | if ($limit) { |
202 | - $cl->setLimits(0, $limit, ($limit > 1000) ? $limit : 1000); |
|
202 | + $cl->setLimits(0, $limit, ($limit>1000) ? $limit : 1000); |
|
203 | 203 | } |
204 | 204 | $cl->setRankingMode($ranker); |
205 | 205 | $res = $cl->query($q, $index); |
@@ -208,16 +208,16 @@ discard block |
||
208 | 208 | // print me out |
209 | 209 | //////////////// |
210 | 210 | |
211 | - if ($res === false) { |
|
212 | - printf('Query failed: %s.' . PHP_EOL, $cl->getLastError()); |
|
211 | + if ($res===false) { |
|
212 | + printf('Query failed: %s.'.PHP_EOL, $cl->getLastError()); |
|
213 | 213 | |
214 | 214 | } else { |
215 | 215 | if ($cl->getLastWarning()) { |
216 | - printf('WARNING: %s' . PHP_EOL . PHP_EOL, $cl->getLastWarning()); |
|
216 | + printf('WARNING: %s'.PHP_EOL.PHP_EOL, $cl->getLastWarning()); |
|
217 | 217 | } |
218 | 218 | |
219 | 219 | print "Query '$q' retrieved {$res['total']} of {$res['total_found']} matches in {$res['time']} sec.\n"; |
220 | - print 'Query stats:' . PHP_EOL; |
|
220 | + print 'Query stats:'.PHP_EOL; |
|
221 | 221 | if (is_array($res['words'])) { |
222 | 222 | foreach ($res['words'] as $word => $info) { |
223 | 223 | print " '$word' found {$info['hits']} times in {$info['docs']} documents\n"; |
@@ -227,14 +227,14 @@ discard block |
||
227 | 227 | |
228 | 228 | if (is_array($res['matches'])) { |
229 | 229 | $n = 1; |
230 | - print 'Matches:' . PHP_EOL; |
|
230 | + print 'Matches:'.PHP_EOL; |
|
231 | 231 | foreach ($res['matches'] as $docinfo) { |
232 | 232 | print "$n. doc_id={$docinfo['id']}, weight={$docinfo['weight']}"; |
233 | 233 | foreach ($res['attrs'] as $attrname => $attrtype) { |
234 | 234 | $value = $docinfo['attrs'][$attrname]; |
235 | - if ($attrtype == SPH_ATTR_MULTI || $attrtype == SPH_ATTR_MULTI64) { |
|
236 | - $value = '(' . join(',', $value) . ')'; |
|
237 | - } elseif ($attrtype == SPH_ATTR_TIMESTAMP) { |
|
235 | + if ($attrtype==SPH_ATTR_MULTI || $attrtype==SPH_ATTR_MULTI64) { |
|
236 | + $value = '('.join(',', $value).')'; |
|
237 | + } elseif ($attrtype==SPH_ATTR_TIMESTAMP) { |
|
238 | 238 | $value = date('Y-m-d H:i:s', $value); |
239 | 239 | } |
240 | 240 | print ", $attrname=$value"; |
@@ -33,82 +33,82 @@ discard block |
||
33 | 33 | ///////////////////////////////////////////////////////////////////////////// |
34 | 34 | |
35 | 35 | /// known searchd commands |
36 | -define('SEARCHD_COMMAND_SEARCH', 0); |
|
37 | -define('SEARCHD_COMMAND_EXCERPT', 1); |
|
38 | -define('SEARCHD_COMMAND_UPDATE', 2); |
|
39 | -define('SEARCHD_COMMAND_KEYWORDS', 3); |
|
40 | -define('SEARCHD_COMMAND_PERSIST', 4); |
|
41 | -define('SEARCHD_COMMAND_STATUS', 5); |
|
36 | +define('SEARCHD_COMMAND_SEARCH', 0); |
|
37 | +define('SEARCHD_COMMAND_EXCERPT', 1); |
|
38 | +define('SEARCHD_COMMAND_UPDATE', 2); |
|
39 | +define('SEARCHD_COMMAND_KEYWORDS', 3); |
|
40 | +define('SEARCHD_COMMAND_PERSIST', 4); |
|
41 | +define('SEARCHD_COMMAND_STATUS', 5); |
|
42 | 42 | define('SEARCHD_COMMAND_FLUSHATTRS', 7); |
43 | 43 | |
44 | 44 | /// current client-side command implementation versions |
45 | -define('VER_COMMAND_SEARCH', 0x11E); |
|
46 | -define('VER_COMMAND_EXCERPT', 0x104); |
|
47 | -define('VER_COMMAND_UPDATE', 0x103); |
|
48 | -define('VER_COMMAND_KEYWORDS', 0x100); |
|
49 | -define('VER_COMMAND_STATUS', 0x101); |
|
50 | -define('VER_COMMAND_QUERY', 0x100); |
|
45 | +define('VER_COMMAND_SEARCH', 0x11E); |
|
46 | +define('VER_COMMAND_EXCERPT', 0x104); |
|
47 | +define('VER_COMMAND_UPDATE', 0x103); |
|
48 | +define('VER_COMMAND_KEYWORDS', 0x100); |
|
49 | +define('VER_COMMAND_STATUS', 0x101); |
|
50 | +define('VER_COMMAND_QUERY', 0x100); |
|
51 | 51 | define('VER_COMMAND_FLUSHATTRS', 0x100); |
52 | 52 | |
53 | 53 | /// known searchd status codes |
54 | -define('SEARCHD_OK', 0); |
|
55 | -define('SEARCHD_ERROR', 1); |
|
56 | -define('SEARCHD_RETRY', 2); |
|
54 | +define('SEARCHD_OK', 0); |
|
55 | +define('SEARCHD_ERROR', 1); |
|
56 | +define('SEARCHD_RETRY', 2); |
|
57 | 57 | define('SEARCHD_WARNING', 3); |
58 | 58 | |
59 | 59 | /// known match modes |
60 | -define('SPH_MATCH_ALL', 0); |
|
61 | -define('SPH_MATCH_ANY', 1); |
|
62 | -define('SPH_MATCH_PHRASE', 2); |
|
63 | -define('SPH_MATCH_BOOLEAN', 3); |
|
64 | -define('SPH_MATCH_EXTENDED', 4); |
|
65 | -define('SPH_MATCH_FULLSCAN', 5); |
|
60 | +define('SPH_MATCH_ALL', 0); |
|
61 | +define('SPH_MATCH_ANY', 1); |
|
62 | +define('SPH_MATCH_PHRASE', 2); |
|
63 | +define('SPH_MATCH_BOOLEAN', 3); |
|
64 | +define('SPH_MATCH_EXTENDED', 4); |
|
65 | +define('SPH_MATCH_FULLSCAN', 5); |
|
66 | 66 | define('SPH_MATCH_EXTENDED2', 6); // extended engine V2 (TEMPORARY, WILL BE REMOVED) |
67 | 67 | |
68 | 68 | /// known ranking modes (ext2 only) |
69 | 69 | define('SPH_RANK_PROXIMITY_BM25', 0); ///< default mode, phrase proximity major factor and BM25 minor one |
70 | -define('SPH_RANK_BM25', 1); ///< statistical mode, BM25 ranking only (faster but worse quality) |
|
71 | -define('SPH_RANK_NONE', 2); ///< no ranking, all matches get a weight of 1 |
|
72 | -define('SPH_RANK_WORDCOUNT', 3); ///< simple word-count weighting, rank is a weighted sum of per-field keyword occurence counts |
|
73 | -define('SPH_RANK_PROXIMITY', 4); |
|
74 | -define('SPH_RANK_MATCHANY', 5); |
|
75 | -define('SPH_RANK_FIELDMASK', 6); |
|
76 | -define('SPH_RANK_SPH04', 7); |
|
77 | -define('SPH_RANK_EXPR', 8); |
|
78 | -define('SPH_RANK_TOTAL', 9); |
|
70 | +define('SPH_RANK_BM25', 1); ///< statistical mode, BM25 ranking only (faster but worse quality) |
|
71 | +define('SPH_RANK_NONE', 2); ///< no ranking, all matches get a weight of 1 |
|
72 | +define('SPH_RANK_WORDCOUNT', 3); ///< simple word-count weighting, rank is a weighted sum of per-field keyword occurence counts |
|
73 | +define('SPH_RANK_PROXIMITY', 4); |
|
74 | +define('SPH_RANK_MATCHANY', 5); |
|
75 | +define('SPH_RANK_FIELDMASK', 6); |
|
76 | +define('SPH_RANK_SPH04', 7); |
|
77 | +define('SPH_RANK_EXPR', 8); |
|
78 | +define('SPH_RANK_TOTAL', 9); |
|
79 | 79 | |
80 | 80 | /// known sort modes |
81 | -define('SPH_SORT_RELEVANCE', 0); |
|
82 | -define('SPH_SORT_ATTR_DESC', 1); |
|
83 | -define('SPH_SORT_ATTR_ASC', 2); |
|
81 | +define('SPH_SORT_RELEVANCE', 0); |
|
82 | +define('SPH_SORT_ATTR_DESC', 1); |
|
83 | +define('SPH_SORT_ATTR_ASC', 2); |
|
84 | 84 | define('SPH_SORT_TIME_SEGMENTS', 3); |
85 | -define('SPH_SORT_EXTENDED', 4); |
|
86 | -define('SPH_SORT_EXPR', 5); |
|
85 | +define('SPH_SORT_EXTENDED', 4); |
|
86 | +define('SPH_SORT_EXPR', 5); |
|
87 | 87 | |
88 | 88 | /// known filter types |
89 | -define('SPH_FILTER_VALUES', 0); |
|
90 | -define('SPH_FILTER_RANGE', 1); |
|
89 | +define('SPH_FILTER_VALUES', 0); |
|
90 | +define('SPH_FILTER_RANGE', 1); |
|
91 | 91 | define('SPH_FILTER_FLOATRANGE', 2); |
92 | -define('SPH_FILTER_STRING', 3); |
|
92 | +define('SPH_FILTER_STRING', 3); |
|
93 | 93 | |
94 | 94 | /// known attribute types |
95 | -define('SPH_ATTR_INTEGER', 1); |
|
95 | +define('SPH_ATTR_INTEGER', 1); |
|
96 | 96 | define('SPH_ATTR_TIMESTAMP', 2); |
97 | -define('SPH_ATTR_ORDINAL', 3); |
|
98 | -define('SPH_ATTR_BOOL', 4); |
|
99 | -define('SPH_ATTR_FLOAT', 5); |
|
100 | -define('SPH_ATTR_BIGINT', 6); |
|
101 | -define('SPH_ATTR_STRING', 7); |
|
102 | -define('SPH_ATTR_FACTORS', 1001); |
|
103 | -define('SPH_ATTR_MULTI', 0x40000001); |
|
104 | -define('SPH_ATTR_MULTI64', 0x40000002); |
|
97 | +define('SPH_ATTR_ORDINAL', 3); |
|
98 | +define('SPH_ATTR_BOOL', 4); |
|
99 | +define('SPH_ATTR_FLOAT', 5); |
|
100 | +define('SPH_ATTR_BIGINT', 6); |
|
101 | +define('SPH_ATTR_STRING', 7); |
|
102 | +define('SPH_ATTR_FACTORS', 1001); |
|
103 | +define('SPH_ATTR_MULTI', 0x40000001); |
|
104 | +define('SPH_ATTR_MULTI64', 0x40000002); |
|
105 | 105 | |
106 | 106 | /// known grouping functions |
107 | -define('SPH_GROUPBY_DAY', 0); |
|
108 | -define('SPH_GROUPBY_WEEK', 1); |
|
109 | -define('SPH_GROUPBY_MONTH', 2); |
|
110 | -define('SPH_GROUPBY_YEAR', 3); |
|
111 | -define('SPH_GROUPBY_ATTR', 4); |
|
107 | +define('SPH_GROUPBY_DAY', 0); |
|
108 | +define('SPH_GROUPBY_WEEK', 1); |
|
109 | +define('SPH_GROUPBY_MONTH', 2); |
|
110 | +define('SPH_GROUPBY_YEAR', 3); |
|
111 | +define('SPH_GROUPBY_ATTR', 4); |
|
112 | 112 | define('SPH_GROUPBY_ATTRPAIR', 5); |
113 | 113 | |
114 | 114 | // important properties of PHP's integers: |
@@ -143,19 +143,19 @@ discard block |
||
143 | 143 | assert(is_numeric($v)); |
144 | 144 | |
145 | 145 | // x64 |
146 | - if (PHP_INT_SIZE >= 8) { |
|
146 | + if (PHP_INT_SIZE>=8) { |
|
147 | 147 | $v = (int)$v; |
148 | 148 | return pack('NN', $v >> 32, $v & 0xFFFFFFFF); |
149 | 149 | } |
150 | 150 | |
151 | 151 | // x32, int |
152 | 152 | if (is_int($v)) { |
153 | - return pack('NN', $v < 0 ? -1 : 0, $v); |
|
153 | + return pack('NN', $v<0 ? -1 : 0, $v); |
|
154 | 154 | } |
155 | 155 | |
156 | 156 | // x32, bcmath |
157 | 157 | if (function_exists('bcmul')) { |
158 | - if (bccomp($v, 0) == -1) { |
|
158 | + if (bccomp($v, 0)==-1) { |
|
159 | 159 | $v = bcadd('18446744073709551616', $v); |
160 | 160 | } |
161 | 161 | $h = bcdiv($v, '4294967296', 0); |
@@ -173,8 +173,8 @@ discard block |
||
173 | 173 | $l = $m - ($q * 4294967296.0); |
174 | 174 | $h = $hi * 2328.0 + $q; // (10 ^ 13) / (1 << 32) = 2328 |
175 | 175 | |
176 | - if ($v < 0) { |
|
177 | - if ($l == 0) { |
|
176 | + if ($v<0) { |
|
177 | + if ($l==0) { |
|
178 | 178 | $h = 4294967296.0 - $h; |
179 | 179 | } else { |
180 | 180 | $h = 4294967295.0 - $h; |
@@ -190,8 +190,8 @@ discard block |
||
190 | 190 | assert(is_numeric($v)); |
191 | 191 | |
192 | 192 | // x64 |
193 | - if (PHP_INT_SIZE >= 8) { |
|
194 | - assert($v >= 0); |
|
193 | + if (PHP_INT_SIZE>=8) { |
|
194 | + assert($v>=0); |
|
195 | 195 | |
196 | 196 | // x64, int |
197 | 197 | if (is_int($v)) { |
@@ -247,16 +247,16 @@ discard block |
||
247 | 247 | { |
248 | 248 | list($hi, $lo) = array_values(unpack('N*N*', $v)); |
249 | 249 | |
250 | - if (PHP_INT_SIZE >= 8) { |
|
251 | - if ($hi < 0) { // because php 5.2.2 to 5.2.5 is totally fucked up again |
|
250 | + if (PHP_INT_SIZE>=8) { |
|
251 | + if ($hi<0) { // because php 5.2.2 to 5.2.5 is totally fucked up again |
|
252 | 252 | $hi += 1 << 32; |
253 | 253 | } |
254 | - if ($lo < 0) { |
|
254 | + if ($lo<0) { |
|
255 | 255 | $lo += 1 << 32; |
256 | 256 | } |
257 | 257 | |
258 | 258 | // x64, int |
259 | - if ($hi <= 2147483647) { |
|
259 | + if ($hi<=2147483647) { |
|
260 | 260 | return ($hi << 32) + $lo; |
261 | 261 | } |
262 | 262 | |
@@ -269,20 +269,20 @@ discard block |
||
269 | 269 | $C = 100000; |
270 | 270 | $h = ((int)($hi / $C) << 32) + (int)($lo / $C); |
271 | 271 | $l = (($hi % $C) << 32) + ($lo % $C); |
272 | - if ($l > $C) { |
|
272 | + if ($l>$C) { |
|
273 | 273 | $h += (int)($l / $C); |
274 | 274 | $l = $l % $C; |
275 | 275 | } |
276 | 276 | |
277 | - if ($h == 0) { |
|
277 | + if ($h==0) { |
|
278 | 278 | return $l; |
279 | 279 | } |
280 | 280 | return sprintf('%d%05d', $h, $l); |
281 | 281 | } |
282 | 282 | |
283 | 283 | // x32, int |
284 | - if ($hi == 0) { |
|
285 | - if ($lo > 0) { |
|
284 | + if ($hi==0) { |
|
285 | + if ($lo>0) { |
|
286 | 286 | return $lo; |
287 | 287 | } |
288 | 288 | return sprintf('%u', $lo); |
@@ -309,10 +309,10 @@ discard block |
||
309 | 309 | |
310 | 310 | $h = sprintf('%.0f', $h); |
311 | 311 | $l = sprintf('%07.0f', $l); |
312 | - if ($h == '0') { |
|
312 | + if ($h=='0') { |
|
313 | 313 | return sprintf('%.0f', (float)$l); |
314 | 314 | } |
315 | - return $h . $l; |
|
315 | + return $h.$l; |
|
316 | 316 | } |
317 | 317 | |
318 | 318 | // unpack 64-bit signed |
@@ -321,24 +321,24 @@ discard block |
||
321 | 321 | list($hi, $lo) = array_values(unpack('N*N*', $v)); |
322 | 322 | |
323 | 323 | // x64 |
324 | - if (PHP_INT_SIZE >= 8) { |
|
325 | - if ($hi < 0) { // because php 5.2.2 to 5.2.5 is totally fucked up again |
|
324 | + if (PHP_INT_SIZE>=8) { |
|
325 | + if ($hi<0) { // because php 5.2.2 to 5.2.5 is totally fucked up again |
|
326 | 326 | $hi += 1 << 32; |
327 | 327 | } |
328 | - if ($lo < 0) { |
|
328 | + if ($lo<0) { |
|
329 | 329 | $lo += 1 << 32; |
330 | 330 | } |
331 | 331 | |
332 | 332 | return ($hi << 32) + $lo; |
333 | 333 | } |
334 | 334 | |
335 | - if ($hi == 0) { // x32, int |
|
336 | - if ($lo > 0) { |
|
335 | + if ($hi==0) { // x32, int |
|
336 | + if ($lo>0) { |
|
337 | 337 | return $lo; |
338 | 338 | } |
339 | 339 | return sprintf('%u', $lo); |
340 | - } elseif ($hi == -1) { // x32, int |
|
341 | - if ($lo < 0) { |
|
340 | + } elseif ($hi==-1) { // x32, int |
|
341 | + if ($lo<0) { |
|
342 | 342 | return $lo; |
343 | 343 | } |
344 | 344 | return sprintf('%.0f', $lo - 4294967296.0); |
@@ -346,7 +346,7 @@ discard block |
||
346 | 346 | |
347 | 347 | $neg = ''; |
348 | 348 | $c = 0; |
349 | - if ($hi < 0) { |
|
349 | + if ($hi<0) { |
|
350 | 350 | $hi = ~$hi; |
351 | 351 | $lo = ~$lo; |
352 | 352 | $c = 1; |
@@ -358,7 +358,7 @@ discard block |
||
358 | 358 | |
359 | 359 | // x32, bcmath |
360 | 360 | if (function_exists('bcmul')) { |
361 | - return $neg . bcadd(bcadd($lo, bcmul($hi, '4294967296')), $c); |
|
361 | + return $neg.bcadd(bcadd($lo, bcmul($hi, '4294967296')), $c); |
|
362 | 362 | } |
363 | 363 | |
364 | 364 | // x32, no-bcmath |
@@ -371,25 +371,25 @@ discard block |
||
371 | 371 | $mq = floor($m / 10000000.0); |
372 | 372 | $l = $m - $mq * 10000000.0 + $c; |
373 | 373 | $h = $q * 4294967296.0 + $r * 429.0 + $mq; |
374 | - if ($l == 10000000) { |
|
374 | + if ($l==10000000) { |
|
375 | 375 | $l = 0; |
376 | 376 | $h += 1; |
377 | 377 | } |
378 | 378 | |
379 | 379 | $h = sprintf('%.0f', $h); |
380 | 380 | $l = sprintf('%07.0f', $l); |
381 | - if ($h == '0') { |
|
382 | - return $neg . sprintf('%.0f', (float)$l); |
|
381 | + if ($h=='0') { |
|
382 | + return $neg.sprintf('%.0f', (float)$l); |
|
383 | 383 | } |
384 | - return $neg . $h . $l; |
|
384 | + return $neg.$h.$l; |
|
385 | 385 | } |
386 | 386 | |
387 | 387 | |
388 | 388 | function sphFixUint($value) |
389 | 389 | { |
390 | - if (PHP_INT_SIZE >= 8) { |
|
390 | + if (PHP_INT_SIZE>=8) { |
|
391 | 391 | // x64 route, workaround broken unpack() in 5.2.2+ |
392 | - if ($value < 0) { |
|
392 | + if ($value<0) { |
|
393 | 393 | $value += 1 << 32; |
394 | 394 | } |
395 | 395 | return $value; |
@@ -471,7 +471,7 @@ discard block |
||
471 | 471 | |
472 | 472 | public function __destruct() |
473 | 473 | { |
474 | - if ($this->socket !== false) { |
|
474 | + if ($this->socket!==false) { |
|
475 | 475 | fclose($this->socket); |
476 | 476 | } |
477 | 477 | } |
@@ -498,19 +498,19 @@ discard block |
||
498 | 498 | public function setServer($host, $port = 0) |
499 | 499 | { |
500 | 500 | assert(is_string($host)); |
501 | - if ($host[0] == '/') { |
|
502 | - $this->path = 'unix://' . $host; |
|
501 | + if ($host[0]=='/') { |
|
502 | + $this->path = 'unix://'.$host; |
|
503 | 503 | return; |
504 | 504 | } |
505 | - if (substr($host, 0, 7) == 'unix://') { |
|
505 | + if (substr($host, 0, 7)=='unix://') { |
|
506 | 506 | $this->path = $host; |
507 | 507 | return; |
508 | 508 | } |
509 | 509 | |
510 | 510 | $this->host = $host; |
511 | 511 | $port = intval($port); |
512 | - assert(0 <= $port && $port < 65536); |
|
513 | - $this->port = $port == 0 ? 9312 : $port; |
|
512 | + assert(0<=$port && $port<65536); |
|
513 | + $this->port = $port==0 ? 9312 : $port; |
|
514 | 514 | $this->path = ''; |
515 | 515 | } |
516 | 516 | |
@@ -524,7 +524,7 @@ discard block |
||
524 | 524 | |
525 | 525 | protected function send($handle, $data, $length) |
526 | 526 | { |
527 | - if (feof($handle) || fwrite($handle, $data, $length) !== $length) { |
|
527 | + if (feof($handle) || fwrite($handle, $data, $length)!==$length) { |
|
528 | 528 | $this->error = 'connection unexpectedly closed (timed out?)'; |
529 | 529 | $this->conn_error = true; |
530 | 530 | return false; |
@@ -555,7 +555,7 @@ discard block |
||
555 | 555 | /// connect to searchd server |
556 | 556 | protected function connect() |
557 | 557 | { |
558 | - if ($this->socket !== false) { |
|
558 | + if ($this->socket!==false) { |
|
559 | 559 | // we are in persistent connection mode, so we have a socket |
560 | 560 | // however, need to check whether it's still alive |
561 | 561 | if (!@feof($this->socket)) { |
@@ -578,7 +578,7 @@ discard block |
||
578 | 578 | $port = $this->port; |
579 | 579 | } |
580 | 580 | |
581 | - if ($this->timeout <= 0) { |
|
581 | + if ($this->timeout<=0) { |
|
582 | 582 | $fp = @fsockopen($host, $port, $errno, $errstr); |
583 | 583 | } else { |
584 | 584 | $fp = @fsockopen($host, $port, $errno, $errstr, $this->timeout); |
@@ -610,7 +610,7 @@ discard block |
||
610 | 610 | // check version |
611 | 611 | list(, $v) = unpack('N*', fread($fp, 4)); |
612 | 612 | $v = (int)$v; |
613 | - if ($v < 1) { |
|
613 | + if ($v<1) { |
|
614 | 614 | fclose($fp); |
615 | 615 | $this->error = "expected searchd protocol version 1+, got version '$v'"; |
616 | 616 | return false; |
@@ -626,10 +626,10 @@ discard block |
||
626 | 626 | $len = 0; |
627 | 627 | |
628 | 628 | $header = fread($fp, 8); |
629 | - if (strlen($header) == 8) { |
|
629 | + if (strlen($header)==8) { |
|
630 | 630 | list($status, $ver, $len) = array_values(unpack('n2a/Nb', $header)); |
631 | 631 | $left = $len; |
632 | - while ($left > 0 && !feof($fp)) { |
|
632 | + while ($left>0 && !feof($fp)) { |
|
633 | 633 | $chunk = fread($fp, min(8192, $left)); |
634 | 634 | if ($chunk) { |
635 | 635 | $response .= $chunk; |
@@ -637,13 +637,13 @@ discard block |
||
637 | 637 | } |
638 | 638 | } |
639 | 639 | } |
640 | - if ($this->socket === false) { |
|
640 | + if ($this->socket===false) { |
|
641 | 641 | fclose($fp); |
642 | 642 | } |
643 | 643 | |
644 | 644 | // check response |
645 | 645 | $read = strlen($response); |
646 | - if (!$response || $read != $len) { |
|
646 | + if (!$response || $read!=$len) { |
|
647 | 647 | $this->error = $len |
648 | 648 | ? "failed to read searchd response (status=$status, ver=$ver, len=$len, read=$read)" |
649 | 649 | : 'received zero-sized searchd response'; |
@@ -651,26 +651,26 @@ discard block |
||
651 | 651 | } |
652 | 652 | |
653 | 653 | // check status |
654 | - if ($status == SEARCHD_WARNING) { |
|
654 | + if ($status==SEARCHD_WARNING) { |
|
655 | 655 | list(, $wlen) = unpack('N*', substr($response, 0, 4)); |
656 | 656 | $this->warning = substr($response, 4, $wlen); |
657 | 657 | return substr($response, 4 + $wlen); |
658 | 658 | } |
659 | - if ($status == SEARCHD_ERROR) { |
|
660 | - $this->error = 'searchd error: ' . substr($response, 4); |
|
659 | + if ($status==SEARCHD_ERROR) { |
|
660 | + $this->error = 'searchd error: '.substr($response, 4); |
|
661 | 661 | return false; |
662 | 662 | } |
663 | - if ($status == SEARCHD_RETRY) { |
|
664 | - $this->error = 'temporary searchd error: ' . substr($response, 4); |
|
663 | + if ($status==SEARCHD_RETRY) { |
|
664 | + $this->error = 'temporary searchd error: '.substr($response, 4); |
|
665 | 665 | return false; |
666 | 666 | } |
667 | - if ($status != SEARCHD_OK) { |
|
667 | + if ($status!=SEARCHD_OK) { |
|
668 | 668 | $this->error = "unknown status code '$status'"; |
669 | 669 | return false; |
670 | 670 | } |
671 | 671 | |
672 | 672 | // check version |
673 | - if ($ver < $client_ver) { |
|
673 | + if ($ver<$client_ver) { |
|
674 | 674 | $this->warning = sprintf( |
675 | 675 | 'searchd command v.%d.%d older than client\'s v.%d.%d, some options might not work', |
676 | 676 | $ver >> 8, |
@@ -693,15 +693,15 @@ discard block |
||
693 | 693 | { |
694 | 694 | assert(is_int($offset)); |
695 | 695 | assert(is_int($limit)); |
696 | - assert($offset >= 0); |
|
697 | - assert($limit > 0); |
|
698 | - assert($max >= 0); |
|
696 | + assert($offset>=0); |
|
697 | + assert($limit>0); |
|
698 | + assert($max>=0); |
|
699 | 699 | $this->offset = $offset; |
700 | 700 | $this->limit = $limit; |
701 | - if ($max > 0) { |
|
701 | + if ($max>0) { |
|
702 | 702 | $this->max_matches = $max; |
703 | 703 | } |
704 | - if ($cutoff > 0) { |
|
704 | + if ($cutoff>0) { |
|
705 | 705 | $this->cutoff = $cutoff; |
706 | 706 | } |
707 | 707 | } |
@@ -711,7 +711,7 @@ discard block |
||
711 | 711 | public function setMaxQueryTime($max) |
712 | 712 | { |
713 | 713 | assert(is_int($max)); |
714 | - assert($max >= 0); |
|
714 | + assert($max>=0); |
|
715 | 715 | $this->max_query_time = $max; |
716 | 716 | } |
717 | 717 | |
@@ -723,21 +723,21 @@ discard block |
||
723 | 723 | E_USER_DEPRECATED |
724 | 724 | ); |
725 | 725 | assert( |
726 | - $mode == SPH_MATCH_ALL || |
|
727 | - $mode == SPH_MATCH_ANY || |
|
728 | - $mode == SPH_MATCH_PHRASE || |
|
729 | - $mode == SPH_MATCH_BOOLEAN || |
|
730 | - $mode == SPH_MATCH_EXTENDED || |
|
731 | - $mode == SPH_MATCH_FULLSCAN || |
|
732 | - $mode == SPH_MATCH_EXTENDED2 |
|
726 | + $mode==SPH_MATCH_ALL || |
|
727 | + $mode==SPH_MATCH_ANY || |
|
728 | + $mode==SPH_MATCH_PHRASE || |
|
729 | + $mode==SPH_MATCH_BOOLEAN || |
|
730 | + $mode==SPH_MATCH_EXTENDED || |
|
731 | + $mode==SPH_MATCH_FULLSCAN || |
|
732 | + $mode==SPH_MATCH_EXTENDED2 |
|
733 | 733 | ); |
734 | 734 | $this->mode = $mode; |
735 | 735 | } |
736 | 736 | |
737 | 737 | /// set ranking mode |
738 | - public function setRankingMode($ranker, $rankexpr='') |
|
738 | + public function setRankingMode($ranker, $rankexpr = '') |
|
739 | 739 | { |
740 | - assert($ranker === 0 || $ranker >= 1 && $ranker < SPH_RANK_TOTAL); |
|
740 | + assert($ranker===0 || $ranker>=1 && $ranker<SPH_RANK_TOTAL); |
|
741 | 741 | assert(is_string($rankexpr)); |
742 | 742 | $this->ranker = $ranker; |
743 | 743 | $this->rank_expr = $rankexpr; |
@@ -746,16 +746,16 @@ discard block |
||
746 | 746 | /// set matches sorting mode |
747 | 747 | public function setSortMode($mode, $sortby = '') |
748 | 748 | { |
749 | - assert ( |
|
750 | - $mode == SPH_SORT_RELEVANCE || |
|
751 | - $mode == SPH_SORT_ATTR_DESC || |
|
752 | - $mode == SPH_SORT_ATTR_ASC || |
|
753 | - $mode == SPH_SORT_TIME_SEGMENTS || |
|
754 | - $mode == SPH_SORT_EXTENDED || |
|
755 | - $mode == SPH_SORT_EXPR |
|
749 | + assert( |
|
750 | + $mode==SPH_SORT_RELEVANCE || |
|
751 | + $mode==SPH_SORT_ATTR_DESC || |
|
752 | + $mode==SPH_SORT_ATTR_ASC || |
|
753 | + $mode==SPH_SORT_TIME_SEGMENTS || |
|
754 | + $mode==SPH_SORT_EXTENDED || |
|
755 | + $mode==SPH_SORT_EXPR |
|
756 | 756 | ); |
757 | 757 | assert(is_string($sortby)); |
758 | - assert($mode == SPH_SORT_RELEVANCE || strlen($sortby) > 0); |
|
758 | + assert($mode==SPH_SORT_RELEVANCE || strlen($sortby)>0); |
|
759 | 759 | |
760 | 760 | $this->sort = $mode; |
761 | 761 | $this->sort_by = $sortby; |
@@ -799,7 +799,7 @@ discard block |
||
799 | 799 | { |
800 | 800 | assert(is_numeric($min)); |
801 | 801 | assert(is_numeric($max)); |
802 | - assert($min <= $max); |
|
802 | + assert($min<=$max); |
|
803 | 803 | $this->min_id = $min; |
804 | 804 | $this->max_id = $max; |
805 | 805 | } |
@@ -847,7 +847,7 @@ discard block |
||
847 | 847 | assert(is_string($attribute)); |
848 | 848 | assert(is_numeric($min)); |
849 | 849 | assert(is_numeric($max)); |
850 | - assert($min <= $max); |
|
850 | + assert($min<=$max); |
|
851 | 851 | |
852 | 852 | $this->filters[] = array( |
853 | 853 | 'type' => SPH_FILTER_RANGE, |
@@ -865,7 +865,7 @@ discard block |
||
865 | 865 | assert(is_string($attribute)); |
866 | 866 | assert(is_float($min)); |
867 | 867 | assert(is_float($max)); |
868 | - assert($min <= $max); |
|
868 | + assert($min<=$max); |
|
869 | 869 | |
870 | 870 | $this->filters[] = array( |
871 | 871 | 'type' => SPH_FILTER_FLOATRANGE, |
@@ -900,12 +900,12 @@ discard block |
||
900 | 900 | assert(is_string($attribute)); |
901 | 901 | assert(is_string($groupsort)); |
902 | 902 | assert( |
903 | - $func == SPH_GROUPBY_DAY || |
|
904 | - $func == SPH_GROUPBY_WEEK || |
|
905 | - $func == SPH_GROUPBY_MONTH || |
|
906 | - $func == SPH_GROUPBY_YEAR || |
|
907 | - $func == SPH_GROUPBY_ATTR || |
|
908 | - $func == SPH_GROUPBY_ATTRPAIR |
|
903 | + $func==SPH_GROUPBY_DAY || |
|
904 | + $func==SPH_GROUPBY_WEEK || |
|
905 | + $func==SPH_GROUPBY_MONTH || |
|
906 | + $func==SPH_GROUPBY_YEAR || |
|
907 | + $func==SPH_GROUPBY_ATTR || |
|
908 | + $func==SPH_GROUPBY_ATTRPAIR |
|
909 | 909 | ); |
910 | 910 | |
911 | 911 | $this->group_by = $attribute; |
@@ -923,8 +923,8 @@ discard block |
||
923 | 923 | /// set distributed retries count and delay |
924 | 924 | public function setRetries($count, $delay = 0) |
925 | 925 | { |
926 | - assert(is_int($count) && $count >= 0); |
|
927 | - assert(is_int($delay) && $delay >= 0); |
|
926 | + assert(is_int($count) && $count>=0); |
|
927 | + assert(is_int($delay) && $delay>=0); |
|
928 | 928 | $this->retry_count = $count; |
929 | 929 | $this->retry_delay = $delay; |
930 | 930 | } |
@@ -981,12 +981,12 @@ discard block |
||
981 | 981 | 'global_idf', |
982 | 982 | 'low_priority' |
983 | 983 | ); |
984 | - $flags = array ( |
|
984 | + $flags = array( |
|
985 | 985 | 'reverse_scan' => array(0, 1), |
986 | 986 | 'sort_method' => array('pq', 'kbuffer'), |
987 | 987 | 'max_predicted_time' => array(0), |
988 | 988 | 'boolean_simplify' => array(true, false), |
989 | - 'idf' => array ('normalized', 'plain', 'tfidf_normalized', 'tfidf_unnormalized'), |
|
989 | + 'idf' => array('normalized', 'plain', 'tfidf_normalized', 'tfidf_unnormalized'), |
|
990 | 990 | 'global_idf' => array(true, false), |
991 | 991 | 'low_priority' => array(true, false) |
992 | 992 | ); |
@@ -994,29 +994,29 @@ discard block |
||
994 | 994 | assert(isset($flag_name, $known_names)); |
995 | 995 | assert( |
996 | 996 | in_array($flag_value, $flags[$flag_name], true) || |
997 | - ($flag_name == 'max_predicted_time' && is_int($flag_value) && $flag_value >= 0) |
|
997 | + ($flag_name=='max_predicted_time' && is_int($flag_value) && $flag_value>=0) |
|
998 | 998 | ); |
999 | 999 | |
1000 | 1000 | switch ($flag_name) { |
1001 | 1001 | case 'reverse_scan': |
1002 | - $this->query_flags = sphSetBit($this->query_flags, 0, $flag_value == 1); |
|
1002 | + $this->query_flags = sphSetBit($this->query_flags, 0, $flag_value==1); |
|
1003 | 1003 | break; |
1004 | 1004 | case 'sort_method': |
1005 | - $this->query_flags = sphSetBit($this->query_flags, 1, $flag_value == 'kbuffer'); |
|
1005 | + $this->query_flags = sphSetBit($this->query_flags, 1, $flag_value=='kbuffer'); |
|
1006 | 1006 | break; |
1007 | 1007 | case 'max_predicted_time': |
1008 | - $this->query_flags = sphSetBit($this->query_flags, 2, $flag_value > 0); |
|
1008 | + $this->query_flags = sphSetBit($this->query_flags, 2, $flag_value>0); |
|
1009 | 1009 | $this->predicted_time = (int)$flag_value; |
1010 | 1010 | break; |
1011 | 1011 | case 'boolean_simplify': |
1012 | 1012 | $this->query_flags = sphSetBit($this->query_flags, 3, $flag_value); |
1013 | 1013 | break; |
1014 | 1014 | case 'idf': |
1015 | - if ($flag_value == 'normalized' || $flag_value == 'plain') { |
|
1016 | - $this->query_flags = sphSetBit($this->query_flags, 4, $flag_value == 'plain'); |
|
1015 | + if ($flag_value=='normalized' || $flag_value=='plain') { |
|
1016 | + $this->query_flags = sphSetBit($this->query_flags, 4, $flag_value=='plain'); |
|
1017 | 1017 | } |
1018 | - if ($flag_value == 'tfidf_normalized' || $flag_value == 'tfidf_unnormalized') { |
|
1019 | - $this->query_flags = sphSetBit($this->query_flags, 6, $flag_value == 'tfidf_normalized'); |
|
1018 | + if ($flag_value=='tfidf_normalized' || $flag_value=='tfidf_unnormalized') { |
|
1019 | + $this->query_flags = sphSetBit($this->query_flags, 6, $flag_value=='tfidf_normalized'); |
|
1020 | 1020 | } |
1021 | 1021 | break; |
1022 | 1022 | case 'global_idf': |
@@ -1034,8 +1034,8 @@ discard block |
||
1034 | 1034 | assert(is_string($orderby)); |
1035 | 1035 | assert(is_int($offset)); |
1036 | 1036 | assert(is_int($limit)); |
1037 | - assert($offset >= 0); |
|
1038 | - assert($limit > 0); |
|
1037 | + assert($offset>=0); |
|
1038 | + assert($limit>0); |
|
1039 | 1039 | |
1040 | 1040 | $this->outer_order_by = $orderby; |
1041 | 1041 | $this->outer_offset = $offset; |
@@ -1100,7 +1100,7 @@ discard block |
||
1100 | 1100 | |
1101 | 1101 | $this->error = $results[0]['error']; |
1102 | 1102 | $this->warning = $results[0]['warning']; |
1103 | - if ($results[0]['status'] == SEARCHD_ERROR) { |
|
1103 | + if ($results[0]['status']==SEARCHD_ERROR) { |
|
1104 | 1104 | return false; |
1105 | 1105 | } else { |
1106 | 1106 | return $results[0]; |
@@ -1124,24 +1124,24 @@ discard block |
||
1124 | 1124 | |
1125 | 1125 | // build request |
1126 | 1126 | $req = pack('NNNNN', $this->query_flags, $this->offset, $this->limit, $this->mode, $this->ranker); |
1127 | - if ($this->ranker == SPH_RANK_EXPR) { |
|
1128 | - $req .= pack('N', strlen($this->rank_expr)) . $this->rank_expr; |
|
1127 | + if ($this->ranker==SPH_RANK_EXPR) { |
|
1128 | + $req .= pack('N', strlen($this->rank_expr)).$this->rank_expr; |
|
1129 | 1129 | } |
1130 | 1130 | $req .= pack('N', $this->sort); // (deprecated) sort mode |
1131 | - $req .= pack('N', strlen($this->sort_by)) . $this->sort_by; |
|
1132 | - $req .= pack('N', strlen($query)) . $query; // query itself |
|
1131 | + $req .= pack('N', strlen($this->sort_by)).$this->sort_by; |
|
1132 | + $req .= pack('N', strlen($query)).$query; // query itself |
|
1133 | 1133 | $req .= pack('N', count($this->weights)); // weights |
1134 | 1134 | foreach ($this->weights as $weight) { |
1135 | 1135 | $req .= pack('N', (int)$weight); |
1136 | 1136 | } |
1137 | - $req .= pack('N', strlen($index)) . $index; // indexes |
|
1137 | + $req .= pack('N', strlen($index)).$index; // indexes |
|
1138 | 1138 | $req .= pack('N', 1); // id64 range marker |
1139 | - $req .= sphPackU64($this->min_id) . sphPackU64($this->max_id); // id64 range |
|
1139 | + $req .= sphPackU64($this->min_id).sphPackU64($this->max_id); // id64 range |
|
1140 | 1140 | |
1141 | 1141 | // filters |
1142 | 1142 | $req .= pack('N', count($this->filters)); |
1143 | 1143 | foreach ($this->filters as $filter) { |
1144 | - $req .= pack('N', strlen($filter['attr'])) . $filter['attr']; |
|
1144 | + $req .= pack('N', strlen($filter['attr'])).$filter['attr']; |
|
1145 | 1145 | $req .= pack('N', $filter['type']); |
1146 | 1146 | switch ($filter['type']) { |
1147 | 1147 | case SPH_FILTER_VALUES: |
@@ -1151,13 +1151,13 @@ discard block |
||
1151 | 1151 | } |
1152 | 1152 | break; |
1153 | 1153 | case SPH_FILTER_RANGE: |
1154 | - $req .= sphPackI64($filter['min']) . sphPackI64($filter['max']); |
|
1154 | + $req .= sphPackI64($filter['min']).sphPackI64($filter['max']); |
|
1155 | 1155 | break; |
1156 | 1156 | case SPH_FILTER_FLOATRANGE: |
1157 | - $req .= $this->packFloat($filter['min']) . $this->packFloat($filter['max']); |
|
1157 | + $req .= $this->packFloat($filter['min']).$this->packFloat($filter['max']); |
|
1158 | 1158 | break; |
1159 | 1159 | case SPH_FILTER_STRING: |
1160 | - $req .= pack('N', strlen($filter['value'])) . $filter['value']; |
|
1160 | + $req .= pack('N', strlen($filter['value'])).$filter['value']; |
|
1161 | 1161 | break; |
1162 | 1162 | default: |
1163 | 1163 | assert(0 && 'internal error: unhandled filter type'); |
@@ -1166,27 +1166,27 @@ discard block |
||
1166 | 1166 | } |
1167 | 1167 | |
1168 | 1168 | // group-by clause, max-matches count, group-sort clause, cutoff count |
1169 | - $req .= pack('NN', $this->group_func, strlen($this->group_by)) . $this->group_by; |
|
1169 | + $req .= pack('NN', $this->group_func, strlen($this->group_by)).$this->group_by; |
|
1170 | 1170 | $req .= pack('N', $this->max_matches); |
1171 | - $req .= pack('N', strlen($this->group_sort)) . $this->group_sort; |
|
1171 | + $req .= pack('N', strlen($this->group_sort)).$this->group_sort; |
|
1172 | 1172 | $req .= pack('NNN', $this->cutoff, $this->retry_count, $this->retry_delay); |
1173 | - $req .= pack('N', strlen($this->group_distinct)) . $this->group_distinct; |
|
1173 | + $req .= pack('N', strlen($this->group_distinct)).$this->group_distinct; |
|
1174 | 1174 | |
1175 | 1175 | // anchor point |
1176 | 1176 | if (empty($this->anchor)) { |
1177 | 1177 | $req .= pack('N', 0); |
1178 | 1178 | } else { |
1179 | - $a =& $this->anchor; |
|
1179 | + $a = & $this->anchor; |
|
1180 | 1180 | $req .= pack('N', 1); |
1181 | - $req .= pack('N', strlen($a['attrlat'])) . $a['attrlat']; |
|
1182 | - $req .= pack('N', strlen($a['attrlong'])) . $a['attrlong']; |
|
1183 | - $req .= $this->packFloat($a['lat']) . $this->packFloat($a['long']); |
|
1181 | + $req .= pack('N', strlen($a['attrlat'])).$a['attrlat']; |
|
1182 | + $req .= pack('N', strlen($a['attrlong'])).$a['attrlong']; |
|
1183 | + $req .= $this->packFloat($a['lat']).$this->packFloat($a['long']); |
|
1184 | 1184 | } |
1185 | 1185 | |
1186 | 1186 | // per-index weights |
1187 | 1187 | $req .= pack('N', count($this->index_weights)); |
1188 | 1188 | foreach ($this->index_weights as $idx => $weight) { |
1189 | - $req .= pack('N', strlen($idx)) . $idx . pack('N', $weight); |
|
1189 | + $req .= pack('N', strlen($idx)).$idx.pack('N', $weight); |
|
1190 | 1190 | } |
1191 | 1191 | |
1192 | 1192 | // max query time |
@@ -1195,16 +1195,16 @@ discard block |
||
1195 | 1195 | // per-field weights |
1196 | 1196 | $req .= pack('N', count($this->field_weights)); |
1197 | 1197 | foreach ($this->field_weights as $field => $weight) { |
1198 | - $req .= pack('N', strlen($field)) . $field . pack('N', $weight); |
|
1198 | + $req .= pack('N', strlen($field)).$field.pack('N', $weight); |
|
1199 | 1199 | } |
1200 | 1200 | |
1201 | 1201 | // comment |
1202 | - $req .= pack('N', strlen($comment)) . $comment; |
|
1202 | + $req .= pack('N', strlen($comment)).$comment; |
|
1203 | 1203 | |
1204 | 1204 | // attribute overrides |
1205 | 1205 | $req .= pack('N', count($this->overrides)); |
1206 | 1206 | foreach ($this->overrides as $key => $entry) { |
1207 | - $req .= pack('N', strlen($entry['attr'])) . $entry['attr']; |
|
1207 | + $req .= pack('N', strlen($entry['attr'])).$entry['attr']; |
|
1208 | 1208 | $req .= pack('NN', $entry['type'], count($entry['values'])); |
1209 | 1209 | foreach ($entry['values'] as $id => $val) { |
1210 | 1210 | assert(is_numeric($id)); |
@@ -1226,14 +1226,14 @@ discard block |
||
1226 | 1226 | } |
1227 | 1227 | |
1228 | 1228 | // select-list |
1229 | - $req .= pack('N', strlen($this->select)) . $this->select; |
|
1229 | + $req .= pack('N', strlen($this->select)).$this->select; |
|
1230 | 1230 | |
1231 | 1231 | // max_predicted_time |
1232 | - if ($this->predicted_time > 0) { |
|
1232 | + if ($this->predicted_time>0) { |
|
1233 | 1233 | $req .= pack('N', (int)$this->predicted_time); |
1234 | 1234 | } |
1235 | 1235 | |
1236 | - $req .= pack('N', strlen($this->outer_order_by)) . $this->outer_order_by; |
|
1236 | + $req .= pack('N', strlen($this->outer_order_by)).$this->outer_order_by; |
|
1237 | 1237 | $req .= pack('NN', $this->outer_offset, $this->outer_limit); |
1238 | 1238 | if ($this->has_outer) { |
1239 | 1239 | $req .= pack('N', 1); |
@@ -1269,7 +1269,7 @@ discard block |
||
1269 | 1269 | $nreqs = count($this->reqs); |
1270 | 1270 | $req = join('', $this->reqs); |
1271 | 1271 | $len = 8 + strlen($req); |
1272 | - $req = pack('nnNNN', SEARCHD_COMMAND_SEARCH, VER_COMMAND_SEARCH, $len, 0, $nreqs) . $req; // add header |
|
1272 | + $req = pack('nnNNN', SEARCHD_COMMAND_SEARCH, VER_COMMAND_SEARCH, $len, 0, $nreqs).$req; // add header |
|
1273 | 1273 | |
1274 | 1274 | if (!$this->send($fp, $req, $len + 8) || !($response = $this->getResponse($fp, VER_COMMAND_SEARCH))) { |
1275 | 1275 | $this->mbPop(); |
@@ -1290,9 +1290,9 @@ discard block |
||
1290 | 1290 | $max = strlen($response); // max position for checks, to protect against broken responses |
1291 | 1291 | |
1292 | 1292 | $results = array(); |
1293 | - for ($ires = 0; $ires < $nreqs && $p < $max; $ires++) { |
|
1293 | + for ($ires = 0; $ires<$nreqs && $p<$max; $ires++) { |
|
1294 | 1294 | $results[] = array(); |
1295 | - $result =& $results[$ires]; |
|
1295 | + $result = & $results[$ires]; |
|
1296 | 1296 | |
1297 | 1297 | $result['error'] = ''; |
1298 | 1298 | $result['warning'] = ''; |
@@ -1301,13 +1301,13 @@ discard block |
||
1301 | 1301 | list(, $status) = unpack('N*', substr($response, $p, 4)); |
1302 | 1302 | $p += 4; |
1303 | 1303 | $result['status'] = $status; |
1304 | - if ($status != SEARCHD_OK) { |
|
1304 | + if ($status!=SEARCHD_OK) { |
|
1305 | 1305 | list(, $len) = unpack('N*', substr($response, $p, 4)); |
1306 | 1306 | $p += 4; |
1307 | 1307 | $message = substr($response, $p, $len); |
1308 | 1308 | $p += $len; |
1309 | 1309 | |
1310 | - if ($status == SEARCHD_WARNING) { |
|
1310 | + if ($status==SEARCHD_WARNING) { |
|
1311 | 1311 | $result['warning'] = $message; |
1312 | 1312 | } else { |
1313 | 1313 | $result['error'] = $message; |
@@ -1321,7 +1321,7 @@ discard block |
||
1321 | 1321 | |
1322 | 1322 | list(, $nfields) = unpack('N*', substr($response, $p, 4)); |
1323 | 1323 | $p += 4; |
1324 | - while ($nfields --> 0 && $p < $max) { |
|
1324 | + while ($nfields-->0 && $p<$max) { |
|
1325 | 1325 | list(, $len) = unpack('N*', substr($response, $p, 4)); |
1326 | 1326 | $p += 4; |
1327 | 1327 | $fields[] = substr($response, $p, $len); |
@@ -1331,7 +1331,7 @@ discard block |
||
1331 | 1331 | |
1332 | 1332 | list(, $nattrs) = unpack('N*', substr($response, $p, 4)); |
1333 | 1333 | $p += 4; |
1334 | - while ($nattrs --> 0 && $p < $max) { |
|
1334 | + while ($nattrs-->0 && $p<$max) { |
|
1335 | 1335 | list(, $len) = unpack('N*', substr($response, $p, 4)); |
1336 | 1336 | $p += 4; |
1337 | 1337 | $attr = substr($response, $p, $len); |
@@ -1350,7 +1350,7 @@ discard block |
||
1350 | 1350 | |
1351 | 1351 | // read matches |
1352 | 1352 | $idx = -1; |
1353 | - while ($count --> 0 && $p < $max) { |
|
1353 | + while ($count-->0 && $p<$max) { |
|
1354 | 1354 | // index into result array |
1355 | 1355 | $idx++; |
1356 | 1356 | |
@@ -1378,14 +1378,14 @@ discard block |
||
1378 | 1378 | $attrvals = array(); |
1379 | 1379 | foreach ($attrs as $attr => $type) { |
1380 | 1380 | // handle 64bit ints |
1381 | - if ($type == SPH_ATTR_BIGINT) { |
|
1381 | + if ($type==SPH_ATTR_BIGINT) { |
|
1382 | 1382 | $attrvals[$attr] = sphUnpackI64(substr($response, $p, 8)); |
1383 | 1383 | $p += 8; |
1384 | 1384 | continue; |
1385 | 1385 | } |
1386 | 1386 | |
1387 | 1387 | // handle floats |
1388 | - if ($type == SPH_ATTR_FLOAT) { |
|
1388 | + if ($type==SPH_ATTR_FLOAT) { |
|
1389 | 1389 | list(, $uval) = unpack('N*', substr($response, $p, 4)); |
1390 | 1390 | $p += 4; |
1391 | 1391 | list(, $fval) = unpack('f*', pack('L', $uval)); |
@@ -1396,28 +1396,28 @@ discard block |
||
1396 | 1396 | // handle everything else as unsigned ints |
1397 | 1397 | list(, $val) = unpack('N*', substr($response, $p, 4)); |
1398 | 1398 | $p += 4; |
1399 | - if ($type == SPH_ATTR_MULTI) { |
|
1399 | + if ($type==SPH_ATTR_MULTI) { |
|
1400 | 1400 | $attrvals[$attr] = array(); |
1401 | 1401 | $nvalues = $val; |
1402 | - while ($nvalues --> 0 && $p < $max) { |
|
1402 | + while ($nvalues-->0 && $p<$max) { |
|
1403 | 1403 | list(, $val) = unpack('N*', substr($response, $p, 4)); |
1404 | 1404 | $p += 4; |
1405 | 1405 | $attrvals[$attr][] = sphFixUint($val); |
1406 | 1406 | } |
1407 | - } elseif ($type == SPH_ATTR_MULTI64) { |
|
1407 | + } elseif ($type==SPH_ATTR_MULTI64) { |
|
1408 | 1408 | $attrvals[$attr] = array(); |
1409 | 1409 | $nvalues = $val; |
1410 | - while ($nvalues > 0 && $p < $max) { |
|
1410 | + while ($nvalues>0 && $p<$max) { |
|
1411 | 1411 | $attrvals[$attr][] = sphUnpackI64(substr($response, $p, 8)); |
1412 | 1412 | $p += 8; |
1413 | 1413 | $nvalues -= 2; |
1414 | 1414 | } |
1415 | - } elseif ($type == SPH_ATTR_STRING) { |
|
1415 | + } elseif ($type==SPH_ATTR_STRING) { |
|
1416 | 1416 | $attrvals[$attr] = substr($response, $p, $val); |
1417 | 1417 | $p += $val; |
1418 | - } elseif ($type == SPH_ATTR_FACTORS) { |
|
1418 | + } elseif ($type==SPH_ATTR_FACTORS) { |
|
1419 | 1419 | $attrvals[$attr] = substr($response, $p, $val - 4); |
1420 | - $p += $val-4; |
|
1420 | + $p += $val - 4; |
|
1421 | 1421 | } else { |
1422 | 1422 | $attrvals[$attr] = sphFixUint($val); |
1423 | 1423 | } |
@@ -1436,14 +1436,14 @@ discard block |
||
1436 | 1436 | $result['time'] = sprintf('%.3f', $msecs / 1000); |
1437 | 1437 | $p += 16; |
1438 | 1438 | |
1439 | - while ($words --> 0 && $p < $max) { |
|
1439 | + while ($words-->0 && $p<$max) { |
|
1440 | 1440 | list(, $len) = unpack('N*', substr($response, $p, 4)); |
1441 | 1441 | $p += 4; |
1442 | 1442 | $word = substr($response, $p, $len); |
1443 | 1443 | $p += $len; |
1444 | 1444 | list($docs, $hits) = array_values(unpack('N*N*', substr($response, $p, 8))); |
1445 | 1445 | $p += 8; |
1446 | - $result['words'][$word] = array ( |
|
1446 | + $result['words'][$word] = array( |
|
1447 | 1447 | 'docs' => sprintf('%u', $docs), |
1448 | 1448 | 'hits' => sprintf('%u', $hits) |
1449 | 1449 | ); |
@@ -1578,23 +1578,23 @@ discard block |
||
1578 | 1578 | $flags |= 1024; |
1579 | 1579 | } |
1580 | 1580 | $req = pack('NN', 0, $flags); // mode=0, flags=$flags |
1581 | - $req .= pack('N', strlen($index)) . $index; // req index |
|
1582 | - $req .= pack('N', strlen($words)) . $words; // req words |
|
1581 | + $req .= pack('N', strlen($index)).$index; // req index |
|
1582 | + $req .= pack('N', strlen($words)).$words; // req words |
|
1583 | 1583 | |
1584 | 1584 | // options |
1585 | - $req .= pack('N', strlen($opts['before_match'])) . $opts['before_match']; |
|
1586 | - $req .= pack('N', strlen($opts['after_match'])) . $opts['after_match']; |
|
1587 | - $req .= pack('N', strlen($opts['chunk_separator'])) . $opts['chunk_separator']; |
|
1585 | + $req .= pack('N', strlen($opts['before_match'])).$opts['before_match']; |
|
1586 | + $req .= pack('N', strlen($opts['after_match'])).$opts['after_match']; |
|
1587 | + $req .= pack('N', strlen($opts['chunk_separator'])).$opts['chunk_separator']; |
|
1588 | 1588 | $req .= pack('NN', (int)$opts['limit'], (int)$opts['around']); |
1589 | 1589 | $req .= pack('NNN', (int)$opts['limit_passages'], (int)$opts['limit_words'], (int)$opts['start_passage_id']); // v.1.2 |
1590 | - $req .= pack('N', strlen($opts['html_strip_mode'])) . $opts['html_strip_mode']; |
|
1591 | - $req .= pack('N', strlen($opts['passage_boundary'])) . $opts['passage_boundary']; |
|
1590 | + $req .= pack('N', strlen($opts['html_strip_mode'])).$opts['html_strip_mode']; |
|
1591 | + $req .= pack('N', strlen($opts['passage_boundary'])).$opts['passage_boundary']; |
|
1592 | 1592 | |
1593 | 1593 | // documents |
1594 | 1594 | $req .= pack('N', count($docs)); |
1595 | 1595 | foreach ($docs as $doc) { |
1596 | 1596 | assert(is_string($doc)); |
1597 | - $req .= pack('N', strlen($doc)) . $doc; |
|
1597 | + $req .= pack('N', strlen($doc)).$doc; |
|
1598 | 1598 | } |
1599 | 1599 | |
1600 | 1600 | //////////////////////////// |
@@ -1602,7 +1602,7 @@ discard block |
||
1602 | 1602 | //////////////////////////// |
1603 | 1603 | |
1604 | 1604 | $len = strlen($req); |
1605 | - $req = pack('nnN', SEARCHD_COMMAND_EXCERPT, VER_COMMAND_EXCERPT, $len) . $req; // add header |
|
1605 | + $req = pack('nnN', SEARCHD_COMMAND_EXCERPT, VER_COMMAND_EXCERPT, $len).$req; // add header |
|
1606 | 1606 | if (!$this->send($fp, $req, $len + 8) || !($response = $this->getResponse($fp, VER_COMMAND_EXCERPT))) { |
1607 | 1607 | $this->mbPop(); |
1608 | 1608 | return false; |
@@ -1620,7 +1620,7 @@ discard block |
||
1620 | 1620 | list(, $len) = unpack('N*', substr($response, $pos, 4)); |
1621 | 1621 | $pos += 4; |
1622 | 1622 | |
1623 | - if ($pos + $len > $rlen) { |
|
1623 | + if ($pos + $len>$rlen) { |
|
1624 | 1624 | $this->error = 'incomplete reply'; |
1625 | 1625 | $this->mbPop(); |
1626 | 1626 | return false; |
@@ -1659,8 +1659,8 @@ discard block |
||
1659 | 1659 | ///////////////// |
1660 | 1660 | |
1661 | 1661 | // v.1.0 req |
1662 | - $req = pack('N', strlen($query)) . $query; // req query |
|
1663 | - $req .= pack('N', strlen($index)) . $index; // req index |
|
1662 | + $req = pack('N', strlen($query)).$query; // req query |
|
1663 | + $req .= pack('N', strlen($index)).$index; // req index |
|
1664 | 1664 | $req .= pack('N', (int)$hits); |
1665 | 1665 | |
1666 | 1666 | //////////////////////////// |
@@ -1668,7 +1668,7 @@ discard block |
||
1668 | 1668 | //////////////////////////// |
1669 | 1669 | |
1670 | 1670 | $len = strlen($req); |
1671 | - $req = pack('nnN', SEARCHD_COMMAND_KEYWORDS, VER_COMMAND_KEYWORDS, $len) . $req; // add header |
|
1671 | + $req = pack('nnN', SEARCHD_COMMAND_KEYWORDS, VER_COMMAND_KEYWORDS, $len).$req; // add header |
|
1672 | 1672 | if (!$this->send($fp, $req, $len + 8) || !($response = $this->getResponse($fp, VER_COMMAND_KEYWORDS))) { |
1673 | 1673 | $this->mbPop(); |
1674 | 1674 | return false; |
@@ -1683,7 +1683,7 @@ discard block |
||
1683 | 1683 | $rlen = strlen($response); |
1684 | 1684 | list(, $nwords) = unpack('N*', substr($response, $pos, 4)); |
1685 | 1685 | $pos += 4; |
1686 | - for ($i = 0; $i < $nwords; $i++) { |
|
1686 | + for ($i = 0; $i<$nwords; $i++) { |
|
1687 | 1687 | list(, $len) = unpack('N*', substr($response, $pos, 4)); |
1688 | 1688 | $pos += 4; |
1689 | 1689 | $tokenized = $len ? substr($response, $pos, $len) : ''; |
@@ -1706,7 +1706,7 @@ discard block |
||
1706 | 1706 | $res[$i]['hits'] = $nhits; |
1707 | 1707 | } |
1708 | 1708 | |
1709 | - if ($pos > $rlen) { |
|
1709 | + if ($pos>$rlen) { |
|
1710 | 1710 | $this->error = 'incomplete reply'; |
1711 | 1711 | $this->mbPop(); |
1712 | 1712 | return false; |
@@ -1719,8 +1719,8 @@ discard block |
||
1719 | 1719 | |
1720 | 1720 | public function escapeString($string) |
1721 | 1721 | { |
1722 | - $from = array('\\', '(',')','|','-','!','@','~','"','&', '/', '^', '$', '=', '<'); |
|
1723 | - $to = array('\\\\', '\(','\)','\|','\-','\!','\@','\~','\"', '\&', '\/', '\^', '\$', '\=', '\<'); |
|
1722 | + $from = array('\\', '(', ')', '|', '-', '!', '@', '~', '"', '&', '/', '^', '$', '=', '<'); |
|
1723 | + $to = array('\\\\', '\(', '\)', '\|', '\-', '\!', '\@', '\~', '\"', '\&', '\/', '\^', '\$', '\=', '\<'); |
|
1724 | 1724 | |
1725 | 1725 | return str_replace($from, $to, $string); |
1726 | 1726 | } |
@@ -1747,7 +1747,7 @@ discard block |
||
1747 | 1747 | foreach ($values as $id => $entry) { |
1748 | 1748 | assert(is_numeric($id)); |
1749 | 1749 | assert(is_array($entry)); |
1750 | - assert(count($entry) == count($attrs)); |
|
1750 | + assert(count($entry)==count($attrs)); |
|
1751 | 1751 | foreach ($entry as $v) { |
1752 | 1752 | if ($mva) { |
1753 | 1753 | assert(is_array($v)); |
@@ -1762,12 +1762,12 @@ discard block |
||
1762 | 1762 | |
1763 | 1763 | // build request |
1764 | 1764 | $this->mbPush(); |
1765 | - $req = pack('N', strlen($index)) . $index; |
|
1765 | + $req = pack('N', strlen($index)).$index; |
|
1766 | 1766 | |
1767 | 1767 | $req .= pack('N', count($attrs)); |
1768 | 1768 | $req .= pack('N', $ignorenonexistent ? 1 : 0); |
1769 | 1769 | foreach ($attrs as $attr) { |
1770 | - $req .= pack('N', strlen($attr)) . $attr; |
|
1770 | + $req .= pack('N', strlen($attr)).$attr; |
|
1771 | 1771 | $req .= pack('N', $mva ? 1 : 0); |
1772 | 1772 | } |
1773 | 1773 | |
@@ -1791,7 +1791,7 @@ discard block |
||
1791 | 1791 | } |
1792 | 1792 | |
1793 | 1793 | $len = strlen($req); |
1794 | - $req = pack('nnN', SEARCHD_COMMAND_UPDATE, VER_COMMAND_UPDATE, $len) . $req; // add header |
|
1794 | + $req = pack('nnN', SEARCHD_COMMAND_UPDATE, VER_COMMAND_UPDATE, $len).$req; // add header |
|
1795 | 1795 | if (!$this->send($fp, $req, $len + 8)) { |
1796 | 1796 | $this->mbPop(); |
1797 | 1797 | return -1; |
@@ -1814,7 +1814,7 @@ discard block |
||
1814 | 1814 | |
1815 | 1815 | public function open() |
1816 | 1816 | { |
1817 | - if ($this->socket !== false) { |
|
1817 | + if ($this->socket!==false) { |
|
1818 | 1818 | $this->error = 'already connected'; |
1819 | 1819 | return false; |
1820 | 1820 | } |
@@ -1833,7 +1833,7 @@ discard block |
||
1833 | 1833 | |
1834 | 1834 | public function close() |
1835 | 1835 | { |
1836 | - if ($this->socket === false) { |
|
1836 | + if ($this->socket===false) { |
|
1837 | 1837 | $this->error = 'not connected'; |
1838 | 1838 | return false; |
1839 | 1839 | } |
@@ -1870,8 +1870,8 @@ discard block |
||
1870 | 1870 | $p += 8; |
1871 | 1871 | |
1872 | 1872 | $res = array(); |
1873 | - for ($i = 0; $i < $rows; $i++) { |
|
1874 | - for ($j = 0; $j < $cols; $j++) { |
|
1873 | + for ($i = 0; $i<$rows; $i++) { |
|
1874 | + for ($j = 0; $j<$cols; $j++) { |
|
1875 | 1875 | list(, $len) = unpack('N*', substr($response, $p, 4)); |
1876 | 1876 | $p += 4; |
1877 | 1877 | $res[$i][] = substr($response, $p, $len); |
@@ -1902,7 +1902,7 @@ discard block |
||
1902 | 1902 | } |
1903 | 1903 | |
1904 | 1904 | $tag = -1; |
1905 | - if (strlen($response) == 4) { |
|
1905 | + if (strlen($response)==4) { |
|
1906 | 1906 | list(, $tag) = unpack('N*', $response); |
1907 | 1907 | } else { |
1908 | 1908 | $this->error = 'unexpected response length'; |