/haiku/headers/os/package/solver/ |
H A D | SolverProblemSolution.h | 68 typedef BSolverProblemSolutionElement Element; typedef in class:BPackageKit::BSolverProblemSolution 75 const Element* ElementAt(int32 index) const; 77 bool AppendElement(const Element& element); 80 typedef BObjectList<Element> ElementList;
|
/haiku/headers/private/fs_shell/ |
H A D | SinglyLinkedList.h | 20 template<typename Element> 26 Element* next; 30 template<typename Element> 33 typedef SinglyLinkedListLink<Element> SLL_Link; 49 template<typename Element> 52 typedef SinglyLinkedListLink<Element> Link; 55 inline Link* operator()(Element* element) const 60 inline const Link* operator()(const Element* element) const 67 template<typename Element, 68 SinglyLinkedListLink<Element> Elemen [all...] |
H A D | DoublyLinkedList.h | 19 template<typename Element> 25 Element *next; 26 Element *previous; 30 template<typename Element> 33 typedef DoublyLinkedListLink<Element> DLL_Link; 49 template<typename Element> 52 typedef DoublyLinkedListLink<Element> Link; 55 inline Link *operator()(Element *element) const 60 inline const Link *operator()(const Element *element) const 67 template<typename Element, [all...] |
/haiku/headers/private/kernel/util/ |
H A D | Heap.h | 17 template<typename Element, typename Key> 25 template<typename Element, typename Key> 28 typedef HeapLink<Element, Key> Link; 37 template<typename Element, typename Key> 40 typedef HeapLink<Element, Key> Link; 43 inline Link* operator()(Element* element) const; 46 template<typename Element, typename Key, 47 HeapLink<Element, Key> Element::*LinkMember> 50 typedef HeapLink<Element, Ke [all...] |
H A D | MinMaxHeap.h | 17 template<typename Element, typename Key> 26 template<typename Element, typename Key> 29 typedef MinMaxHeapLink<Element, Key> Link; 38 template<typename Element, typename Key> 41 typedef MinMaxHeapLink<Element, Key> Link; 44 inline Link* operator()(Element* element) const; 47 template<typename Element, typename Key, 48 MinMaxHeapLink<Element, Key> Element::*LinkMember> 51 typedef MinMaxHeapLink<Element, Ke [all...] |
H A D | SinglyLinkedList.h | 17 template<typename Element> 23 Element* next; 27 template<typename Element> 30 typedef SinglyLinkedListLink<Element> SLL_Link; 46 template<typename Element> 49 typedef SinglyLinkedListLink<Element> Link; 52 inline Link* operator()(Element* element) const 57 inline const Link* operator()(const Element* element) const 64 template<typename Element, 65 SinglyLinkedListLink<Element> Elemen [all...] |
H A D | DoublyLinkedList.h | 26 template<typename Element> 29 Element* next; 30 Element* previous; 34 template<typename Element> 37 typedef DoublyLinkedListLink<Element> DLL_Link; 50 template<typename Element> 53 typedef DoublyLinkedListLink<Element> Link; 56 inline Link* operator()(Element* element) const 61 inline const Link* operator()(const Element* element) const 68 template<typename Element, [all...] |
H A D | DoublyLinkedQueue.h | 23 #define DOUBLY_LINKED_QUEUE_CLASS_NAME DoublyLinkedQueue<Element, GetLink> 26 template<typename Element, 27 typename GetLink = DoublyLinkedListStandardGetLink<Element> > 30 typedef DoublyLinkedQueue<Element, GetLink> Queue; 31 typedef DoublyLinkedListLink<Element> Link; 53 Element *Next() 61 Element *Remove() 63 Element *element = fCurrent; 87 Element *fCurrent; 88 Element *fNex [all...] |
H A D | Vector.h | 181 inline Value *Element() const function in class:VectorIterator 752 if (iterator.Element()) { 753 int32 index = iterator.Element() - fItems; 771 if (iterator.Element()) { 772 int32 index = iterator.Element() - fItems;
|
/haiku/headers/private/shared/ |
H A D | Array.h | 23 template<typename Element> 27 Array(const Array<Element>& other); 33 inline Element* Elements() const { return fElements; } 35 inline bool Add(const Element& element); 37 inline bool Insert(const Element& element, int32 index); 44 inline Element& ElementAt(int32 index); 45 inline const Element& ElementAt(int32 index) const; 47 inline Element& operator[](int32 index); 48 inline const Element& operator[](int32 index) const; 50 Array<Element> [all...] |
H A D | HashMap.h | 22 typedef HashMapElement<Key, Value> Element; typedef in class:BPrivate::HashMapElement 79 typedef HashMapElement<Key, Value> Element; typedef in class:BPrivate::HashMap::Iterator 127 Element* fElement; 150 typedef HashMapElement<Key, Value> Element; typedef in class:BPrivate::HashMap 378 Element* element = fTable.Lookup(key); 386 element = new(std::nothrow) Element(key, value); 403 Element* element = fTable.Lookup(key); 420 Element* element = it.fElement; 440 Element* element = fTable.Clear(true); 442 Element* nex [all...] |
H A D | HashSet.h | 22 typedef HashSetElement<Key> Element; typedef in class:BPrivate::HashSetElement 67 typedef HashSetElement<Key> Element; typedef in class:BPrivate::HashSet::Iterator 113 Element* fElement; 136 typedef HashSetElement<Key> Element; typedef in class:BPrivate::HashSet 246 Element* element = fTable.Lookup(key); 253 element = new(std::nothrow) Element(key); 270 Element* element = fTable.Lookup(key); 286 Element* element = it.fElement; 304 Element* element = fTable.Clear(true); 306 Element* nex [all...] |
/haiku/src/add-ons/kernel/file_systems/netfs/headers/shared/ |
H A D | SLList.h | 11 template<typename Element> 17 Element *next; 21 template<typename Element> 24 typedef SLListLink<Element> Link; 38 template<typename Element> 41 typedef SLListLink<Element> Link; 44 inline Link *operator()(Element *element) const 49 inline const Link *operator()(const Element *element) const 56 #define SL_LIST_TEMPLATE_LIST template<typename Element, typename GetLink> 57 #define SL_LIST_CLASS_NAME SLList<Element, GetLin [all...] |
H A D | BlockingQueue.h | 15 template<typename Element> 24 const Vector<Element*>** elements = NULL); 26 status_t Push(Element* element); 27 status_t Pop(Element** element, 29 status_t Peek(Element** element); 30 status_t Remove(Element* element); 35 Vector<Element*> fElements; 40 template<typename Element> 41 BlockingQueue<Element>::BlockingQueue(const char* name) 49 template<typename Element> [all...] |
/haiku/src/apps/cortex/Persistence/ |
H A D | ExportContext.cpp | 367 out << "Element stack:\n";
|
/haiku/src/kits/package/solver/ |
H A D | SolverProblemSolution.cpp | 144 const BSolverProblemSolution::Element* 152 BSolverProblemSolution::AppendElement(const Element& element) 154 Element* newElement = new(std::nothrow) Element(element);
|
/haiku/src/system/kernel/ |
H A D | TeamThreadTables.h | 15 template<typename Element> 18 typedef typename Element::id_type id_type; 19 typedef typename Element::iterator_type IteratorEntry; 38 Element* Next() 40 Element* result = fNext; 52 fNext = static_cast<Element*>(entry); 63 Element* fNext; 78 void Insert(Element* element) 85 void Remove(Element* element) 91 Element* Looku [all...] |
/haiku/src/system/kernel/scheduler/ |
H A D | RunQueue.h | 17 template<typename Element> 22 Element* fPrevious; 23 Element* fNext; 26 template<typename Element> 29 inline RunQueueLink<Element>* GetRunQueueLink(); 32 RunQueueLink<Element> fRunQueueLink; 35 template<typename Element> 38 typedef RunQueueLink<Element> Link; 41 inline Link* operator()(Element* element) const; 44 template<typename Element, RunQueueLin [all...] |
/haiku/src/tests/system/kernel/util/ |
H A D | SinglyLinkedListTest.cpp | 52 template <class List, class Element> 54 SinglyLinkedListTest::TestList(List &list, Element *values, int valueCount) 72 Element* element = iterator.Next();
|
H A D | SinglyLinkedListTest.h | 15 template <class List, class Element> 16 void TestList(List &list, Element *values, int valueCount);
|
/haiku/headers/private/userlandfs/shared/ |
H A D | Vector.h | 177 inline Value *Element() const function in class:VectorIterator 748 if (iterator.Element()) { 749 int32 index = iterator.Element() - fItems; 767 if (iterator.Element()) { 768 int32 index = iterator.Element() - fItems;
|
/haiku/src/add-ons/kernel/bus_managers/acpi/acpica/components/dispatcher/ |
H A D | dspkginit.c | 169 ACPI_OPERAND_OBJECT **Element); 550 ACPI_OPERAND_OBJECT *Element = *ElementPtr; local 562 if (Element->Reference.Resolved) 571 /* Element must be a reference object of correct type */ 573 ScopeInfo.Scope.Node = Element->Reference.Node; /* Prefix node */ 575 Status = AcpiNsLookup (&ScopeInfo, (char *) Element->Reference.Aml, 603 (char *) Element->Reference.Aml, NULL, &ExternalPath); 642 Element->Reference.Resolved = TRUE; 643 Element->Reference.Node = ResolvedNode; 644 Type = Element [all...] |
/haiku/src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/ |
H A D | uttrack.c | 434 * 2) Element was found. Returns Allocation parameter. 435 * 3) Element was not found. Returns position where it should be 457 ACPI_DEBUG_MEM_BLOCK *Element; local 460 Element = AcpiGbl_GlobalList->ListHead; 461 if (!Element) 473 while (Element > Allocation) 477 if (!Element->Next) 479 return (Element); 482 Element = Element 521 ACPI_DEBUG_MEM_BLOCK *Element; local 756 ACPI_DEBUG_MEM_BLOCK *Element; local [all...] |
/haiku/src/add-ons/kernel/file_systems/reiserfs/ |
H A D | Iterators.cpp | 55 fElements = new(nothrow) Element[fMaxLength]; 87 const TreePath::Element * 90 Element *element = NULL; 97 const TreePath::Element * 132 \class TreePath::Element 138 TreePath::Element::SetTo(uint64 blockNumber, int32 index) 147 TreePath::Element::GetBlockNumber() const 154 TreePath::Element::GetIndex() const 478 const TreePath::Element *element = fPath->GetTopElement();
|
H A D | Iterators.h | 39 class Element; 49 const Element *ElementAt(int32 index) const; 50 const Element *GetTopElement() const; 58 Element *fElements; 61 // TreePath::Element 62 class TreePath::Element { class in class:TreePath 64 Element() {} function in class:TreePath::Element 65 ~Element() {}
|