当前位置: 首页>>代码示例>>PHP>>正文


PHP Zend_Search_Lucene::termPositions方法代码示例

本文整理汇总了PHP中Zend_Search_Lucene::termPositions方法的典型用法代码示例。如果您正苦于以下问题:PHP Zend_Search_Lucene::termPositions方法的具体用法?PHP Zend_Search_Lucene::termPositions怎么用?PHP Zend_Search_Lucene::termPositions使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在Zend_Search_Lucene的用法示例。


在下文中一共展示了Zend_Search_Lucene::termPositions方法的6个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的PHP代码示例。

示例1: score

 /**
  * Score specified document
  *
  * @param integer $docId
  * @param Zend_Search_Lucene $reader
  * @return float
  */
 public function score($docId, $reader)
 {
     if ($this->_docVector === null) {
         if (extension_loaded('bitset')) {
             $this->_docVector = bitset_from_array($reader->termDocs($this->_term));
         } else {
             $this->_docVector = array_flip($reader->termDocs($this->_term));
         }
         $this->_termPositions = $reader->termPositions($this->_term);
         $this->_initWeight($reader);
     }
     $match = extension_loaded('bitset') ? bitset_in($this->_docVector, $docId) : isset($this->_docVector[$docId]);
     if ($this->_sign && $match) {
         return $reader->getSimilarity()->tf(count($this->_termPositions[$docId])) * $this->_weight->getValue() * $reader->norm($docId, $this->_term->field);
     } else {
         return 0;
     }
 }
开发者ID:Nurudeen,项目名称:prado,代码行数:25,代码来源:Term.php

示例2: _calculateNonConjunctionResult

 /**
  * Calculate result vector for non Conjunction query
  * (like '+something -another')
  *
  * @param Zend_Search_Lucene $reader
  */
 private function _calculateNonConjunctionResult($reader)
 {
     if (extension_loaded('bitset')) {
         $required = null;
         $neither = bitset_empty();
         $prohibited = bitset_empty();
         foreach ($this->_terms as $termId => $term) {
             $termDocs = bitset_from_array($reader->termDocs($term));
             if ($this->_signs[$termId] === true) {
                 // required
                 if ($required !== null) {
                     $required = bitset_intersection($required, $termDocs);
                 } else {
                     $required = $termDocs;
                 }
             } elseif ($this->_signs[$termId] === false) {
                 // prohibited
                 $prohibited = bitset_union($prohibited, $termDocs);
             } else {
                 // neither required, nor prohibited
                 $neither = bitset_union($neither, $termDocs);
             }
             $this->_termsPositions[$termId] = $reader->termPositions($term);
         }
         if ($required === null) {
             $required = $neither;
         }
         $this->_resVector = bitset_intersection($required, bitset_invert($prohibited, $reader->count()));
     } else {
         $required = null;
         $neither = array();
         $prohibited = array();
         foreach ($this->_terms as $termId => $term) {
             $termDocs = array_flip($reader->termDocs($term));
             if ($this->_signs[$termId] === true) {
                 // required
                 if ($required !== null) {
                     // substitute for bitset_intersection
                     foreach ($required as $key => $value) {
                         if (!isset($termDocs[$key])) {
                             unset($required[$key]);
                         }
                     }
                 } else {
                     $required = $termDocs;
                 }
             } elseif ($this->_signs[$termId] === false) {
                 // prohibited
                 // substitute for bitset_union
                 foreach ($termDocs as $key => $value) {
                     $prohibited[$key] = $value;
                 }
             } else {
                 // neither required, nor prohibited
                 // substitute for bitset_union
                 foreach ($termDocs as $key => $value) {
                     $neither[$key] = $value;
                 }
             }
             $this->_termsPositions[$termId] = $reader->termPositions($term);
         }
         if ($required === null) {
             $required = $neither;
         }
         foreach ($required as $key => $value) {
             if (isset($prohibited[$key])) {
                 unset($required[$key]);
             }
         }
         $this->_resVector = $required;
     }
 }
开发者ID:Nurudeen,项目名称:prado,代码行数:78,代码来源:MultiTerm.php

示例3: _calculateResult

 /**
  * Calculate result vector
  *
  * @param Zend_Search_Lucene $reader
  */
 private function _calculateResult($reader)
 {
     if (extension_loaded('bitset')) {
         foreach ($this->_terms as $termId => $term) {
             if ($this->_resVector === null) {
                 $this->_resVector = bitset_from_array($reader->termDocs($term));
             } else {
                 $this->_resVector = bitset_intersection($this->_resVector, bitset_from_array($reader->termDocs($term)));
             }
             $this->_termsPositions[$termId] = $reader->termPositions($term);
         }
     } else {
         foreach ($this->_terms as $termId => $term) {
             if ($this->_resVector === null) {
                 $this->_resVector = array_flip($reader->termDocs($term));
             } else {
                 $termDocs = array_flip($reader->termDocs($term));
                 foreach ($this->_resVector as $key => $value) {
                     if (!isset($termDocs[$key])) {
                         unset($this->_resVector[$key]);
                     }
                 }
             }
             $this->_termsPositions[$termId] = $reader->termPositions($term);
         }
     }
 }
开发者ID:BackupTheBerlios,项目名称:openpublisher-svn,代码行数:32,代码来源:Phrase.php

示例4: execute

 /**
  * Execute query in context of index reader
  * It also initializes necessary internal structures
  *
  * @param Zend_Search_Lucene $reader
  */
 public function execute($reader)
 {
     $this->_docVector = array_flip($reader->termDocs($this->_term));
     $this->_termPositions = $reader->termPositions($this->_term);
     // Initialize weight if it's not done yet
     $this->_initWeight($reader);
 }
开发者ID:5haman,项目名称:knowledgetree,代码行数:13,代码来源:Term.php

示例5: _calculateNonConjunctionResult

 /**
  * Calculate result vector for non Conjunction query
  * (like '+something -another')
  *
  * @param Zend_Search_Lucene $reader
  */
 private function _calculateNonConjunctionResult($reader)
 {
     $required = null;
     $optional = array();
     $prohibited = array();
     foreach ($this->_terms as $termId => $term) {
         $termDocs = array_flip($reader->termDocs($term));
         if ($this->_signs[$termId] === true) {
             // required
             if ($required !== null) {
                 // array intersection
                 $required = array_intersect_key($required, $termDocs);
             } else {
                 $required = $termDocs;
             }
         } elseif ($this->_signs[$termId] === false) {
             // prohibited
             // array union
             $prohibited += $termDocs;
         } else {
             // neither required, nor prohibited
             // array union
             $optional += $termDocs;
         }
         $this->_termsPositions[$termId] = $reader->termPositions($term);
     }
     if ($required !== null) {
         $this->_resVector = array_diff_key($required, $prohibited);
     } else {
         $this->_resVector = array_diff_key($optional, $prohibited);
     }
     ksort($this->_resVector, SORT_NUMERIC);
 }
开发者ID:5haman,项目名称:knowledgetree,代码行数:39,代码来源:MultiTerm.php

示例6: execute

 /**
  * Execute query in context of index reader
  * It also initializes necessary internal structures
  *
  * @param Zend_Search_Lucene $reader
  */
 public function execute($reader)
 {
     $this->_resVector = null;
     if (count($this->_terms) == 0) {
         $this->_resVector = array();
     }
     foreach ($this->_terms as $termId => $term) {
         if ($this->_resVector === null) {
             $this->_resVector = array_flip($reader->termDocs($term));
         } else {
             $this->_resVector = array_intersect_key($this->_resVector, array_flip($reader->termDocs($term)));
         }
         if (count($this->_resVector) == 0) {
             // Empty result set, we don't need to check other terms
             break;
         }
         $this->_termsPositions[$termId] = $reader->termPositions($term);
     }
     ksort($this->_resVector, SORT_NUMERIC);
     // Initialize weight if it's not done yet
     $this->_initWeight($reader);
 }
开发者ID:5haman,项目名称:knowledgetree,代码行数:28,代码来源:Phrase.php


注:本文中的Zend_Search_Lucene::termPositions方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。