/haiku/headers/private/kernel/util/ |
H A D | AVLTreeMap.h | 80 status_t Insert(const Key& key, const Value& value, 82 status_t Insert(const Key& key, const Value& value, 371 // Insert 374 _AVL_TREE_MAP_CLASS_NAME::Insert(const Key& key, const Value& value, function in class:_AVL_TREE_MAP_CLASS_NAME 384 status_t error = fTree.Insert(node); 397 // Insert 400 _AVL_TREE_MAP_CLASS_NAME::Insert(const Key& key, const Value& value, function in class:_AVL_TREE_MAP_CLASS_NAME 410 status_t error = fTree.Insert(node);
|
H A D | Heap.h | 88 inline status_t Insert(Element* element, Key key); 249 HEAP_CLASS_NAME::Insert(Element* element, Key key) function in class:HEAP_CLASS_NAME
|
H A D | MinMaxHeap.h | 86 inline status_t Insert(Element* element, Key key); 292 MIN_MAX_HEAP_CLASS_NAME::Insert(Element* element, Key key) function in class:MIN_MAX_HEAP_CLASS_NAME
|
H A D | MultiHashTable.h | 45 void Insert(ValueType *value) function in class:MultiHashTable
|
H A D | SplayTree.h | 60 Insert into the tree. 63 bool Insert(Node* node) function in class:SplayTree 497 bool Insert(Node* node) function in class:IteratableSplayTree 499 if (!fTree.Insert(node))
|
/haiku/headers/private/media/ |
H A D | TList.h | 44 bool Insert(const value &v) function in class:List
|
H A D | TMap.h | 46 bool Insert(const key &k, const value &v) function in class:Map
|
/haiku/headers/private/shared/ |
H A D | Array.h | 37 inline bool Insert(const Element& element, int32 index); 115 Array<Element>::Insert(const Element& element, int32 index) function in class:BPrivate::Array
|
H A D | HashMap.h | 390 status_t error = fTable.Insert(element);
|
H A D | HashSet.h | 257 status_t error = fTable.Insert(element);
|
H A D | RangeArray.h | 140 return fRanges.Insert(RangeType(offset, size), index); 209 if (!fRanges.Insert(newRange, index + 1))
|
/haiku/src/add-ons/input_server/methods/pen/ |
H A D | PenInputLooper.cpp | 151 fOwner->fDebugAlert->TextView()->Insert("Looper:\n"); 152 fOwner->fDebugAlert->TextView()->Insert(sio.String());
|
H A D | PenInputServerMethod.cpp | 65 fDebugAlert->TextView()->Insert(s.String()); 117 fDebugAlert->TextView()->Insert(sio.String()); 178 fDebugAlert->TextView()->Insert(">>>\n"); 197 fDebugAlert->TextView()->Insert("<<<\n");
|
/haiku/src/add-ons/input_server/methods/pen/compat/ |
H A D | StringIO.cpp | 39 fString->Insert(' ', (int32)(pos - fString->Length()), fString->Length()); 41 fString->Insert((const char *)buffer, size, (int32)pos);
|
/haiku/src/add-ons/kernel/file_systems/bfs/ |
H A D | Index.cpp | 276 status = tree->Insert(transaction, (const uint8*)newKey, newLength,
|
/haiku/src/add-ons/kernel/file_systems/netfs/client/ |
H A D | QueryIterator.cpp | 104 fSubIterators.Insert(subIterator); 130 subIterators.Insert(iterator);
|
H A D | QueryManager.cpp | 89 iteratorList->Insert(iterator); 256 iterators.Insert(iterator);
|
H A D | ShareAttrDir.cpp | 186 fAttributes.Insert(attributes[i]); 243 iterators->Insert(_iterators[i]); 271 fAttributes.Insert(newAttr); 275 fAttributes.Insert(newAttr); 348 fAttributes.Insert(attribute);
|
H A D | ShareNode.cpp | 140 fReferringEntries.Insert(entry); 462 fEntries.Insert(entry); 506 fIterators.Insert(iterator);
|
H A D | ShareVolume.cpp | 2735 iteratorList->Insert(iterator);
|
H A D | VirtualDir.cpp | 220 fEntryList.Insert(entry); 303 fIterators.Insert(iterator);
|
H A D | VolumeManager.cpp | 69 fEvents.Insert(event);
|
/haiku/src/add-ons/kernel/file_systems/netfs/headers/shared/ |
H A D | SLList.h | 172 inline void Insert(Element *element, bool back = true); 215 // Insert 218 SL_LIST_CLASS_NAME::Insert(Element *element, bool back) function in class:SL_LIST_CLASS_NAME
|
/haiku/src/add-ons/kernel/file_systems/netfs/server/ |
H A D | AttributeDirectory.cpp | 204 fAttributes.Insert(attribute);
|
H A D | Directory.cpp | 253 fEntries.Insert(entry); 328 fIterators.Insert(iterator);
|