/haiku/src/apps/cortex/Persistence/ |
H A D | XMLElementMapping.h | 36 // "make an object for this XML element." 56 const BString element; member in class:XMLElementMapping 62 element(_element) {} 75 const char* element) : 76 XMLElementMapping(element) {} 83 // compare pointers to Mappings by element name 87 return a->element < b->element; 74 Mapping( const char* element) argument
|
H A D | ImportContext.cpp | 56 // fetch the current element (tag) 58 const char* ImportContext::element() const { function in class:ImportContext 95 (uint32)XML_GetCurrentColumnNumber(p) << ", element '" << 96 (element() ? element() : "(none)") << "')\n"; 114 (uint32)XML_GetCurrentColumnNumber(p) << ", element '" << 115 (element() ? element() : "(none)") << "')\n";
|
/haiku/headers/private/kernel/util/ |
H A D | DoublyLinkedList.h | 56 inline Link* operator()(Element* element) const 58 return element->GetDoublyLinkedListLink(); 61 inline const Link* operator()(const Element* element) const 63 return element->GetDoublyLinkedListLink(); 75 inline Link* operator()(Element* element) const 77 return &(element->*LinkMember); 80 inline const Link* operator()(const Element* element) const 82 return &(element->*LinkMember); 93 inline Link* operator()(Element* element) const 95 return (Link*)&element 156 Element* element = fCurrent; local 205 Element* element = fNext; local 257 Element* element = fCurrent; local 306 Element* element = fNext; local 395 Insert(Element* element, bool back) argument 429 InsertBefore(Element* before, Element* element) argument 459 InsertAfter(Element* after, Element* element) argument 489 Insert(Element* before, Element* element) argument 498 Add(Element* element, bool back) argument 506 Remove(Element* element) argument 588 Element* element = Head(); local 598 Element* element = Tail(); local 606 GetPrevious(Element* element) argument 617 GetNext(Element* element) argument 660 Element* element = tail; local [all...] |
H A D | DoublyLinkedQueue.h | 63 Element *element = fCurrent; local 68 return element; 112 Element *element = fNext; local 115 return element; 141 inline void Insert(Element *element); 142 inline void InsertBefore(Element *before, Element *element); 143 inline void Add(Element *element); 144 inline void Remove(Element *element); 158 inline Element *GetPrevious(Element *element) const; 159 inline Element *GetNext(Element *element) cons 179 Insert(Element *element) argument 194 InsertBefore(Element *before, Element *element) argument 219 Add(Element *element) argument 227 Remove(Element *element) argument 291 Element *element = fFirst; local 309 Element *element = fFirst; local 324 Element *element = Head(); local [all...] |
H A D | SinglyLinkedList.h | 52 inline Link* operator()(Element* element) const 54 return element->GetSinglyLinkedListLink(); 57 inline const Link* operator()(const Element* element) const 59 return element->GetSinglyLinkedListLink(); 71 inline Link* operator()(Element* element) const 73 return &(element->*LinkMember); 76 inline const Link* operator()(const Element* element) const 78 return &(element->*LinkMember); 118 Element* element = fNext; local 121 return element; 181 Add(Element* element) argument 199 Remove(Element* element) argument 226 Remove(Element* previous, Element* element) argument 270 Element* element = fFirst; local 284 Element* element = Head(); local [all...] |
H A D | MinMaxHeap.h | 44 inline Link* operator()(Element* element) const; 54 inline Link* operator()(Element* element) const; 79 static const Key& GetKey(Element* element); 81 inline void ModifyKey(Element* element, Key newKey); 86 inline status_t Insert(Element* element, Key key); 135 MinMaxHeapStandardGetLink<Element, Key>::operator()(Element* element) const 137 return element->GetMinMaxHeapLink(); 145 Element* element) const 147 return &(element->*LinkMember); 223 MIN_MAX_HEAP_CLASS_NAME::GetKey(Element* element) argument 231 ModifyKey(Element* element, Key newKey) argument 259 Element* element = PeekMinimum(); local 280 Element* element = PeekMaximum(); local 292 Insert(Element* element, Key key) argument [all...] |
H A D | Heap.h | 43 inline Link* operator()(Element* element) const; 53 inline Link* operator()(Element* element) const; 83 static const Key& GetKey(Element* element); 85 inline void ModifyKey(Element* element, Key newKey); 88 inline status_t Insert(Element* element, Key key); 130 HeapStandardGetLink<Element, Key>::operator()(Element* element) const 132 return element->GetHeapLink(); 139 HeapMemberGetLink<Element, Key, LinkMember>::operator()(Element* element) const 141 return &(element->*LinkMember); 201 HEAP_CLASS_NAME::GetKey(Element* element) argument 209 ModifyKey(Element* element, Key newKey) argument 231 Element* element = PeekRoot(); local 249 Insert(Element* element, Key key) argument 302 Element* element = fElements[link->fIndex]; local 340 Element* element = fElements[link->fIndex]; local [all...] |
/haiku/src/add-ons/kernel/file_systems/ext2/ |
H A D | HashRevokeManager.cpp | 36 RevokeElement *element = fHash->Clear(true); local 38 while (element != NULL) { 39 RevokeElement* next = element->next; 40 delete element; 41 element = next; 65 RevokeElement* element = fHash->Lookup(block); local 67 if (element != NULL) { 68 TRACE("HashRevokeManager::Insert(): Already has an element\n"); 69 if (element->commitID < commitID) { 70 TRACE("HashRevokeManager::Insert(): Deleting previous element\ 90 RevokeElement* element = fHash->Lookup(block); local 106 RevokeElement* element = fHash->Lookup(block); local 146 RevokeElement* element = new(std::nothrow) RevokeElement; local [all...] |
/haiku/src/tools/fs_shell/ |
H A D | hash.cpp | 51 next_element(hash_table *table, void *element) argument 54 return (void *)(*(unsigned long *)NEXT_ADDR(table, element)); 111 hash_insert(struct hash_table *table, void *element) argument 115 ASSERT(table != NULL && element != NULL); 116 TRACE(("hash_insert: table 0x%x, element 0x%x\n", table, element)); 118 hash = table->hash_func(element, NULL, table->table_size); 119 PUT_IN_NEXT(table, element, table->table[hash]); 120 table->table[hash] = (struct hash_element *)element; 133 void *element, *lastElemen local 157 void *element; local 193 void *element = table->table[index]; local 212 void *element; local 227 void *element; local [all...] |
/haiku/headers/private/fs_shell/ |
H A D | DoublyLinkedList.h | 55 inline Link *operator()(Element *element) const 57 return element->GetDoublyLinkedListLink(); 60 inline const Link *operator()(const Element *element) const 62 return element->GetDoublyLinkedListLink(); 74 inline Link *operator()(Element *element) const 76 return &(element->*LinkMember); 79 inline const Link *operator()(const Element *element) const 81 return &(element->*LinkMember); 92 inline Link *operator()(Element *element) const 94 return (Link *)&element 151 Element *element = fCurrent; local 200 Element *element = fNext; local 252 Element *element = fCurrent; local 301 Element *element = fNext; local 382 Insert(Element *element, bool back) argument 412 InsertBefore(Element* before, Element* element) argument 437 InsertAfter(Element* after, Element* element) argument 462 Insert(Element* before, Element* element) argument 471 Add(Element *element, bool back) argument 479 Remove(Element *element) argument 543 Element *element = fFirst; local 559 Element *element = Head(); local [all...] |
H A D | SinglyLinkedList.h | 55 inline Link* operator()(Element* element) const 57 return element->GetSinglyLinkedListLink(); 60 inline const Link* operator()(const Element* element) const 62 return element->GetSinglyLinkedListLink(); 74 inline Link* operator()(Element* element) const 76 return &(element->*LinkMember); 79 inline const Link* operator()(const Element* element) const 81 return &(element->*LinkMember); 121 Element* element = fNext; local 124 return element; 180 Add(Element* element) argument 191 Remove(Element* element) argument 217 Element* element = fFirst; local 231 Element* element = Head(); local [all...] |
/haiku/src/add-ons/kernel/file_systems/netfs/headers/shared/ |
H A D | SLList.h | 44 inline Link *operator()(Element *element) const 46 return element->GetSLListLink(); 49 inline const Link *operator()(const Element *element) const 51 return element->GetSLListLink(); 102 Element *element = fCurrent; local 107 return element; 146 Element *element = fNext; local 149 return element; 172 inline void Insert(Element *element, bool back = true); 173 inline void InsertAfter(Element *previous, Element *element); 218 Insert(Element *element, bool back) argument 226 InsertAfter(Element *previous, Element *element) argument 250 Remove(Element *element) argument 286 Element *element = fFirst; local 307 _Remove(Element *previous, Element *element) argument [all...] |
H A D | BlockingQueue.h | 26 status_t Push(Element* element); 27 status_t Pop(Element** element, 29 status_t Peek(Element** element); 30 status_t Remove(Element* element); 88 BlockingQueue<Element>::Push(Element* element) argument 93 status_t error = fElements.PushBack(element); 105 BlockingQueue<Element>::Pop(Element** element, bigtime_t timeout) argument 117 *element = fElements.ElementAt(0); 125 BlockingQueue<Element>::Peek(Element** element) argument 133 *element 140 Remove(Element* element) argument [all...] |
/haiku/headers/private/package/hpkg/ |
H A D | Stacker.h | 19 Stacker(Type*& location, Type* element) argument 24 *fLocation = element; 27 Stacker(Type** location, Type* element) argument 32 *fLocation = element;
|
/haiku/src/kits/interface/layouter/ |
H A D | CollapsingLayouter.cpp | 40 SetElementPosition(int32 element, int32 position) argument 42 fElements[element] = position; 46 ElementLocation(int32 element) argument 48 if (element < 0 || element >= fElementCount || fElements[element] < 0) 50 return fTarget->ElementLocation(fElements[element]); 54 ElementSize(int32 element) argument 56 if (element < 0 || element > 62 ElementRangeSize(int32 element, int32 length) argument 134 AddConstraints(int32 element, int32 length, float min, float max, float preferred) argument 173 SetWeight(int32 element, float weight) argument 287 ElementInfo& element = fElements[i]; local 306 ElementInfo& element = fElements[i]; local [all...] |
H A D | Layouter.h | 18 virtual float ElementLocation(int32 element) = 0; 19 virtual float ElementSize(int32 element) = 0; 30 virtual void AddConstraints(int32 element, int32 length, 32 virtual void SetWeight(int32 element, float weight) = 0;
|
H A D | OneElementLayouter.h | 18 virtual void AddConstraints(int32 element, int32 length, 20 virtual void SetWeight(int32 element, float weight);
|
H A D | OneElementLayouter.cpp | 20 virtual float ElementLocation(int32 element) argument 25 virtual float ElementSize(int32 element) argument 47 OneElementLayouter::AddConstraints(int32 element, int32 length, argument 60 OneElementLayouter::SetWeight(int32 element, float weight) argument
|
/haiku/src/system/libroot/posix/musl/search/ |
H A D | insque.c | 8 void insque(void *element, void *pred) argument 10 struct node *e = element; 24 void remque(void *element) argument 26 struct node *e = element;
|
/haiku/src/system/kernel/ |
H A D | TeamThreadTables.h | 78 void Insert(Element* element) argument 80 element->serial_number = fNextSerialNumber++; 81 fTable.InsertUnchecked(element); 82 fList.Add(element); 85 void Remove(Element* element) argument 87 fTable.RemoveUnchecked(element); 88 fList.Remove(element); 93 Element* element = fTable.Lookup(id); local 94 return element != NULL && (!visibleOnly || element 137 Element* element = static_cast<Element*>(nextEntry); local [all...] |
/haiku/src/add-ons/kernel/bus_managers/usb/ |
H A D | Stack.cpp | 337 usb_driver_info *element = fDriverList; local 338 while (element) { 339 status_t result = device->ReportDevice(element->support_descriptors, 340 element->support_descriptor_count, &element->notify_hooks, 341 &element->cookies, added, false); 344 const char *driverName = element->driver_name; 345 if (element->republish_driver_name) 346 driverName = element->republish_driver_name; 370 element 448 usb_driver_info *element = fDriverList; local 466 usb_driver_info *element = fDriverList; local 501 usb_driver_info *element = fDriverList; local [all...] |
/haiku/src/system/kernel/scheduler/ |
H A D | RunQueue.h | 41 inline Link* operator()(Element* element) const; 50 inline Link* operator()(Element* element) const; 90 inline void PushFront(Element* element, unsigned int priority); 93 inline void Remove(Element* element); 138 RunQueueStandardGetLink<Element>::operator()(Element* element) const 140 return element->GetRunQueueLink(); 146 RunQueueMemberGetLink<Element, LinkMember>::operator()(Element* element) const 148 return &(element->*LinkMember); 267 Element* element = fHeads[priority]; local 269 ASSERT(sGetLink(element) 279 PushFront(Element* element, unsigned int priority) argument 308 PushBack(Element* element, unsigned int priority) argument 337 Remove(Element* element) argument [all...] |
/haiku/headers/private/shared/ |
H A D | HashSet.h | 246 Element* element = fTable.Lookup(key); local 247 if (element) { 252 // does not contain the key yet: create an element and add it 253 element = new(std::nothrow) Element(key); 254 if (!element) 257 status_t error = fTable.Insert(element); 259 delete element; 270 Element* element = fTable.Lookup(key); local 271 if (element == NULL) 274 fTable.Remove(element); 286 Element* element = it.fElement; local 304 Element* element = fTable.Clear(true); local [all...] |
/haiku/src/apps/installer/ |
H A D | BlockingQueue.h | 29 status_t Push(Element* element); 30 status_t Pop(Element** element, 32 status_t Peek(Element** element); 33 status_t Remove(Element* element); 91 BlockingQueue<Element>::Push(Element* element) argument 97 fElements.push_back(element); 110 BlockingQueue<Element>::Pop(Element** element, bigtime_t timeout) argument 122 *element = fElements[0]; 130 BlockingQueue<Element>::Peek(Element** element) argument 138 *element 145 Remove(Element* element) argument [all...] |
/haiku/src/add-ons/translators/rtf/ |
H A D | RTF.cpp | 104 dump(Element &element, int32 level = 0) argument 106 printf("%03" B_PRId32 " (%p):", level, &element); 110 if (RTF::Header *header = dynamic_cast<RTF::Header *>(&element)) { 112 } else if (RTF::Command *command = dynamic_cast<RTF::Command *>(&element)) { 117 } else if (RTF::Text *text = dynamic_cast<RTF::Text *>(&element)) { 120 } else if (RTF::Group *group = dynamic_cast<RTF::Group *>(&element)) 123 if (RTF::Group *group = dynamic_cast<RTF::Group *>(&element)) { 174 Element *element = NULL; local 183 parent->AddElement(element = new Group()); 184 parent = static_cast<Group *>(element); 286 Element *element; local 307 AddElement(Element *element) argument 362 Element *element = FindDefinitionStart(index, &startIndex); local 383 Element *element; local 759 Element *element; local 797 Dispatch(Element *element) argument [all...] |