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


PHP Zend_Search_Lucene_Interface::termFreqs方法代码示例

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


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

示例1: execute

 public function execute(Zend_Search_Lucene_Interface $reader, $docsFilter = null)
 {
     $this->_docVector = array_flip($reader->termDocs($this->_term, $docsFilter));
     $this->_termFreqs = $reader->termFreqs($this->_term, $docsFilter);
     // Initialize weight if it's not done yet
     $this->_initWeight($reader);
 }
开发者ID:hackingman,项目名称:TubeX,代码行数:7,代码来源:Term.php

示例2: _calculateNonConjunctionResult

 /**
  * Calculate result vector for non Conjunction query
  * (like '+something -another')
  *
  * @param Zend_Search_Lucene_Interface $reader
  */
 private function _calculateNonConjunctionResult(Zend_Search_Lucene_Interface $reader)
 {
     $requiredVectors = array();
     $requiredVectorsSizes = array();
     $requiredVectorsIds = array();
     // is used to prevent arrays comparison
     $optional = array();
     $prohibited = array();
     foreach ($this->_terms as $termId => $term) {
         $termDocs = array_flip($reader->termDocs($term));
         if ($this->_signs[$termId] === true) {
             // required
             $requiredVectors[] = $termDocs;
             $requiredVectorsSizes[] = count($termDocs);
             $requiredVectorsIds[] = $termId;
         } elseif ($this->_signs[$termId] === false) {
             // prohibited
             // array union
             $prohibited += $termDocs;
         } else {
             // neither required, nor prohibited
             // array union
             $optional += $termDocs;
         }
         $this->_termsFreqs[$termId] = $reader->termFreqs($term);
     }
     // sort resvectors in order of subquery cardinality increasing
     array_multisort($requiredVectorsSizes, SORT_ASC, SORT_NUMERIC, $requiredVectorsIds, SORT_ASC, SORT_NUMERIC, $requiredVectors);
     $required = null;
     foreach ($requiredVectors as $nextResVector) {
         if ($required === null) {
             $required = $nextResVector;
         } else {
             //$required = array_intersect_key($required, $nextResVector);
             /**
              * This code is used as workaround for array_intersect_key() slowness problem.
              */
             $updatedVector = array();
             foreach ($required as $id => $value) {
                 if (isset($nextResVector[$id])) {
                     $updatedVector[$id] = $value;
                 }
             }
             $required = $updatedVector;
         }
         if (count($required) == 0) {
             // Empty result set, we don't need to check other terms
             break;
         }
     }
     if ($required !== null) {
         $this->_resVector = $required;
     } else {
         $this->_resVector = $optional;
     }
     if (count($prohibited) != 0) {
         // $this->_resVector = array_diff_key($this->_resVector, $prohibited);
         /**
          * This code is used as workaround for array_diff_key() slowness problem.
          */
         if (count($this->_resVector) < count($prohibited)) {
             $updatedVector = $this->_resVector;
             foreach ($this->_resVector as $id => $value) {
                 if (isset($prohibited[$id])) {
                     unset($updatedVector[$id]);
                 }
             }
             $this->_resVector = $updatedVector;
         } else {
             $updatedVector = $this->_resVector;
             foreach ($prohibited as $id => $value) {
                 unset($updatedVector[$id]);
             }
             $this->_resVector = $updatedVector;
         }
     }
     ksort($this->_resVector, SORT_NUMERIC);
 }
开发者ID:sraj4,项目名称:EthicsPublicHtmlProd,代码行数:84,代码来源:MultiTerm.php

示例3: termFreqs

 /**
  * Returns an array of all term freqs.
  * Return array structure: array( docId => freq, ...)
  *
  * @param Zend_Search_Lucene_Index_Term $term
  * @param Zend_Search_Lucene_Index_DocsFilter|null $docsFilter
  * @return integer
  */
 public function termFreqs(Zend_Search_Lucene_Index_Term $term, $docsFilter = null)
 {
     return $this->_index->termFreqs($term, $docsFilter);
 }
开发者ID:abdulhadikaryana,项目名称:kebudayaan,代码行数:12,代码来源:Proxy.php

示例4: termFreqs

 /**
  * Returns an array of all term freqs.
  * Return array structure: array( docId => freq, ...)
  *
  * @param Zend_Search_Lucene_Index_Term $term
  * @return integer
  */
 public function termFreqs(Zend_Search_Lucene_Index_Term $term)
 {
     return $this->_index->termFreqs($term);
 }
开发者ID:lortnus,项目名称:zf1,代码行数:11,代码来源:Proxy.php

示例5: _calculateNonConjunctionResult

 /**
  * Calculate result vector for non Conjunction query
  * (like '+something -another')
  *
  * @param Zend_Search_Lucene_Interface $reader
  */
 private function _calculateNonConjunctionResult(Zend_Search_Lucene_Interface $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->_termsFreqs[$termId] = $reader->termFreqs($term);
     }
     if ($required !== null) {
         $this->_resVector = count($prohibited) > 0 ? array_diff_key($required, $prohibited) : $required;
     } else {
         $this->_resVector = count($prohibited) > 0 ? array_diff_key($optional, $prohibited) : $optional;
     }
     ksort($this->_resVector, SORT_NUMERIC);
 }
开发者ID:vojtajina,项目名称:sitellite,代码行数:39,代码来源:MultiTerm.php

示例6: _calculateNonConjunctionResult

 private function _calculateNonConjunctionResult(Zend_Search_Lucene_Interface $reader)
 {
     $requiredVectors = array();
     $requiredVectorsSizes = array();
     $requiredVectorsIds = array();
     $optional = array();
     $prohibited = array();
     foreach ($this->_terms as $termId => $term) {
         $termDocs = array_flip($reader->termDocs($term));
         if ($this->_signs[$termId] === true) {
             $requiredVectors[] = $termDocs;
             $requiredVectorsSizes[] = count($termDocs);
             $requiredVectorsIds[] = $termId;
         } elseif ($this->_signs[$termId] === false) {
             $prohibited += $termDocs;
         } else {
             $optional += $termDocs;
         }
         $this->_termsFreqs[$termId] = $reader->termFreqs($term);
     }
     array_multisort($requiredVectorsSizes, SORT_ASC, SORT_NUMERIC, $requiredVectorsIds, SORT_ASC, SORT_NUMERIC, $requiredVectors);
     $required = null;
     foreach ($requiredVectors as $nextResVector) {
         if ($required === null) {
             $required = $nextResVector;
         } else {
             $updatedVector = array();
             foreach ($required as $id => $value) {
                 if (isset($nextResVector[$id])) {
                     $updatedVector[$id] = $value;
                 }
             }
             $required = $updatedVector;
         }
         if (count($required) == 0) {
             break;
         }
     }
     if ($required !== null) {
         $this->_resVector = $required;
     } else {
         $this->_resVector = $optional;
     }
     if (count($prohibited) != 0) {
         if (count($this->_resVector) < count($prohibited)) {
             $updatedVector = $this->_resVector;
             foreach ($this->_resVector as $id => $value) {
                 if (isset($prohibited[$id])) {
                     unset($updatedVector[$id]);
                 }
             }
             $this->_resVector = $updatedVector;
         } else {
             $updatedVector = $this->_resVector;
             foreach ($prohibited as $id => $value) {
                 unset($updatedVector[$id]);
             }
             $this->_resVector = $updatedVector;
         }
     }
     ksort($this->_resVector, SORT_NUMERIC);
 }
开发者ID:Blu2z,项目名称:implsk,代码行数:62,代码来源:Zend_Search_Lucene.php


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