| /haiku/src/kits/debugger/types/ |
| H A D | ArrayIndexPath.cpp | 24 fIndices(other.fIndices)
37 fIndices.Clear();
49 if (!fIndices.Add(index))
67 fIndices.Clear();
98 fIndices = other.fIndices;
|
| /haiku/headers/private/debugger/types/ |
| H A D | ArrayIndexPath.h | 39 IndexArray fIndices; member in class:ArrayIndexPath
46 return fIndices.Count();
53 return index >= 0 && index < fIndices.Count()
54 ? fIndices.ElementAt(index) : -1;
61 return fIndices.Add(index);
68 if (at >= 0 && at < fIndices.Count())
69 fIndices[at] = newIndex;
|
| /haiku/src/apps/icon-o-matic/shape/commands/ |
| H A D | NudgePointsCommand.cpp | 51 fIndices(NULL),
56 fIndices = new (nothrow) int32[fCount];
57 memcpy(fIndices, indices, fCount * sizeof(int32));
68 delete[] fIndices;
76 if (fPath && fIndices && fPoints)
97 fPath->SetPoint(fIndices[i], fPoints[i].point + translation,
|
| H A D | TransformPointsCommand.cpp | 43 fIndices(indices && count > 0 ?
49 if (!fIndices || !fPoints)
52 memcpy(fIndices, indices, fCount * sizeof(int32));
65 delete[] fIndices;
73 return fPath && fIndices && fPoints ? TransformCommand::InitCheck()
115 if (!fPath->SetPoint(fIndices[i], point, pointIn, pointOut,
|
| H A D | NudgePointsCommand.h | 47 int32* fIndices; member in class:NudgePointsCommand
|
| H A D | TransformPointsCommand.h | 64 int32* fIndices; member in class:TransformPointsCommand
|
| /haiku/src/add-ons/kernel/file_systems/ramfs/ |
| H A D | IndexDirectory.cpp | 21 fIndices()
27 if (!fIndices.AddItem(fNameIndex)
28 || !fIndices.AddItem(fLastModifiedIndex)
29 || !fIndices.AddItem(fSizeIndex)) {
30 fIndices.MakeEmpty();
46 fIndices.RemoveItem(fNameIndex);
50 fIndices.RemoveItem(fLastModifiedIndex);
54 fIndices.RemoveItem(fSizeIndex);
58 int32 count = fIndices.CountItems();
60 delete fIndices
[all...] |
| H A D | IndexDirectory.h | 40 Index *IndexAt(int32 index) const { return fIndices.ItemAt(index); }
47 List<Index*> fIndices; member in class:IndexDirectory
|
| /haiku/src/apps/mediaplayer/playlist/ |
| H A D | MovePLItemsCommand.cpp | 32 fIndices(fCount > 0 ? new (nothrow) int32[fCount] : NULL),
49 fIndices[i] = (int32)(addr_t)indices.ItemAt(i);
50 fItems[i] = fPlaylist->ItemAt(fIndices[i]);
57 if (fIndices[i] < fToIndex)
67 delete[] fIndices;
80 int32 index = fIndices[0];
81 // NOTE: fIndices == NULL if fCount < 1
93 if (fIndices[i] != index + 1) {
97 index = fIndices[i];
121 fPlaylist->RemoveItem(fIndices[
[all...] |
| H A D | RemovePLItemsCommand.cpp | 33 fIndices(fCount > 0 ? new (nothrow) int32[fCount] : NULL),
49 fIndices[i] = (int32)(addr_t)indices.ItemAt(i);
50 fItems[i] = fPlaylist->ItemAt(fIndices[i]);
63 delete[] fIndices;
70 if (!fPlaylist || !fItems || !fIndices)
88 lastRemovedIndex = fIndices[i] - i;
152 if (!fPlaylist->AddItem(fItems[i], fIndices[i])) {
|
| H A D | RemovePLItemsCommand.h | 33 int32* fIndices; member in class:RemovePLItemsCommand
|
| H A D | MovePLItemsCommand.h | 33 int32* fIndices; member in class:MovePLItemsCommand
|
| /haiku/src/apps/icon-o-matic/generic/command/ |
| H A D | MoveCommand.h | 55 int32* fIndices; member in class:MoveCommand
69 fIndices(count > 0 ? new (nothrow) int32[count] : NULL),
73 if (!fContainer || !fItems || !fIndices)
81 fIndices[i] = fContainer->IndexOf(fItems[i]);
82 if (fIndices[i] >= 0 && fIndices[i] < fToIndex)
93 delete[] fIndices;
101 if (!fContainer || !fItems || !fIndices)
107 int32 index = fIndices[0];
108 // NOTE: fIndices
[all...] |
| H A D | RemoveCommand.h | 55 int32* fIndices; member in class:RemoveCommand
67 fIndices(count > 0 ? new (nothrow) int32[count] : NULL),
71 if (!fContainer || !fItems || !fIndices)
74 memcpy(fIndices, indices, sizeof(int32) * fCount);
76 fItems[i] = fContainer->ItemAt(fIndices[i]);
90 delete[] fIndices;
98 return fContainer && fItems && fIndices ? B_OK : B_NO_INIT;
129 if (fItems[i] && !fContainer->AddItem(fItems[i], fIndices[i])) {
|
| /haiku/src/apps/icon-o-matic/transformable/ |
| H A D | TransformPointsBox.cpp | 30 fIndices(path && count > 0 ? new (nothrow) int32[count] : NULL),
38 if (fPoints && fIndices) {
40 memcpy(fIndices, indices, fCount * sizeof(int32));
43 if (fPath->GetPointsAt(fIndices[i], fPoints[i].point,
71 delete[] fIndices;
98 if (!deep || !fIndices || !fPoints)
111 fPath->SetPoint(fIndices[i], transformed,
124 fIndices,
|
| H A D | TransformPointsBox.h | 52 int32* fIndices; member in class:TransformPointsBox
|
| /haiku/src/add-ons/kernel/file_systems/packagefs/volume/ |
| H A D | Volume.h | 90 { return fIndices.Lookup(name); }
92 { return fIndices.GetIterator(); }
202 IndexHashTable fIndices; member in class:Volume
|
| H A D | Volume.cpp | 198 Index* index = fIndices.Clear(true);
250 error = fIndices.Init();
266 fIndices.Insert(index);
281 fIndices.Insert(index);
296 fIndices.Insert(index);
311 fIndices.Insert(index);
|
| /haiku/src/kits/debugger/arch/x86/ |
| H A D | ArchitectureX86.cpp | 86 memset(fIndices, -1, sizeof(fIndices));
89 fIndices[kFromDwarfRegisters[i]] = i;
100 return index >= 0 && index < X86_REGISTER_COUNT ? fIndices[index] : -1;
104 int32 fIndices[X86_REGISTER_COUNT]; member in struct:ArchitectureX86::ToDwarfRegisterMap
|
| /haiku/src/kits/debugger/arch/x86_64/ |
| H A D | ArchitectureX8664.cpp | 104 memset(fIndices, -1, sizeof(fIndices));
107 fIndices[kFromDwarfRegisters[i]] = i;
118 return index >= 0 && index < X86_64_REGISTER_COUNT ? fIndices[index] : -1;
122 int32 fIndices[X86_64_REGISTER_COUNT]; member in struct:ArchitectureX8664::ToDwarfRegisterMap
|