headers/os/package/solver/SolverProblemSolution.h

83

ElementList fElements;

headers/os/package/solver/SolverResult.h

60

ElementList fElements;

headers/private/kernel/util/Heap.h

164

fElements(NULL),

headers/private/kernel/util/Heap.h

174

fElements(NULL),

headers/private/kernel/util/Heap.h

185

free(fElements);

headers/private/kernel/util/Heap.h

194

return fElements[index];

headers/private/kernel/util/Heap.h

239

Element* lastElement = fElements[fLastElement];

headers/private/kernel/util/Heap.h

240

fElements[0] = lastElement;

headers/private/kernel/util/Heap.h

263

fElements[fLastElement] = element;

headers/private/kernel/util/Heap.h

280

= reinterpret_cast<Element**>(realloc(fElements, arraySize));

headers/private/kernel/util/Heap.h

284

fElements = newBuffer;

headers/private/kernel/util/Heap.h

298

&& sCompare(link->fKey, sGetLink(fElements[parent])->fKey)) {

headers/private/kernel/util/Heap.h

300

sGetLink(fElements[parent])->fIndex = link->fIndex;

headers/private/kernel/util/Heap.h

302

Element* element = fElements[link->fIndex];

headers/private/kernel/util/Heap.h

303

fElements[link->fIndex] = fElements[parent];

headers/private/kernel/util/Heap.h

304

fElements[parent] = element;

headers/private/kernel/util/Heap.h

324

&& sCompare(sGetLink(fElements[child])->fKey, link->fKey)) {

headers/private/kernel/util/Heap.h

330

&& sCompare(sGetLink(fElements[child])->fKey,

headers/private/kernel/util/Heap.h

331

sGetLink(fElements[current])->fKey)) {

headers/private/kernel/util/Heap.h

338

sGetLink(fElements[current])->fIndex = link->fIndex;

headers/private/kernel/util/Heap.h

340

Element* element = fElements[link->fIndex];

headers/private/kernel/util/Heap.h

341

fElements[link->fIndex] = fElements[current];

headers/private/kernel/util/Heap.h

342

fElements[current] = element;

headers/private/kernel/util/Heap.h

96

Element** fElements;

headers/private/kernel/util/VectorMap.h

113

ElementVector fElements;

headers/private/kernel/util/VectorMap.h

267

: fElements(chunkSize)

headers/private/kernel/util/VectorMap.h

306

fElements[index] = fEntryStrategy.MakeEntry(key, value);

headers/private/kernel/util/VectorMap.h

309

return fElements.Insert(fEntryStrategy.MakeEntry(key, value), index);

headers/private/kernel/util/VectorMap.h

339

return fEntryStrategy.GetValue(fElements[0]);

headers/private/kernel/util/VectorMap.h

340

return fEntryStrategy.GetValue(fElements[index]);

headers/private/kernel/util/VectorMap.h

359

return fEntryStrategy.GetValue(fElements[0]);

headers/private/kernel/util/VectorMap.h

360

return fEntryStrategy.GetValue(fElements[index]);

headers/private/kernel/util/VectorMap.h

377

fElements.Erase(index);

headers/private/kernel/util/VectorMap.h

393

return Iterator(this, fElements.Erase(iterator.GetIterator()));

headers/private/kernel/util/VectorMap.h

405

return fElements.Count();

headers/private/kernel/util/VectorMap.h

417

return fElements.IsEmpty();

headers/private/kernel/util/VectorMap.h

427

fElements.MakeEmpty();

headers/private/kernel/util/VectorMap.h

443

return Iterator(this, fElements.Begin());

headers/private/kernel/util/VectorMap.h

459

return ConstIterator(this, fElements.Begin());

headers/private/kernel/util/VectorMap.h

475

return Iterator(this, fElements.End());

headers/private/kernel/util/VectorMap.h

491

return ConstIterator(this, fElements.End());

headers/private/kernel/util/VectorMap.h

507

return Iterator(this, fElements.Null());

headers/private/kernel/util/VectorMap.h

523

return ConstIterator(this, fElements.Null());

headers/private/kernel/util/VectorMap.h

541

return Iterator(this, fElements.IteratorForIndex(index));

headers/private/kernel/util/VectorMap.h

559

return ConstIterator(this, fElements.IteratorForIndex(index));

headers/private/kernel/util/VectorMap.h

595

return Iterator(this, fElements.IteratorForIndex(index));

headers/private/kernel/util/VectorMap.h

599

return Iterator(this, fElements.IteratorForIndex(index - 1));

headers/private/kernel/util/VectorMap.h

636

return ConstIterator(this, fElements.IteratorForIndex(index));

headers/private/kernel/util/VectorMap.h

640

return ConstIterator(this, fElements.IteratorForIndex(index - 1));

headers/private/kernel/util/VectorMap.h

663

int cmp = fEntryStrategy.Compare(fEntryStrategy.GetKey(fElements[mid]),

headers/private/kernel/util/VectorMap.h

671

fEntryStrategy.GetKey(fElements[lower])) == 0);

headers/private/kernel/util/VectorSet.h

134

fElements[index] = value;

headers/private/kernel/util/VectorSet.h

137

return fElements.Insert(value, index);

headers/private/kernel/util/VectorSet.h

154

fElements.Erase(index);

headers/private/kernel/util/VectorSet.h

170

return fElements.Erase(iterator);

headers/private/kernel/util/VectorSet.h

182

return fElements.Count();

headers/private/kernel/util/VectorSet.h

194

return fElements.IsEmpty();

headers/private/kernel/util/VectorSet.h

204

fElements.MakeEmpty();

headers/private/kernel/util/VectorSet.h

220

return fElements.Begin();

headers/private/kernel/util/VectorSet.h

236

return fElements.Begin();

headers/private/kernel/util/VectorSet.h

252

return fElements.End();

headers/private/kernel/util/VectorSet.h

268

return fElements.End();

headers/private/kernel/util/VectorSet.h

284

return fElements.Null();

headers/private/kernel/util/VectorSet.h

300

return fElements.Null();

headers/private/kernel/util/VectorSet.h

317

return fElements.End();

headers/private/kernel/util/VectorSet.h

318

return fElements.IteratorForIndex(index);

headers/private/kernel/util/VectorSet.h

335

return fElements.End();

headers/private/kernel/util/VectorSet.h

336

return fElements.IteratorForIndex(index);

headers/private/kernel/util/VectorSet.h

372

return fElements.IteratorForIndex(index);

headers/private/kernel/util/VectorSet.h

376

return fElements.IteratorForIndex(index - 1);

headers/private/kernel/util/VectorSet.h

377

return fElements.End();

headers/private/kernel/util/VectorSet.h

413

return fElements.IteratorForIndex(index);

headers/private/kernel/util/VectorSet.h

417

return fElements.IteratorForIndex(index - 1);

headers/private/kernel/util/VectorSet.h

418

return fElements.End();

headers/private/kernel/util/VectorSet.h

440

int cmp = fCompare(fElements[mid], value);

headers/private/kernel/util/VectorSet.h

446

exists = (lower < Count() && fCompare(value, fElements[lower]) == 0);

headers/private/kernel/util/VectorSet.h

79

ElementVector fElements;

headers/private/kernel/util/VectorSet.h

94

: fElements(chunkSize)

headers/private/shared/Array.h

123

fElements[index] = element;

headers/private/shared/Array.h

163

memmove(fElements + index, fElements + index + count,

headers/private/shared/Array.h

181

free(fElements);

headers/private/shared/Array.h

183

fElements = NULL;

headers/private/shared/Array.h

201

return fElements[index];

headers/private/shared/Array.h

209

return fElements[index];

headers/private/shared/Array.h

217

return fElements[index];

headers/private/shared/Array.h

225

return fElements[index];

headers/private/shared/Array.h

237

memcpy(fElements, other.fElements, fSize * sizeof(Element));

headers/private/shared/Array.h

259

memmove(fElements + index + delta, fElements + index,

headers/private/shared/Array.h

263

memcpy(fElements + index, fElements + index - delta,

headers/private/shared/Array.h

277

memcpy(elements, fElements, index * sizeof(Element));

headers/private/shared/Array.h

281

memcpy(elements + index + delta, fElements + index,

headers/private/shared/Array.h

285

memcpy(elements + index, fElements + index - delta,

headers/private/shared/Array.h

290

free(fElements);

headers/private/shared/Array.h

291

fElements = elements;

headers/private/shared/Array.h

33

inline Element* Elements() const { return fElements; }

headers/private/shared/Array.h

58

Element* fElements;

headers/private/shared/Array.h

67

fElements(NULL),

headers/private/shared/Array.h

77

fElements(NULL),

headers/private/shared/Array.h

88

free(fElements);

headers/private/shared/Array.h

99

fElements[fSize] = element;

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

114

int32 count = fElements.Count();

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

117

*element = fElements.ElementAt(0);

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

118

fElements.Erase(0);

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

130

int32 count = fElements.Count();

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

133

*element = fElements.ElementAt(0);

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

149

int32 count = fElements.Remove(element);

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

167

return (fElements.Count());

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

35

Vector<Element*> fElements;

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

42

: fElements(),

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

76

*elements = &fElements;

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

78

int32 count = fElements.Count();

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

80

delete fElements.ElementAt(i);

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

93

status_t error = fElements.PushBack(element);

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

98

fElements.Erase(fElements.Count() - 1);

src/add-ons/kernel/file_systems/netfs/headers/shared/RequestMemberArray.h

106

= (Member*)realloc((void*)fElements, capacity * sizeof(Member));

src/add-ons/kernel/file_systems/netfs/headers/shared/RequestMemberArray.h

110

fElements = elements;

src/add-ons/kernel/file_systems/netfs/headers/shared/RequestMemberArray.h

118

Member* fElements;

src/add-ons/kernel/file_systems/netfs/headers/shared/RequestMemberArray.h

18

: fElements(NULL),

src/add-ons/kernel/file_systems/netfs/headers/shared/RequestMemberArray.h

27

fElements[i].~Member();

src/add-ons/kernel/file_systems/netfs/headers/shared/RequestMemberArray.h

28

free(fElements);

src/add-ons/kernel/file_systems/netfs/headers/shared/RequestMemberArray.h

35

visitor->Visit(this, fElements[i]);

src/add-ons/kernel/file_systems/netfs/headers/shared/RequestMemberArray.h

44

flattener->Visit(this, fElements[i]);

src/add-ons/kernel/file_systems/netfs/headers/shared/RequestMemberArray.h

53

fElements[i].~Member();

src/add-ons/kernel/file_systems/netfs/headers/shared/RequestMemberArray.h

66

Member* element = new(fElements + i) Member;

src/add-ons/kernel/file_systems/netfs/headers/shared/RequestMemberArray.h

79

new(fElements + fSize) Member(element);

src/add-ons/kernel/file_systems/netfs/headers/shared/RequestMemberArray.h

91

return fElements;

src/add-ons/kernel/file_systems/reiserfs/Iterators.cpp

109

error = fElements[fLength].SetTo(blockNumber, index);

src/add-ons/kernel/file_systems/reiserfs/Iterators.cpp

55

fElements = new(nothrow) Element[fMaxLength];

src/add-ons/kernel/file_systems/reiserfs/Iterators.cpp

61

if (fElements)

src/add-ons/kernel/file_systems/reiserfs/Iterators.cpp

62

delete[] fElements;

src/add-ons/kernel/file_systems/reiserfs/Iterators.cpp

69

return (fElements ? B_OK : B_NO_MEMORY);

src/add-ons/kernel/file_systems/reiserfs/Iterators.cpp

92

element = fElements + index;

src/add-ons/kernel/file_systems/reiserfs/Iterators.h

58

Element *fElements;

src/add-ons/translators/rtf/RTF.cpp

287

while ((element = (Element *)fElements.RemoveItem((int32)0)) != NULL) {

src/add-ons/translators/rtf/RTF.cpp

312

if (fElements.AddItem(element)) {

src/add-ons/translators/rtf/RTF.cpp

324

return (uint32)fElements.CountItems();

src/add-ons/translators/rtf/RTF.cpp

331

return static_cast<Element *>(fElements.ItemAt(index));

src/add-ons/translators/rtf/RTF.h

84

BList fElements;

src/apps/installer/BlockingQueue.h

103

fElements.erase(fElements.begin() + fElements.size() - 1);

src/apps/installer/BlockingQueue.h

119

int32 count = fElements.size();

src/apps/installer/BlockingQueue.h

122

*element = fElements[0];

src/apps/installer/BlockingQueue.h

123

fElements.erase(fElements.begin());

src/apps/installer/BlockingQueue.h

135

int32 count = fElements.size();

src/apps/installer/BlockingQueue.h

138

*element = fElements[0];

src/apps/installer/BlockingQueue.h

156

for (int32 i = fElements.size() - 1; i >= 0; i--) {

src/apps/installer/BlockingQueue.h

157

if (fElements[i] == element) {

src/apps/installer/BlockingQueue.h

158

fElements.erase(fElements.begin() + i);

src/apps/installer/BlockingQueue.h

181

return (fElements.size());

src/apps/installer/BlockingQueue.h

38

vector<Element*> fElements;

src/apps/installer/BlockingQueue.h

45

: fElements(),

src/apps/installer/BlockingQueue.h

79

*elements = &fElements;

src/apps/installer/BlockingQueue.h

81

int32 count = fElements.size();

src/apps/installer/BlockingQueue.h

83

delete fElements[i];

src/apps/installer/BlockingQueue.h

97

fElements.push_back(element);

src/kits/interface/layouter/CollapsingLayouter.cpp

117

fElements(new ElementInfo[elementCount]),

src/kits/interface/layouter/CollapsingLayouter.cpp

128

delete[] fElements;

src/kits/interface/layouter/CollapsingLayouter.cpp

154

if (fElements[i].valid == false) {

src/kits/interface/layouter/CollapsingLayouter.cpp

155

fElements[i].valid = true;

src/kits/interface/layouter/CollapsingLayouter.cpp

160

fElements[element].constraints.AddItem(constraint);

src/kits/interface/layouter/CollapsingLayouter.cpp

178

ElementInfo& elementInfo = fElements[element];

src/kits/interface/layouter/CollapsingLayouter.cpp

226

info->SetElementPosition(i, fElements[i].position);

src/kits/interface/layouter/CollapsingLayouter.cpp

23

fElements = new int32[elementCount];

src/kits/interface/layouter/CollapsingLayouter.cpp

238

clone->fElements[i].SetTo(fElements[i]);

src/kits/interface/layouter/CollapsingLayouter.cpp

28

delete[] fElements;

src/kits/interface/layouter/CollapsingLayouter.cpp

287

ElementInfo& element = fElements[i];

src/kits/interface/layouter/CollapsingLayouter.cpp

306

ElementInfo& element = fElements[i];

src/kits/interface/layouter/CollapsingLayouter.cpp

328

fLayouter->SetWeight(fElements[i].position, fElements[i].weight);

src/kits/interface/layouter/CollapsingLayouter.cpp

42

fElements[element] = position;

src/kits/interface/layouter/CollapsingLayouter.cpp

48

if (element < 0 || element >= fElementCount || fElements[element] < 0)

src/kits/interface/layouter/CollapsingLayouter.cpp

50

return fTarget->ElementLocation(fElements[element]);

src/kits/interface/layouter/CollapsingLayouter.cpp

56

if (element < 0 || element >= fElementCount || fElements[element] < 0)

src/kits/interface/layouter/CollapsingLayouter.cpp

58

return fTarget->ElementSize(fElements[element]);

src/kits/interface/layouter/CollapsingLayouter.cpp

64

if (element < 0 || element >= fElementCount || fElements[element] < 0)

src/kits/interface/layouter/CollapsingLayouter.cpp

66

return fTarget->ElementRangeSize(fElements[element], length);

src/kits/interface/layouter/CollapsingLayouter.cpp

70

int32* fElements;

src/kits/interface/layouter/CollapsingLayouter.h

56

ElementInfo* fElements;

src/kits/interface/layouter/SimpleLayouter.cpp

100

return fElements[element].location;

src/kits/interface/layouter/SimpleLayouter.cpp

110

return fElements[element].size - 1;

src/kits/interface/layouter/SimpleLayouter.cpp

125

fElements = new ElementInfo[elementCount];

src/kits/interface/layouter/SimpleLayouter.cpp

127

fElements[i].index = i;

src/kits/interface/layouter/SimpleLayouter.cpp

133

delete[] fElements;

src/kits/interface/layouter/SimpleLayouter.cpp

154

ElementInfo& info = fElements[element];

src/kits/interface/layouter/SimpleLayouter.cpp

171

fElements[element].weight = weight;

src/kits/interface/layouter/SimpleLayouter.cpp

229

fLayoutInfo->fElements[i].location = location;

src/kits/interface/layouter/SimpleLayouter.cpp

230

location += fSpacing + fLayoutInfo->fElements[i].size;

src/kits/interface/layouter/SimpleLayouter.cpp

241

layouter->fElements[i].Assign(fElements[i]);

src/kits/interface/layouter/SimpleLayouter.cpp

345

ElementInfo& info = fElements[i];

src/kits/interface/layouter/SimpleLayouter.cpp

366

ElementInfo* infos = fElements;

src/kits/interface/layouter/SimpleLayouter.cpp

375

fLayoutInfo->fElements[infos[i].index].size = infos[i].max;

src/kits/interface/layouter/SimpleLayouter.cpp

394

fLayoutInfo->fElements[infos[i].index].size

src/kits/interface/layouter/SimpleLayouter.cpp

407

infosToLayout.AddItem(&fElements[i]);

src/kits/interface/layouter/SimpleLayouter.cpp

408

fLayoutInfo->fElements[i].size = 0;

src/kits/interface/layouter/SimpleLayouter.cpp

422

ElementLayoutInfo& layoutInfo = fLayoutInfo->fElements[info->index];

src/kits/interface/layouter/SimpleLayouter.cpp

78

ElementLayoutInfo* fElements;

src/kits/interface/layouter/SimpleLayouter.cpp

85

fElements = new ElementLayoutInfo[elementCount];

src/kits/interface/layouter/SimpleLayouter.cpp

90

delete[] fElements;

src/kits/interface/layouter/SimpleLayouter.h

56

ElementInfo* fElements;

src/kits/package/solver/SolverProblemSolution.cpp

127

fElements(10)

src/kits/package/solver/SolverProblemSolution.cpp

140

return fElements.CountItems();

src/kits/package/solver/SolverProblemSolution.cpp

147

return fElements.ItemAt(index);

src/kits/package/solver/SolverProblemSolution.cpp

155

if (newElement == NULL || !fElements.AddItem(newElement)) {

src/kits/package/solver/SolverResult.cpp

102

fElements.MakeEmpty();

src/kits/package/solver/SolverResult.cpp

111

if (newElement == NULL || !fElements.AddItem(newElement)) {

src/kits/package/solver/SolverResult.cpp

68

fElements(20)

src/kits/package/solver/SolverResult.cpp

81

return fElements.IsEmpty();

src/kits/package/solver/SolverResult.cpp

88

return fElements.CountItems();

src/kits/package/solver/SolverResult.cpp

95

return fElements.ItemAt(index);