| /haiku/headers/os/storage/ |
| H A D | Entry.h | 73 status_t Remove();
|
| /haiku/headers/os/support/ |
| H A D | StringList.h | 27 bool Remove(const BString& string,
29 bool Remove(const BStringList& list,
31 BString Remove(int32 index);
32 bool Remove(int32 index, int32 count);
|
| /haiku/headers/private/fs_shell/ |
| H A D | SinglyLinkedList.h | 151 inline void Remove(Element* element);
188 // Remove
191 SINGLY_LINKED_LIST_CLASS_NAME::Remove(Element* element) function in class:FSShell::SINGLY_LINKED_LIST_CLASS_NAME
232 Remove(element);
|
| /haiku/headers/private/kernel/ |
| H A D | UserTimer.h | 205 { fTimers.Remove(timer); }
|
| /haiku/headers/private/kernel/util/ |
| H A D | AVLTreeMap.h | 84 status_t Remove(const Key& key);
85 status_t Remove(Node* node);
130 inline void Remove() function in class:AVLTreeMap::Iterator
132 if (AVLTreeNode* node = ConstIterator::fTreeIterator.Remove()) {
423 // Remove
426 _AVL_TREE_MAP_CLASS_NAME::Remove(const Key& key) function in class:_AVL_TREE_MAP_CLASS_NAME
428 AVLTreeNode* node = fTree.Remove(&key);
437 // Remove
440 _AVL_TREE_MAP_CLASS_NAME::Remove(Node* node) function in class:_AVL_TREE_MAP_CLASS_NAME
442 if (!fTree.Remove(nod
[all...] |
| H A D | MultiHashTable.h | 60 bool Remove(ValueType *value) function in class:MultiHashTable
|
| H A D | SinglyLinkedList.h | 148 inline bool Remove(Element* element);
149 inline void Remove(Element* previous, Element* element);
199 SINGLY_LINKED_LIST_CLASS_NAME::Remove(Element* element) function in class:SINGLY_LINKED_LIST_CLASS_NAME
226 SINGLY_LINKED_LIST_CLASS_NAME::Remove(Element* previous, Element* element) function in class:SINGLY_LINKED_LIST_CLASS_NAME
285 Remove(element);
|
| H A D | SplayTree.h | 97 Node* Remove(const Key& key) function in class:SplayTree
123 Remove from the tree.
126 bool Remove(Node* node) function in class:SplayTree
277 in the Remove() method.
405 Node* Remove() function in class:IteratableSplayTree::Iterator
409 fTree->Remove(fCurrent);
514 Node* Remove(const Key& key) function in class:IteratableSplayTree
516 Node* node = fTree.Remove(key);
531 bool Remove(Node* node) function in class:IteratableSplayTree
533 if (!fTree.Remove(nod
[all...] |
| /haiku/headers/private/media/ |
| H A D | TList.h | 65 bool Remove(int32 index) function in class:List
118 return Remove(item_iter);
|
| H A D | TMap.h | 71 bool Remove(const key &k) { function in class:Map
|
| /haiku/headers/private/shared/ |
| H A D | Array.h | 39 inline bool Remove(int32 index, int32 count = 1);
148 Array<Element>::Remove(int32 index, int32 count) function in class:BPrivate::Array
153 snprintf(buffer, sizeof(buffer), "Array::Remove(): index: %" B_PRId32
|
| H A D | HashMap.h | 136 Value Remove(const Key& key);
137 Value Remove(Iterator& it);
181 Value Remove(const Key& key) function in class:BPrivate::SynchronizedHashMap
186 return fMap.Remove(key);
189 Value Remove(Iterator& it) function in class:BPrivate::SynchronizedHashMap
194 return fMap.Remove(it);
398 // Remove
401 HashMap<Key, Value>::Remove(const Key& key) function in class:BPrivate::HashMap
407 fTable.Remove(element);
415 // Remove
418 HashMap<Key, Value>::Remove(Iterator& it) function in class:BPrivate::HashMap
[all...] |
| H A D | HashSet.h | 125 bool Remove(const Key& key);
126 bool Remove(Iterator& it);
166 bool Remove(const Key& key) function in class:BPrivate::SynchronizedHashSet
171 return fSet.Remove(key);
265 // Remove
268 HashSet<Key>::Remove(const Key& key) function in class:BPrivate::HashSet
274 fTable.Remove(element);
281 // Remove
284 HashSet<Key>::Remove(Iterator& it) function in class:BPrivate::HashSet
|
| H A D | RangeArray.h | 237 return fRanges.Remove(index, count);
|
| /haiku/src/add-ons/input_server/methods/pen/compat/ |
| H A D | StringIO.cpp | 40 fString->Remove((int32)pos, size);
|
| /haiku/src/add-ons/kernel/bluetooth/hci/ |
| H A D | bluetooth.cpp | 290 sDeviceList.Remove(device);
|
| /haiku/src/add-ons/kernel/file_systems/bfs/ |
| H A D | Index.cpp | 264 status = tree->Remove(transaction, (const uint8*)oldKey, oldLength,
|
| /haiku/src/add-ons/kernel/file_systems/ext2/ |
| H A D | Transaction.cpp | 179 fListeners.Remove(listener);
|
| /haiku/src/add-ons/kernel/file_systems/netfs/client/ |
| H A D | QueryIterator.cpp | 120 fSubIterators.Remove(subIterator);
|
| H A D | QueryManager.cpp | 195 iteratorList->Remove(iterator);
199 fIterators->Remove(nodeID);
215 subIterators.Remove(subIterator);
255 iteratorList->Remove(iterator);
265 fIterators->Remove(nodeID);
273 iterators.Remove(iterator);
280 subIterators.Remove(subIterator);
|
| H A D | ServerConnection.cpp | 171 fVolumes->Remove(volume->GetID());
|
| H A D | ServerManager.cpp | 388 fServerInfos->Remove(serverInfo->GetAddress());
522 fServerInfos->Remove(serverInfo->GetAddress());
578 fServerInfos->Remove(oldInfo->GetAddress());
|
| H A D | ShareAttrDir.cpp | 234 iterators->Remove(iterator);
250 fAttributes.Remove(attribute);
364 it.Remove();
380 fAttributes.Remove(attribute);
|
| H A D | ShareNode.cpp | 148 fReferringEntries.Remove(entry);
478 fEntries.Remove(entry);
516 fIterators.Remove(iterator);
|
| H A D | ShareVolume.cpp | 184 fNodes->Remove(fRootNode->GetID());
370 // Remove all nodes that are not known to the VFS right away.
383 fNodes->Remove(node->GetID());
533 fNodes->Remove(node->GetID());
2368 fLocalNodeIDs->Remove(remoteID);
2409 fRemoteNodeIDs->Remove(localID);
2410 fLocalNodeIDs->Remove(remoteID);
2549 // should refer to. Remove the old entry and create a new one.
2625 fEntries->Remove(EntryKey(entry->GetDirectory()->GetID(),
2760 iteratorList->Remove(iterato
[all...] |