fTable
fIterator(map->fTable.GetIterator()),
ElementTable fTable;
fTable()
fTable.Init();
return (fTable.TableSize() > 0 ? B_OK : B_NO_MEMORY);
Element* element = fTable.Lookup(key);
status_t error = fTable.Insert(element);
Element* element = fTable.Lookup(key);
fTable.Remove(element);
fTable.RemoveUnchecked(element);
Element* element = fTable.Clear(true);
if (Element* element = fTable.Lookup(key))
if (Element* element = fTable.Lookup(key)) {
return fTable.Lookup(key) != NULL;
return fTable.CountElements();
fIterator(set->fTable.GetIterator()),
ElementTable fTable;
fTable()
fTable.Init();
return (fTable.TableSize() > 0 ? B_OK : B_NO_MEMORY);
Element* element = fTable.Lookup(key);
status_t error = fTable.Insert(element);
Element* element = fTable.Lookup(key);
fTable.Remove(element);
fTable.RemoveUnchecked(element);
Element* element = fTable.Clear(true);
return fTable.Lookup(key) != NULL;
return fTable.CountElements();
ValueType** link = &HashTable::fTable[index];
slot = HashTable::fTable[index];
if (HashTable::fTable) {
ValueType *bucket = HashTable::fTable[i];
delete [] HashTable::fTable;
HashTable::fTable = newTable;
_Insert(HashTable::fTable, HashTable::fTableSize, value);
Iterator::fTable = table;
return ((const MultiTable *)Iterator::fTable)->_Definition().CompareValues(
fTable(NULL)
fTable(NULL)
fTable(NULL)
fAllocator.Free(fTable);
ValueType* slot = fTable[index];
_Insert(fTable, fTableSize, value);
ValueType* slot = fTable[index];
fTable[index] = next;
ValueType* element = fTable[i];
memset(this->fTable, 0, sizeof(ValueType*) * this->fTableSize);
: fTable(table)
: fTable(table), fIndex(index), fNext(value) {}
fNext = fTable->_Link(fNext);
while (fNext == NULL && fIndex < fTable->fTableSize)
fNext = fTable->fTable[fIndex++];
const HashTable* fTable;
ValueType* slot = fTable[index];
if (fTable) {
ValueType* bucket = fTable[i];
*_oldTable = fTable;
fAllocator.Free(fTable);
fTable = newTable;
ValueType* bucket = fTable[i];
ValueType** fTable;
SET_ERROR(error, fTable.Insert(child));
Entry* child = fTable.Lookup(DirectoryEntryHash::Key(id, name));
return fTable.Remove(child) ? B_OK : B_ERROR;
Entry *child = fTable.Lookup(DirectoryEntryHash::Key(id, name));
info.AddDirectoryEntryTableAllocation(0, fTable.TableSize(),
sizeof(void*), fTable.CountElements());
BOpenHashTable<DirectoryEntryHash> fTable;
fInitStatus = fTable.Init(1000);
if (fTable[fNewCode] != NULL) {
if (!OutputColor(fTable[fNewCode], fEntrySize[fNewCode]))
newEntry[fOldCodeLength] = fTable[fNewCode][0];
fTable[fNextCode] = MemblockAllocate(fOldCodeLength + 1);
if (fTable[fNextCode] == NULL)
fTable[fNextCode][x] = newEntry[x];
fOldCode[x] = fTable[fNewCode][x];
fTable[x] = NULL;
fTable[x] = MemblockAllocate(1);
if (fTable[x] != NULL) {
fTable[x][0] = x;
unsigned char* fTable[ENTRY_COUNT];
fTable->ColumnMouseUp(this, row, field, screenWhere, buttons);
fTable = table;
if (fTable == NULL)
if (fTable == NULL)
BLooper* window = fTable->Looper();
fTable->ColumnMouseDown(this, row, field, screenWhere, buttons);
if (fTable == NULL)
BLooper* window = fTable->Looper();
AbstractTable* fTable;
fTable(table),
while ((row = fTable->CurrentSelection(row)) != NULL)
while ((row = fTable->CurrentSelection(row)) != NULL)
fRows[index++] = fTable->_ModelIndexOfRow(row);
Table* fTable;
if (fTable == NULL) {
((fTable[i].hash < hash) ? left : right) = i;
if (fTable[right].hash == hash) {
*color = fTable[right].color;
fTable = (_XColorEntry*)res->LoadResource(B_RAW_TYPE, "XColorsTable", &size);
if (fTable == NULL || size < sizeof(_XColorEntry)) {
fTable = NULL;
fTable(NULL),
fTable = NULL;
const _XColorEntry* fTable;
fTable[index] = new Entry(fTable[index], key, value);
table = fTable;
fIteratorEntry = fTable[0];
fIteratorEntry = fTable[++fIteratorIndex];
for (entry = fTable[index]; entry; entry = next) {
fTable[index] = NULL;
struct Entry **oldTable = fTable,**newtable;
fTable = newtable;
table = fTable;
if (!(fTable = (struct Entry **)malloc(capacity * sizeof(void *))))
memset(fTable,0,capacity * sizeof(void *));
struct Entry **table = fTable;
Entry **fTable;
ElementTable fTable;
return fTable.Init(initialSize);
fTable.InsertUnchecked(element);
fTable.RemoveUnchecked(element);
Element* element = fTable.Lookup(id);
alignas(uint64_t) Descriptor fTable[kDescriptorCount];
alignas(uint64_t) TableType fTable;
fTable {
sizeof(fTable) - 1,
static_cast<const void*>(fTable),
fTable[index] = tss.GetLower();
fTable[index + 1] = tss.GetUpper();
fTable { Function(Index)... }
fTable[index] = desc.GetDescriptor();
T fTable[sizeof...(Index)];
sizeof(fTable) - 1,
static_cast<const void*>(fTable.fTable),
fTable(NULL)
fTable(NULL)
fTable(NULL)
fAllocator.Free(fTable);
ValueType* slot = fTable[index];
_Insert(fTable, fTableSize, value);
ValueType* slot = fTable[index];
fTable[index] = next;
ValueType* element = fTable[i];
memset(this->fTable, 0, sizeof(ValueType*) * this->fTableSize);
: fTable(table)
: fTable(table), fIndex(index), fNext(value) {}
fNext = fTable->_Link(fNext);
while (fNext == NULL && fIndex < fTable->fTableSize)
fNext = fTable->fTable[fIndex++];
const HashTable* fTable;
ValueType* slot = fTable[index];
if (fTable) {
ValueType* bucket = fTable[i];
*_oldTable = fTable;
fAllocator.Free(fTable);
fTable = newTable;
ValueType* bucket = fTable[i];
ValueType** fTable;