Home
last modified time | relevance | path

Searched refs:SphDocID_t (Results 1 – 25 of 25) sorted by relevance

/dports/textproc/libsphinxclient/sphinx-2.0.9-release/src/
H A Dsphinxfilter.cpp234 …if ( (SphDocID_t)GetValue(i)>=(SphDocID_t)uBlockMin && (SphDocID_t)GetValue(i)<=(SphDocID_t)uBlock… in EvalBlockValues()
257 m_iMinValue = (SphDocID_t)Max ( 0, (SphDocID_t)tMin ); in SetRange()
263 const SphDocID_t uID = tMatch.m_iDocID; in Eval()
264 return uID>=(SphDocID_t)m_iMinValue && uID<=(SphDocID_t)m_iMaxValue; in Eval()
269 const SphDocID_t uBlockMin = DOCINFO2ID ( pMinDocinfo ); in EvalBlock()
270 const SphDocID_t uBlockMax = DOCINFO2ID ( pMaxDocinfo ); in EvalBlock()
272 return (!( (SphDocID_t)m_iMaxValue<uBlockMin || (SphDocID_t)m_iMinValue>uBlockMax )); in EvalBlock()
H A Dsphinxsearch.cpp57 SphDocID_t m_uDocid;
126 SphDocID_t m_uMaxID;
257 SphDocID_t m_uDocid;
300 SphDocID_t m_uTermMaxID;
304 SphDocID_t m_uLastID;
314 SphDocID_t m_uDoneFor;
357 SphDocID_t m_uMatchedDocid;
669 SphDocID_t m_uHitsOverFor;
773 SphDocID_t m_uMaxID;
5680 SphDocID_t uMaxID = 0; in Mark()
[all …]
H A Dindextool.cpp372 CSphTightVector<SphDocID_t> dLiveID; in DoKlistsOptimization()
408 SphDocID_t uid = (SphDocID_t)dKlist[i]; in DoKlistsOptimization()
409 SphDocID_t * pInLive = sphBinarySearch ( dLiveID.Begin(), &dLiveID.Last(), uid ); in DoKlistsOptimization()
417 SphDocID_t * pFirstLive = dLiveID.Begin(); in DoKlistsOptimization()
418 SphDocID_t * pLastLive = &dLiveID.Last(); in DoKlistsOptimization()
422 SphDocID_t uID = (SphDocID_t)dKlist[i]; in DoKlistsOptimization()
423 SphDocID_t * pKilled = sphBinarySearch ( pFirstLive, pLastLive, uID ); in DoKlistsOptimization()
460 SphDocID_t uID = 0; in DoKlistsOptimization()
H A Dsphinx.h90 typedef uint64_t SphDocID_t; typedef
97 STATIC_SIZE_ASSERT ( SphDocID_t, 8 );
104 typedef DWORD SphDocID_t; typedef
111 STATIC_SIZE_ASSERT ( SphDocID_t, 4 );
170 return DOCINFO2ID_T<SphDocID_t> ( pDocinfo ); in DOCINFO2ID()
853 SphDocID_t m_iDocID; ///< document ID
885 return m_iBitOffset==-8*(int)sizeof(SphDocID_t) && m_iBitCount==8*sizeof(SphDocID_t); in IsID()
990 SphDocID_t m_iDocID; ///< document ID
1567 SphDocID_t VerifyID ( SphDocID_t uID );
1735 SphDocID_t m_uMinID; ///< grand min ID
[all …]
H A Dsphinxint.h96 void PutDocid ( SphDocID_t uValue ) { PutOffset ( uValue ); } in PutDocid()
98 void PutDocid ( SphDocID_t uValue ) { PutDword ( uValue ); } in PutDocid()
194 SphDocID_t GetDocid () { return GetOffset(); } in GetDocid()
195 SphDocID_t UnzipDocid () { return UnzipOffset(); } in UnzipDocid()
198 SphDocID_t GetDocid () { return GetDword(); } in GetDocid()
199 SphDocID_t UnzipDocid () { return UnzipInt(); } in UnzipDocid()
384 SphDocID_t m_iDocID;
400 template < typename DOCID = SphDocID_t >
701 SphDocID_t uDocID = DOCINFO2ID_T<DOCID>(pCur); in Collect()
728 sError.SetSprintf ( "broken index: mva list out of bounds, id=" DOCID_FMT, (SphDocID_t)uDocID ); in Collect()
[all …]
H A Dsphinxrt.cpp239 bool Exists ( SphDocID_t uDoc ) in Exists()
287 SphDocID_t uLastDocID = 0; in LoadFromFile()
309 SphDocID_t uLastDocID = 0; in SaveToFile()
427 SphDocID_t m_uLastDocID;
482 SphDocID_t uDeltaID; in UnzipDoc()
753 SphDocID_t m_uDocid;
1711 SphDocID_t m_uDocid;
2124 void SetDocid ( SphDocID_t ) {} in SetDocid() argument
2155 void SetDocid ( SphDocID_t ) {} in SetDocid() argument
2215 void SetDocid ( SphDocID_t ) {} in SetDocid() argument
[all …]
H A Dsphinxrt.h41 virtual bool DeleteDocument ( const SphDocID_t * pDocs, int iDocs, CSphString & sError ) = 0;
H A Dsphinx.cpp1284 SphDocID_t m_uDocID;
7791 SphDocID_t* pDocid = (SphDocID_t *)(g_pMvaArena + iNewIndex); in UpdateAttributes()
7956 SphDocID_t *pDocid = (SphDocID_t*)(g_pMvaArena + iAlloc); in LoadPersistentMVA()
8236 bool IsLess ( SphDocID_t a, SphDocID_t b ) const in IsLess()
9071 SphDocID_t m_uDocID;
10513 SphDocID_t tDocId; in Build()
12787 SphDocID_t uDocid = (SphDocID_t) pQuery->m_dFilters[0].GetValue(i); in MultiScan()
13936 SphDocID_t uDoc; in Preread()
16245 const SphDocID_t uMinDocID = *(SphDocID_t*)pMinEntry; in DebugCheck()
16246 const SphDocID_t uMaxDocID = *(SphDocID_t*)pMaxEntry; in DebugCheck()
[all …]
H A Dtests.cpp1669 bool IterateKillListNext ( SphDocID_t & ) { return false; } in IterateKillListNext() argument
1908 bool IterateKillListNext ( SphDocID_t & ) { return false; } in IterateKillListNext() argument
1998 const SphDocID_t tID = tResult.m_dMatches[i].m_iDocID; in TestRTSendVsMerge()
2001 assert ( (SphDocID_t)tTag1==tID+1000 ); in TestRTSendVsMerge()
H A Dsearchd.cpp3570 int iReqSize = 108 + 2*sizeof(SphDocID_t) + 4*q.m_iWeights in CalcQueryLen()
4182 SphDocID_t uMinID = 0; in ParseSearchQuery()
4183 SphDocID_t uMaxID = DOCID_MAX; in ParseSearchQuery()
4186 uMinID = (SphDocID_t)tReq.GetUint64 (); in ParseSearchQuery()
4187 uMaxID = (SphDocID_t)tReq.GetUint64 (); in ParseSearchQuery()
4422 tEntry.m_uDocID = (SphDocID_t) tReq.GetUint64 (); in ParseSearchQuery()
5250 pId->m_tLocator.m_iBitOffset = -8*(int)sizeof(SphDocID_t); in MkIdAttribute()
5251 pId->m_tLocator.m_iBitCount = 8*sizeof(SphDocID_t); in MkIdAttribute()
7527 CSphVector<SphDocID_t> m_dDeleteIds;
9405 tUpd.m_dDocids.Add ( (SphDocID_t)uDocid ); // FIXME! check this in HandleCommandUpdate()
[all …]
H A Dsphinxsort.cpp246 tSet.m_dRows[i] = m_pData[i].m_pStatic - ( sizeof(SphDocID_t) / sizeof(CSphRowitem) ); in DoUpdate()
/dports/textproc/sphinxsearch/sphinx-2.2.11-release/src/
H A Dsphinx.h92 typedef uint64_t SphDocID_t; typedef
99 STATIC_SIZE_ASSERT ( SphDocID_t, 8 );
106 typedef DWORD SphDocID_t; typedef
113 STATIC_SIZE_ASSERT ( SphDocID_t, 4 );
1153 SphDocID_t m_uDocID; ///< document ID
1191 return m_iBitOffset==-8*(int)sizeof(SphDocID_t) && m_iBitCount==8*sizeof(SphDocID_t); in IsID()
1304 SphDocID_t m_uDocID; ///< document ID
2024 SphDocID_t VerifyID ( SphDocID_t uID );
3030 SphDocID_t m_iJustPushed;
3198 const SphDocID_t * m_pBegin;
[all …]
H A Dsphinxfilter.cpp310 …if ( (SphDocID_t)GetValue(i)>=(SphDocID_t)uBlockMin && (SphDocID_t)GetValue(i)<=(SphDocID_t)uBlock… in EvalBlockValues()
334 m_iMinValue = (SphDocID_t)Max ( (SphDocID_t)tMin, 0u ); in SetRange()
340 const SphDocID_t uID = tMatch.m_uDocID; in Eval()
342 return uID>=(SphDocID_t)m_iMinValue && uID<=(SphDocID_t)m_iMaxValue; in Eval()
344 return uID>(SphDocID_t)m_iMinValue && uID<(SphDocID_t)m_iMaxValue; in Eval()
349 const SphDocID_t uBlockMin = DOCINFO2ID ( pMinDocinfo ); in EvalBlock()
350 const SphDocID_t uBlockMax = DOCINFO2ID ( pMaxDocinfo ); in EvalBlock()
353 return ( (SphDocID_t)m_iMaxValue>=uBlockMin && (SphDocID_t)m_iMinValue<=uBlockMax ); in EvalBlock()
355 return ( (SphDocID_t)m_iMaxValue>uBlockMin && (SphDocID_t)m_iMinValue<uBlockMax ); in EvalBlock()
1292 CSphVector<SphDocID_t> m_dMerged;
H A Dsphinxsearch.h40 SphDocID_t m_iBaseDocid; ///< delta decoder docid base (aka docid infinum)
93 virtual void HintDocid ( SphDocID_t ) {} in HintDocid() argument
122 SphDocID_t m_uMinDocid;
H A Dsphinxrt.cpp269 bool Exists ( SphDocID_t uDoc ) in Exists()
341 SphDocID_t uLastDocID = 0; in LoadFromFile()
362 SphDocID_t uLastDocID = 0; in SaveToFile()
511 SphDocID_t m_uLastDocID;
573 SphDocID_t uDeltaID; in UnzipDoc()
2008 SphDocID_t m_uDocid;
2283 const SphDocID_t * m_pKlist;
4851 SphDocID_t uPrevDocID = 0; in DebugCheck()
4857 SphDocID_t uDeltaID; in DebugCheck()
5205 SphDocID_t uLastID = 0; in DebugCheck()
[all …]
H A Dsphinxsearch.cpp76 SphDocID_t m_uDocid;
111 SphDocID_t m_uDocid;
469 SphDocID_t m_uLastID;
479 SphDocID_t m_uDoneFor;
480 SphDocID_t m_uHitStartDocid;
565 SphDocID_t m_uMatchedDocid;
981 SphDocID_t m_uHitsOverFor;
1461 SphDocID_t m_uDocid;
2381 SphDocID_t uSkipID = m_uLastID; in GetDocsChunk()
5645 SphDocID_t uMaxID = 0; in GetFilteredDocs()
[all …]
H A Dindextool.cpp242 CSphTightVector<SphDocID_t> dLiveID; in DoKlistsOptimization()
278 SphDocID_t uid = (SphDocID_t)dKlist[i]; in DoKlistsOptimization()
279 SphDocID_t * pInLive = sphBinarySearch ( dLiveID.Begin(), &dLiveID.Last(), uid ); in DoKlistsOptimization()
287 SphDocID_t * pFirstLive = dLiveID.Begin(); in DoKlistsOptimization()
288 SphDocID_t * pLastLive = &dLiveID.Last(); in DoKlistsOptimization()
292 SphDocID_t uID = (SphDocID_t)dKlist[i]; in DoKlistsOptimization()
293 SphDocID_t * pKilled = sphBinarySearch ( pFirstLive, pLastLive, uID ); in DoKlistsOptimization()
330 SphDocID_t uID = 0; in DoKlistsOptimization()
H A Dsphinxint.h209 void PutDocid ( SphDocID_t uValue ) { PutOffset ( uValue ); } in PutDocid()
211 void PutDocid ( SphDocID_t uValue ) { PutDword ( uValue ); } in PutDocid()
313 SphDocID_t GetDocid () { return GetOffset(); } in GetDocid()
314 SphDocID_t UnzipDocid () { return UnzipOffset(); } in UnzipDocid()
317 SphDocID_t GetDocid () { return GetDword(); } in GetDocid()
318 SphDocID_t UnzipDocid () { return UnzipInt(); } in UnzipDocid()
564 template < typename DOCID = SphDocID_t >
863 SphDocID_t uDocID = DOCINFO2ID_T<DOCID>(pCur); in Collect()
890 sError.SetSprintf ( "broken index: mva list out of bounds, id=" DOCID_FMT, (SphDocID_t)uDocID ); in Collect()
1307 SphDocID_t m_uDocid;
[all …]
H A Dsphinx.cpp10180 SphDocID_t* pDocid = (SphDocID_t *)(g_pMvaArena + iNewIndex); in UpdateAttributes()
10361 SphDocID_t *pDocid = (SphDocID_t*)(g_pMvaArena + iAlloc); in LoadPersistentMVA()
10851 bool IsLess ( SphDocID_t a, SphDocID_t b ) const in IsLess()
11617 SphDocID_t d2, l2 = 0; in cidxWriteRawVLB()
12008 SphDocID_t m_uDocID;
12225 SphDocID_t uCurID = 0; in BuildMVA()
13188 SphDocID_t uDocId; in Build()
15898 SphDocID_t uDocid = (SphDocID_t) pQuery->m_dFilters[0].GetValue(i); in MultiScan()
17429 SphDocID_t uDoc; in Preread()
26004 SphDocID_t CSphSource::VerifyID ( SphDocID_t uID ) in VerifyID()
[all …]
H A Dsphinxrt.h45 virtual bool DeleteDocument ( const SphDocID_t * pDocs, int iDocs, CSphString & sError ) = 0;
H A Dtests.cpp1127 virtual SphDocID_t * GetKillList () const { return NULL; } in GetKillList()
1129 virtual bool HasDocid ( SphDocID_t ) const { return false; } in HasDocid()
2297 if ( m_tDocInfo.m_uDocID>=(SphDocID_t)m_iDocCount ) in NextDocument()
2317 bool IterateKillListNext ( SphDocID_t & ) { return false; } in IterateKillListNext() argument
2556 bool IterateKillListNext ( SphDocID_t & ) { return false; } in IterateKillListNext() argument
2653 const SphDocID_t uID = tResult.m_dMatches[i].m_uDocID; in TestRTSendVsMerge()
2656 assert ( (SphDocID_t)tTag1==uID+1000 ); in TestRTSendVsMerge()
H A Dsearchd.cpp6621 SphDocID_t uMinID = 0; in ParseSearchQuery()
6622 SphDocID_t uMaxID = DOCID_MAX; in ParseSearchQuery()
6625 uMinID = (SphDocID_t)tReq.GetUint64 (); in ParseSearchQuery()
6626 uMaxID = (SphDocID_t)tReq.GetUint64 (); in ParseSearchQuery()
6879 tEntry.m_uDocID = (SphDocID_t) tReq.GetUint64 (); in ParseSearchQuery()
8928 d.m_tLocator.m_iBitCount = 8*sizeof(SphDocID_t); in MinimizeAggrResult()
17231 CSphVector<SphDocID_t> dValues; in LocalIndexDoDeleteDocuments()
17300 const SphDocID_t * pDocs = NULL; in HandleMysqlDelete()
17302 CSphVector<SphDocID_t> dDeleteIds; in HandleMysqlDelete()
17316 pDocs = (SphDocID_t*)pFilter->GetValueArray(); in HandleMysqlDelete()
[all …]
H A Dsphinxsort.cpp513 m_tWorkSet.m_dRows[i] = m_pData[i].m_pStatic - ( sizeof(SphDocID_t) / sizeof(CSphRowitem) ); in DoUpdate()
602 CSphVector<SphDocID_t>* m_pValues;
605 CSphDeleteQueue ( int iSize, CSphVector<SphDocID_t> * pDeletes ) in CSphDeleteQueue()
2402 CSphTightVector<SphDocID_t> dJustPopped; in PushEx()
H A Dindexer.cpp1752 if ( !g_bQuiet && sizeof(SphDocID_t)==4 ) in main()
H A Dsphinxexpr.cpp245 CSphOrderedHash < CSphString, SphDocID_t, IdentityHash_fn, 256 > * m_pFactors;