Home
last modified time | relevance | path

Searched refs:hSubTrees (Results 1 – 2 of 2) sorted by relevance

/dports/textproc/libsphinxclient/sphinx-2.0.9-release/src/
H A Dsphinxquery.cpp1753 if ( bFlag && hSubTrees.Exists ( iHash ) && hSubTrees [ iHash ].m_pTree->IsEqualTo ( pTree ) ) in FlagCommonSubtrees()
1755 hSubTrees[iHash].MarkIt (); in FlagCommonSubtrees()
1761 if ( !hSubTrees.Exists ( pTree->m_dChildren[i]->GetHash() ) ) in FlagCommonSubtrees()
1762 FlagCommonSubtrees ( pTree->m_dChildren[i], hSubTrees, false, bMarkIt ); in FlagCommonSubtrees()
1764 FlagCommonSubtrees ( pTree->m_dChildren[i], hSubTrees, false, false ); in FlagCommonSubtrees()
1768 hSubTrees[iHash].MarkIt(false); in FlagCommonSubtrees()
1770 hSubTrees.Add ( MarkedNode_t ( pTree ), iHash ); in FlagCommonSubtrees()
1773 FlagCommonSubtrees ( pTree->m_dChildren[i], hSubTrees, bFlag, bMarkIt ); in FlagCommonSubtrees()
1784 if ( hSubTrees.Exists(iHash) && hSubTrees[iHash].m_bMarked ) in SignCommonSubtrees()
1785 pTree->TagAsCommon ( hSubTrees[iHash].m_iOrder, hSubTrees[iHash].m_iCounter ); in SignCommonSubtrees()
[all …]
/dports/textproc/sphinxsearch/sphinx-2.2.11-release/src/
H A Dsphinxquery.cpp2472 if ( bFlag && hSubTrees.Exists ( iHash ) && tCmp.IsEqual ( hSubTrees [ iHash ].m_pTree, pTree ) ) in FlagCommonSubtrees()
2474 hSubTrees[iHash].MarkIt ( true ); in FlagCommonSubtrees()
2480 if ( !hSubTrees.Exists ( pTree->m_dChildren[i]->GetHash() ) ) in FlagCommonSubtrees()
2481 FlagCommonSubtrees ( pTree->m_dChildren[i], hSubTrees, tCmp, false, bMarkIt ); in FlagCommonSubtrees()
2483 FlagCommonSubtrees ( pTree->m_dChildren[i], hSubTrees, tCmp, false, false ); in FlagCommonSubtrees()
2487 hSubTrees[iHash].MarkIt ( false ); in FlagCommonSubtrees()
2489 hSubTrees.Add ( MarkedNode_t ( pTree ), iHash ); in FlagCommonSubtrees()
2492 FlagCommonSubtrees ( pTree->m_dChildren[i], hSubTrees, tCmp, bFlag, bMarkIt ); in FlagCommonSubtrees()
2497 static void SignCommonSubtrees ( XQNode_t * pTree, const CSubtreeHash & hSubTrees ) in SignCommonSubtrees() argument
2503 const MarkedNode_t * pCommon = hSubTrees ( iHash ); in SignCommonSubtrees()
[all …]