Home
last modified time | relevance | path

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

12

/dports/biology/sra-tools/sra-tools-2.11.0/ncbi-vdb/libs/kdb/
H A Dptrieval-v1.c59 bool key2id; member
68 const KPTrieIndex_v1 *self, const KIndex *outer, bool key2id, bool id2key ) in KPTrieIndexCCParmsInit_v1() argument
74 pb -> key2id = key2id; in KPTrieIndexCCParmsInit_v1()
149 if ( pb -> key2id || pb -> id2key ) in KPTrieIndexCCVisit_v1()
166 if ( pb -> key2id ) in KPTrieIndexCCVisit_v1()
235 const KIndex *outer, bool key2id, bool id2key ) in KPTrieIndexCheckConsistency_v1() argument
243 if ( ( key2id || id2key ) && outer == NULL ) in KPTrieIndexCheckConsistency_v1()
246 KPTrieIndexCCParmsInit_v1 ( & pb, self, outer, key2id, id2key ); in KPTrieIndexCheckConsistency_v1()
247 if ( PTrieDoUntil ( self -> key2id, KPTrieIndexCCVisit_v1, & pb ) ) in KPTrieIndexCheckConsistency_v1()
H A Dtrieidx-v1.c66 rc = PTrieMakeOrig ( & self -> key2id, in KPTrieIndexInit_v1()
70 size_t ptsize = PTrieSize ( self -> key2id ); in KPTrieIndexInit_v1()
113 PTrieWhack ( self -> key2id ); in KPTrieIndexInit_v1()
114 self -> key2id = NULL; in KPTrieIndexInit_v1()
129 PTrieWhack ( self -> key2id ); in KPTrieIndexWhack_v1()
171 if ( self -> pt . key2id != NULL ) in KTrieIndexFind_v1()
178 nid = PTrieFind ( self -> pt . key2id, & key, & n, custom_cmp, data ); in KTrieIndexFind_v1()
200 rc_t rc = PTrieGetNode ( self -> pt . key2id, in KTrieIndexProject_v1()
H A Dtrieidx-v2.c177 self -> key2id = v1 . key2id; in KPTrieIndexInitFromV1_v2()
203 self -> key2id = v1 . key2id; in KPTrieIndexInitFromV1_v2()
362 self -> key2id = NULL; in KPTrieIndexInit_v2()
463 PTrieWhack ( self -> key2id ), self -> key2id = NULL; in KPTrieIndexInit_v2()
469 PTrieWhack ( self -> key2id ), self -> key2id = NULL; in KPTrieIndexInit_v2()
499 self -> key2id = NULL; in KPTrieIndexInit_v3_v4()
600 PTrieWhack ( self -> key2id ), self -> key2id = NULL; in KPTrieIndexInit_v3_v4()
606 PTrieWhack ( self -> key2id ), self -> key2id = NULL; in KPTrieIndexInit_v3_v4()
621 PTrieWhack ( self -> key2id ); in KPTrieIndexWhack_v2()
989 if ( self -> pt . key2id == NULL ) in KTrieIndexOpen_v2()
[all …]
H A Dptrieval-v2.c61 bool key2id; member
72 …const KPTrieIndex_v2 *self, const KIndex *outer, bool key2id, bool id2key, bool all_ids, bool conv… in KPTrieIndexCCParmsInit_v2() argument
78 pb -> key2id = key2id; in KPTrieIndexCCParmsInit_v2()
275 if ( pb -> key2id || pb -> id2key ) in KPTrieIndexCCVisit_v2()
291 if ( pb -> key2id ) in KPTrieIndexCCVisit_v2()
366 const KIndex *outer, bool key2id, bool id2key, bool all_ids, bool convertFromV1 ) in KPTrieIndexCheckConsistency_v2() argument
374 if ( ( key2id || id2key ) && outer == NULL ) in KPTrieIndexCheckConsistency_v2()
377 KPTrieIndexCCParmsInit_v2 ( & pb, self, outer, key2id, id2key, all_ids, convertFromV1 ); in KPTrieIndexCheckConsistency_v2()
378 if ( PTrieDoUntil ( self -> key2id, KPTrieIndexCCVisit_v2, & pb ) ) in KPTrieIndexCheckConsistency_v2()
H A Dwtrieidx-v1.c74 rc = PTrieMakeOrig ( & self -> key2id, in KPTrieIndexInit_v1()
121 PTrieWhack ( self -> key2id ); in KPTrieIndexInit_v1()
122 self -> key2id = NULL; in KPTrieIndexInit_v1()
137 PTrieWhack ( self -> key2id ); in KPTrieIndexWhack_v1()
280 rc = TriePersist ( & self -> key2id, & pb -> ptt_size, in KTrieIndexPersistTrie_v1()
780 TrieForEach ( & self -> key2id, in KTrieIndexAttach_v1()
781 KTrieIdxNodeUnlink_v1, & self -> key2id ); in KTrieIndexAttach_v1()
830 if ( self -> pt . key2id != NULL ) in KTrieIndexInsert_v1()
950 if ( self -> pt . key2id != NULL ) in KTrieIndexDelete_v1()
1003 TrieUnlink ( & self -> key2id, & node -> n ); in KTrieIndexDelete_v1()
[all …]
H A Dindex-cmn.h94 struct PTrie *key2id; member
111 struct KIndex const *outer, bool key2id, bool id2key );
139 struct KIndex const *outer, bool key2id, bool id2key );
195 struct PTrie *key2id; member
226 struct KIndex const *outer, bool key2id, bool id2key, bool all_ids, bool convertFromV1 );
264 struct KIndex const *outer, bool key2id, bool id2key, bool all_ids, bool convertFromV1 );
H A Dwtrieidx-v2.c180 self -> key2id = v1 . key2id; in KPTrieIndexInitFromV1_v2()
206 self -> key2id = v1 . key2id; in KPTrieIndexInitFromV1_v2()
357 self -> key2id = NULL; in KPTrieIndexInit_v2()
443 PTrieWhack ( self -> key2id ), self -> key2id = NULL; in KPTrieIndexInit_v2()
449 PTrieWhack ( self -> key2id ), self -> key2id = NULL; in KPTrieIndexInit_v2()
479 self -> key2id = NULL; in KPTrieIndexInit_v3_v4()
565 PTrieWhack ( self -> key2id ), self -> key2id = NULL; in KPTrieIndexInit_v3_v4()
571 PTrieWhack ( self -> key2id ), self -> key2id = NULL; in KPTrieIndexInit_v3_v4()
586 PTrieWhack ( self -> key2id ); in KPTrieIndexWhack_v2()
1946 if ( self -> pt . key2id == NULL ) in KTrieIndexOpen_v2()
[all …]
H A Dtrieval-v1.c41 struct KIndex const *outer, bool key2id, bool id2key ) in KTrieIndexCheckConsistency_v1() argument
48 outer, key2id, id2key ); in KTrieIndexCheckConsistency_v1()
H A Dtrieval-v2.c41 struct KIndex const *outer, bool key2id, bool id2key, bool all_ids, bool convertFromV1 ) in KTrieIndexCheckConsistency_v2() argument
48 outer, key2id, id2key, all_ids, convertFromV1 ); in KTrieIndexCheckConsistency_v2()
H A Dwindex-priv.h80 Trie key2id; member
176 Trie key2id; member
H A Dindex.c612 bool key2id, id2key, all_ids; in KIndexConsistencyCheck() local
616 key2id = id2key = all_ids = false; in KIndexConsistencyCheck()
619 key2id = id2key = false; in KIndexConsistencyCheck()
623 key2id = id2key = true; in KIndexConsistencyCheck()
627 key2id = id2key = all_ids = true; in KIndexConsistencyCheck()
640 self, key2id, id2key ); in KIndexConsistencyCheck()
647 self, key2id, id2key, all_ids, self -> converted_from_v1 ); in KIndexConsistencyCheck()
/dports/biology/ncbi-vdb/ncbi-vdb-2.11.0/libs/kdb/
H A Dptrieval-v1.c59 bool key2id; member
68 const KPTrieIndex_v1 *self, const KIndex *outer, bool key2id, bool id2key ) in KPTrieIndexCCParmsInit_v1() argument
74 pb -> key2id = key2id; in KPTrieIndexCCParmsInit_v1()
149 if ( pb -> key2id || pb -> id2key ) in KPTrieIndexCCVisit_v1()
166 if ( pb -> key2id ) in KPTrieIndexCCVisit_v1()
235 const KIndex *outer, bool key2id, bool id2key ) in KPTrieIndexCheckConsistency_v1() argument
243 if ( ( key2id || id2key ) && outer == NULL ) in KPTrieIndexCheckConsistency_v1()
246 KPTrieIndexCCParmsInit_v1 ( & pb, self, outer, key2id, id2key ); in KPTrieIndexCheckConsistency_v1()
247 if ( PTrieDoUntil ( self -> key2id, KPTrieIndexCCVisit_v1, & pb ) ) in KPTrieIndexCheckConsistency_v1()
H A Dtrieidx-v1.c66 rc = PTrieMakeOrig ( & self -> key2id, in KPTrieIndexInit_v1()
70 size_t ptsize = PTrieSize ( self -> key2id ); in KPTrieIndexInit_v1()
113 PTrieWhack ( self -> key2id ); in KPTrieIndexInit_v1()
114 self -> key2id = NULL; in KPTrieIndexInit_v1()
129 PTrieWhack ( self -> key2id ); in KPTrieIndexWhack_v1()
171 if ( self -> pt . key2id != NULL ) in KTrieIndexFind_v1()
178 nid = PTrieFind ( self -> pt . key2id, & key, & n, custom_cmp, data ); in KTrieIndexFind_v1()
200 rc_t rc = PTrieGetNode ( self -> pt . key2id, in KTrieIndexProject_v1()
H A Dtrieidx-v2.c177 self -> key2id = v1 . key2id; in KPTrieIndexInitFromV1_v2()
203 self -> key2id = v1 . key2id; in KPTrieIndexInitFromV1_v2()
362 self -> key2id = NULL; in KPTrieIndexInit_v2()
463 PTrieWhack ( self -> key2id ), self -> key2id = NULL; in KPTrieIndexInit_v2()
469 PTrieWhack ( self -> key2id ), self -> key2id = NULL; in KPTrieIndexInit_v2()
499 self -> key2id = NULL; in KPTrieIndexInit_v3_v4()
600 PTrieWhack ( self -> key2id ), self -> key2id = NULL; in KPTrieIndexInit_v3_v4()
606 PTrieWhack ( self -> key2id ), self -> key2id = NULL; in KPTrieIndexInit_v3_v4()
621 PTrieWhack ( self -> key2id ); in KPTrieIndexWhack_v2()
989 if ( self -> pt . key2id == NULL ) in KTrieIndexOpen_v2()
[all …]
H A Dptrieval-v2.c61 bool key2id; member
72 …const KPTrieIndex_v2 *self, const KIndex *outer, bool key2id, bool id2key, bool all_ids, bool conv… in KPTrieIndexCCParmsInit_v2() argument
78 pb -> key2id = key2id; in KPTrieIndexCCParmsInit_v2()
275 if ( pb -> key2id || pb -> id2key ) in KPTrieIndexCCVisit_v2()
291 if ( pb -> key2id ) in KPTrieIndexCCVisit_v2()
366 const KIndex *outer, bool key2id, bool id2key, bool all_ids, bool convertFromV1 ) in KPTrieIndexCheckConsistency_v2() argument
374 if ( ( key2id || id2key ) && outer == NULL ) in KPTrieIndexCheckConsistency_v2()
377 KPTrieIndexCCParmsInit_v2 ( & pb, self, outer, key2id, id2key, all_ids, convertFromV1 ); in KPTrieIndexCheckConsistency_v2()
378 if ( PTrieDoUntil ( self -> key2id, KPTrieIndexCCVisit_v2, & pb ) ) in KPTrieIndexCheckConsistency_v2()
H A Dwtrieidx-v1.c74 rc = PTrieMakeOrig ( & self -> key2id, in KPTrieIndexInit_v1()
121 PTrieWhack ( self -> key2id ); in KPTrieIndexInit_v1()
122 self -> key2id = NULL; in KPTrieIndexInit_v1()
137 PTrieWhack ( self -> key2id ); in KPTrieIndexWhack_v1()
280 rc = TriePersist ( & self -> key2id, & pb -> ptt_size, in KTrieIndexPersistTrie_v1()
780 TrieForEach ( & self -> key2id, in KTrieIndexAttach_v1()
781 KTrieIdxNodeUnlink_v1, & self -> key2id ); in KTrieIndexAttach_v1()
830 if ( self -> pt . key2id != NULL ) in KTrieIndexInsert_v1()
950 if ( self -> pt . key2id != NULL ) in KTrieIndexDelete_v1()
1003 TrieUnlink ( & self -> key2id, & node -> n ); in KTrieIndexDelete_v1()
[all …]
H A Dindex-cmn.h94 struct PTrie *key2id; member
111 struct KIndex const *outer, bool key2id, bool id2key );
139 struct KIndex const *outer, bool key2id, bool id2key );
195 struct PTrie *key2id; member
226 struct KIndex const *outer, bool key2id, bool id2key, bool all_ids, bool convertFromV1 );
264 struct KIndex const *outer, bool key2id, bool id2key, bool all_ids, bool convertFromV1 );
H A Dwtrieidx-v2.c180 self -> key2id = v1 . key2id; in KPTrieIndexInitFromV1_v2()
206 self -> key2id = v1 . key2id; in KPTrieIndexInitFromV1_v2()
357 self -> key2id = NULL; in KPTrieIndexInit_v2()
443 PTrieWhack ( self -> key2id ), self -> key2id = NULL; in KPTrieIndexInit_v2()
449 PTrieWhack ( self -> key2id ), self -> key2id = NULL; in KPTrieIndexInit_v2()
479 self -> key2id = NULL; in KPTrieIndexInit_v3_v4()
565 PTrieWhack ( self -> key2id ), self -> key2id = NULL; in KPTrieIndexInit_v3_v4()
571 PTrieWhack ( self -> key2id ), self -> key2id = NULL; in KPTrieIndexInit_v3_v4()
586 PTrieWhack ( self -> key2id ); in KPTrieIndexWhack_v2()
1946 if ( self -> pt . key2id == NULL ) in KTrieIndexOpen_v2()
[all …]
H A Dtrieval-v1.c41 struct KIndex const *outer, bool key2id, bool id2key ) in KTrieIndexCheckConsistency_v1() argument
48 outer, key2id, id2key ); in KTrieIndexCheckConsistency_v1()
H A Dtrieval-v2.c41 struct KIndex const *outer, bool key2id, bool id2key, bool all_ids, bool convertFromV1 ) in KTrieIndexCheckConsistency_v2() argument
48 outer, key2id, id2key, all_ids, convertFromV1 ); in KTrieIndexCheckConsistency_v2()
H A Dwindex-priv.h80 Trie key2id; member
176 Trie key2id; member
H A Dindex.c612 bool key2id, id2key, all_ids; in KIndexConsistencyCheck() local
616 key2id = id2key = all_ids = false; in KIndexConsistencyCheck()
619 key2id = id2key = false; in KIndexConsistencyCheck()
623 key2id = id2key = true; in KIndexConsistencyCheck()
627 key2id = id2key = all_ids = true; in KIndexConsistencyCheck()
640 self, key2id, id2key ); in KIndexConsistencyCheck()
647 self, key2id, id2key, all_ids, self -> converted_from_v1 ); in KIndexConsistencyCheck()
/dports/biology/sra-tools/sra-tools-2.11.0/tools/fastq-loader/
H A Dspot-assembler.c88 rc = OpenKBTree(ctx->cache_size, ctx->tmpfs, ctx->pid, &ctx->key2id[0], 1, 1); in GetKeyIDOld()
95 rc = KBTreeEntry(ctx->key2id[0], &tmpKey, wasInserted, name, namelen); in GetKeyIDOld()
113 rc = KBTreeEntry(ctx->key2id[0], &tmpKey, wasInserted, buf, actsize); in GetKeyIDOld()
257 ctx->key2id[f] = tree; in SpotAssemblerGetKeyID()
272 rc = KBTreeEntry(ctx->key2id[f], &tmpKey, wasInserted, name, namelen); in SpotAssemblerGetKeyID()
402 KBTreeDropBacking ( self->key2id[i] ); in SpotAssemblerRelease()
403 KBTreeRelease ( self->key2id[i]) ; in SpotAssemblerRelease()
404 self->key2id[i] = NULL; in SpotAssemblerRelease()
/dports/lang/ruby26/ruby-2.6.9/
H A Did_table.c17 key2id(id_key_t key) in key2id() function
219 fprintf(stderr, " -> [%d] %s %d\n", i, rb_id2name(key2id(keys[i])), (int)keys[i]); in hash_table_show()
277 enum rb_id_table_iterator_result ret = (*func)(key2id(key), tbl->items[i].val, data); in rb_id_table_foreach()
/dports/lang/erlang-runtime23/corba-5.0.2/lib/orber/COSS/CosNaming/
H A Dorber_cosnaming_utils.erl416 NS = iop_ior:create_external(Vers, key2id(Key), Host, Port, Key),
430 NS = iop_ior:create_external(Vers, key2id(Key), Host, Port, Key, [SSLComponent]),
443 ObjRef = iop_ior:create_external(Vers, key2id(Key), Host, Port, Key),
478 ObjRef = iop_ior:create_external(Vers, key2id(Key), Host, Port, Key, [SSLComponent]),
583 key2id(Key) -> function

12