| /haiku/src/kits/support/ |
| H A D | List.cpp | 36 fItemCount(0),
42 _ResizeArray(fItemCount);
50 fItemCount(0),
68 if (_ResizeArray(other.fItemCount)) {
69 fItemCount = other.fItemCount;
70 memcpy(fObjectList, other.fObjectList, fItemCount * sizeof(void*));
84 if (other.fItemCount != fItemCount)
87 if (fItemCount >
[all...] |
| /haiku/headers/private/interface/ |
| H A D | TextViewSupportBuffer.h | 31 int32 fItemCount; member in class:_BTextViewSupportBuffer_
41 fItemCount(inCount),
42 fBufferCount(fExtraCount + fItemCount),
45 fBuffer = (T*)calloc(fExtraCount + fItemCount, sizeof(T));
65 inAtIndex = (inAtIndex > fItemCount) ? fItemCount : inAtIndex;
69 int32 logSize = fItemCount * sizeof(T);
79 (fItemCount - inAtIndex) * sizeof(T));
82 fItemCount += inNumItems;
94 inAtIndex = (inAtIndex > fItemCount
[all...] |
| /haiku/src/add-ons/kernel/file_systems/reiserfs/ |
| H A D | List.h | 85 int32 fItemCount; member in class:List
100 fItemCount(0),
149 bool result = (index >= 0 && index <= fItemCount
150 && _Resize(fItemCount + 1));
152 _MoveItems(fItems + index, 1, fItemCount - index - 1);
164 if ((int32)fCapacity > fItemCount) {
165 new(fItems + fItemCount) item_t(item);
166 fItemCount++;
168 if ((result = _Resize(fItemCount + 1)))
169 new(fItems + (fItemCount
[all...] |
| /haiku/src/kits/interface/textview_support/ |
| H A D | TextGapBuffer.cpp | 31 fItemCount(0),
33 fBufferCount(kTextGapBufferBlockSize + fItemCount),
34 fGapIndex(fItemCount),
40 fBuffer = (char*)malloc(kTextGapBufferBlockSize + fItemCount);
58 inAtIndex = (inAtIndex > fItemCount) ? fItemCount : inAtIndex;
71 fItemCount += inNumItems;
94 inAtIndex = (inAtIndex > fItemCount) ? fItemCount : inAtIndex;
107 fItemCount
[all...] |
| H A D | TextGapBuffer.h | 54 int32 fItemCount; // logical count member in class:BPrivate::TextGapBuffer
68 return fItemCount;
75 if (index < 0 || index >= fItemCount) {
76 if (index != fItemCount)
|
| H A D | LineBuffer.cpp | 56 int32 maxIndex = fItemCount - 1;
78 int32 maxIndex = fItemCount - 1;
99 for (long i = index; i < fItemCount; i++)
107 for (long i = index; i < fItemCount; i++)
115 if (fItemCount == 0)
120 for (int32 i = 0; i < fItemCount; i++) {
|
| H A D | LineBuffer.h | 51 return fItemCount - 1;
|
| H A D | WidthBuffer.cpp | 82 for (int32 x = 0; x < fItemCount; x++)
191 for (int32 i = 0; i < fItemCount; i++) {
218 uint32 position = fItemCount;
|
| H A D | StyleBuffer.cpp | 48 if (fItemCount <= 1)
52 int32 maxIndex = fItemCount;
58 if (index >= fItemCount - 1
74 for (int32 i = index; i < fItemCount; i++)
104 for (index = 0; index < fItemCount; index++) {
123 InsertItemsAt(1, fItemCount, &newRecord);
147 for (int32 i = 0; i < fItemCount; i++) {
|
| /haiku/src/add-ons/kernel/network/ppp/shared/libkernelppp/headers/ |
| H A D | TemplateList.h | 80 int32 fItemCount; member in class:TemplateList
95 fItemCount(0),
144 bool result = (index >= 0 && index <= fItemCount
145 && _Resize(fItemCount + 1));
147 _MoveItems(fItems + index, 1, fItemCount - index - 1);
159 if ((int32)fCapacity > fItemCount) {
160 new(fItems + fItemCount) item_t(item);
161 fItemCount++;
163 if ((result = _Resize(fItemCount + 1)))
164 new(fItems + (fItemCount
[all...] |
| /haiku/src/add-ons/kernel/file_systems/ramfs/ |
| H A D | List.h | 75 int32 fItemCount; member in class:List
90 fItemCount(0),
139 bool result = (index >= 0 && index <= fItemCount
140 && _Resize(fItemCount + 1));
142 _MoveItems(fItems + index, 1, fItemCount - index - 1);
154 if ((int32)fCapacity > fItemCount) {
155 new(fItems + fItemCount) item_t(item);
156 fItemCount++;
158 if ((result = _Resize(fItemCount + 1)))
159 new(fItems + (fItemCount
[all...] |
| /haiku/headers/private/kernel/util/ |
| H A D | Vector.h | 92 int32 fItemCount; member in class:Vector
203 fItemCount(0),
251 return Insert(value, fItemCount);
263 if (fItemCount > 0)
276 if (fItemCount > 0)
277 Erase(fItemCount - 1);
310 if (index < 0 || index > fItemCount)
312 if (!_Resize(fItemCount + 1))
314 _MoveItems(fItems + index, 1, fItemCount - index - 1);
349 for (int32 i = fItemCount
[all...] |
| H A D | OpenHashTable.h | 102 fItemCount(0),
111 fItemCount(0),
121 fItemCount(0),
145 return fItemCount == 0;
150 return fItemCount;
175 } else if (AutoExpand && fItemCount >= (fTableSize * 200 / 256))
198 fItemCount++;
209 && fItemCount < (fTableSize * 50 / 256))
256 fItemCount--;
268 if (fItemCount
493 size_t fItemCount; member in class:BOpenHashTable
[all...] |
| H A D | MultiHashTable.h | 48 && HashTable::fItemCount >= (HashTable::fTableSize * 200 / 256))
57 HashTable::fItemCount++; member in class:MultiHashTable::HashTable
66 && HashTable::fItemCount < (HashTable::fTableSize * 50 / 256))
|
| /haiku/headers/private/userlandfs/shared/ |
| H A D | Vector.h | 88 int32 fItemCount; member in class:Vector
199 fItemCount(0),
247 return Insert(value, fItemCount);
259 if (fItemCount > 0)
272 if (fItemCount > 0)
273 Erase(fItemCount - 1);
306 if (index < 0 || index > fItemCount)
308 if (!_Resize(fItemCount + 1))
310 _MoveItems(fItems + index, 1, fItemCount - index - 1);
345 for (int32 i = fItemCount
[all...] |
| /haiku/src/tools/fs_shell/ |
| H A D | OpenHashTable.h | 102 fItemCount(0),
111 fItemCount(0),
121 fItemCount(0),
145 return fItemCount == 0;
150 return fItemCount;
175 } else if (AutoExpand && fItemCount >= (fTableSize * 200 / 256))
198 fItemCount++;
209 && fItemCount < (fTableSize * 50 / 256))
256 fItemCount--;
268 if (fItemCount
493 size_t fItemCount; member in class:BOpenHashTable
[all...] |
| /haiku/src/tests/kits/shared/ |
| H A D | FakeJsonDataGenerator.cpp | 25 fItemCount(count),
128 if (fItemUpto >= fItemCount)
188 if (fItemUpto >= fItemCount)
|
| H A D | FakeJsonDataGenerator.h | 43 int fItemCount; member in class:FakeJsonStreamDataIO
|
| /haiku/src/kits/debugger/value/value_nodes/ |
| H A D | BListValueNode.cpp | 168 fItemCount(0),
259 } else if (strcmp(member->Name(), "fItemCount") == 0) {
282 fItemCount = listSize.ToInt32();
286 fItemCount);
353 if (highIndex >= fItemCount)
354 highIndex = fItemCount - 1;
414 highIndex = fItemCount - 1;
|
| /haiku/src/apps/musiccollection/ |
| H A D | MusicCollectionWindow.cpp | 40 fItemCount(0)
59 fItemCount++;
61 count << fItemCount; local
151 printf("prev count %i\n", (int)fItemCount);
152 fItemCount = 0;
198 int32 fItemCount; member in class:ListViewListener
|
| /haiku/headers/os/support/ |
| H A D | List.h | 72 int32 fItemCount; member in class:BList
|
| /haiku/headers/private/debugger/value/value_nodes/ |
| H A D | BListValueNode.h | 64 int32 fItemCount; member in class:BListValueNode
|
| /haiku/src/apps/haikudepot/ui/ |
| H A D | PackageListView.cpp | 739 fItemCount(0)
791 if (count == fItemCount)
793 fItemCount = count;
794 fLabel = _DeriveLabel(fItemCount);
815 int32 fItemCount; member in class:PackageListView::ItemCountView
|
| /haiku/src/apps/softwareupdater/ |
| H A D | SoftwareUpdaterWindow.h | 64 int32 fItemCount; member in class:SuperItem
|
| H A D | SoftwareUpdaterWindow.cpp | 744 fItemCount(0)
827 fItemCount = count;
830 fItemText << fItemCount; local
|