/haiku/src/apps/installer/ |
H A D | BlockingQueue.h | 38 vector<Element*> fElements; member in class:BlockingQueue 45 : fElements(), 79 *elements = &fElements; 81 int32 count = fElements.size(); 83 delete fElements[i]; 97 fElements.push_back(element); 103 fElements.erase(fElements.begin() + fElements.size() - 1); 119 int32 count = fElements [all...] |
/haiku/src/add-ons/kernel/file_systems/netfs/headers/shared/ |
H A D | RequestMemberArray.h | 18 : fElements(NULL), 27 fElements[i].~Member(); 28 free(fElements); 35 visitor->Visit(this, fElements[i]); 44 flattener->Visit(this, fElements[i]); 53 fElements[i].~Member(); 66 Member* element = new(fElements + i) Member; 79 new(fElements + fSize) Member(element); 91 return fElements; 106 = (Member*)realloc(fElements, capacit 118 Member* fElements; member in class:RequestMemberArray [all...] |
H A D | BlockingQueue.h | 35 Vector<Element*> fElements; member in class:BlockingQueue 42 : fElements(), 76 *elements = &fElements; 78 int32 count = fElements.Count(); 80 delete fElements.ElementAt(i); 93 status_t error = fElements.PushBack(element); 98 fElements.Erase(fElements.Count() - 1); 114 int32 count = fElements.Count(); 117 *element = fElements [all...] |
/haiku/headers/private/kernel/util/ |
H A D | VectorSet.h | 79 ElementVector fElements; member in class:VectorSet 94 : fElements(chunkSize) 134 fElements[index] = value; 137 return fElements.Insert(value, index); 154 fElements.Erase(index); 170 return fElements.Erase(iterator); 182 return fElements.Count(); 194 return fElements.IsEmpty(); 204 fElements.MakeEmpty(); 220 return fElements [all...] |
H A D | Heap.h | 96 Element** fElements; member in class:Heap 164 fElements(NULL), 174 fElements(NULL), 185 free(fElements); 194 return fElements[0]; 239 Element* lastElement = fElements[fLastElement]; 240 fElements[0] = lastElement; 263 fElements[fLastElement] = element; 280 = reinterpret_cast<Element**>(realloc(fElements, arraySize)); 284 fElements [all...] |
H A D | VectorMap.h | 113 ElementVector fElements; member in class:VectorMap 267 : fElements(chunkSize) 306 fElements[index] = fEntryStrategy.MakeEntry(key, value); 309 return fElements.Insert(fEntryStrategy.MakeEntry(key, value), index); 339 return fEntryStrategy.GetValue(fElements[0]); 340 return fEntryStrategy.GetValue(fElements[index]); 359 return fEntryStrategy.GetValue(fElements[0]); 360 return fEntryStrategy.GetValue(fElements[index]); 377 fElements.Erase(index); 393 return Iterator(this, fElements [all...] |
/haiku/headers/private/shared/ |
H A D | Array.h | 33 inline Element* Elements() const { return fElements; } 58 Element* fElements; member in class:BPrivate::Array 67 fElements(NULL), 77 fElements(NULL), 88 free(fElements); 99 fElements[fSize] = element; 123 fElements[index] = element; 163 memmove(fElements + index, fElements + index + count, 181 free(fElements); [all...] |
/haiku/src/kits/package/solver/ |
H A D | SolverResult.cpp | 68 fElements(20, true) 81 return fElements.IsEmpty(); 88 return fElements.CountItems(); 95 return fElements.ItemAt(index); 102 fElements.MakeEmpty(); 111 if (newElement == NULL || !fElements.AddItem(newElement)) {
|
H A D | SolverProblemSolution.cpp | 127 fElements(10, true) 140 return fElements.CountItems(); 147 return fElements.ItemAt(index); 155 if (newElement == NULL || !fElements.AddItem(newElement)) {
|
/haiku/src/kits/interface/layouter/ |
H A D | CollapsingLayouter.cpp | 23 fElements = new int32[elementCount]; 28 delete[] fElements; 42 fElements[element] = position; 48 if (element < 0 || element >= fElementCount || fElements[element] < 0) 50 return fTarget->ElementLocation(fElements[element]); 56 if (element < 0 || element >= fElementCount || fElements[element] < 0) 58 return fTarget->ElementSize(fElements[element]); 64 if (element < 0 || element >= fElementCount || fElements[element] < 0) 66 return fTarget->ElementRangeSize(fElements[element], length); 70 int32* fElements; member in class:CollapsingLayouter::ProxyLayoutInfo [all...] |
H A D | SimpleLayouter.cpp | 78 ElementLayoutInfo* fElements; member in class:SimpleLayouter::MyLayoutInfo 85 fElements = new ElementLayoutInfo[elementCount]; 90 delete[] fElements; 100 return fElements[element].location; 110 return fElements[element].size - 1; 125 fElements = new ElementInfo[elementCount]; 127 fElements[i].index = i; 133 delete[] fElements; 154 ElementInfo& info = fElements[element]; 171 fElements[elemen [all...] |
H A D | CollapsingLayouter.h | 56 ElementInfo* fElements; member in class:BPrivate::Layout::CollapsingLayouter
|
H A D | SimpleLayouter.h | 56 ElementInfo* fElements; member in class:BPrivate::Layout::SimpleLayouter
|
/haiku/headers/os/package/solver/ |
H A D | SolverResult.h | 60 ElementList fElements; member in class:BPackageKit::BSolverResult
|
H A D | SolverProblemSolution.h | 83 ElementList fElements; member in class:BPackageKit::BSolverProblemSolution
|
/haiku/src/add-ons/kernel/file_systems/reiserfs/ |
H A D | Iterators.cpp | 53 fElements(NULL) 55 fElements = new(nothrow) Element[fMaxLength]; 61 if (fElements) 62 delete[] fElements; 69 return (fElements ? B_OK : B_NO_MEMORY); 92 element = fElements + index; 109 error = fElements[fLength].SetTo(blockNumber, index);
|
H A D | Iterators.h | 58 Element *fElements; member in class:TreePath
|
/haiku/src/add-ons/translators/rtf/ |
H A D | RTF.cpp | 287 while ((element = (Element *)fElements.RemoveItem((int32)0)) != NULL) { 312 if (fElements.AddItem(element)) { 324 return (uint32)fElements.CountItems(); 331 return static_cast<Element *>(fElements.ItemAt(index));
|
H A D | RTF.h | 85 BList fElements; member in class:RTF::Group
|