/haiku/src/kits/debugger/debug_managers/ |
H A D | TeamMemoryBlockManager.cpp | 59 size_t HashKey(const Key& key) const 61 return key.HashValue(); 69 bool Compare(const Key& key, const MemoryBlockEntry* value) const argument 71 return key == *value;
|
/haiku/src/kits/debugger/model/ |
H A D | ExpressionValues.cpp | 70 size_t HashKey(const Key& key) const 72 return key.HashValue(); 80 bool Compare(const Key& key, const ValueEntry* value) const argument 82 return key == *value;
|
H A D | StackFrameValueInfos.cpp | 85 size_t HashKey(const Key& key) const 87 return key.HashValue(); 95 bool Compare(const Key& key, const InfoEntry* value) const argument 97 return key == *value;
|
/haiku/headers/private/debugger/controllers/ |
H A D | ThreadHandler.h | 149 size_t HashKey(thread_id key) const 151 return (size_t)key; 159 bool Compare(thread_id key, ThreadHandler* value) const argument 161 return value->ThreadID() == key;
|
/haiku/src/add-ons/kernel/file_systems/userlandfs/kernel_add_on/ |
H A D | FileSystem.h | 56 size_t HashKey(const FSVNodeCapabilities& key) const 57 { return key.GetHashCode(); } 60 bool Compare(const FSVNodeCapabilities& key, const VNodeOps* value) const argument 61 { return value->capabilities == key; }
|
/haiku/src/add-ons/kernel/file_systems/packagefs/indices/ |
H A D | NameIndex.h | 33 virtual AbstractIndexIterator* InternalFind(const void* key,
|
/haiku/src/apps/debugger/user_interface/gui/model/ |
H A D | VariablesViewState.cpp | 162 size_t HashKey(const Key& key) const 164 return key.HashValue(); 172 bool Compare(const Key& key, const InfoEntry* value) const argument 174 return key == *value;
|
/haiku/src/kits/debugger/debug_info/ |
H A D | TeamDebugInfo.cpp | 44 size_t HashKey(const FunctionInstance* key) const 47 if (key->SourceFile() == NULL) 48 return (uint32)(addr_t)key; 50 uint32 hash = StringUtils::HashValue(key->Name()); 51 hash = hash * 17 + (uint32)(addr_t)key->SourceFile(); 52 SourceLocation location = key->GetSourceLocation(); 64 bool Compare(const FunctionInstance* key, const Function* value) const argument 67 if (key->SourceFile() != value->SourceFile()) 71 if (key->SourceFile() == NULL) 72 return key 246 Compare(const LocatableFile* key, const SourceFileEntry* value) const argument [all...] |
/haiku/src/add-ons/kernel/file_systems/ramfs/ |
H A D | SizeIndex.h | 28 virtual AbstractIndexEntryIterator *InternalFind(const uint8 *key,
|
H A D | AttributeIndexImpl.h | 28 virtual AbstractIndexEntryIterator *InternalFind(const uint8 *key,
|
H A D | LastModifiedIndex.h | 28 virtual AbstractIndexEntryIterator *InternalFind(const uint8 *key,
|
H A D | NameIndex.h | 30 virtual AbstractIndexEntryIterator *InternalFind(const uint8 *key,
|
/haiku/headers/private/kernel/util/ |
H A D | AVLTreeBase.h | 31 virtual int CompareKeyNode(const void* key, 60 AVLTreeNode* Find(const void* key) const; 61 AVLTreeNode* FindClosest(const void* key, bool less) const; 64 AVLTreeNode* Remove(const void* key);
|
/haiku/src/add-ons/kernel/file_systems/packagefs/package/ |
H A D | Package.h | 174 size_t HashKey(const char* key) const 176 return hash_hash_string(key); 184 bool Compare(const char* key, const Package* value) const argument 186 return strcmp(value->FileName(), key) == 0;
|
/haiku/src/kits/mail/ |
H A D | MailComponent.cpp | 121 BMailComponent::SetHeaderField(const char* key, const char* value, argument 125 headers.RemoveName(key); 127 headers.AddString(key, value); 143 BMailComponent::SetHeaderField(const char* key, BMessage* structure, argument 151 headers.RemoveName(key); 184 SetHeaderField(key, value.String(), (uint32) charset, (mail_encoding) encoding); 189 BMailComponent::HeaderField(const char* key, int32 index) const argument 193 headers.FindString(key, index, &string); 199 BMailComponent::HeaderField(const char* key, BMessage* structure, argument 202 BString string = HeaderField(key, inde 262 RemoveHeader(const char* key) argument 311 const char* key; local 334 concat << key << ": "; local [all...] |
/haiku/src/add-ons/kernel/file_systems/packagefs/util/ |
H A D | TwoKeyAVLTree.h | 200 inline Node* Allocate(const Key& key, const Value& value) const argument 315 Value* FindFirst(const PrimaryKey& key, 317 Value* FindFirstClosest(const PrimaryKey& key, 319 Value* FindLast(const PrimaryKey& key, 337 Node* _FindFirst(const PrimaryKey& key, 472 TWO_KEY_AVL_TREE_CLASS_NAME::FindFirst(const PrimaryKey& key, argument 477 Node* node = _FindFirst(key, NULL); 490 TWO_KEY_AVL_TREE_CLASS_NAME::FindFirstClosest(const PrimaryKey& key, bool less, argument 496 Node* node = _FindFirst(key, &parent); 504 int cmp = fPrimaryKeyCompare(key, 526 FindLast(const PrimaryKey& key, Iterator* iterator) argument 634 _FindFirst(const PrimaryKey& key, Node** _parent) const argument [all...] |
/haiku/src/tests/add-ons/kernel/kernelland_emu/ |
H A D | condition_variable.cpp | 38 size_t HashKey(const void* key) const 39 { return (size_t)key; } 42 bool Compare(const void* key, ConditionVariable* variable) const argument 43 { return key == variable->fObject; }
|
/haiku/src/apps/mail/ |
H A D | Words.cpp | 164 entry.key = GetKey(entryName); 173 entry.key = GetKey(suffixName); 210 int32 key = 0; local 222 key |= int32(c) << offset; 225 key |= int32(31) << offset; 226 // printf(": %ld\n", key); 227 return key; 715 int32 key = (ItemAt(index))->key; local 767 // Does this word match the key [all...] |
H A D | WIndex.h | 50 int32 key; member in struct:WIndexEntry 73 int32 Lookup(int32 key);
|
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/ |
H A D | object_id.c | 127 OBJECT_ID_INDEX_KEY key; member in struct:OBJECT_ID_INDEX 165 memcpy(&indx.key.object_id,object_id,sizeof(GUID)); 226 OBJECT_ID_INDEX_KEY key; local 235 memcpy(&key.object_id,objectid_attr,sizeof(GUID)); 236 if (!ntfs_index_lookup(&key, 274 OBJECT_ID_INDEX_KEY key; local 284 memcpy(&key.object_id, 286 if (!ntfs_index_lookup(&key, 521 OBJECT_ID_INDEX_KEY key; local 531 memcpy(&key [all...] |
/haiku/src/apps/icon-o-matic/ |
H A D | CanvasView.h | 80 virtual bool _HandleKeyDown(uint32 key, uint32 modifiers); 81 virtual bool _HandleKeyUp(uint32 key, uint32 modifiers);
|
/haiku/src/add-ons/input_server/filters/shortcut_catcher/ |
H A D | KeyCommandMap.cpp | 42 hks(int32 key, BitFieldTester* tester, CommandActuator* actuator, argument 45 fKey(key), 133 int32 key; local 136 && keyMessage->FindInt32("key", &key) == B_OK 142 if (key == next->GetKey() && next->DoModifiersMatch(modifiers)) { 258 uint32 key; local 262 if (message.FindInt32("key", (int32*)&key) == B_OK 293 newList->AddItem(new hks(key, teste [all...] |
/haiku/src/apps/cortex/Persistence/ |
H A D | ExportContext.cpp | 177 out << "\n" << indentString() << key;\ 178 _pad_with_spaces(out, key, *this, m_attrColumn) << " = '" << VAL_SPEC << '\'';\ 183 const char* key, 187 const char* key, 191 const char* key, 195 const char* key, 199 const char* key, 203 const char* key, 207 const char* key, 211 const char* key, 182 writeAttr( const char* key, int8 value) argument 186 writeAttr( const char* key, uint8 value) argument 190 writeAttr( const char* key, int16 value) argument 194 writeAttr( const char* key, uint16 value) argument 198 writeAttr( const char* key, int32 value) argument 202 writeAttr( const char* key, uint32 value) argument 206 writeAttr( const char* key, int64 value) argument 210 writeAttr( const char* key, uint64 value) argument 214 writeAttr( const char* key, const char* value) argument 218 writeAttr( const char* key, const BString& value) argument 222 writeAttr( const char* key, float value) argument [all...] |
/haiku/src/tests/kits/locale/ |
H A D | collatorSpeed.cpp | 58 BString key; local 59 collator->GetSortKey(kStrings[i], &key); 125 // test key creation speed
|
/haiku/src/add-ons/print/transports/ipp/ |
H A D | HttpURLConnection.h | 65 string key; member in struct:Field 87 void setRequestProperty(const char *key, const char *value);
|