fIterators
= fIterators.GetIterator();
fIterators.Add(iterator);
fIterators.Remove(iterator);
= fIterators.GetIterator();
SinglyLinkedList<TreeIterator> fIterators;
fIterators.Add(iterator);
fIterators.Remove(iterator);
= fIterators.GetIterator();
= fIterators.GetIterator();
SinglyLinkedList<AttributeIterator> fIterators;
= fIterators.GetIterator();
fIterators.Add(iterator);
fIterators.Remove(iterator);
SinglyLinkedList<TreeIterator> fIterators;
IteratorList* iteratorList = fIterators->Get(nodeID);
fIterators->Remove(nodeID);
if (IteratorList* iteratorList = fIterators->Get(nodeID)) {
fIterators->Remove(nodeID);
for (IteratorMap::Iterator it = fIterators->GetIterator(); it.HasNext();) {
delete fIterators;
fIterators = new(std::nothrow) IteratorMap;
if (!fIterators)
status_t error = fIterators->InitCheck();
IteratorList* iteratorList = fIterators->Get(nodeID);
status_t error = fIterators->Put(nodeID, iteratorList);
IteratorMap* fIterators;
fIterators(),
for (LocalShareDirIterator* iterator = fIterators.First();
iterator = fIterators.GetNext(iterator)) {
fIterators.Insert(iterator);
fIterators.Remove(iterator);
DoublyLinkedList<LocalShareDirIterator> fIterators;
for (VirtualDirIterator* iterator = fIterators.First();
iterator = fIterators.GetNext(iterator)) {
fIterators.Insert(iterator);
fIterators.Remove(iterator);
DoublyLinkedList<VirtualDirIterator> fIterators;
fIterators(),
while (DirIterator* iterator = fIterators.First())
for (DirIterator* iterator = fIterators.First();
iterator = fIterators.GetNext(iterator)) {
fIterators.Insert(iterator);
return fIterators.First();
fIterators.Remove(iterator);
IteratorList fIterators;
for (DirectoryIteratorList::Iterator it = fIterators.GetIterator();
fIterators.Add(iterator);
fIterators.Remove(iterator);
DirectoryIteratorList fIterators;
fIterators.Insert(iterator);
fIterators.Remove(iterator);
{ return &fIterators; }
DoublyLinkedList<AttributeIterator> fIterators;
if (fInitStatus == B_OK && (!fAttributes || !fIterators))
if (fIterators) {
for (Iterator *iterator = fIterators->First();
iterator = fIterators->GetNext(iterator)) {
delete fIterators;
for (Iterator *iterator = fIterators->First();
iterator = fIterators->GetNext(iterator)) {
fIterators->Insert(iterator);
fIterators->Remove(iterator);
IteratorList *fIterators;
fIterators.Insert(iterator);
fIterators.Remove(iterator);
{ return &fIterators; }
DoublyLinkedList<EntryIterator> fIterators;
if (fInitStatus == B_OK && (!fNodes || !fIterators))
if (fIterators) {
for (Iterator *iterator = fIterators->First();
iterator = fIterators->GetNext(iterator)) {
delete fIterators;
for (Iterator *iterator = fIterators->First();
iterator = fIterators->GetNext(iterator)) {
fIterators->Insert(iterator);
fIterators->Remove(iterator);
IteratorList *fIterators;
if (fInitStatus == B_OK && (!fNodes || !fIterators))
if (fIterators) {
for (Iterator *iterator = fIterators->First();
iterator = fIterators->GetNext(iterator)) {
delete fIterators;
for (Iterator *iterator = fIterators->First();
iterator = fIterators->GetNext(iterator)) {
fIterators->Insert(iterator);
fIterators->Remove(iterator);
IteratorList *fIterators;