Home
last modified time | relevance | path

Searched refs:sphSort (Results 1 – 12 of 12) sorted by relevance

/dports/textproc/libsphinxclient/sphinx-2.0.9-release/src/
H A Dtests.cpp1366 sphSort ( pData, iCount ); in BenchSort()
1580 sphSort ( dMini, 1, fnSortDummy, fnSortDummy ); in TestStridedSortPass()
1581 sphSort ( dMini, 0, fnSortDummy, fnSortDummy ); in TestStridedSortPass()
1585 sphSort ( pData, iCount, fnSort, fnSort ); in TestStridedSortPass()
1589 sphSort ( pData, iCount, fnSort, fnSort ); in TestStridedSortPass()
1597 sphSort ( pData, iCount, fnSort, fnSort ); in TestStridedSortPass()
1602 sphSort ( pData, iCount, fnSort, fnSort ); in TestStridedSortPass()
H A Dsphinxstd.h450 void sphSort ( T * pData, int iCount, U COMP, V ACC ) in sphSort() function
533 void sphSort ( T * pData, int iCount, U COMP ) in sphSort() function
535 sphSort ( pData, iCount, COMP, SphAccessor_T<T>() ); in sphSort()
540 void sphSort ( T * pData, int iCount ) in sphSort() function
542 sphSort ( pData, iCount, SphLess_T<T>() ); in sphSort()
869 sphSort ( m_pData+iStart, iEnd-iStart+1, COMP );
H A Dsphinxsort.cpp652 sphSort ( pRemoveGroups, iRemoveGroups ); in Compact()
1309 sphSort ( m_pData, m_iUsed, m_tGroupSorter, m_tGroupSorter ); in SortGroups()
H A Dsphinx.cpp7138 sphSort ( m_pTags, *m_pTagCount, sphMemberLess ( &TagDesc_t::m_iTag ) ); in TaggedAlloc()
8262 sphSort ( pBuf, iCount, fnSort, fnSort ); in sphSortDocinfos()
9190 sphSort ( pMvaPool, pMva-pMvaPool ); in BuildMVA()
9209 sphSort ( pMvaPool, pMva-pMvaPool ); in BuildMVA()
10464 sphSort ( &dHits[0], iHits, CmpHit_fn() ); in Build()
10554 sphSort ( &dHits[0], iHits, CmpHit_fn() ); in Build()
10587 sphSort ( &dHits[0], iHits, CmpHit_fn() ); in Build()
10632 sphSort ( &dHits[0], iHits, CmpHit_fn() ); in Build()
H A Dsearchd.cpp5448 sphSort ( tRes.m_dMatches.Begin(), tRes.m_dMatches.GetLength(), fnSort, fnSort ); in KillAllDupes()
/dports/textproc/sphinxsearch/sphinx-2.2.11-release/src/
H A Dsphinxstd.h540 void sphSort ( T * pData, int iCount, U COMP, V ACC ) in sphSort() function
629 void sphSort ( T * pData, int iCount, U COMP ) in sphSort() function
631 sphSort ( pData, iCount, COMP, SphAccessor_T<T>() ); in sphSort()
636 void sphSort ( T * pData, int iCount ) in sphSort() function
638 sphSort ( pData, iCount, SphLess_T<T>() ); in sphSort()
1014 sphSort ( m_pData+iStart, iEnd-iStart+1, COMP );
H A Dtests.cpp1997 sphSort ( pData, iCount ); in BenchSort()
2209 sphSort ( dMini, 1, fnSortDummy, fnSortDummy ); in TestStridedSortPass()
2210 sphSort ( dMini, 0, fnSortDummy, fnSortDummy ); in TestStridedSortPass()
2214 sphSort ( pData, iCount, fnSort, fnSort ); in TestStridedSortPass()
2218 sphSort ( pData, iCount, fnSort, fnSort ); in TestStridedSortPass()
2226 sphSort ( pData, iCount, fnSort, fnSort ); in TestStridedSortPass()
2231 sphSort ( pData, iCount, fnSort, fnSort ); in TestStridedSortPass()
2268 sphSort ( dUniq, iCount ); in TestStridedSort()
H A Dsphinxsort.cpp300 sphSort ( dIndexes.Begin(), dIndexes.GetLength(), CompareIndex_fn<COMP> ( m_pData, &m_tState ) ); in Finalize()
389 sphSort ( m_pEnd-m_iSize, m_iSize, tComp, tComp ); in Push()
399 sphSort ( m_pData, m_iUsed, tComp, tComp ); in Push()
430 sphSort ( m_pEnd-m_iUsed, m_iUsed, tComp, tComp ); in Finalize()
459 sphSort ( m_pEnd-m_iUsed, m_iUsed, tComp, tComp ); in Flatten()
1224 sphSort ( pRemoveGroups, iRemoveGroups ); in Compact()
2017 sphSort ( m_pData, m_iUsed, m_tGroupSorter, m_tGroupSorter ); in SortGroups()
2768 sphSort ( m_pData, m_iFreeHeads, m_tGroupSorter, m_tGroupSorter ); in SortGroups()
H A Dsphinxrt.cpp6106sphSort ( m_dWordExpand.Begin(), m_dWordExpand.GetLength(), ExpandedOrderDesc_T<RtExpandedEntry_t>… in Convert()
6113 sphSort ( m_dWordExpand.Begin(), m_dWordExpand.GetLength(), fnCmp ); in Convert()
6152sphSort ( m_dWordPayload.Begin()+tSeg.m_uOff, tSeg.m_uLen, ExpandedOrderDesc_T<RtExpandedPayload_t… in Convert()
6158sphSort ( m_dWordPayload.Begin()+tSeg.m_uOff, tSeg.m_uLen, bind ( &RtExpandedPayload_t::m_uDoclist… in Convert()
8273 sphSort ( pCombined, (int)iCount ); in AttachDiskIndex()
H A Dsphinxsearch.cpp2847 sphSort ( m_dHits, iHit, CmpAndHitReverse_fn() ); in GetHitsChunk()
2981 sphSort ( m_dHits, iHit, CmpAndHitReverse_fn() ); in GetHitsChunk()
4073 sphSort ( dHashes.Begin(), dHashes.GetLength() ); in ExtQuorum_c()
4341 sphSort ( m_dQuorumHits+m_iMyLast, iLen, QuorumCmpHitPos_fn() ); in GetHitsChunkDupes()
H A Dsphinx.cpp9357 sphSort ( m_pTags, *m_pTagCount, sphMemberLess ( &TagDesc_t::m_iTag ) ); in TaggedAlloc()
10877 sphSort ( pBuf, iCount, fnSort, fnSort ); in sphSortDocinfos()
12128 sphSort ( pMvaPool, pMva-pMvaPool ); in BuildMVA()
12146 sphSort ( pMvaPool, pMva-pMvaPool ); in BuildMVA()
13095 sphSort ( dHits.Begin(), iHits, CmpHit_fn() ); in Build()
13200 sphSort ( dHits.Begin(), iHits, CmpHit_fn() ); in Build()
13238 sphSort ( dHits.Begin(), iHits, CmpHit_fn() ); in Build()
13284 sphSort ( dHits.Begin(), iHits, CmpHit_fn() ); in Build()
18034 sphSort ( dKeywords.Begin(), dKeywords.GetLength(), bind ( &CSphKeywordInfo::m_iQpos ) ); in GetKeywords()
30945 sphSort ( dColumnsSorted.Begin(), dColumnsSorted.GetLength(), bind ( &SortedRemapXSV_t::m_iTag ) ); in Setup()
[all …]
H A Dsearchd.cpp8520 sphSort ( tRes.m_dMatches.Begin(), tRes.m_dMatches.GetLength(), fnSort, fnSort ); in KillAllDupes()
9067 sphSort ( tRes.m_dMatches.Begin(), tRes.m_dMatches.GetLength(), tReorder, MatchSortAccessor_t() ); in MinimizeAggrResult()