/dports/textproc/htdig/htdig-3.2.0b6/htword/ |
H A D | WordCursorOne.cc | 69 searchKey = nsearchKey; in Initialize() 82 searchKey.Clear(); in Clear() 190 if(searchKey.Empty()) { in WalkInit() 197 prefixKey = searchKey; in WalkInit() 233 if(searchKey.Empty()) { in WalkRewind() 236 prefixKey = searchKey; in WalkRewind() 308 if(!(searchKey.Empty())) { in WalkNextStep() 329 !searchKey.Equal(found.Key())) { in WalkNextStep() 503 foundKey.Merge(searchKey); in SkipUselessSequentialWalking() 533 WordKey pos = searchKey; in Seek() [all …]
|
H A D | WordCursor.cc | 34 searchKey = nsearchKey; in Initialize() 46 searchKey.Clear(); in Clear() 156 if(searchKey.Empty()) { in WalkInit() 164 prefixKey = searchKey; in WalkInit() 206 if(searchKey.Empty()) { in WalkRewind() 209 prefixKey = searchKey; in WalkRewind() 281 if(!(searchKey.Empty())) { in WalkNextStep() 455 complement(foundKey, searchKey); in SkipUselessSequentialWalking() 486 foundKey.Merge(searchKey); in SkipUselessSequentialWalking() 516 WordKey pos = searchKey; in Seek() [all …]
|
H A D | WordCursor.h | 172 …r(WordList *words, const WordKey &searchKey, int action = HTDIG_WORDLIST_WALKER) { Clear(); Initia… 177 …words, const WordKey &searchKey, wordlist_walk_callback_t callback, Object * callback_data) { Clea… in WordCursor() argument 301 WordKey& GetSearch() { return searchKey; } in GetSearch() 303 const WordKey& GetSearch() const { return searchKey; } in GetSearch() 369 WordKey searchKey; variable
|
/dports/textproc/mifluz/mifluz-0.26.0/mifluz/ |
H A D | WordCursorOne.cc | 69 searchKey = nsearchKey; in Initialize() 82 searchKey.Clear(); in Clear() 190 if(searchKey.Empty()) { in WalkInit() 197 prefixKey = searchKey; in WalkInit() 233 if(searchKey.Empty()) { in WalkRewind() 236 prefixKey = searchKey; in WalkRewind() 311 if(!(searchKey.Empty())) { in WalkNextStep() 332 !searchKey.Equal(found.Key())) { in WalkNextStep() 506 foundKey.Merge(searchKey); in SkipUselessSequentialWalking() 536 WordKey pos = searchKey; in Seek() [all …]
|
/dports/devel/critcl/critcl-3.1.18.1/lib/wikit/ |
H A D | search.tcl | 12 variable searchKey "" 16 variable searchKey 19 if {$searchKey == ""} { 28 return [mk::select $db.pages -rsort date -keyword $fields $searchKey] 37 variable searchKey 41 if {$searchKey == ""} {return ""} 45 set result "Searched for \"'''$searchKey'''\" (in page titles"
|
/dports/biology/seqan1/seqan-1.3.1/seqan/chaining/ |
H A D | rmt_compl_algos.h | 106 typename Key< TObject >::Type searchKey = key( *base, dim ); in _connectUpdate() local 133 TKey searchKey, in _performRMQ() argument 138 …SEQAN_CHECK2( searchKey > minValue< typename Key< TObject >::Type >( ), "search theKeyexceeds infi… in _performRMQ() 146 while( key( *right_buffer ) < searchKey ) in _performRMQ() 165 while( key( *base_element, dim ) < searchKey ) in _performRMQ() 178 TKey searchKey, in _performRMQ() argument 192 while( key( *right_buffer ) < searchKey ) in _performRMQ() 209 while( key( *base_element, dim ) < searchKey ) in _performRMQ() 220 typename Key< TObject >::Type searchKey, in _performRMQ() 235 while( key( *right_buffer ) < searchKey ) in _performRMQ() [all …]
|
/dports/databases/mysql55-client/mysql-5.5.62/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxCmp.cpp | 30 Dbtux::cmpSearchKey(const Frag& frag, unsigned& start, ConstData searchKey, ConstData entryData, un… in cmpSearchKey() argument 37 searchKey += AttributeHeaderSize + ah(searchKey).getDataSize(); in cmpSearchKey() 49 if (! ah(searchKey).isNULL()) { in cmpSearchKey() 54 ndbrequire(ah(searchKey).getAttributeId() == descAttr.m_primaryAttrId); in cmpSearchKey() 57 const unsigned size1 = ah(searchKey).getDataSize(); in cmpSearchKey() 62 const Uint32* const p1 = &searchKey[AttributeHeaderSize]; in cmpSearchKey() 84 searchKey += AttributeHeaderSize + ah(searchKey).getDataSize(); in cmpSearchKey()
|
/dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.jdt.core/org.eclipse.jdt.core/search/org/eclipse/jdt/internal/core/nd/field/ |
H A D | FieldSearchIndex.java | 36 FieldSearchKey<?> searchKey; field in FieldSearchIndex 133 IString key = FieldSearchIndex.this.searchKey.get(this.nd, address); in compare() 152 IString key = FieldSearchIndex.this.searchKey.get(this.nd, address); in visit() 172 private FieldSearchIndex(FieldSearchKey<?> searchKey, String structName, int fieldNumber) { in FieldSearchIndex() argument 176 IString key1 = FieldSearchIndex.this.searchKey.get(nd, record1); in FieldSearchIndex() 177 IString key2 = FieldSearchIndex.this.searchKey.get(nd, record2); in FieldSearchIndex() 188 if (searchKey != null) { in FieldSearchIndex() 189 if (searchKey.searchIndex != null && searchKey.searchIndex != this) { in FieldSearchIndex() 194 searchKey.searchIndex = this; in FieldSearchIndex() 196 this.searchKey = searchKey; in FieldSearchIndex() [all …]
|
/dports/astro/kstars/kstars-3.5.6/kstars/htmesh/ |
H A D | SkipList.cpp | 63 void SkipList::insert(const Key searchKey, const Value value) in insert() argument 77 while ((nextElement != NIL) && (nextElement->getKey() < searchKey)) in insert() 89 if ((element != NIL) && (element->getKey() == searchKey)) in insert() 114 element = new SkipListElement(newLevel, searchKey, value); in insert() 127 Key SkipList::findMAX(const Key searchKey) const in findMAX() 138 while ((nextElement != NIL) && (nextElement->getKey() < searchKey)) in findMAX() 163 Key SkipList::findMIN(const Key searchKey) const in findMIN() 173 while ((nextElement != NIL) && (nextElement->getKey() <= searchKey)) in findMIN() 227 void SkipList::free(const Key searchKey) in free() argument 240 while ((nextElement != NIL) && (nextElement->getKey() < searchKey)) in free() [all …]
|
/dports/editors/libreoffice/libreoffice-7.2.6.2/scripting/examples/beanshell/Highlight/ |
H A D | highlighter.bsh | 26 int replaceText(searchKey, color, bold) { 68 // Replaces all instances of searchKey with new Text properties 69 // and gets the number of instances of the searchKey 70 descriptor.setSearchString(searchKey); 71 descriptor.setReplaceString(searchKey); 81 searchKey = ""; 92 searchKey = findTextBox.getText(); 94 if(searchKey.equalsIgnoreCase("")) { 103 num = replaceText(searchKey, red, true); 107 searchKey + " was found " + num + [all …]
|
/dports/editors/libreoffice6/libreoffice-6.4.7.2/scripting/examples/beanshell/Highlight/ |
H A D | highlighter.bsh | 26 int replaceText(searchKey, color, bold) { 68 // Replaces all instances of searchKey with new Text properties 69 // and gets the number of instances of the searchKey 70 descriptor.setSearchString(searchKey); 71 descriptor.setReplaceString(searchKey); 81 searchKey = ""; 92 searchKey = findTextBox.getText(); 94 if(searchKey.equalsIgnoreCase("")) { 103 num = replaceText(searchKey, red, true); 107 searchKey + " was found " + num + [all …]
|
/dports/databases/percona56-server/percona-server-5.6.51-91.0/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxMaint.cpp | 81 KeyData searchKey(indexPtr.p->m_keySpec, false, 0); in execTUX_MAINT_REQ() local 82 searchKey.set_buf(c_ctx.c_searchKey, MaxAttrDataSize << 2); in execTUX_MAINT_REQ() 83 readKeyAttrs(c_ctx, frag, ent, searchKey, indexPtr.p->m_numAttrs); in execTUX_MAINT_REQ() 85 searchKey.get_null_cnt() == indexPtr.p->m_numAttrs) { in execTUX_MAINT_REQ() 107 ok = searchToAdd(c_ctx, frag, searchKey, ent, treePos); in execTUX_MAINT_REQ() 139 frag.m_entryBytes += searchKey.get_data_len(); in execTUX_MAINT_REQ() 144 ok = searchToRemove(c_ctx, frag, searchKey, ent, treePos); in execTUX_MAINT_REQ() 162 frag.m_entryBytes -= searchKey.get_data_len(); in execTUX_MAINT_REQ()
|
/dports/databases/percona56-client/percona-server-5.6.51-91.0/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxMaint.cpp | 81 KeyData searchKey(indexPtr.p->m_keySpec, false, 0); in execTUX_MAINT_REQ() local 82 searchKey.set_buf(c_ctx.c_searchKey, MaxAttrDataSize << 2); in execTUX_MAINT_REQ() 83 readKeyAttrs(c_ctx, frag, ent, searchKey, indexPtr.p->m_numAttrs); in execTUX_MAINT_REQ() 85 searchKey.get_null_cnt() == indexPtr.p->m_numAttrs) { in execTUX_MAINT_REQ() 107 ok = searchToAdd(c_ctx, frag, searchKey, ent, treePos); in execTUX_MAINT_REQ() 139 frag.m_entryBytes += searchKey.get_data_len(); in execTUX_MAINT_REQ() 144 ok = searchToRemove(c_ctx, frag, searchKey, ent, treePos); in execTUX_MAINT_REQ() 162 frag.m_entryBytes -= searchKey.get_data_len(); in execTUX_MAINT_REQ()
|
/dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxMaint.cpp | 81 KeyData searchKey(indexPtr.p->m_keySpec, false, 0); in execTUX_MAINT_REQ() local 82 searchKey.set_buf(c_ctx.c_searchKey, MaxAttrDataSize << 2); in execTUX_MAINT_REQ() 83 readKeyAttrs(c_ctx, frag, ent, searchKey, indexPtr.p->m_numAttrs); in execTUX_MAINT_REQ() 85 searchKey.get_null_cnt() == indexPtr.p->m_numAttrs) { in execTUX_MAINT_REQ() 107 ok = searchToAdd(c_ctx, frag, searchKey, ent, treePos); in execTUX_MAINT_REQ() 139 frag.m_entryBytes += searchKey.get_data_len(); in execTUX_MAINT_REQ() 144 ok = searchToRemove(c_ctx, frag, searchKey, ent, treePos); in execTUX_MAINT_REQ() 162 frag.m_entryBytes -= searchKey.get_data_len(); in execTUX_MAINT_REQ()
|
/dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxMaint.cpp | 83 KeyData searchKey(indexPtr.p->m_keySpec, false, 0); in execTUX_MAINT_REQ() local 84 searchKey.set_buf(c_ctx.c_searchKey, MaxAttrDataSize << 2); in execTUX_MAINT_REQ() 85 readKeyAttrs(c_ctx, frag, ent, searchKey, indexPtr.p->m_numAttrs); in execTUX_MAINT_REQ() 87 searchKey.get_null_cnt() == indexPtr.p->m_numAttrs) { in execTUX_MAINT_REQ() 110 ok = searchToAdd(c_ctx, frag, searchKey, ent, treePos); in execTUX_MAINT_REQ() 142 frag.m_entryBytes += searchKey.get_data_len(); in execTUX_MAINT_REQ() 147 ok = searchToRemove(c_ctx, frag, searchKey, ent, treePos); in execTUX_MAINT_REQ() 165 frag.m_entryBytes -= searchKey.get_data_len(); in execTUX_MAINT_REQ()
|
/dports/databases/mysqlwsrep57-server/mysql-wsrep-wsrep_5.7.35-25.27/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxMaint.cpp | 83 KeyData searchKey(indexPtr.p->m_keySpec, false, 0); in execTUX_MAINT_REQ() local 84 searchKey.set_buf(c_ctx.c_searchKey, MaxAttrDataSize << 2); in execTUX_MAINT_REQ() 85 readKeyAttrs(c_ctx, frag, ent, searchKey, indexPtr.p->m_numAttrs); in execTUX_MAINT_REQ() 87 searchKey.get_null_cnt() == indexPtr.p->m_numAttrs) { in execTUX_MAINT_REQ() 110 ok = searchToAdd(c_ctx, frag, searchKey, ent, treePos); in execTUX_MAINT_REQ() 142 frag.m_entryBytes += searchKey.get_data_len(); in execTUX_MAINT_REQ() 147 ok = searchToRemove(c_ctx, frag, searchKey, ent, treePos); in execTUX_MAINT_REQ() 165 frag.m_entryBytes -= searchKey.get_data_len(); in execTUX_MAINT_REQ()
|
/dports/databases/percona57-client/percona-server-5.7.36-39/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxMaint.cpp | 83 KeyData searchKey(indexPtr.p->m_keySpec, false, 0); in execTUX_MAINT_REQ() local 84 searchKey.set_buf(c_ctx.c_searchKey, MaxAttrDataSize << 2); in execTUX_MAINT_REQ() 85 readKeyAttrs(c_ctx, frag, ent, searchKey, indexPtr.p->m_numAttrs); in execTUX_MAINT_REQ() 87 searchKey.get_null_cnt() == indexPtr.p->m_numAttrs) { in execTUX_MAINT_REQ() 110 ok = searchToAdd(c_ctx, frag, searchKey, ent, treePos); in execTUX_MAINT_REQ() 142 frag.m_entryBytes += searchKey.get_data_len(); in execTUX_MAINT_REQ() 147 ok = searchToRemove(c_ctx, frag, searchKey, ent, treePos); in execTUX_MAINT_REQ() 165 frag.m_entryBytes -= searchKey.get_data_len(); in execTUX_MAINT_REQ()
|
/dports/www/grafana8/grafana-8.3.6/vendor/github.com/hashicorp/go-immutable-radix/ |
H A D | reverse_iter_test.go | 21 radixAddAndScan := func(newKey, searchKey readableString) []string { 29 it.SeekReverseLowerBound([]byte(searchKey)) 41 sliceAddSortAndFilter := func(newKey, searchKey readableString) []string { 50 if k <= string(searchKey) && k != prev { 81 radixAddAndScan := func(newKey, searchKey readableString) []string { 95 it.SeekReverseLowerBound([]byte(searchKey)) 107 sliceAddSortAndFilter := func(newKey, searchKey readableString) []string { 127 if k <= string(searchKey) && k[:len(prefix)] <= string(prefix) && k != prev {
|
/dports/news/husky/husky-1.9.20191207/msged/ |
H A D | mxbt.c | 69 static void mxbtSetKey(MXBT * mxbt, void *searchKey); 70 static void mxbtSetCompare(MXBT * mxbt, int (*compare) (void *testKey, void *searchKey, int len)); 75 …btOneSearch(MXBT * mxbt, char *indexFile, void *searchKey, int (*compare) (void *testKey, void *se… in mxbtOneSearch() argument 87 mxbtSetKey(mxbt, searchKey); in mxbtOneSearch() 144 static void mxbtSetKey(MXBT * mxbt, void *searchKey) in mxbtSetKey() argument 146 mxbt->searchK = searchKey; in mxbtSetKey() 149 static void mxbtSetCompare(MXBT * mxbt, int (*compare) (void *testKey, void *searchKey, int len)) in mxbtSetCompare() argument
|
/dports/news/husky-areafix/husky-areafix-1.9.20191207/msged/ |
H A D | mxbt.c | 69 static void mxbtSetKey(MXBT * mxbt, void *searchKey); 70 static void mxbtSetCompare(MXBT * mxbt, int (*compare) (void *testKey, void *searchKey, int len)); 75 …btOneSearch(MXBT * mxbt, char *indexFile, void *searchKey, int (*compare) (void *testKey, void *se… in mxbtOneSearch() argument 87 mxbtSetKey(mxbt, searchKey); in mxbtOneSearch() 144 static void mxbtSetKey(MXBT * mxbt, void *searchKey) in mxbtSetKey() argument 146 mxbt->searchK = searchKey; in mxbtSetKey() 149 static void mxbtSetCompare(MXBT * mxbt, int (*compare) (void *testKey, void *searchKey, int len)) in mxbtSetCompare() argument
|
/dports/news/husky-fidoconf/husky-fidoconf-1.9.20191207/msged/ |
H A D | mxbt.c | 69 static void mxbtSetKey(MXBT * mxbt, void *searchKey); 70 static void mxbtSetCompare(MXBT * mxbt, int (*compare) (void *testKey, void *searchKey, int len)); 75 …btOneSearch(MXBT * mxbt, char *indexFile, void *searchKey, int (*compare) (void *testKey, void *se… in mxbtOneSearch() argument 87 mxbtSetKey(mxbt, searchKey); in mxbtOneSearch() 144 static void mxbtSetKey(MXBT * mxbt, void *searchKey) in mxbtSetKey() argument 146 mxbt->searchK = searchKey; in mxbtSetKey() 149 static void mxbtSetCompare(MXBT * mxbt, int (*compare) (void *testKey, void *searchKey, int len)) in mxbtSetCompare() argument
|
/dports/databases/percona57-server/percona-server-5.7.36-39/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxMaint.cpp | 83 KeyData searchKey(indexPtr.p->m_keySpec, false, 0); in execTUX_MAINT_REQ() local 84 searchKey.set_buf(c_ctx.c_searchKey, MaxAttrDataSize << 2); in execTUX_MAINT_REQ() 85 readKeyAttrs(c_ctx, frag, ent, searchKey, indexPtr.p->m_numAttrs); in execTUX_MAINT_REQ() 87 searchKey.get_null_cnt() == indexPtr.p->m_numAttrs) { in execTUX_MAINT_REQ() 110 ok = searchToAdd(c_ctx, frag, searchKey, ent, treePos); in execTUX_MAINT_REQ() 142 frag.m_entryBytes += searchKey.get_data_len(); in execTUX_MAINT_REQ() 147 ok = searchToRemove(c_ctx, frag, searchKey, ent, treePos); in execTUX_MAINT_REQ() 165 frag.m_entryBytes -= searchKey.get_data_len(); in execTUX_MAINT_REQ()
|
/dports/databases/xtrabackup/percona-xtrabackup-2.4.21/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxMaint.cpp | 83 KeyData searchKey(indexPtr.p->m_keySpec, false, 0); in execTUX_MAINT_REQ() local 84 searchKey.set_buf(c_ctx.c_searchKey, MaxAttrDataSize << 2); in execTUX_MAINT_REQ() 85 readKeyAttrs(c_ctx, frag, ent, searchKey, indexPtr.p->m_numAttrs); in execTUX_MAINT_REQ() 87 searchKey.get_null_cnt() == indexPtr.p->m_numAttrs) { in execTUX_MAINT_REQ() 110 ok = searchToAdd(c_ctx, frag, searchKey, ent, treePos); in execTUX_MAINT_REQ() 142 frag.m_entryBytes += searchKey.get_data_len(); in execTUX_MAINT_REQ() 147 ok = searchToRemove(c_ctx, frag, searchKey, ent, treePos); in execTUX_MAINT_REQ() 165 frag.m_entryBytes -= searchKey.get_data_len(); in execTUX_MAINT_REQ()
|
/dports/net/py-impacket/impacket-0.9.17/examples/ |
H A D | registry-read.py | 71 def enumValues(reg, searchKey): argument 72 key = reg.findKey(searchKey) 77 print "[%s]\n" % searchKey 83 data = reg.getValue('%s\\%s'%(searchKey,value)) 92 def enumKey(reg, searchKey, isRecursive, indent=' '): argument 93 parentKey = reg.findKey(searchKey) 103 if searchKey == '\\': 106 enumKey(reg, '%s\\%s'%(searchKey,key),isRecursive,indent+' ')
|
/dports/databases/mysqlwsrep56-server/mysql-wsrep-wsrep_5.6.51-25.33/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxMaint.cpp | 81 KeyData searchKey(indexPtr.p->m_keySpec, false, 0); in execTUX_MAINT_REQ() local 82 searchKey.set_buf(c_ctx.c_searchKey, MaxAttrDataSize << 2); in execTUX_MAINT_REQ() 83 readKeyAttrs(c_ctx, frag, ent, searchKey, indexPtr.p->m_numAttrs); in execTUX_MAINT_REQ() 85 searchKey.get_null_cnt() == indexPtr.p->m_numAttrs) { in execTUX_MAINT_REQ() 107 ok = searchToAdd(c_ctx, frag, searchKey, ent, treePos); in execTUX_MAINT_REQ() 139 frag.m_entryBytes += searchKey.get_data_len(); in execTUX_MAINT_REQ() 144 ok = searchToRemove(c_ctx, frag, searchKey, ent, treePos); in execTUX_MAINT_REQ() 162 frag.m_entryBytes -= searchKey.get_data_len(); in execTUX_MAINT_REQ()
|