Home
last modified time | relevance | path

Searched defs:element (Results 1 – 25 of 76) sorted by relevance

1234

/haiku/headers/private/kernel/util/
H A DDoublyLinkedQueue.h63 Element *element = fCurrent; in Remove() local
112 Element *element = fNext; in Next() local
179 DOUBLY_LINKED_QUEUE_CLASS_NAME::Insert(Element *element) in Insert()
194 DOUBLY_LINKED_QUEUE_CLASS_NAME::InsertBefore(Element *before, Element *element) in InsertBefore()
219 DOUBLY_LINKED_QUEUE_CLASS_NAME::Add(Element *element) in Add()
227 DOUBLY_LINKED_QUEUE_CLASS_NAME::Remove(Element *element) in Remove()
291 Element *element = fFirst; in MoveFrom() local
309 Element *element = fFirst; in RemoveAll() local
324 Element *element = Head(); in RemoveHead() local
332 DOUBLY_LINKED_QUEUE_CLASS_NAME::GetPrevious(Element *element) const in GetPrevious()
[all …]
H A DDoublyLinkedList.h156 Element* element = fCurrent; in Remove() local
205 Element* element = fNext; in Next() local
257 Element* element = fCurrent; in Remove() local
306 Element* element = fNext; in Next() local
395 DOUBLY_LINKED_LIST_CLASS_NAME::Insert(Element* element, bool back) in Insert()
429 DOUBLY_LINKED_LIST_CLASS_NAME::InsertBefore(Element* before, Element* element) in InsertBefore()
459 DOUBLY_LINKED_LIST_CLASS_NAME::InsertAfter(Element* after, Element* element) in InsertAfter()
489 DOUBLY_LINKED_LIST_CLASS_NAME::Insert(Element* before, Element* element) in Insert()
498 DOUBLY_LINKED_LIST_CLASS_NAME::Add(Element* element, bool back) in Add()
506 DOUBLY_LINKED_LIST_CLASS_NAME::Remove(Element* element) in Remove()
[all …]
H A DSinglyLinkedList.h118 Element* element = fNext; in Next() local
181 SINGLY_LINKED_LIST_CLASS_NAME::Add(Element* element) in Add()
199 SINGLY_LINKED_LIST_CLASS_NAME::Remove(Element* element) in Remove()
226 SINGLY_LINKED_LIST_CLASS_NAME::Remove(Element* previous, Element* element) in Remove()
270 Element* element = fFirst; in RemoveAll() local
284 Element* element = Head(); in RemoveHead() local
292 SINGLY_LINKED_LIST_CLASS_NAME::GetNext(Element* element) const in GetNext()
306 for (Element* element = First(); element; element = GetNext(element)) in Count() local
H A DMinMaxHeap.h221 MIN_MAX_HEAP_CLASS_NAME::GetKey(Element* element) in GetKey()
229 MIN_MAX_HEAP_CLASS_NAME::ModifyKey(Element* element, Key newKey) in ModifyKey()
257 Element* element = PeekMinimum(); in RemoveMinimum() local
278 Element* element = PeekMaximum(); in RemoveMaximum() local
290 MIN_MAX_HEAP_CLASS_NAME::Insert(Element* element, Key key) in Insert()
360 Element* element = tree[link->fIndex]; in _MoveUp() local
403 Element* element = tree[link->fIndex]; in _MoveDown() local
446 Element* element = currentTree[link->fIndex]; in _ChangeTree() local
479 Element* element = tree[lastElement]; in _RemoveLast() local
H A DHeap.h201 HEAP_CLASS_NAME::GetKey(Element* element) in GetKey()
209 HEAP_CLASS_NAME::ModifyKey(Element* element, Key newKey) in ModifyKey()
231 Element* element = PeekRoot(); in RemoveRoot() local
249 HEAP_CLASS_NAME::Insert(Element* element, Key key) in Insert()
302 Element* element = fElements[link->fIndex]; in _MoveUp() local
340 Element* element = fElements[link->fIndex]; in _MoveDown() local
/haiku/headers/private/fs_shell/
H A DDoublyLinkedList.h151 Element *element = fCurrent; in Remove() local
200 Element *element = fNext; in Next() local
252 Element *element = fCurrent; in Remove() local
301 Element *element = fNext; in Next() local
382 DOUBLY_LINKED_LIST_CLASS_NAME::Insert(Element *element, bool back) in Insert()
412 DOUBLY_LINKED_LIST_CLASS_NAME::InsertBefore(Element* before, Element* element) in InsertBefore()
437 DOUBLY_LINKED_LIST_CLASS_NAME::InsertAfter(Element* after, Element* element) in InsertAfter()
462 DOUBLY_LINKED_LIST_CLASS_NAME::Insert(Element* before, Element* element) in Insert()
471 DOUBLY_LINKED_LIST_CLASS_NAME::Add(Element *element, bool back) in Add()
479 DOUBLY_LINKED_LIST_CLASS_NAME::Remove(Element *element) in Remove()
[all …]
H A DSinglyLinkedList.h121 Element* element = fNext; in Next() local
180 SINGLY_LINKED_LIST_CLASS_NAME::Add(Element* element) in Add()
191 SINGLY_LINKED_LIST_CLASS_NAME::Remove(Element* element) in Remove()
217 Element* element = fFirst; in RemoveAll() local
231 Element* element = Head(); in RemoveHead() local
239 SINGLY_LINKED_LIST_CLASS_NAME::GetNext(Element* element) const in GetNext()
253 for (Element* element = First(); element; element = GetNext(element)) in Count() local
/haiku/src/add-ons/kernel/file_systems/netfs/headers/shared/
H A DSLList.h102 Element *element = fCurrent; in Remove() local
146 Element *element = fNext; in Next() local
218 SL_LIST_CLASS_NAME::Insert(Element *element, bool back) in Insert()
226 SL_LIST_CLASS_NAME::InsertAfter(Element *previous, Element *element) in InsertAfter()
250 SL_LIST_CLASS_NAME::Remove(Element *element) in Remove()
286 Element *element = fFirst; in RemoveAll() local
299 SL_LIST_CLASS_NAME::GetNext(Element *element) const in GetNext()
307 SL_LIST_CLASS_NAME::_Remove(Element *previous, Element *element) in _Remove()
327 for (Element* element = GetFirst(); element; element = GetNext(element)) in Size() local
H A DBlockingQueue.h88 BlockingQueue<Element>::Push(Element* element) in Push()
105 BlockingQueue<Element>::Pop(Element** element, bigtime_t timeout) in Pop()
125 BlockingQueue<Element>::Peek(Element** element) in Peek()
140 BlockingQueue<Element>::Remove(Element* element) in Remove()
H A DRequestMemberArray.h66 Member* element = new(fElements + i) Member; in Unflatten() local
74 status_t Append(const Member& element) in Append()
/haiku/src/add-ons/kernel/file_systems/ext2/
H A DHashRevokeManager.cpp36 RevokeElement *element = fHash->Clear(true); in ~HashRevokeManager() local
65 RevokeElement* element = fHash->Lookup(block); in Insert() local
90 RevokeElement* element = fHash->Lookup(block); in Remove() local
106 RevokeElement* element = fHash->Lookup(block); in Lookup() local
146 RevokeElement* element = new(std::nothrow) RevokeElement; in _ForceInsert() local
/haiku/src/kits/interface/layouter/
H A DOneElementLayouter.cpp20 virtual float ElementLocation(int32 element) in ElementLocation()
25 virtual float ElementSize(int32 element) in ElementSize()
47 OneElementLayouter::AddConstraints(int32 element, int32 length, in AddConstraints()
60 OneElementLayouter::SetWeight(int32 element, float weight) in SetWeight()
H A DCollapsingLayouter.cpp40 SetElementPosition(int32 element, int32 position) in SetElementPosition()
46 ElementLocation(int32 element) in ElementLocation()
54 ElementSize(int32 element) in ElementSize()
62 ElementRangeSize(int32 element, int32 length) in ElementRangeSize()
134 CollapsingLayouter::AddConstraints(int32 element, int32 length, float min, in AddConstraints()
173 CollapsingLayouter::SetWeight(int32 element, float weight) in SetWeight()
287 ElementInfo& element = fElements[i]; in _DoCollapse() local
306 ElementInfo& element = fElements[i]; in _AddConstraints() local
/haiku/headers/private/shared/
H A DHashSet.h246 Element* element = fTable.Lookup(key); in Add() local
259 delete element; in Add() local
270 Element* element = fTable.Lookup(key); in Remove() local
275 delete element; in Remove() local
286 Element* element = it.fElement; in Remove() local
291 delete element; in Remove() local
304 Element* element = fTable.Clear(true); in Clear() local
307 delete element; in Clear() local
H A DHashMap.h378 Element* element = fTable.Lookup(key); in Put() local
392 delete element; in Put() local
403 Element* element = fTable.Lookup(key); in Remove() local
409 delete element; in Remove() local
420 Element* element = it.fElement; in Remove() local
427 delete element; in Remove() local
440 Element* element = fTable.Clear(true); in Clear() local
443 delete element; in Clear() local
454 if (Element* element = fTable.Lookup(key)) in Get() local
465 if (Element* element = fTable.Lookup(key)) { in Get() local
/haiku/src/apps/installer/
H A DBlockingQueue.h91 BlockingQueue<Element>::Push(Element* element) in Push()
110 BlockingQueue<Element>::Pop(Element** element, bigtime_t timeout) in Pop()
130 BlockingQueue<Element>::Peek(Element** element) in Peek()
145 BlockingQueue<Element>::Remove(Element* element) in Remove()
/haiku/headers/private/package/hpkg/
H A DStacker.h19 Stacker(Type*& location, Type* element) in Stacker()
27 Stacker(Type** location, Type* element) in Stacker()
/haiku/src/system/libroot/posix/musl/search/
H A Dinsque.c8 void insque(void *element, void *pred) in insque()
24 void remque(void *element) in remque()
/haiku/src/tools/fs_shell/
H A Dhash.cpp51 next_element(hash_table *table, void *element) in next_element()
111 hash_insert(struct hash_table *table, void *element) in hash_insert()
133 void *element, *lastElement = NULL; in hash_remove() local
157 void *element; in hash_remove_current() local
193 void *element = table->table[index]; in hash_remove_first() local
212 void *element; in hash_find() local
227 void *element; in hash_lookup() local
/haiku/src/system/kernel/scheduler/
H A DRunQueue.h267 Element* element = fHeads[priority]; in PeekMaximum() local
279 RUN_QUEUE_CLASS_NAME::PushFront(Element* element, in PushFront()
308 RUN_QUEUE_CLASS_NAME::PushBack(Element* element, in PushBack()
337 RUN_QUEUE_CLASS_NAME::Remove(Element* element) in Remove()
/haiku/src/add-ons/translators/rtf/
H A DRTF.cpp104 dump(Element &element, int32 level = 0) in dump()
174 Element *element = NULL; in Parse() local
286 Element *element; in ~Group() local
307 Group::AddElement(Element *element) in AddElement()
341 Element *element; in FindDefinitionStart() local
362 Element *element = FindDefinitionStart(index, &startIndex); in FindDefinition() local
383 Element *element; in FindGroup() local
759 Element *element; in Next() local
797 Worker::Dispatch(Element *element) in Dispatch()
/haiku/src/add-ons/kernel/bus_managers/usb/
H A DStack.cpp352 usb_driver_info *element = fDriverList; in NotifyDeviceChange() local
422 usb_driver_info *element = fDriverList; in RegisterDriver() local
463 usb_driver_info *element = fDriverList; in RegisterDriver() local
481 usb_driver_info *element = fDriverList; in InstallNotify() local
516 usb_driver_info *element = fDriverList; in UninstallNotify() local
/haiku/src/libs/zydis/Zycore/
H A DVector.c422 ZyanStatus ZyanVectorPushBack(ZyanVector* vector, const void* element) in ZyanVectorPushBack()
446 ZyanStatus ZyanVectorInsert(ZyanVector* vector, ZyanUSize index, const void* element) in ZyanVectorInsert()
484 ZyanStatus ZyanVectorEmplace(ZyanVector* vector, void** element, ZyanMemberFunction constructor) in ZyanVectorEmplace()
494 ZyanStatus ZyanVectorEmplaceEx(ZyanVector* vector, ZyanUSize index, void** element, in ZyanVectorEmplaceEx()
642 ZyanStatus ZyanVectorFind(const ZyanVector* vector, const void* element, ZyanISize* found_index, in ZyanVectorFind()
653 ZyanStatus ZyanVectorFindEx(const ZyanVector* vector, const void* element, ZyanISize* found_index, in ZyanVectorFindEx()
687 ZyanStatus ZyanVectorBinarySearch(const ZyanVector* vector, const void* element, in ZyanVectorBinarySearch()
698 ZyanStatus ZyanVectorBinarySearchEx(const ZyanVector* vector, const void* element, in ZyanVectorBinarySearchEx()
/haiku/headers/private/kernel/
H A Dsmp.h133 int32* element = (int32*)&fBitmap[cpu / kArrayBits]; in SetBit() local
141 int32* element = (int32*)&fBitmap[cpu / kArrayBits]; in ClearBit() local
149 int32* element = (int32*)&fBitmap[cpu / kArrayBits]; in SetBitAtomic() local
157 int32* element = (int32*)&fBitmap[cpu / kArrayBits]; in ClearBitAtomic() local
165 int32* element = (int32*)&fBitmap[cpu / kArrayBits]; in GetBit() local
/haiku/src/servers/app/drawing/
H A DAlphaMaskCache.cpp95 ShapeMaskElement element(mask->fShape, mask, mask->fPreviousMask.Get(), in Put() local
117 ShapeMaskElement element(&shape, NULL, previousMask, inverse); in Get() local

1234