Home
last modified time | relevance | path

Searched refs:pHits (Results 1 – 15 of 15) sorted by relevance

/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/proof/fraig/
H A DfraigFeed.c34 static int Fraig_GetSmallestColumn( int * pHits, int nHits );
390 int * pHits, iPat, iCol, i; in Fraig_FeedBackCovering() local
398 pHits = ABC_ALLOC( int, vColumns->nSize ); in Fraig_FeedBackCovering()
403 nOnesTotal += pHits[i]; in Fraig_FeedBackCovering()
434 ABC_FREE( pHits ); in Fraig_FeedBackCovering()
555 int Fraig_GetSmallestColumn( int * pHits, int nHits ) in Fraig_GetSmallestColumn() argument
561 if ( pHits[i] == 0 ) in Fraig_GetSmallestColumn()
564 if ( pHits[i] == 1 ) in Fraig_GetSmallestColumn()
567 if ( nHitsMin > pHits[i] ) in Fraig_GetSmallestColumn()
569 nHitsMin = pHits[i]; in Fraig_GetSmallestColumn()
[all …]
/dports/net-mgmt/promscale/promscale-0.6.2/vendor/github.com/thanos-io/thanos/pkg/store/cache/
H A Dinmemory_test.go246 pHits, pMisses := cache.FetchMultiPostings(ctx, id, []labels.Label{lbls})
247 testutil.Equals(t, emptyPostingsHits, pHits, "no such key")
264 pHits, pMisses = cache.FetchMultiPostings(ctx, id, []labels.Label{lbls})
269 testutil.Equals(t, emptyPostingsHits, pHits, "no such key")
273 testutil.Equals(t, emptyPostingsHits, pHits, "no such key")
316 pHits, pMisses = cache.FetchMultiPostings(ctx, id, []labels.Label{lbls})
317 testutil.Equals(t, emptyPostingsHits, pHits, "no such key")
324 pHits, pMisses = cache.FetchMultiPostings(ctx, id, []labels.Label{lbls2})
325 testutil.Equals(t, map[labels.Label][]byte{lbls2: v}, pHits)
343 pHits, pMisses = cache.FetchMultiPostings(ctx, id, []labels.Label{lbls2})
[all …]
/dports/net-mgmt/thanos/thanos-0.11.0/pkg/store/cache/
H A Dinmemory_test.go244 pHits, pMisses := cache.FetchMultiPostings(ctx, id, []labels.Label{lbls})
245 testutil.Equals(t, emptyPostingsHits, pHits, "no such key")
262 pHits, pMisses = cache.FetchMultiPostings(ctx, id, []labels.Label{lbls})
267 testutil.Equals(t, emptyPostingsHits, pHits, "no such key")
271 testutil.Equals(t, emptyPostingsHits, pHits, "no such key")
314 pHits, pMisses = cache.FetchMultiPostings(ctx, id, []labels.Label{lbls})
315 testutil.Equals(t, emptyPostingsHits, pHits, "no such key")
322 pHits, pMisses = cache.FetchMultiPostings(ctx, id, []labels.Label{lbls2})
323 testutil.Equals(t, map[labels.Label][]byte{lbls2: v}, pHits)
341 pHits, pMisses = cache.FetchMultiPostings(ctx, id, []labels.Label{lbls2})
[all …]
/dports/textproc/sphinxsearch/sphinx-2.2.11-release/src/
H A Dtests.cpp1539 for ( const CKeywordHits * pHits = pTest->m_pKeywordHits; pHits->m_sKeyword; ++pHits ) in TestQueryTransforms() local
1540 Verify ( tIndex.m_hHits.Add ( pHits->m_iHits, pHits->m_sKeyword ) ); in TestQueryTransforms()
2074 int64_t tmSort = BenchSort ( pHits, HITS, true ); in BenchSort()
2079 SafeDeleteArray ( pHits ); in BenchSort()
2436 ISphHits * pHits; in TestRTWeightBoundary() local
2444 pHits = pSrc->IterateHits ( sError ); in TestRTWeightBoundary()
2445 if ( !pHits ) in TestRTWeightBoundary()
2633 ISphHits * pHits = pSrc->IterateHits ( sError ); in TestRTSendVsMerge() local
2634 if ( !pHits ) in TestRTSendVsMerge()
2747 ISphHits * pHits = pSrc->IterateHits ( sError ); in TestRankerFactors() local
[all …]
H A Dsphinxrt.h41 …virtual bool AddDocument ( ISphHits * pHits, const CSphMatch & tDoc, const char ** ppStr, const CS…
H A Dsphinxsearch.cpp149 …tRes.Appendf ( i ? ", 0x%x:0x%x" : "0x%x:0x%x", DWORD ( pHits[i].m_uDocid ), DWORD ( pHits[i].m_uH… in PrintHitsChunk()
9225 const ExtHit_t * pHits = NULL; in Mark() local
9234 pHits = m_pRoot->GetHitsChunk ( pDocs ); in Mark()
9235 if ( !pHits ) in Mark()
9238 for ( ; pHits->m_uDocid!=DOCID_MAX; pHits++ ) in Mark()
9241 tMark.m_uPosition = HITMAN::GetPos ( pHits->m_uHitpos ); in Mark()
9242 tMark.m_uSpan = pHits->m_uMatchlen; in Mark()
9472 const ExtHit_t * pHits = NULL; in WarmupCache() local
9475 while ( ( pHits = pChild->GetHitsChunk ( pChunkHits ) )!=NULL ) in WarmupCache()
9477 for ( ; pHits->m_uDocid!=DOCID_MAX; pHits++ ) in WarmupCache()
[all …]
H A Dsphinxrt.cpp881 …void AddDocument ( ISphHits * pHits, const CSphMatch & tDoc, int iRowSize, const char ** ppStr, …
1134 …virtual bool AddDocument ( ISphHits * pHits, const CSphMatch & tDoc, const char ** ppStr, const…
1549 ISphHits * pHits = tSrc.IterateHits ( sError ); in AddDocument() local
1552 if ( !AddDocument ( pHits, tDoc, ppStr, dMvas, sError, sWarning ) ) in AddDocument()
1594 bool RtIndex_t::AddDocument ( ISphHits * pHits, const CSphMatch & tDoc, const char ** ppStr, const … in AddDocument() argument
1652 pAcc->AddDocument ( pHits, tDoc, m_tSchema.GetRowSize(), ppStr, dMvas, dJsonData ); in AddDocument()
1728 void RtAccum_t::AddDocument ( ISphHits * pHits, const CSphMatch & tDoc, int iRowSize, const char **… in AddDocument() argument
1736 if ( pHits && pHits->Length() && !m_dAccum.GetLength() ) in AddDocument()
1823 if ( pHits && pHits->Length() ) in AddDocument()
1830 iHits = pHits->Length(); in AddDocument()
[all …]
H A Dsphinx.cpp13078 pHits += iDocHits; in Build()
13081 if ( pHits<pHitsMax in Build()
13098 pHits = dHits.Begin(); in Build()
13202 pHits = dHits.Begin(); in Build()
13230 pHits += iJoinedHits; in Build()
13241 pHits = dHits.Begin(); in Build()
13280 if ( pHits>dHits.Begin() ) in Build()
24127 return pHits; in FindFirstGte()
24129 CSphWordHit * pL = pHits; in FindFirstGte()
24175 if ( !pHits || iHits<=0 ) in HitblockPatch()
[all …]
H A Dsphinxexcerpt.cpp3312 explicit SnippetsFastQword_c ( const CSphVector<int> * pHits ) in SnippetsFastQword_c() argument
3313 : m_pHits ( pHits ) in SnippetsFastQword_c()
/dports/textproc/libsphinxclient/sphinx-2.0.9-release/src/
H A Dsphinxrt.h37 …virtual bool AddDocument ( ISphHits * pHits, const CSphMatch & tDoc, const char ** ppStr, const CS…
H A Dtests.cpp1433 CSphWordHit * pHits = new CSphWordHit [ MAXHITS ]; in BenchSort() local
1439 if ( (int)fread ( pHits, sizeof(CSphWordHit), HITS, fp )!=HITS ) in BenchSort()
1443 int64_t tmSort = BenchSort ( pHits, HITS, true ); in BenchSort()
1448 SafeDeleteArray ( pHits ); in BenchSort()
1793 ISphHits * pHits; in TestRTWeightBoundary() local
1801 pHits = pSrc->IterateHits ( sError ); in TestRTWeightBoundary()
1802 if ( !pHits ) in TestRTWeightBoundary()
1805 pIndex->AddDocument ( pHits, pSrc->m_tDocInfo, NULL, dMvas, sError ); in TestRTWeightBoundary()
1980 ISphHits * pHits = pSrc->IterateHits ( sError ); in TestRTSendVsMerge() local
1981 if ( !pHits ) in TestRTSendVsMerge()
[all …]
H A Dsphinxsearch.cpp5677 const ExtHit_t * pHits = NULL; in Mark() local
5687 pHits = m_pRoot->GetHitsChunk ( pDocs, uMaxID ); in Mark()
5688 if ( !pHits ) in Mark()
5691 for ( ; pHits->m_uDocid!=DOCID_MAX; pHits++ ) in Mark()
5694 tMark.m_uPosition = HITMAN::GetPos ( pHits->m_uHitpos ); in Mark()
5695 tMark.m_uSpan = pHits->m_uMatchlen; in Mark()
5905 const ExtHit_t * pHits = NULL; in WarmupCache() local
5909 while ( ( pHits = pChild->GetHitsChunk ( pChunkHits, uLastDocid ) )!=NULL ) in WarmupCache()
5911 for ( ; pHits->m_uDocid!=DOCID_MAX; pHits++ ) in WarmupCache()
5913 m_Hits.Add ( *pHits ); in WarmupCache()
H A Dsphinxrt.cpp788 …void AddDocument ( ISphHits * pHits, const CSphMatch & tDoc, int iRowSize, const char ** ppStr, …
1016 …virtual bool AddDocument ( ISphHits * pHits, const CSphMatch & tDoc, const char ** ppStr, const…
1350 ISphHits * pHits = tSrc.IterateHits ( sError ); in AddDocument() local
1352 return AddDocument ( pHits, tDoc, ppStr, dMvas, sError ); in AddDocument()
1389 bool RtIndex_t::AddDocument ( ISphHits * pHits, const CSphMatch & tDoc, const char ** ppStr, const … in AddDocument() argument
1395 pAcc->AddDocument ( pHits, tDoc, m_tSchema.GetRowSize(), ppStr, dMvas ); in AddDocument()
1470 void RtAccum_t::AddDocument ( ISphHits * pHits, const CSphMatch & tDoc, int iRowSize, const char **… in AddDocument() argument
1478 if ( pHits && pHits->Length() && !m_dAccum.GetLength() ) in AddDocument()
1541 if ( pHits && pHits->Length() ) in AddDocument()
1548 iHits = pHits->Length(); in AddDocument()
[all …]
H A Dsphinx.cpp10446 pHits += iDocHits; in Build()
10449 if ( pHits<pHitsMax in Build()
10467 pHits = dHits; in Build()
10557 pHits = dHits; in Build()
10578 *pHits++ = *pHit; in Build()
10590 pHits = dHits; in Build()
10627 if ( pHits>dHits ) in Build()
18439 return pHits; in FindFirstGte()
18441 CSphWordHit * pL = pHits; in FindFirstGte()
18487 if ( !pHits || iHits<=0 ) in HitblockPatch()
[all …]
H A Dsphinxexcerpt.cpp2736 explicit SnippetsFastQword_c ( const CSphVector<int> * pHits ) in SnippetsFastQword_c() argument
2737 : m_pHits ( pHits ) in SnippetsFastQword_c()