Home
last modified time | relevance | path

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

12

/dports/textproc/tokyodystopia/tokyodystopia-0.9.15/
H A Ddystopia.c255 QDBRSET rsets[4]; in tcidbsearch() local
258 rsets[0].ids = tcidbsearchimpl(idb, token, IDBSFULL, &rsets[0].num); in tcidbsearch()
272 QDBRSET rsets[2]; in tcidbsearch() local
283 QDBRSET rsets[2]; in tcidbsearch() local
352 QDBRSET *rsets = tcmalloc(tnum * sizeof(*rsets)); in tcidbsearch2() local
389 if(rsets[0].num < 0) rsets[0].num = 0; in tcidbsearch2()
402 memmove(rsets + 1, rsets + unum + 1, (rsnum - unum - 1) * sizeof(*rsets)); in tcidbsearch2()
419 memmove(rsets + 1, rsets + unum + 1, (rsnum - unum - 1) * sizeof(*rsets)); in tcidbsearch2()
428 if(!rsets[0].ids || rsets[0].num < 0) rsets[0].num = 0; in tcidbsearch2()
436 tcfree(rsets); in tcidbsearch2()
[all …]
H A Dlaputa.c340 QDBRSET *rsets = tcmalloc(tnum * sizeof(*rsets)); in tcjdbsearch2() local
351 rsets[rsnum].ids = tcjdbsearchtoken(jdb, term, &rsets[rsnum].num); in tcjdbsearch2()
377 if(rsets[0].num < 0) rsets[0].num = 0; in tcjdbsearch2()
390 memmove(rsets + 1, rsets + unum + 1, (rsnum - unum - 1) * sizeof(*rsets)); in tcjdbsearch2()
407 memmove(rsets + 1, rsets + unum + 1, (rsnum - unum - 1) * sizeof(*rsets)); in tcjdbsearch2()
416 if(!rsets[0].ids || rsets[0].num < 0) rsets[0].num = 0; in tcjdbsearch2()
424 tcfree(rsets); in tcjdbsearch2()
1218 QDBRSET *rsets = tcmalloc(wnum * sizeof(*rsets)); in tcjdbsearchimpl() local
1221 if(!rsets[i].ids) rsets[i].num = 0; in tcjdbsearchimpl()
1227 tcfree(rsets); in tcjdbsearchimpl()
[all …]
H A Dlapusearch.c237 QDBRSET rsets[wnum]; in writeresult() local
239 rsets[i].ids = tcjdbsearch(jdb, tclistval2(words, i), params->smode, &rsets[i].num); in writeresult()
241 res = tcqdbresunion(rsets, wnum, &rnum); in writeresult()
243 tcfree(rsets[i].ids); in writeresult()
252 QDBRSET rsets[wnum]; in writeresult() local
254 rsets[i].ids = tcjdbsearch(jdb, tclistval2(words, i), params->smode, &rsets[i].num); in writeresult()
258 tcfree(rsets[i].ids); in writeresult()
267 QDBRSET rsets[wnum]; in writeresult() local
269 rsets[i].ids = tcjdbsearch(jdb, tclistval2(words, i), params->smode, &rsets[i].num); in writeresult()
271 res = tcqdbresdiff(rsets, wnum, &rnum); in writeresult()
[all …]
H A Ddystsearch.c243 QDBRSET rsets[wnum]; in writeresult() local
245 rsets[i].ids = tcidbsearch(idb, tclistval2(words, i), params->smode, &rsets[i].num); in writeresult()
247 res = tcqdbresunion(rsets, wnum, &rnum); in writeresult()
249 tcfree(rsets[i].ids); in writeresult()
258 QDBRSET rsets[wnum]; in writeresult() local
260 rsets[i].ids = tcidbsearch(idb, tclistval2(words, i), params->smode, &rsets[i].num); in writeresult()
264 tcfree(rsets[i].ids); in writeresult()
273 QDBRSET rsets[wnum]; in writeresult() local
275 rsets[i].ids = tcidbsearch(idb, tclistval2(words, i), params->smode, &rsets[i].num); in writeresult()
277 res = tcqdbresdiff(rsets, wnum, &rnum); in writeresult()
[all …]
H A Dtcqdb.c560 if(!rsets[0].ids){ in tcqdbresunion()
564 *np = rsets[0].num; in tcqdbresunion()
565 return tcmemdup(rsets[0].ids, rsets[0].num * sizeof(rsets[0].ids[0])); in tcqdbresunion()
570 sum += rsets[i].num; in tcqdbresunion()
600 if(!rsets[i].ids){ in tcqdbresisect()
610 *np = rsets[0].num; in tcqdbresisect()
611 return tcmemdup(rsets[0].ids, rsets[0].num * sizeof(rsets[0].ids[0])); in tcqdbresisect()
616 if(rsets[0].num < rsets[1].num){ in tcqdbresisect()
645 sum += rsets[i].num; in tcqdbresisect()
683 *np = rsets[0].num; in tcqdbresdiff()
[all …]
H A Dtcqdb.h364 uint64_t *tcqdbresunion(QDBRSET *rsets, int rsnum, int *np);
375 uint64_t *tcqdbresisect(QDBRSET *rsets, int rsnum, int *np);
386 uint64_t *tcqdbresdiff(QDBRSET *rsets, int rsnum, int *np);
H A Dtcqmgr.c598 QDBRSET rsets[wnum]; in procsearch() local
602 rsets[i].ids = tcqdbsearch(qdb, ntext, smode, &rsets[i].num); in procsearch()
609 res = tcqdbresunion(rsets, wnum, &rnum); in procsearch()
612 res = tcqdbresdiff(rsets, wnum, &rnum); in procsearch()
615 res = tcqdbresisect(rsets, wnum, &rnum); in procsearch()
629 tcfree(rsets[i].ids); in procsearch()
H A Dtcwmgr.c591 QDBRSET rsets[wnum]; in procsearch() local
595 rsets[i].ids = tcwdbsearch(wdb, ntext, &rsets[i].num); in procsearch()
602 res = tcqdbresunion(rsets, wnum, &rnum); in procsearch()
605 res = tcqdbresdiff(rsets, wnum, &rnum); in procsearch()
608 res = tcqdbresisect(rsets, wnum, &rnum); in procsearch()
622 tcfree(rsets[i].ids); in procsearch()
H A Dlapumgr.c675 QDBRSET rsets[wnum]; in procsearch() local
677 rsets[i].ids = tcjdbsearch(jdb, words[i], smode, &rsets[i].num); in procsearch()
683 res = tcqdbresisect(rsets, wnum, &rnum); in procsearch()
686 res = tcqdbresdiff(rsets, wnum, &rnum); in procsearch()
689 res = tcqdbresunion(rsets, wnum, &rnum); in procsearch()
695 tcfree(rsets[i].ids); in procsearch()
H A Ddystmgr.c681 QDBRSET rsets[wnum]; in procsearch() local
683 rsets[i].ids = tcidbsearch(idb, words[i], smode, &rsets[i].num); in procsearch()
689 res = tcqdbresisect(rsets, wnum, &rnum); in procsearch()
692 res = tcqdbresdiff(rsets, wnum, &rnum); in procsearch()
695 res = tcqdbresunion(rsets, wnum, &rnum); in procsearch()
701 tcfree(rsets[i].ids); in procsearch()
/dports/devel/bison/bison-3.7.6/src/
H A Dnullable.c62 rule_list **rsets = xcalloc (nnterms, sizeof *rsets); in nullable_compute() local
89 p->next = rsets[*rp - ntokens]; in nullable_compute()
91 rsets[*rp - ntokens] = p; in nullable_compute()
110 for (rule_list *p = rsets[*s1++ - ntokens]; p; p = p->next) in nullable_compute()
123 free (rsets); in nullable_compute()
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/ghc-exactprint-0.6.4/tests/examples/ghc710/
H A DSlidingRecordSetter.hs2 selfQualify mod rsets = let defs = Set.fromList (map rs_name rsets)
4 (map (\RS{..} -> RS{rs_name = qualify mod rs_name, ..}) rsets)
/dports/net/zebra-server/idzebra-2.0.55/index/
H A Drpnscan.c204 RSET rsets[2]; in scan_save_set() local
206 rsets[0] = rset; in scan_save_set()
207 rsets[1] = rset_t; in scan_save_set()
209 2, rsets); in scan_save_set()
221 RSET rsets[2]; in scan_save_set() local
222 rsets[0] = rset; in scan_save_set()
223 rsets[1] = rset_dup(limit_set); in scan_save_set()
225 rset = rset_create_and(nmem, kc, kc->scope, 2, rsets); in scan_save_set()
H A Dtrunc.c426 RSET *rsets = xmalloc(no*sizeof(RSET)); /* use nmem! */ in rset_trunc() local
429 rsets[i] = rsisamb_create(rset_nmem, kctrl, scope, in rset_trunc()
433 termid, no, rsets); in rset_trunc()
434 xfree(rsets); in rset_trunc()
/dports/math/polymake/polymake-4.5/bundled/atint/apps/tropical/src/
H A Dmatroid_from_fan.cc60 Array<Set<Int>> rsets{ all_subsets_of_k(sequence(0,n), r) }; in matroid_from_fan() local
62 for (const auto& rset : rsets) { in matroid_from_fan()
/dports/databases/tokyotyrant/tokyotyrant-1.1.41/ext/
H A Dusherette.lua338 local rsets = {}
339 table.insert(rsets, result)
343 table.insert(rsets, ids)
345 result = _union(rsets)
/dports/net/zebra-server/idzebra-2.0.55/rset/
H A Drsmultiandor.c257 int no_rsets, RSET* rsets, in rsmulti_andor_create() argument
261 no_rsets, rsets); in rsmulti_andor_create()
275 int scope, TERMID termid, int no_rsets, RSET* rsets) in rset_create_or() argument
278 no_rsets, rsets, &control_or); in rset_create_or()
282 int scope, int no_rsets, RSET* rsets) in rset_create_and() argument
285 no_rsets, rsets, &control_and); in rset_create_and()
/dports/net/py-python-designateclient/python-designateclient-4.4.0/designateclient/functionaltests/v2/
H A Dtest_recordsets.py52 rsets = self.clients.recordset_list(self.zone.id)
53 self.assertGreater(len(rsets), 0)
/dports/textproc/py-nltk/nltk-3.4.1/nltk/corpus/reader/
H A Dnombank.py143 rsets = []
148 rsets.append(etree.findall('predicate/roleset'))
149 return LazyConcatenation(rsets)
H A Dpropbank.py138 rsets = []
143 rsets.append(etree.findall('predicate/roleset'))
144 return LazyConcatenation(rsets)
/dports/net/zebra-server/idzebra-2.0.55/include/
H A Drset.h241 int scope, TERMID termid, int no_rsets, RSET* rsets);
244 int scope, int no_rsets, RSET* rsets);
/dports/sysutils/kubectl/kubernetes-1.22.2/vendor/github.com/libopenstorage/openstorage/api/
H A Dapi.go316 rsets := m.GetReplicaSets()
317 for _, rset := range rsets {
/dports/net-mgmt/bgpq4/bgpq4-1.4/
H A Dexpander.c99 STAILQ_INIT(&b->rsets); in bgpq_expander_init()
142 STAILQ_INSERT_TAIL(&b->rsets, le, entry); in bgpq_expander_add_rset()
1049 STAILQ_FOREACH(mc, &b->rsets, entry) { in bgpq_expand()
1146 while (!STAILQ_EMPTY(&expander->rsets)) { in expander_freeall()
1147 struct slentry *n1 = STAILQ_FIRST(&expander->rsets); in expander_freeall()
1148 STAILQ_REMOVE_HEAD(&expander->rsets, entry); in expander_freeall()
H A Dextern.h112 STAILQ_HEAD(slentries, slentry) macroses, rsets;
/dports/net-mgmt/bgpq3/bgpq3-0.1.36/
H A Dbgpq3.h49 STAILQ_HEAD(sx_slentries, sx_slentry) macroses, rsets;

12