-
Notifications
You must be signed in to change notification settings - Fork 0
/
SphinxClient.php
1187 lines (1068 loc) · 33.5 KB
/
SphinxClient.php
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
<?php
/**
* This file is derived from PHP API of the sfSphinx package.
* (c) 2001-2008 Andrew Aksyonoff
* (c) 2007 Rick Olson <rick@napalmriot.com>
* (c) 2008-2009 Massimiliano Arione <garakkio@gmail.com>
*
* For the full copyright and license information, please view the LICENSE
* file that was distributed with this source code.
*/
/**
* sfSphinxClient.
*
* based on php api class of Sphinx project
*
* @package sfSphinxPlugin
* @author Massimiliano Arione <garakkio@gmail.com>
* @author Alejandro Glejberman <alejandro@acilia.es>
*/
class SphinxClient
{
// known searchd commands
const SEARCHD_COMMAND_SEARCH = 0;
const SEARCHD_COMMAND_EXCERPT = 1;
const SEARCHD_COMMAND_UPDATE = 2;
const SEARCHD_COMMAND_KEYWORDS = 3;
// current client-side command implementation versions
const VER_COMMAND_SEARCH = 0x113;
const VER_COMMAND_EXCERPT = 0x100;
const VER_COMMAND_UPDATE = 0x101;
const VER_COMMAND_KEYWORDS = 0x100;
// known searchd status codes
const SEARCHD_OK = 0;
const SEARCHD_ERROR = 1;
const SEARCHD_RETRY = 2;
const SEARCHD_WARNING = 3;
// known match modes
const SPH_MATCH_ALL = 0;
const SPH_MATCH_ANY = 1;
const SPH_MATCH_PHRASE = 2;
const SPH_MATCH_BOOLEAN = 3;
const SPH_MATCH_EXTENDED = 4;
const SPH_MATCH_FULLSCAN = 5;
// known ranking modes (ext2 only)
const SPH_RANK_PROXIMITY_BM25 = 0; // default mode, phrase proximity major factor and BM25 minor one
const SPH_RANK_BM25 = 1; // statistical mode, BM25 ranking only (faster but worse quality)
const SPH_RANK_NONE = 2; // no ranking, all matches get a weight of 1
const SPH_RANK_WORDCOUNT = 3; // simple word-count weighting, rank is a weighted sum of
// per-field keyword occurence counts
// known sort modes
const SPH_SORT_RELEVANCE = 0;
const SPH_SORT_ATTR_DESC = 1;
const SPH_SORT_ATTR_ASC = 2;
const SPH_SORT_TIME_SEGMENTS = 3;
const SPH_SORT_EXTENDED = 4;
const SPH_SORT_EXPR = 5;
// known filter types
const SPH_FILTER_VALUES = 0;
const SPH_FILTER_RANGE = 1;
const SPH_FILTER_FLOATRANGE = 2;
// known attribute types
const SPH_ATTR_INTEGER = 1;
const SPH_ATTR_TIMESTAMP = 2;
const SPH_ATTR_ORDINAL = 3;
const SPH_ATTR_BOOL = 4;
const SPH_ATTR_FLOAT = 5;
const SPH_ATTR_MULTI = 0x40000000;
// known grouping functions
const SPH_GROUPBY_DAY = 0;
const SPH_GROUPBY_WEEK = 1;
const SPH_GROUPBY_MONTH = 2;
const SPH_GROUPBY_YEAR = 3;
const SPH_GROUPBY_ATTR = 4;
const SPH_GROUPBY_ATTRPAIR = 5;
protected $host; // searchd host (default is 'localhost')
protected $port; // searchd port (default is 3312)
protected $offset; // how many records to seek from result-set start (default is 0)
protected $limit; // how many records to return from result-set (default is 20)
protected $mode; // query matching mode (default is self::SPH_MATCH_ALL)
protected $weights; // per-field weights (default is 1 for all fields)
protected $sort; // match sorting mode (default is self::SPH_SORT_RELEVANCE)
protected $sortby; // attribute to sort by (defualt is '')
protected $min_id; // min ID to match (default is 0)
protected $max_id; // max ID to match (default is UINT_MAX)
protected $filters; // search filters
protected $min; // attribute name to min-value hash (for range filters)
protected $max; // attribute name to max-value hash (for range filters)
protected $filter; // attribute name to values set hash (for values-set filters)
protected $groupby; // group-by attribute name (default is self::SPH_GROUPBY_DAY)
protected $groupfunc; // function to pre-process group-by attribute value with
protected $groupsort; // group-by sorting clause (to sort groups in result set with)
protected $groupdistinct; // group-by count-distinct attribute
protected $maxmatches; // max matches to retrieve (default is 1000)
protected $cutoff; // cutoff to stop searching at (default is 0)
protected $retrycount; // distributed retries count
protected $retrydelay; // distributed retries delay
protected $anchor; // geographical anchor point
protected $indexweights; // per-index weights
protected $ranker; // ranking mode (default is self::SPH_RANK_PROXIMITY_BM25)
protected $maxquerytime; // max query time, milliseconds (default is 0, do not limit)
protected $fieldweights; // per-field-name weights
protected $mbenc; // stored mbstring encoding
protected $arrayresult; // whether $result['matches'] should be a hash or an array
protected $timeout; // connect timeout
private $reqs; // requests array for multi-query
private $error; // last error message
private $warning; // last warning message
private $res; // result from RunQueries()
/**
* create a new client object, filling defaults for options not passed
* @param array $options
*/
public function __construct($options)
{
$default_options = array(
'host' => 'localhost',
'port' => 3312,
'offset' => 0,
'limit' => 20,
'mode' => self::SPH_MATCH_ALL,
'weights' => array(),
'sort' => self::SPH_SORT_RELEVANCE,
'sortby' => '',
'min_id' => 0,
'max_id' => 0xFFFFFFFF,
'filters' => array(),
'groupby' => '',
'groupfunc' => self::SPH_GROUPBY_DAY,
'groupsort' => '@group desc',
'groupdistinct' => '',
'maxmatches' => 1000,
'cutoff' => 0,
'retrycount' => 0,
'retrydelay' => 0,
'anchor' => array(),
'indexweights' => array(),
'ranker' => self::SPH_RANK_PROXIMITY_BM25,
'maxquerytime' => 0,
'fieldweights' => array(),
'mbenc' => '',
'arrayresult' => true,
'timeout' => 0,
);
$available_options = array_keys($default_options);
$new_options = array_merge($default_options, $options);
foreach ($new_options as $k => $v)
{
if (in_array($k, $available_options))
{
$this->$k = $v;
}
}
$this->reqs = array();
$this->error = '';
$this->warning = '';
$this->res = false;
}
/**
* portably pack numeric to 64 unsigned bits, network order
* @param integer $v
* @return integer
*/
private function sphPack64($v)
{
// x64 route
if (PHP_INT_SIZE >= 8)
{
$i = (int)$v;
return pack('NN', $i >> 32, $i & ((1 << 32) - 1));
}
// x32 route, bcmath
$x = '4294967296';
if (function_exists('bcmul'))
{
$h = bcdiv($v, $x, 0);
$l = bcmod($v, $x);
// conversion to float is intentional; int would lose 31st bit
return pack('NN', (float)$h, (float)$l);
}
// x32 route, 15 or less decimal digits
// we can use float, because its actually double and has 52 precision bits
if (strlen($v) <= 15)
{
$f = (float)$v;
$h = (int)($f / $x);
$l = (int)($f - $x * $h);
return pack('NN', $h, $l);
}
}
/**
* portably unpack 64 unsigned bits, network order to numeric
* @param integer $v
* @return integer
*/
private function sphUnpack64($v)
{
list($h, $l) = array_values(unpack('N*N*', $v));
// x64 route
if (PHP_INT_SIZE >= 8)
{
if ($h < 0)
{
$h += (1 << 32); // because php 5.2.2 to 5.2.5 is totally messed up again
}
if ($l < 0)
{
$l += (1 << 32);
}
return ($h << 32) + $l;
}
// x32 route
$h = sprintf('%u', $h);
$l = sprintf('%u', $l);
$x = '4294967296';
// bcmath
if (function_exists('bcmul'))
{
return bcadd($l, bcmul($x, $h));
}
// no bcmath, 15 or less decimal digits
// we can use float, because its actually double and has 52 precision bits
if ($h < 1048576)
{
$f = ((float)$h) * $x + (float)$l;
return sprintf('%.0f', $f); // builtin conversion is only about 39-40 bits precise!
}
}
/**
* helper to pack floats in network byte order
* @param float $f
* @return integer
*/
private function packFloat($f)
{
$t1 = pack('f', $f); // machine order
list(, $t2) = unpack('L*', $t1); // int in machine order
return pack('N', $t2);
}
/**
* enter mbstring workaround mode
*/
private function MBPush()
{
$this->mbenc = '';
if (ini_get('mbstring.func_overload') & 2)
{
$this->mbenc = mb_internal_encoding();
mb_internal_encoding('latin1');
}
}
/**
* leave mbstring workaround mode
*/
private function MBPop()
{
if ($this->mbenc)
{
mb_internal_encoding($this->mbenc);
}
}
/**
* escape a string
* @param string $string
* @return string
*/
private function EscapeString($string)
{
$from = array('(', ')', '|', '-', '!', '@', '~', '"', '&', '/' );
$to = array('\(', '\)', '\|', '\-', '\!', '\@', '\~', '\"', '\&', '\/');
return str_replace($from, $to, $string);
}
/**
* check if there's an error or not
* @return string
*/
public function isError()
{
return !empty($this->error);
}
/**
* get last error message
* @return string
*/
public function GetLastError()
{
return $this->error;
}
/**
* get last warning message
* @return string
*/
public function GetLastWarning()
{
return $this->warning;
}
/**
* set searchd server
* @param string $host
* @param integer $port
*/
public function SetServer($host, $port)
{
$this->host = $host;
$this->port = $port;
}
/**
* connect to searchd server
* @return resource
* @throws Exception
*/
protected function Connect()
{
$errno = 0;
$errstr = '';
if ($this->timeout <= 0)
{
$fp = @fsockopen($this->host, $this->port, $errno, $errstr);
}
else
{
$fp = @fsockopen($this->host, $this->port, $errno, $errstr, $this->timeout);
}
if (!$fp)
{
$errstr = trim($errstr);
$this->error = "Sphinx connection to {$this->host}:{$this->port} failed (errno=$errno, msg=$errstr)";
throw new Exception($this->error);
}
// check version
list(, $v) = unpack("N*", fread($fp, 4));
$v = (int) $v;
if ($v < 1)
{
fclose($fp);
$this->error = "expected searchd protocol version 1+, got version '$v'";
throw new Exception($this->error);
}
// all ok, send my version
fwrite($fp, pack("N", 1));
return $fp;
}
/**
* get and check response packet from searchd server
* @param resource $fp
* @param integer $client_ver
* @return string
* @throws Exception
*/
protected function GetResponse($fp, $client_ver)
{
$header = fread($fp, 8);
list($status, $ver, $len) = array_values(unpack('n2a/Nb', $header));
$response = '';
$left = $len;
while ($left > 0 && !feof($fp))
{
$chunk = fread($fp, $left);
if ($chunk)
{
$response .= $chunk;
$left -= strlen($chunk);
}
}
fclose($fp);
// check response
$read = strlen($response);
if (!$response || $read != $len)
{
$this->error = $len
? "failed to read searchd response (status=$status, ver=$ver, len=$len, read=$read)"
: 'received zero-sized searchd response';
throw new Exception($this->error);
}
// check status
if ($status == self::SEARCHD_ERROR)
{
$this->error = 'searchd error: ' . substr($response, 4);
throw new Exception($this->error);
}
if ($status == self::SEARCHD_RETRY)
{
$this->error = 'temporary searchd error: ' . substr($response, 4);
throw new Exception($this->error);
}
if ($status != self::SEARCHD_OK)
{
$this->error = "unknown status code '$status'";
throw new Exception($this->error);
}
// check version
if ($ver < $client_ver)
{
$this->warning = sprintf(
"searchd command v.%d.%d older than client's v.%d.%d, some options might not work",
$ver >> 8, $ver & 0xff, $client_ver >> 8, $client_ver & 0xff);
}
return $response;
}
/**
* set match offset, count, and max number to retrieve
* @param integer $offset
* @param integer $limit
* @param integer $max
*/
public function SetLimits($offset, $limit, $max = 0)
{
$this->offset = $offset;
$this->limit = $limit;
if ($max > 0)
{
$this->maxmatches = $max;
}
}
/**
* set match mode
* @param integer $mode
*/
public function SetMatchMode($mode)
{
$this->mode = $mode;
}
/**
* set sort mode
* @param integer $mode
* @param string $sortby
*/
public function SetSortMode($mode, $sortby = '')
{
$this->sort = $mode;
$this->sortby = $sortby;
}
/**
* set per-field weights
* @param array $weights
*/
public function SetWeights($weights)
{
foreach ($weights as $weight)
{
$this->weights = $weights;
}
}
/**
* set IDs range to match
* only match those records where document ID is beetwen $min and $max
* (including $min and $max)
* @param integer $min
* @param integer $max
*/
public function SetIDRange($min, $max)
{
$this->min_id = $min;
$this->max_id = $max;
}
/**
* set values set filter
* only match records where $attribute value is in given set
* @param string $attribute
* @param array $values
* @param boolean $exclude
*/
public function SetFilter($attribute, $values, $exclude = false)
{
if (is_array($values) && !empty($values))
{
$this->filters[] = array(
'type' => self::SPH_FILTER_VALUES,
'attr' => $attribute,
'exclude' => $exclude,
'values' => $values
);
}
}
/**
* set range filter
* only match those records where $attribute column value is beetwen $min and $max
* (including $min and $max)
* @param string $attribute
* @param integer $min
* @param integer $max
* @param boolean $exclude
*/
public function SetFilterRange($attribute, $min, $max, $exclude = false)
{
$this->filters[] = array(
'type' => self::SPH_FILTER_RANGE,
'attr' => $attribute,
'exclude'=> $exclude,
'min' => $min,
'max' => $max
);
}
/**
* set grouping attribute and function
* in grouping mode, all matches are assigned to different groups
* based on grouping function value.
*
* each group keeps track of the total match count, and the best match
* (in this group) according to current sorting function.
*
* the final result set contains one best match per group, with
* grouping function value and matches count attached. result set
* is sorted by grouping function value, in descending order.
*
* for example, if sorting by relevance and grouping by 'published'
* attribute with self::SPH_GROUPBY_DAY function, then the result set will
* contain one most relevant match per each day when there were any
* matches published, with day number and per-day match count attached,
* and sorted by day number in descending order (ie. recent days first).
*
* @param string $attribute
* @param integer $func
*/
public function SetGroupBy($attribute, $func)
{
$this->groupby = $attribute;
$this->groupfunc = $func;
}
/**
* add a query to $reqs
* @param string $query
* @param string $index
* @param string $comment
* @return integer index into results array from RunQueries() call
*/
public function AddQuery($query, $index = '*', $comment = '')
{
// mbstring workaround
$this->MBPush();
// build request
// mode and limits
$req = pack('NNNNN', $this->offset, $this->limit, $this->mode, $this->ranker, $this->sort);
$req .= pack('N', strlen($this->sortby)) . $this->sortby;
$req .= pack('N', strlen($query)) . $query; // query itself
$req .= pack('N', count($this->weights)); // weights
foreach ($this->weights as $weight)
{
$req .= pack('N', (int)$weight);
}
$req .= pack('N', strlen($index)) . $index; // indexes
$req .= pack('N', 1); // id64 range marker
$req .= $this->sphPack64($this->min_id) . $this->sphPack64($this->max_id); // id64 range
// filters
$req .= pack('N', count($this->filters));
foreach ($this->filters as $filter)
{
$req .= pack('N', strlen($filter['attr'])) . $filter['attr'];
$req .= pack('N', $filter['type']);
switch ($filter['type'])
{
case self::SPH_FILTER_VALUES:
$req .= pack('N', count($filter['values']));
foreach ($filter['values'] as $value)
{
$req .= pack('N', floatval($value)); // this uberhack is to workaround 32bit signed int limit on x32 platforms
}
break;
case self::SPH_FILTER_RANGE:
$req .= pack('NN', $filter['min'], $filter['max']);
break;
case self::SPH_FILTER_FLOATRANGE:
$req .= $this->packFloat( $filter['min']) . $this->packFloat( $filter['max']);
}
$req .= pack('N', $filter['exclude']);
}
// group-by clause, max-matches count, group-sort clause, cutoff count
$req .= pack('NN', $this->groupfunc, strlen($this->groupby)) . $this->groupby;
$req .= pack('N', $this->maxmatches);
$req .= pack('N', strlen($this->groupsort)) . $this->groupsort;
$req .= pack('NNN', $this->cutoff, $this->retrycount, $this->retrydelay);
$req .= pack('N', strlen($this->groupdistinct)) . $this->groupdistinct;
// anchor point
if (empty($this->anchor))
{
$req .= pack('N', 0);
}
else
{
$a = $this->anchor;
$req .= pack('N', 1);
$req .= pack('N', strlen($a['attrlat'])) . $a['attrlat'];
$req .= pack('N', strlen($a['attrlong'])) . $a['attrlong'];
$req .= $this->packFloat($a['lat']) . $this->packFloat($a['long']);
}
// per-index weights
$req .= pack('N', count($this->indexweights));
foreach ($this->indexweights as $idx=>$weight)
{
$req .= pack('N', strlen($idx)) . $idx . pack('N', $weight);
}
// max query time
$req .= pack('N', $this->maxquerytime);
// per-field weights
$req .= pack('N', count($this->fieldweights));
foreach ( $this->fieldweights as $field=>$weight)
$req .= pack('N', strlen($field)) . $field . pack('N', $weight);
// comment
$req .= pack('N', strlen($comment)) . $comment;
// mbstring workaround
$this->MBPop();
// store request to requests array
$this->reqs[] = $req;
return count($this->reqs) - 1;
}
/**
* connect to searchd server and run given search query
*
* @param string $query
* @param string $index index name to query, default is '*' which means to query all indexes
* @param string $comment
* @return array array with following keys:
* 'matches'
* hash which maps found document_id to ('weight', 'group') hash
* 'total'
* amount of matches retrieved (upto self::SPH_MAX_MATCHES)
* 'total_found'
* amount of matching documents in index
* 'time'
* search time
* 'words'
* hash which maps query terms (stemmed!) to ('docs', 'hits') hash
* @throws Exception
*/
public function Query($query, $index = '*', $comment = '')
{
$this->AddQuery($query, $index, $comment);
$results = $this->RunQueries();
if (!is_array($results))
{
// probably network error; error message should be already filled
throw new Exception($this->error);
}
$this->error = $results[0]['error'];
$this->warning = $results[0]['warning'];
if ($results[0]['status'] == self::SEARCHD_ERROR)
{
throw new Exception($this->error);
}
else
{
//$this->res = $results[0];
$this->res = $this->processResults($results[0]);
return $this->res;
}
}
/**
* get query results
* @return array See Query() method
*/
public function getRes()
{
return $this->res;
}
/**
* connect to searchd, run queries batch, and return an array of result sets
* @return array
*/
public function RunQueries()
{
if (empty($this->reqs))
{
$this->error = 'no queries defined, issue AddQuery() first';
throw new Exception($this->error);
}
// mbstring workaround
$this->MBPush();
if (!($fp = $this->Connect()))
{
$this->MBPop();
throw new Exception($this->error);
}
//// send query, get response
$nreqs = count($this->reqs);
$req = join ( '', $this->reqs );
$len = 4 + strlen($req);
// add header
$req = pack('nnNN', self::SEARCHD_COMMAND_SEARCH, self::VER_COMMAND_SEARCH, $len, $nreqs) . $req;
fwrite ($fp, $req, $len + 8);
if (!($response = $this->GetResponse($fp, self::VER_COMMAND_SEARCH)))
{
$this->MBPop();
throw new Exception($this->error);
}
$this->reqs = array();
//// parse response
$p = 0; // current position
$max = strlen($response); // max position for checks, to protect against broken responses
$results = array();
for ($ires = 0; $ires < $nreqs && $p < $max; $ires ++)
{
$results[] = array();
$result =& $results[$ires];
$result['error'] = '';
$result['warning'] = '';
// extract status
list(, $status) = unpack('N*', substr($response, $p, 4));
$p += 4;
$result['status'] = $status;
if ($status != self::SEARCHD_OK)
{
list(, $len) = unpack('N*', substr($response, $p, 4));
$p += 4;
$message = substr($response, $p, $len);
$p += $len;
if ($status == self::SEARCHD_WARNING)
{
$result['warning'] = $message;
}
else
{
$result['error'] = $message;
continue;
}
}
// read schema
$fields = array();
$attrs = array();
list(, $nfields) = unpack('N*', substr($response, $p, 4));
$p += 4;
while ($nfields -- > 0 && $p < $max)
{
list(, $len) = unpack('N*', substr($response, $p, 4));
$p += 4;
$fields[] = substr($response, $p, $len);
$p += $len;
}
$result['fields'] = $fields;
list(, $nattrs) = unpack('N*', substr($response, $p, 4));
$p += 4;
while ($nattrs -- > 0 && $p < $max)
{
list(, $len) = unpack('N*', substr($response, $p, 4));
$p += 4;
$attr = substr($response, $p, $len);
$p += $len;
list(, $type) = unpack('N*', substr($response, $p, 4));
$p += 4;
$attrs[$attr] = $type;
}
$result['attrs'] = $attrs;
// read match count
list(, $count) = unpack('N*', substr($response, $p, 4));
$p += 4;
list(, $id64) = unpack('N*', substr($response, $p, 4));
$p += 4;
// read matches
$idx = -1;
while ($count -- > 0 && $p < $max)
{
// index into result array
$idx ++;
// parse document id and weight
if ($id64)
{
$doc = $this->sphUnpack64(substr($response, $p, 8));
$p += 8;
list(, $weight) = unpack('N*', substr($response, $p, 4));
$p += 4;
}
else
{
list($doc, $weight) = array_values(unpack('N*N*', substr($response, $p, 8)));
$p += 8;
if (PHP_INT_SIZE >= 8)
{
// x64 route, workaround broken unpack() in 5.2.2+
if ($doc < 0)
{
$doc += (1 << 32);
}
}
else
{
// x32 route, workaround php signed/unsigned braindamage
$doc = sprintf('%u', $doc);
}
}
$weight = sprintf('%u', $weight);
// create match entry
if ($this->arrayresult)
{
$result['matches'][$idx] = array('id' => $doc, 'weight' => $weight);
}
else
{
$result['matches'][$doc]['weight'] = $weight;
}
// parse and create attributes
$attrvals = array();
foreach ($attrs as $attr => $type)
{
// handle floats
if ($type == self::SPH_ATTR_FLOAT)
{
list(, $uval) = unpack('N*', substr($response, $p, 4));
$p += 4;
list(, $fval) = unpack('f*', pack('L', $uval ));
$attrvals[$attr] = $fval;
continue;
}
// handle everything else as unsigned ints
list(, $val) = unpack('N*', substr($response, $p, 4));
$p += 4;
if ($type & self::SPH_ATTR_MULTI)
{
$attrvals[$attr] = array();
$nvalues = $val;
while ($nvalues -- > 0 && $p < $max)
{
list(, $val) = unpack('N*', substr($response, $p, 4));
$p += 4;
$attrvals[$attr][] = sprintf('%u', $val);
}
}
else
{
$attrvals[$attr] = sprintf('%u', $val);
}
}
if ($this->arrayresult)
{
$result['matches'][$idx]['attrs'] = $attrvals;
}
else
{
$result['matches'][$doc]['attrs'] = $attrvals;
}
}
list($total, $total_found, $msecs, $words ) =
array_values(unpack('N*N*N*N*', substr($response, $p, 16)));
$result['total'] = sprintf('%u', $total);
$result['total_found'] = sprintf('%u', $total_found);
$result['time'] = sprintf('%.3f', $msecs / 1000);
$p += 16;
while ($words -- > 0 && $p < $max)
{
list(, $len) = unpack('N*', substr($response, $p, 4));
$p += 4;
$word = substr($response, $p, $len);
$p += $len;
list($docs, $hits) = array_values(unpack('N*N*', substr($response, $p, 8)));
$p += 8;
$result['words'][$word] = array (
'docs' => sprintf('%u', $docs),
'hits' => sprintf('%u', $hits));
}
}
$this->MBPop();
return $results;
}
/**
* excerpts generation
* connect to searchd server and generate exceprts from given documents
*
* @param array $docs strings representing the documents' contents
* @param string $index index which settings will be used for stemming, lexing and case folding
* @param string $words words to highlight
* @param array $opts additional optional highlighting parameters:
* 'before_match'
* a string to insert before a set of matching words, default is '<b>'
* 'after_match'
* a string to insert after a set of matching words, default is '<b>'
* 'chunk_separator'
* a string to insert between excerpts chunks, default is ' ... '
* 'limit'
* max excerpt size in symbols (codepoints), default is 256
* 'around'
* how much words to highlight around each match, default is 5
* @return array strings of excerpts
* @throws Exception
*/
public function BuildExcerpts($docs, $index, $words, $opts = array())
{
$this->MBPush();
if (!($fp = $this->Connect()))
{
$this->MBPop();
throw new Exception($this->error);
}
//// fixup options
if (!isset($opts['before_match'])) $opts['before_match'] = '<b>';
if (!isset($opts['after_match'])) $opts['after_match'] = '</b>';
if (!isset($opts['chunk_separator'])) $opts['chunk_separator'] = ' ... ';
if (!isset($opts['limit'])) $opts['limit'] = 256;
if (!isset($opts['around'])) $opts['around'] = 5;
if (!isset($opts['exact_phrase'])) $opts['exact_phrase'] = false;
if (!isset($opts['single_passage'])) $opts['single_passage'] = false;
if (!isset($opts['use_boundaries'])) $opts['use_boundaries'] = false;
if (!isset($opts['weight_order'])) $opts['weight_order'] = false;
//// build request
// v.1.0 req
$flags = 1; // remove spaces
if ($opts['exact_phrase']) $flags |= 2;
if ($opts['single_passage']) $flags |= 4;
if ($opts['use_boundaries']) $flags |= 8;
if ($opts['weight_order']) $flags |= 16;
$req = pack('NN', 0, $flags); // mode=0, flags=$flags
$req .= pack('N', strlen($index)) . $index; // req index
$req .= pack('N', strlen($words)) . $words; // req words
// options
$req .= pack('N', strlen($opts['before_match'])) . $opts['before_match'];
$req .= pack('N', strlen($opts['after_match'])) . $opts['after_match'];
$req .= pack('N', strlen($opts['chunk_separator'])) . $opts['chunk_separator'];
$req .= pack('N', (int)$opts['limit']);
$req .= pack('N', (int)$opts['around']);
// documents
$req .= pack('N', count($docs));
foreach ($docs as $doc)
{
$req .= pack('N', strlen($doc)) . $doc;