Searched refs:element (Results 1 - 25 of 107) sorted by path

12345

/haiku/headers/compatibility/bsd/sys/
H A Dqueue.h50 * added to the list after an existing element or at the head of the list.
61 * to the list after an existing element, at the head of the list, or at the
70 * so that an arbitrary element can be removed without a need to
72 * or after an existing element or at the head of the list. A list
77 * linked so that an arbitrary element can be removed without a need to
79 * after an existing element, at the head of the list, or at the end of
109 /* Store the last 2 places the queue element or head was altered */
146 struct type *slh_first; /* first element */ \
154 struct type *sle_next; /* next element */ \
218 struct type *stqh_first;/* first element */ \
595 struct quehead *element = (struct quehead *)a, local
607 struct quehead *element = (struct quehead *)a; local
[all...]
/haiku/headers/os/package/solver/
H A DSolverProblemSolution.h77 bool AppendElement(const Element& element);
H A DSolverResult.h54 const BSolverResultElement& element);
/haiku/headers/private/firewire/
H A Dqueue.h45 * added to the list after an existing element or at the head of the list.
56 * to the list after an existing element, at the head of the list, or at the
65 * so that an arbitrary element can be removed without a need to
67 * or after an existing element or at the head of the list. A list
72 * linked so that an arbitrary element can be removed without a need to
74 * after an existing element, at the head of the list, or at the end of
104 /* Store the last 2 places the queue element or head was altered */
141 struct type *slh_first; /* first element */ \
149 struct type *sle_next; /* next element */ \
213 struct type *stqh_first;/* first element */ \
590 struct quehead *element = (struct quehead *)a, local
602 struct quehead *element = (struct quehead *)a; local
[all...]
/haiku/headers/private/fs_shell/
H A DSinglyLinkedList.h55 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/headers/private/kernel/util/
H A DHeap.h43 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...]
H A DMinMaxHeap.h44 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 DSinglyLinkedList.h52 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 DSplayTree.h407 Node* element = fCurrent; local
412 return element;
/haiku/headers/private/package/hpkg/
H A DStacker.h19 Stacker(Type*& location, Type* element) argument
24 *fLocation = element;
27 Stacker(Type** location, Type* element) argument
32 *fLocation = element;
/haiku/headers/private/shared/
H A DArray.h35 inline bool Add(const Element& element);
37 inline bool Insert(const Element& element, int32 index);
94 Array<Element>::Add(const Element& element) argument
99 fElements[fSize] = element;
115 Array<Element>::Insert(const Element& element, int32 index) argument
123 fElements[index] = element;
H A DHashMap.h378 Element* element = fTable.Lookup(key); local
379 if (element) {
381 element->fValue = value;
385 // does not contain the key yet: create an element and add it
386 element = new(std::nothrow) Element(key, value);
387 if (!element)
390 status_t error = fTable.Insert(element);
392 delete element;
403 Element* element = fTable.Lookup(key); local
404 if (element
420 Element* element = it.fElement; local
440 Element* element = fTable.Clear(true); local
[all...]
H A DHashSet.h246 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/add-ons/kernel/file_systems/netfs/headers/shared/
H A DRequestMemberArray.h66 Member* element = new(fElements + i) Member; local
68 unflattener->Visit(this, *element);
74 status_t Append(const Member& element) argument
79 new(fElements + fSize) Member(element);
H A DSLList.h44 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...]
/haiku/src/apps/cortex/Persistence/
H A DExportContext.cpp94 // push tag onto element stack, and link to entry for the current object
97 m_objectStack.back().element = m_elementStack.back().name.String();
106 // writes an end tag corresponding to the current element.
136 // pop element off stack
141 // current element's start tag.)
251 if(!entry.element)
H A DExportContext.h72 // the element stack
92 // writes an end tag corresponding to the current element.
98 // current element's start tag.)
207 // * single vs. multi-line element formatting
248 object_entry() : element(0), object(0) {}
250 const char* element; member in struct:ExportContext::object_entry
H A DImportContext.cpp56 // 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";
H A DImportContext.h69 // fetch the current element (tag)
71 const char* element() const;
73 // fetch the current element's parent
74 // (returns 0 if the stack is empty or the current element is top-level)
H A DImporter.cpp182 // (disengaged once the first element is encountered)
270 // this is the first element; identify or verify document type
276 BString err("Unexpected document element (should be <");
294 // whoops, don't know how to handle this element:
295 BString err("No document type registered for element '");
311 // push element name onto the stack
314 // try to create an object for this element if necessary
321 make_pair(m_context->element(), target));
342 // no object directly maps to this element; hand to
382 // compare name to element o
[all...]
H A DXML.cpp84 // element of the stream, or
101 // prepare an Importer to figure document type (from first element)
174 // (document) element name corresponding to the
290 // object. If a mapping for the element already exists,
305 const char* element) {
307 _NullMapping m(element);
304 objectFor( const char* element) argument
H A DXML.h94 // element of the stream, or
186 // object. If a mapping for the element already exists,
192 // returns 0 if no mapping found for the given element
194 const char* element);
/haiku/src/apps/cortex/Persistence/Wrappers/
H A DMessageIO.cpp254 if(strcmp(context.element(), s_element) != 0) {
255 context.reportError("Unexpected child element.\n");
279 context.reportError("Unexpected parent element.\n");
283 if(!_isValidMessageElement(context.element())) {
284 context.reportError("Invalid message field element.\n");
331 const char* element) const {
333 if(!strcmp(element, _boolEl)) return true;
334 if(!strcmp(element, _int8El)) return true;
335 if(!strcmp(element, _int16El)) return true;
336 if(!strcmp(element, _int32E
347 _importField( BMessage* message, const char* element, const char* name, const char* data) argument
[all...]
H A DMessageIO.h158 const char* element) const;
162 const char* element,
/haiku/src/apps/cortex/RouteApp/
H A DConnectionIO.cpp417 if(!strcmp(context.element(), _LIVE_NODE_ELEMENT)) {
441 else if(!strcmp(context.element(), _NAME_ELEMENT)) {
463 context.reportError("Unexpected element.\n");
507 context.reportError("ConnectionIO: unexpected nested child element\n");
514 context.reportError("ConnectionIO: unexpected nested child element\n");
520 context.reportError("ConnectionIO: unexpected child element\n");

Completed in 218 milliseconds

12345