/haiku/headers/private/shared/ |
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 | LRUCache.h | 102 Value Remove(const Key& key) function in class:BPrivate::LRUCache 108 fMap.Remove(key); 187 Remove(fOldestNode->fKey);
|
/haiku/headers/private/kernel/util/ |
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 | DoublyLinkedQueue.h | 61 Element *Remove() function in class:DoublyLinkedQueue::Iterator 65 fQueue->Remove(fCurrent); 144 inline void Remove(Element *element); 224 // Remove 227 DOUBLY_LINKED_QUEUE_CLASS_NAME::Remove(Element *element) function in class:DOUBLY_LINKED_QUEUE_CLASS_NAME 325 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...] |
H A D | AVLTree.h | 65 Value* Remove(const Key& key); 66 bool Remove(Value* key); 106 inline void Remove() function in class:AVLTree::Iterator 108 ConstIterator::fTreeIterator.Remove(); 371 AVLTree<Definition>::Remove(const Key& key) function in class:AVLTree 373 AVLTreeNode* node = fTree.Remove(&key); 380 AVLTree<Definition>::Remove(Value* value) function in class:AVLTree 382 return fTree.Remove(_GetAVLTreeNode(value));
|
/haiku/src/system/kernel/vm/ |
H A D | VMPageQueue.h | 36 inline void Remove(vm_page* page); 127 VMPageQueue::Remove(vm_page* page) function in class:VMPageQueue 131 panic("%p->VMPageQueue::Remove(page: %p): page thinks it " 136 fPages.Remove(page); 176 fPages.Remove(page); 224 return Remove(page);
|
H A D | VMArea.cpp | 104 fWiredRanges.Remove(range); 257 VMAreas::Remove(VMArea* area) function in class:VMAreas 260 sTree.Remove(area);
|
/haiku/src/tests/kits/support/bstring/ |
H A D | StringRemoveTest.cpp | 68 // Remove(int32 from, int32 length) 71 string1->Remove(2, 2); 78 string1->Remove(2, 1); 85 string1->Remove(20, 2); 92 string1->Remove(4, 30); 98 string1->Remove(-3, 5); 255 return(new StringRemoveTestCaller("BString::Remove Test",
|
/haiku/src/servers/media/ |
H A D | BufferManager.cpp | 136 fBufferInfoMap.Remove(bufferID); 162 fBufferInfoMap.Remove(iterator); 227 fCloneInfoMap.Remove(area); 251 fSourceInfoMap.Remove(clone); 252 fCloneInfoMap.Remove(source);
|
/haiku/src/add-ons/kernel/file_systems/netfs/client/ |
H A D | VirtualDir.cpp | 239 VirtualDirEntry* entry = fEntries.Remove(name); 251 fEntryList.Remove(entry); 313 fIterators.Remove(iterator);
|
H A D | QueryIterator.cpp | 120 fSubIterators.Remove(subIterator);
|
/haiku/src/kits/shared/ |
H A D | RWLockManager.cpp | 206 lockable->fWaiters.Remove(&waiter); 228 lockable->fWaiters.Remove(waiter); 250 lockable->fWaiters.Remove(waiter);
|
/haiku/src/kits/debugger/debug_managers/ |
H A D | TeamMemoryBlockManager.cpp | 182 fActiveBlocks->Remove(entry); 195 fActiveBlocks->Remove(entry); 204 fDeadBlocks->Remove(block);
|
/haiku/src/add-ons/kernel/file_systems/netfs/headers/shared/ |
H A D | BlockingQueue.h | 30 status_t Remove(Element* element); 137 // Remove 140 BlockingQueue<Element>::Remove(Element* element) function in class:BlockingQueue 149 int32 count = fElements.Remove(element); 155 ERROR("ERROR: BlockingQueue::Remove(): Removed %ld elements!\n",
|
H A D | SLList.h | 100 Element *Remove() function in class:UserlandFSUtil::SLList::Iterator 174 inline void Remove(Element *element); 247 // Remove 250 SL_LIST_CLASS_NAME::Remove(Element *element) function in class:SL_LIST_CLASS_NAME 257 it.Remove();
|
/haiku/src/apps/haikudepot/textview/ |
H A D | TextEditor.cpp | 210 Remove(SelectionStart(), SelectionLength()); 213 Remove(fSelection.Caret() - 1, 1); 219 Remove(SelectionStart(), SelectionLength()); 222 Remove(fSelection.Caret(), 1); 267 TextEditor::Remove(int32 offset, int32 length) function in class:TextEditor 272 status_t ret = fDocument->Remove(offset, length);
|
/haiku/src/preferences/backgrounds/ |
H A D | BackgroundImage.h | 111 void Remove(); 134 void Remove(BackgroundImageInfo*);
|
/haiku/src/tests/kits/shared/ |
H A D | LRUCacheTest.cpp | 99 BString resultOcean = map.Remove(HashString("Ocean")); 100 BString resultLake = map.Remove(HashString("Lake"));
|
/haiku/src/system/boot/loader/ |
H A D | PathBlocklist.cpp | 145 PathBlocklist::Remove(const char* path) function in class:PathBlocklist 149 fPaths.Remove(blockedPath);
|
/haiku/src/add-ons/kernel/network/protocols/l2cap/ |
H A D | L2capEndpointManager.cpp | 60 fBoundEndpoints.Remove(endpoint); 106 fChannelEndpoints.Remove(endpoint);
|
/haiku/src/add-ons/kernel/file_systems/netfs/shared/ |
H A D | Request.cpp | 95 fBuffers.Remove(buffer);
|
/haiku/src/add-ons/print/drivers/postscript/ |
H A D | PPDParser.cpp | 82 result.Remove(0, 1);
|
/haiku/src/system/kernel/arch/x86/paging/32bit/ |
H A D | X86PagingStructures32Bit.cpp | 97 sPagingStructuresList.Remove(this);
|
/haiku/src/tests/add-ons/print/ppd/model/ |
H A D | StatementList.cpp | 35 void StatementList::Remove(Statement* statement) function in class:StatementList
|