xref: /dokuwiki/inc/fulltext.php (revision 4987233dfc97c0b3bdfa620a25fc3ee5775f42a5) 
1<?php
2/**
3 * DokuWiki fulltextsearch functions using the index
4 *
5 * @license    GPL 2 (http://www.gnu.org/licenses/gpl.html)
6 * @author     Andreas Gohr <andi@splitbrain.org>
7 */
8
9if(!defined('DOKU_INC')) die('meh.');
10
11/**
12 * create snippets for the first few results only
13 */
14if(!defined('FT_SNIPPET_NUMBER')) define('FT_SNIPPET_NUMBER',15);
15
16/**
17 * The fulltext search
18 *
19 * Returns a list of matching documents for the given query
20 *
21 * refactored into ft_pageSearch(), _ft_pageSearch() and trigger_event()
22 *
23 */
24function ft_pageSearch($query,&$highlight){
25
26    $data['query'] = $query;
27    $data['highlight'] =& $highlight;
28
29    return trigger_event('SEARCH_QUERY_FULLPAGE', $data, '_ft_pageSearch');
30}
31
32/**
33 * Returns a list of matching documents for the given query
34 *
35 * @author Andreas Gohr <andi@splitbrain.org>
36 * @author Kazutaka Miyasaka <kazmiya@gmail.com>
37 */
38function _ft_pageSearch(&$data) {
39    // parse the given query
40    $q = ft_queryParser($data['query']);
41    $data['highlight'] = $q['highlight'];
42
43    if (empty($q['parsed_ary'])) return array();
44
45    // lookup all words found in the query
46    $lookup = idx_lookup($q['words']);
47
48    // get all pages in this dokuwiki site (!: includes nonexistent pages)
49    $pages_all = array();
50    foreach (idx_getIndex('page', '') as $id) {
51        $pages_all[trim($id)] = 0; // base: 0 hit
52    }
53
54    // process the query
55    $stack = array();
56    foreach ($q['parsed_ary'] as $token) {
57        switch (substr($token, 0, 3)) {
58            case 'W+:':
59            case 'W-:':
60            case 'W_:': // word
61                $word    = substr($token, 3);
62                $stack[] = (array) $lookup[$word];
63                break;
64            case 'P+:':
65            case 'P-:': // phrase
66                $phrase = substr($token, 3);
67                // since phrases are always parsed as ((W1)(W2)...(P)),
68                // the end($stack) always points the pages that contain
69                // all words in this phrase
70                $pages  = end($stack);
71                $pages_matched = array();
72                foreach(array_keys($pages) as $id){
73                    $text = utf8_strtolower(rawWiki($id));
74                    if (strpos($text, $phrase) !== false) {
75                        $pages_matched[$id] = 0; // phrase: always 0 hit
76                    }
77                }
78                $stack[] = $pages_matched;
79                break;
80            case 'N+:':
81            case 'N-:': // namespace
82                $ns = substr($token, 3);
83                $pages_matched = array();
84                foreach (array_keys($pages_all) as $id) {
85                    if (strpos($id, $ns) === 0) {
86                        $pages_matched[$id] = 0; // namespace: always 0 hit
87                    }
88                }
89                $stack[] = $pages_matched;
90                break;
91            case 'AND': // and operation
92                list($pages1, $pages2) = array_splice($stack, -2);
93                $stack[] = ft_resultCombine(array($pages1, $pages2));
94                break;
95            case 'OR':  // or operation
96                list($pages1, $pages2) = array_splice($stack, -2);
97                $stack[] = ft_resultUnite(array($pages1, $pages2));
98                break;
99            case 'NOT': // not operation (unary)
100                $pages   = array_pop($stack);
101                $stack[] = ft_resultComplement(array($pages_all, $pages));
102                break;
103        }
104    }
105    $docs = array_pop($stack);
106
107    if (empty($docs)) return array();
108
109    // check: settings, acls, existence
110    foreach (array_keys($docs) as $id) {
111        if (isHiddenPage($id) || auth_quickaclcheck($id) < AUTH_READ || !page_exists($id, '', false)) {
112            unset($docs[$id]);
113        }
114    }
115
116    // sort docs by count
117    arsort($docs);
118
119    return $docs;
120}
121
122/**
123 * Returns the backlinks for a given page
124 *
125 * Does a quick lookup with the fulltext index, then
126 * evaluates the instructions of the found pages
127 */
128function ft_backlinks($id){
129    global $conf;
130    $swfile   = DOKU_INC.'inc/lang/'.$conf['lang'].'/stopwords.txt';
131    $stopwords = @file_exists($swfile) ? file($swfile) : array();
132
133    $result = array();
134
135    // quick lookup of the pagename
136    $page    = noNS($id);
137    $matches = idx_lookup(idx_tokenizer($page,$stopwords));  // pagename may contain specials (_ or .)
138    $docs    = array_keys(ft_resultCombine(array_values($matches)));
139    $docs    = array_filter($docs,'isVisiblePage'); // discard hidden pages
140    if(!count($docs)) return $result;
141
142    // check metadata for matching links
143    foreach($docs as $match){
144        // metadata relation reference links are already resolved
145        $links = p_get_metadata($match,'relation references');
146        if (isset($links[$id])) $result[] = $match;
147    }
148
149    if(!count($result)) return $result;
150
151    // check ACL permissions
152    foreach(array_keys($result) as $idx){
153        if(auth_quickaclcheck($result[$idx]) < AUTH_READ){
154            unset($result[$idx]);
155        }
156    }
157
158    sort($result);
159    return $result;
160}
161
162/**
163 * Returns the pages that use a given media file
164 *
165 * Does a quick lookup with the fulltext index, then
166 * evaluates the instructions of the found pages
167 *
168 * Aborts after $max found results
169 */
170function ft_mediause($id,$max){
171    global $conf;
172    $swfile   = DOKU_INC.'inc/lang/'.$conf['lang'].'/stopwords.txt';
173    $stopwords = @file_exists($swfile) ? file($swfile) : array();
174
175    if(!$max) $max = 1; // need to find at least one
176
177    $result = array();
178
179    // quick lookup of the mediafile
180    $media   = noNS($id);
181    $matches = idx_lookup(idx_tokenizer($media,$stopwords));
182    $docs    = array_keys(ft_resultCombine(array_values($matches)));
183    if(!count($docs)) return $result;
184
185    // go through all found pages
186    $found = 0;
187    $pcre  = preg_quote($media,'/');
188    foreach($docs as $doc){
189        $ns = getNS($doc);
190        preg_match_all('/\{\{([^|}]*'.$pcre.'[^|}]*)(|[^}]+)?\}\}/i',rawWiki($doc),$matches);
191        foreach($matches[1] as $img){
192            $img = trim($img);
193            if(preg_match('/^https?:\/\//i',$img)) continue; // skip external images
194                list($img) = explode('?',$img);                  // remove any parameters
195            resolve_mediaid($ns,$img,$exists);               // resolve the possibly relative img
196
197            if($img == $id){                                 // we have a match
198                $result[] = $doc;
199                $found++;
200                break;
201            }
202        }
203        if($found >= $max) break;
204    }
205
206    sort($result);
207    return $result;
208}
209
210
211
212/**
213 * Quicksearch for pagenames
214 *
215 * By default it only matches the pagename and ignores the
216 * namespace. This can be changed with the second parameter.
217 * The third parameter allows to search in titles as well.
218 *
219 * The function always returns titles as well
220 *
221 * @triggers SEARCH_QUERY_PAGELOOKUP
222 * @author Andreas Gohr <andi@splitbrain.org>
223 * @author Adrian Lang <lang@cosmocode.de>
224 */
225function ft_pageLookup($id, $in_ns=false, $in_title=false){
226    $data = compact('id', 'in_ns', 'in_title');
227    $data['has_titles'] = true; // for plugin backward compatibility check
228    return trigger_event('SEARCH_QUERY_PAGELOOKUP', $data, '_ft_pageLookup');
229}
230
231function _ft_pageLookup(&$data){
232    // split out original parameters
233    $id = $data['id'];
234    if (preg_match('/(?:^| )@(\w+)/', $id, $matches)) {
235        $ns = cleanID($matches[1]) . ':';
236        $id = str_replace($matches[0], '', $id);
237    }
238
239    $in_ns    = $data['in_ns'];
240    $in_title = $data['in_title'];
241
242    $pages  = array_map('rtrim', idx_getIndex('page', ''));
243    $titles = array_map('rtrim', idx_getIndex('title', ''));
244    // check for corrupt title index #FS2076
245    if(count($pages) != count($titles)){
246        $titles = array_fill(0,count($pages),'');
247        @unlink($conf['indexdir'].'/title.idx'); // will be rebuilt in inc/init.php
248    }
249    $pages = array_combine($pages, $titles);
250
251    $cleaned = cleanID($id);
252    if ($id !== '' && $cleaned !== '') {
253        foreach ($pages as $p_id => $p_title) {
254            if ((strpos($in_ns ? $p_id : noNSorNS($p_id), $cleaned) === false) &&
255                (!$in_title || (stripos($p_title, $id) === false)) ) {
256                unset($pages[$p_id]);
257            }
258        }
259    }
260    if (isset($ns)) {
261        foreach (array_keys($pages) as $p_id) {
262            if (strpos($p_id, $ns) !== 0) {
263                unset($pages[$p_id]);
264            }
265        }
266    }
267
268    // discard hidden pages
269    // discard nonexistent pages
270    // check ACL permissions
271    foreach(array_keys($pages) as $idx){
272        if(!isVisiblePage($idx) || !page_exists($idx) ||
273           auth_quickaclcheck($idx) < AUTH_READ) {
274            unset($pages[$idx]);
275        }
276    }
277
278    uasort($pages,'ft_pagesorter');
279    return $pages;
280}
281
282/**
283 * Sort pages based on their namespace level first, then on their string
284 * values. This makes higher hierarchy pages rank higher than lower hierarchy
285 * pages.
286 */
287function ft_pagesorter($a, $b){
288    $ac = count(explode(':',$a));
289    $bc = count(explode(':',$b));
290    if($ac < $bc){
291        return -1;
292    }elseif($ac > $bc){
293        return 1;
294    }
295    return strcmp ($a,$b);
296}
297
298/**
299 * Creates a snippet extract
300 *
301 * @author Andreas Gohr <andi@splitbrain.org>
302 * @triggers FULLTEXT_SNIPPET_CREATE
303 */
304function ft_snippet($id,$highlight){
305    $text = rawWiki($id);
306    $evdata = array(
307            'id'        => $id,
308            'text'      => &$text,
309            'highlight' => &$highlight,
310            'snippet'   => '',
311            );
312
313    $evt = new Doku_Event('FULLTEXT_SNIPPET_CREATE',$evdata);
314    if ($evt->advise_before()) {
315        $match = array();
316        $snippets = array();
317        $utf8_offset = $offset = $end = 0;
318        $len = utf8_strlen($text);
319
320        // build a regexp from the phrases to highlight
321        $re1 = '('.join('|',array_map('ft_snippet_re_preprocess', array_map('preg_quote_cb',array_filter((array) $highlight)))).')';
322        $re2 = "$re1.{0,75}(?!\\1)$re1";
323        $re3 = "$re1.{0,45}(?!\\1)$re1.{0,45}(?!\\1)(?!\\2)$re1";
324
325        for ($cnt=4; $cnt--;) {
326            if (0) {
327            } else if (preg_match('/'.$re3.'/iu',$text,$match,PREG_OFFSET_CAPTURE,$offset)) {
328            } else if (preg_match('/'.$re2.'/iu',$text,$match,PREG_OFFSET_CAPTURE,$offset)) {
329            } else if (preg_match('/'.$re1.'/iu',$text,$match,PREG_OFFSET_CAPTURE,$offset)) {
330            } else {
331                break;
332            }
333
334            list($str,$idx) = $match[0];
335
336            // convert $idx (a byte offset) into a utf8 character offset
337            $utf8_idx = utf8_strlen(substr($text,0,$idx));
338            $utf8_len = utf8_strlen($str);
339
340            // establish context, 100 bytes surrounding the match string
341            // first look to see if we can go 100 either side,
342            // then drop to 50 adding any excess if the other side can't go to 50,
343            $pre = min($utf8_idx-$utf8_offset,100);
344            $post = min($len-$utf8_idx-$utf8_len,100);
345
346            if ($pre>50 && $post>50) {
347                $pre = $post = 50;
348            } else if ($pre>50) {
349                $pre = min($pre,100-$post);
350            } else if ($post>50) {
351                $post = min($post, 100-$pre);
352            } else {
353                // both are less than 50, means the context is the whole string
354                // make it so and break out of this loop - there is no need for the
355                // complex snippet calculations
356                $snippets = array($text);
357                break;
358            }
359
360            // establish context start and end points, try to append to previous
361            // context if possible
362            $start = $utf8_idx - $pre;
363            $append = ($start < $end) ? $end : false;  // still the end of the previous context snippet
364            $end = $utf8_idx + $utf8_len + $post;      // now set it to the end of this context
365
366            if ($append) {
367                $snippets[count($snippets)-1] .= utf8_substr($text,$append,$end-$append);
368            } else {
369                $snippets[] = utf8_substr($text,$start,$end-$start);
370            }
371
372            // set $offset for next match attempt
373            //   substract strlen to avoid splitting a potential search success,
374            //   this is an approximation as the search pattern may match strings
375            //   of varying length and it will fail if the context snippet
376            //   boundary breaks a matching string longer than the current match
377            $utf8_offset = $utf8_idx + $post;
378            $offset = $idx + strlen(utf8_substr($text,$utf8_idx,$post));
379            $offset = utf8_correctIdx($text,$offset);
380        }
381
382        $m = "\1";
383        $snippets = preg_replace('/'.$re1.'/iu',$m.'$1'.$m,$snippets);
384        $snippet = preg_replace('/'.$m.'([^'.$m.']*?)'.$m.'/iu','<strong class="search_hit">$1</strong>',hsc(join('... ',$snippets)));
385
386        $evdata['snippet'] = $snippet;
387    }
388    $evt->advise_after();
389    unset($evt);
390
391    return $evdata['snippet'];
392}
393
394/**
395 * Wraps a search term in regex boundary checks.
396 */
397function ft_snippet_re_preprocess($term) {
398    if(substr($term,0,2) == '\\*'){
399        $term = substr($term,2);
400    }else{
401        $term = '\b'.$term;
402    }
403
404    if(substr($term,-2,2) == '\\*'){
405        $term = substr($term,0,-2);
406    }else{
407        $term = $term.'\b';
408    }
409    return $term;
410}
411
412/**
413 * Combine found documents and sum up their scores
414 *
415 * This function is used to combine searched words with a logical
416 * AND. Only documents available in all arrays are returned.
417 *
418 * based upon PEAR's PHP_Compat function for array_intersect_key()
419 *
420 * @param array $args An array of page arrays
421 */
422function ft_resultCombine($args){
423    $array_count = count($args);
424    if($array_count == 1){
425        return $args[0];
426    }
427
428    $result = array();
429    if ($array_count > 1) {
430        foreach ($args[0] as $key => $value) {
431            $result[$key] = $value;
432            for ($i = 1; $i !== $array_count; $i++) {
433                if (!isset($args[$i][$key])) {
434                    unset($result[$key]);
435                    break;
436                }
437                $result[$key] += $args[$i][$key];
438            }
439        }
440    }
441    return $result;
442}
443
444/**
445 * Unites found documents and sum up their scores
446 *
447 * based upon ft_resultCombine() function
448 *
449 * @param array $args An array of page arrays
450 * @author Kazutaka Miyasaka <kazmiya@gmail.com>
451 */
452function ft_resultUnite($args) {
453    $array_count = count($args);
454    if ($array_count === 1) {
455        return $args[0];
456    }
457
458    $result = $args[0];
459    for ($i = 1; $i !== $array_count; $i++) {
460        foreach (array_keys($args[$i]) as $id) {
461            $result[$id] += $args[$i][$id];
462        }
463    }
464    return $result;
465}
466
467/**
468 * Computes the difference of documents using page id for comparison
469 *
470 * nearly identical to PHP5's array_diff_key()
471 *
472 * @param array $args An array of page arrays
473 * @author Kazutaka Miyasaka <kazmiya@gmail.com>
474 */
475function ft_resultComplement($args) {
476    $array_count = count($args);
477    if ($array_count === 1) {
478        return $args[0];
479    }
480
481    $result = $args[0];
482    foreach (array_keys($result) as $id) {
483        for ($i = 1; $i !== $array_count; $i++) {
484            if (isset($args[$i][$id])) unset($result[$id]);
485        }
486    }
487    return $result;
488}
489
490/**
491 * Parses a search query and builds an array of search formulas
492 *
493 * @author Andreas Gohr <andi@splitbrain.org>
494 * @author Kazutaka Miyasaka <kazmiya@gmail.com>
495 */
496function ft_queryParser($query){
497    global $conf;
498    $swfile    = DOKU_INC.'inc/lang/'.$conf['lang'].'/stopwords.txt';
499    $stopwords = @file_exists($swfile) ? file($swfile) : array();
500
501    /**
502     * parse a search query and transform it into intermediate representation
503     *
504     * in a search query, you can use the following expressions:
505     *
506     *   words:
507     *     include
508     *     -exclude
509     *   phrases:
510     *     "phrase to be included"
511     *     -"phrase you want to exclude"
512     *   namespaces:
513     *     @include:namespace (or ns:include:namespace)
514     *     ^exclude:namespace (or -ns:exclude:namespace)
515     *   groups:
516     *     ()
517     *     -()
518     *   operators:
519     *     and ('and' is the default operator: you can always omit this)
520     *     or  (or pipe symbol '|', lower precedence than 'and')
521     *
522     * e.g. a query [ aa "bb cc" @dd:ee ] means "search pages which contain
523     *      a word 'aa', a phrase 'bb cc' and are within a namespace 'dd:ee'".
524     *      this query is equivalent to [ -(-aa or -"bb cc" or -ns:dd:ee) ]
525     *      as long as you don't mind hit counts.
526     *
527     * intermediate representation consists of the following parts:
528     *
529     *   ( )           - group
530     *   AND           - logical and
531     *   OR            - logical or
532     *   NOT           - logical not
533     *   W+:, W-:, W_: - word      (underscore: no need to highlight)
534     *   P+:, P-:      - phrase    (minus sign: logically in NOT group)
535     *   N+:, N-:      - namespace
536     */
537    $parsed_query = '';
538    $parens_level = 0;
539    $terms = preg_split('/(-?".*?")/u', utf8_strtolower($query), -1, PREG_SPLIT_DELIM_CAPTURE | PREG_SPLIT_NO_EMPTY);
540
541    foreach ($terms as $term) {
542        $parsed = '';
543        if (preg_match('/^(-?)"(.+)"$/u', $term, $matches)) {
544            // phrase-include and phrase-exclude
545            $not = $matches[1] ? 'NOT' : '';
546            $parsed = $not.ft_termParser($matches[2], $stopwords, false, true);
547        } else {
548            // fix incomplete phrase
549            $term = str_replace('"', ' ', $term);
550
551            // fix parentheses
552            $term = str_replace(')'  , ' ) ', $term);
553            $term = str_replace('('  , ' ( ', $term);
554            $term = str_replace('- (', ' -(', $term);
555
556            // treat pipe symbols as 'OR' operators
557            $term = str_replace('|', ' or ', $term);
558
559            // treat ideographic spaces (U+3000) as search term separators
560            // FIXME: some more separators?
561            $term = preg_replace('/[ \x{3000}]+/u', ' ',  $term);
562            $term = trim($term);
563            if ($term === '') continue;
564
565            $tokens = explode(' ', $term);
566            foreach ($tokens as $token) {
567                if ($token === '(') {
568                    // parenthesis-include-open
569                    $parsed .= '(';
570                    ++$parens_level;
571                } elseif ($token === '-(') {
572                    // parenthesis-exclude-open
573                    $parsed .= 'NOT(';
574                    ++$parens_level;
575                } elseif ($token === ')') {
576                    // parenthesis-any-close
577                    if ($parens_level === 0) continue;
578                    $parsed .= ')';
579                    $parens_level--;
580                } elseif ($token === 'and') {
581                    // logical-and (do nothing)
582                } elseif ($token === 'or') {
583                    // logical-or
584                    $parsed .= 'OR';
585                } elseif (preg_match('/^(?:\^|-ns:)(.+)$/u', $token, $matches)) {
586                    // namespace-exclude
587                    $parsed .= 'NOT(N+:'.$matches[1].')';
588                } elseif (preg_match('/^(?:@|ns:)(.+)$/u', $token, $matches)) {
589                    // namespace-include
590                    $parsed .= '(N+:'.$matches[1].')';
591                } elseif (preg_match('/^-(.+)$/', $token, $matches)) {
592                    // word-exclude
593                    $parsed .= 'NOT('.ft_termParser($matches[1], $stopwords).')';
594                } else {
595                    // word-include
596                    $parsed .= ft_termParser($token, $stopwords);
597                }
598            }
599        }
600        $parsed_query .= $parsed;
601    }
602
603    // cleanup (very sensitive)
604    $parsed_query .= str_repeat(')', $parens_level);
605    do {
606        $parsed_query_old = $parsed_query;
607        $parsed_query = preg_replace('/(NOT)?\(\)/u', '', $parsed_query);
608    } while ($parsed_query !== $parsed_query_old);
609    $parsed_query = preg_replace('/(NOT|OR)+\)/u', ')'      , $parsed_query);
610    $parsed_query = preg_replace('/(OR)+/u'      , 'OR'     , $parsed_query);
611    $parsed_query = preg_replace('/\(OR/u'       , '('      , $parsed_query);
612    $parsed_query = preg_replace('/^OR|OR$/u'    , ''       , $parsed_query);
613    $parsed_query = preg_replace('/\)(NOT)?\(/u' , ')AND$1(', $parsed_query);
614
615    // adjustment: make highlightings right
616    $parens_level     = 0;
617    $notgrp_levels    = array();
618    $parsed_query_new = '';
619    $tokens = preg_split('/(NOT\(|[()])/u', $parsed_query, -1, PREG_SPLIT_DELIM_CAPTURE | PREG_SPLIT_NO_EMPTY);
620    foreach ($tokens as $token) {
621        if ($token === 'NOT(') {
622            $notgrp_levels[] = ++$parens_level;
623        } elseif ($token === '(') {
624            ++$parens_level;
625        } elseif ($token === ')') {
626            if ($parens_level-- === end($notgrp_levels)) array_pop($notgrp_levels);
627        } elseif (count($notgrp_levels) % 2 === 1) {
628            // turn highlight-flag off if terms are logically in "NOT" group
629            $token = preg_replace('/([WPN])\+\:/u', '$1-:', $token);
630        }
631        $parsed_query_new .= $token;
632    }
633    $parsed_query = $parsed_query_new;
634
635    /**
636     * convert infix notation string into postfix (Reverse Polish notation) array
637     * by Shunting-yard algorithm
638     *
639     * see: http://en.wikipedia.org/wiki/Reverse_Polish_notation
640     * see: http://en.wikipedia.org/wiki/Shunting-yard_algorithm
641     */
642    $parsed_ary     = array();
643    $ope_stack      = array();
644    $ope_precedence = array(')' => 1, 'OR' => 2, 'AND' => 3, 'NOT' => 4, '(' => 5);
645    $ope_regex      = '/([()]|OR|AND|NOT)/u';
646
647    $tokens = preg_split($ope_regex, $parsed_query, -1, PREG_SPLIT_DELIM_CAPTURE | PREG_SPLIT_NO_EMPTY);
648    foreach ($tokens as $token) {
649        if (preg_match($ope_regex, $token)) {
650            // operator
651            $last_ope = end($ope_stack);
652            while ($ope_precedence[$token] <= $ope_precedence[$last_ope] && $last_ope != '(') {
653                $parsed_ary[] = array_pop($ope_stack);
654                $last_ope = end($ope_stack);
655            }
656            if ($token == ')') {
657                array_pop($ope_stack); // this array_pop always deletes '('
658            } else {
659                $ope_stack[] = $token;
660            }
661        } else {
662            // operand
663            $token_decoded = str_replace(array('OP', 'CP'), array('(', ')'), $token);
664            $parsed_ary[] = $token_decoded;
665        }
666    }
667    $parsed_ary = array_values(array_merge($parsed_ary, array_reverse($ope_stack)));
668
669    // cleanup: each double "NOT" in RPN array actually does nothing
670    $parsed_ary_count = count($parsed_ary);
671    for ($i = 1; $i < $parsed_ary_count; ++$i) {
672        if ($parsed_ary[$i] === 'NOT' && $parsed_ary[$i - 1] === 'NOT') {
673            unset($parsed_ary[$i], $parsed_ary[$i - 1]);
674        }
675    }
676    $parsed_ary = array_values($parsed_ary);
677
678    // build return value
679    $q = array();
680    $q['query']      = $query;
681    $q['parsed_str'] = $parsed_query;
682    $q['parsed_ary'] = $parsed_ary;
683
684    foreach ($q['parsed_ary'] as $token) {
685        if ($token[2] !== ':') continue;
686        $body = substr($token, 3);
687
688        switch (substr($token, 0, 3)) {
689            case 'N+:':
690                     $q['ns'][]        = $body; // for backward compatibility
691                     break;
692            case 'N-:':
693                     $q['notns'][]     = $body; // for backward compatibility
694                     break;
695            case 'W_:':
696                     $q['words'][]     = $body;
697                     break;
698            case 'W-:':
699                     $q['words'][]     = $body;
700                     $q['not'][]       = $body; // for backward compatibility
701                     break;
702            case 'W+:':
703                     $q['words'][]     = $body;
704                     $q['highlight'][] = $body;
705                     $q['and'][]       = $body; // for backward compatibility
706                     break;
707            case 'P-:':
708                     $q['phrases'][]   = $body;
709                     break;
710            case 'P+:':
711                     $q['phrases'][]   = $body;
712                     $q['highlight'][] = $body;
713                     break;
714        }
715    }
716    foreach (array('words', 'phrases', 'highlight', 'ns', 'notns', 'and', 'not') as $key) {
717        $q[$key] = empty($q[$key]) ? array() : array_values(array_unique($q[$key]));
718    }
719
720    return $q;
721}
722
723/**
724 * Transforms given search term into intermediate representation
725 *
726 * This function is used in ft_queryParser() and not for general purpose use.
727 *
728 * @author Kazutaka Miyasaka <kazmiya@gmail.com>
729 */
730function ft_termParser($term, &$stopwords, $consider_asian = true, $phrase_mode = false) {
731    $parsed = '';
732    if ($consider_asian) {
733        // successive asian characters need to be searched as a phrase
734        $words = preg_split('/('.IDX_ASIAN.'+)/u', $term, -1, PREG_SPLIT_DELIM_CAPTURE | PREG_SPLIT_NO_EMPTY);
735        foreach ($words as $word) {
736            if (preg_match('/'.IDX_ASIAN.'/u', $word)) $phrase_mode = true;
737            $parsed .= ft_termParser($word, $stopwords, false, $phrase_mode);
738        }
739    } else {
740        $term_noparen = str_replace(array('(', ')'), ' ', $term);
741        $words = idx_tokenizer($term_noparen, $stopwords, true);
742
743        // W_: no need to highlight
744        if (empty($words)) {
745            $parsed = '()'; // important: do not remove
746        } elseif ($words[0] === $term) {
747            $parsed = '(W+:'.$words[0].')';
748        } elseif ($phrase_mode) {
749            $term_encoded = str_replace(array('(', ')'), array('OP', 'CP'), $term);
750            $parsed = '((W_:'.implode(')(W_:', $words).')(P+:'.$term_encoded.'))';
751        } else {
752            $parsed = '((W+:'.implode(')(W+:', $words).'))';
753        }
754    }
755    return $parsed;
756}
757
758//Setup VIM: ex: et ts=4 enc=utf-8 :
759