fIndices
IndexArray fIndices;
return fIndices.Count();
return index >= 0 && index < fIndices.Count()
? fIndices.ElementAt(index) : -1;
return fIndices.Add(index);
if (at >= 0 && at < fIndices.Count())
fIndices[at] = newIndex;
Index* index = fIndices.Clear(true);
error = fIndices.Init();
fIndices.Insert(index);
fIndices.Insert(index);
fIndices.Insert(index);
fIndices.Insert(index);
IndexHashTable fIndices;
{ return fIndices.Lookup(name); }
{ return fIndices.GetIterator(); }
if (fIndices.AddItem(index)) {
int32 i = fIndices.IndexOf(index);
fIndices.RemoveItem(i);
int32 count = fIndices.CountItems();
Index *index = fIndices.ItemAt(i);
if (!fIndices.AddItem(fNameIndex)
|| !fIndices.AddItem(fLastModifiedIndex)
|| !fIndices.AddItem(fSizeIndex)) {
fIndices.MakeEmpty();
fIndices.RemoveItem(fNameIndex);
fIndices.RemoveItem(fLastModifiedIndex);
fIndices.RemoveItem(fSizeIndex);
int32 count = fIndices.CountItems();
delete fIndices.ItemAt(i);
Index *IndexAt(int32 index) const { return fIndices.ItemAt(index); }
List<Index*> fIndices;
if (!fContainer || !fItems || !fIndices)
int32 index = fIndices[0];
if (fIndices[i] != index + 1) {
index = fIndices[i];
if (fItems[i] && !fContainer->AddItem(fItems[i], fIndices[i])) {
int32* fIndices;
fIndices(count > 0 ? new (nothrow) int32[count] : NULL),
if (!fContainer || !fItems || !fIndices)
fIndices[i] = fContainer->IndexOf(fItems[i]);
if (fIndices[i] >= 0 && fIndices[i] < fToIndex)
delete[] fIndices;
if (fItems[i] && !fContainer->AddItem(fItems[i], fIndices[i])) {
int32* fIndices;
fIndices(count > 0 ? new (nothrow) int32[count] : NULL),
if (!fContainer || !fItems || !fIndices)
memcpy(fIndices, indices, sizeof(int32) * fCount);
fItems[i] = fContainer->ItemAt(fIndices[i]);
delete[] fIndices;
return fContainer && fItems && fIndices ? B_OK : B_NO_INIT;
fIndices(NULL),
fIndices = new (nothrow) int32[fCount];
memcpy(fIndices, indices, fCount * sizeof(int32));
delete[] fIndices;
if (fPath && fIndices && fPoints)
fPath->SetPoint(fIndices[i], fPoints[i].point + translation,
int32* fIndices;
if (!fPath->SetPoint(fIndices[i], point, pointIn, pointOut,
fIndices(indices && count > 0 ?
if (!fIndices || !fPoints)
memcpy(fIndices, indices, fCount * sizeof(int32));
delete[] fIndices;
return fPath && fIndices && fPoints ? TransformCommand::InitCheck()
int32* fIndices;
fPath->SetPoint(fIndices[i], transformed,
fIndices,
fIndices(path && count > 0 ? new (nothrow) int32[count] : NULL),
if (fPoints && fIndices) {
memcpy(fIndices, indices, fCount * sizeof(int32));
if (fPath->GetPointsAt(fIndices[i], fPoints[i].point,
delete[] fIndices;
if (!deep || !fIndices || !fPoints)
int32* fIndices;
fPlaylist->RemoveItem(fIndices[i] - i, false);
if (!fPlaylist->AddItem(fItems[i], fIndices[i])) {
fIndices(fCount > 0 ? new (nothrow) int32[fCount] : NULL),
fIndices[i] = (int32)(addr_t)indices.ItemAt(i);
fItems[i] = fPlaylist->ItemAt(fIndices[i]);
if (fIndices[i] < fToIndex)
delete[] fIndices;
int32 index = fIndices[0];
if (fIndices[i] != index + 1) {
index = fIndices[i];
int32* fIndices;
if (!fPlaylist->AddItem(fItems[i], fIndices[i])) {
fIndices(fCount > 0 ? new (nothrow) int32[fCount] : NULL),
fIndices[i] = (int32)(addr_t)indices.ItemAt(i);
fItems[i] = fPlaylist->ItemAt(fIndices[i]);
delete[] fIndices;
if (!fPlaylist || !fItems || !fIndices)
lastRemovedIndex = fIndices[i] - i;
int32* fIndices;
return index >= 0 && index < X86_REGISTER_COUNT ? fIndices[index] : -1;
int32 fIndices[X86_REGISTER_COUNT];
memset(fIndices, -1, sizeof(fIndices));
fIndices[kFromDwarfRegisters[i]] = i;
memset(fIndices, -1, sizeof(fIndices));
fIndices[kFromDwarfRegisters[i]] = i;
return index >= 0 && index < X86_64_REGISTER_COUNT ? fIndices[index] : -1;
int32 fIndices[X86_64_REGISTER_COUNT];
fIndices(other.fIndices)
fIndices.Clear();
if (!fIndices.Add(index))
fIndices.Clear();
fIndices = other.fIndices;