/haiku/src/apps/packageinstaller/ |
H A D | PackageInfo.cpp | 649 uint8 element = P_NONE; local 667 element = type; \ 691 if (element == P_NONE) { 707 if (element == P_NONE) { 716 if (element == P_NONE) { 725 if (element == P_NONE) { 734 if (element == P_NONE) { 743 if (element == P_NONE) { 752 if (element == P_NONE) { 761 if (element [all...] |
/haiku/src/apps/cortex/Persistence/ |
H A D | ImportContext.h | 69 // 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 D | ExportContext.h | 72 // 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
|
/haiku/headers/os/package/solver/ |
H A D | SolverResult.h | 54 const BSolverResultElement& element);
|
H A D | SolverProblemSolution.h | 77 bool AppendElement(const Element& element);
|
/haiku/src/servers/app/drawing/ |
H A D | AlphaMaskCache.cpp | 95 ShapeMaskElement element(mask->fShape, mask, mask->fPreviousMask.Get(), 97 fShapeMasks.insert(element); 117 ShapeMaskElement element(&shape, NULL, previousMask, inverse); 118 ShapeMaskSet::iterator it = fShapeMasks.find(element);
|
/haiku/src/kits/network/libnetservices/ |
H A D | HttpForm.cpp | 667 BHttpForm::_GetMultipartHeader(const BHttpFormData* element) const 671 result << "Content-Disposition: form-data; name=\"" << element->Name() 674 switch (element->Type()) { 680 result << "; filename=\"" << element->File().Leaf() << '"'; 682 BNode fileNode(element->File().Path()); 697 if (element->IsFile()) { 698 result << "; filename=\"" << element->Filename() << '"'; 700 if (element->MimeType().Length() > 0) 701 result << "\r\nContent-Type: " << element->MimeType(); 743 BHttpFormData* element local [all...] |
/haiku/src/kits/package/solver/ |
H A D | SolverProblemSolution.cpp | 152 BSolverProblemSolution::AppendElement(const Element& element) argument 154 Element* newElement = new(std::nothrow) Element(element);
|
/haiku/headers/private/shared/ |
H A D | Array.h | 35 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;
|
/haiku/src/apps/glteapot/ |
H A D | util.h | 66 inline int is_present(contents* element) argument 69 if (node->car == element) 157 /* Create and add a new node for a specified element, 206 /* Remove & delete all nodes pointing to a particular element. */ 207 inline void rem_del (contents* element) argument 211 if ((*pp)->car == element) { 260 inline contents *get(contents *element) 265 if (node->car == element)
|
/haiku/src/servers/package/ |
H A D | ProblemWindow.cpp | 262 const BSolverProblemSolutionElement* element local 266 _SolutionElementText(element).String())); 283 const BSolverProblemSolutionElement* element) const 287 BSolverPackage* package = element->SourcePackage(); 288 if (element->Type() == BSolverProblemSolutionElement::B_ALLOW_DEINSTALLATION 296 return element->ToString();
|
H A D | ProblemWindow.h | 62 element) const;
|
/haiku/src/kits/interface/layouter/ |
H A D | ComplexLayouter.cpp | 42 // We also store the location of the virtual elementCountth element. 43 // Thus fLocation[i + 1] - fLocation[i] is the size of the ith element 60 virtual float ElementLocation(int32 element) argument 62 if (element < 0 || element >= fCount) 65 return fLocations[element]; 68 virtual float ElementSize(int32 element) argument 70 if (element < 0 || element >= fCount) 73 return fLocations[element 218 AddConstraints(int32 element, int32 length, float _min, float _max, float _preferred) argument 260 SetWeight(int32 element, float weight) argument [all...] |
/haiku/headers/private/firewire/ |
H A D | queue.h | 45 * 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/compatibility/bsd/sys/ |
H A D | queue.h | 50 * 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/src/tools/fs_shell/ |
H A D | OpenHashTable.h | 278 ValueType* element = fTable[i]; local 279 if (element != NULL) { 281 *nextPointer = element; 284 // element in the bucket 285 while (element != NULL) { 286 nextPointer = &_Link(element); 287 element = *nextPointer; 349 The iterator is not invalidated when removing the current element from
|
/haiku/headers/private/kernel/util/ |
H A D | OpenHashTable.h | 278 ValueType* element = fTable[i]; local 279 if (element != NULL) { 281 *nextPointer = element; 284 // element in the bucket 285 while (element != NULL) { 286 nextPointer = &_Link(element); 287 element = *nextPointer; 349 The iterator is not invalidated when removing the current element from
|
H A D | AVLTreeBase.h | 63 status_t Insert(AVLTreeNode* element); 65 bool Remove(AVLTreeNode* element);
|
/haiku/src/tests/system/kernel/util/ |
H A D | SinglyLinkedListTest.cpp | 72 Element* element = iterator.Next(); local 73 CHK(*element == values[preIndex]);
|
/haiku/src/add-ons/kernel/drivers/bus/usb/ |
H A D | usb_raw.cpp | 115 raw_device *element = gDeviceList; local 116 while (element) { 117 if (element->link == device) { 118 element->link = device->link; 122 element = (raw_device *)element->link; 202 raw_device *element = gDeviceList; local 203 while (element) { 204 if (strcmp(name, element->name) == 0) { 205 element 1006 raw_device *element = gDeviceList; local [all...] |
/haiku/src/add-ons/kernel/bus_managers/firewire/ |
H A D | firewire.cpp | 361 struct firewire_child_info *element, *info; 365 element = sc->fc->childList; 366 while (element) { 367 if (strcmp(element->child_name, childname) == 0) { 372 element = element->link; 386 element = sc->fc->childList; 387 if (element) { 388 while (element->link) 389 element 513 struct firewire_child_info *element, *temp; local 743 struct firewire_child_info *element = fc->childList; local 1875 struct firewire_child_info *element = fc->childList; local [all...] |
/haiku/src/apps/cortex/RouteApp/ |
H A D | route_app_io.h | 90 const char* element,
|
/haiku/src/bin/pkgman/ |
H A D | command_resolve_dependencies.cpp | 100 for (int32 i = 0; const BSolverResultElement* element = result.ElementAt(i); 102 BSolverPackage* package = element->Package(); 240 for (int32 i = 0; const BSolverResultElement* element = result.ElementAt(i); 243 BSolverPackage* package = element->Package();
|
/haiku/headers/os/locale/ |
H A D | NumberFormat.h | 42 BString GetSeparator(BNumberElement element);
|
/haiku/src/kits/support/ |
H A D | StringList.cpp | 123 BString element(StringAt(i)); 124 if (length == element.Length() && string.ICompare(element) == 0) { 259 BString element(StringAt(i)); 260 if (length == element.Length() && string.ICompare(element) == 0) 451 // handle simple cases (0 or 1 element)
|