/haiku/src/add-ons/kernel/file_systems/packagefs/package/ |
H A D | PackageDirectory.h | 30 { return fChildren; } 36 PackageNodeList fChildren; member in class:PackageDirectory 43 return fChildren.First(); 50 return fChildren.GetNext(node);
|
H A D | PackageDirectory.cpp | 25 while (PackageNode* child = fChildren.RemoveHead()) 33 fChildren.Add(node); 41 fChildren.Remove(node);
|
/haiku/src/add-ons/kernel/drivers/input/hid_shared/ |
H A D | HIDCollection.cpp | 49 for (int32 i = 0; i < fChildren.Count(); i++) 50 delete fChildren[i]; 75 if (fChildren.PushBack(child) == B_NO_MEMORY) { 86 int32 count = fChildren.Count(); 90 return fChildren[index]; 101 for (int32 i = 0; i < fChildren.Count(); i++) { 102 HIDCollection *child = fChildren[i]; 146 for (int32 i = 0; i < fChildren.Count(); i++) { 147 HIDCollection *child = fChildren[i]; 208 TRACE_ALWAYS("%s\tchild count: %" B_PRIu32 "\n", indent, fChildren [all...] |
H A D | HIDCollection.h | 29 uint32 CountChildren() { return fChildren.Count(); }; 58 Vector<HIDCollection *> fChildren; member in class:HIDCollection
|
/haiku/src/tests/add-ons/print/ppd/model/ |
H A D | Statement.cpp | 19 , fChildren(NULL) 28 delete fChildren; 74 return fChildren; 79 if (fChildren == NULL) { 80 fChildren = new StatementList(true); 82 fChildren->Add(statement);
|
H A D | Statement.h | 31 StatementList* fChildren; member in class:Statement
|
/haiku/src/kits/debugger/value/ |
H A D | ValueNodeContainer.cpp | 20 fChildren(20, false), 43 return fChildren.CountItems(); 50 return fChildren.ItemAt(index); 59 if (!fChildren.AddItem(child)) 72 if (child->Container() != this || !fChildren.RemoveItem(child)) 90 fChildren.MakeEmpty();
|
/haiku/src/add-ons/kernel/bus_managers/usb/ |
H A D | Hub.cpp | 29 fChildren[i] = NULL; 116 if (fChildren[i] == NULL) 119 fChildren[i]->Changed(changeList, false); 120 fChildren[i] = NULL; 211 fChildren[i], fChildren[i] != NULL 212 ? fChildren[i]->USBID() : 0); 218 && fChildren[i] == NULL)) { 256 if (fChildren[i] != NULL) { 259 fChildren[ [all...] |
/haiku/src/kits/debugger/value/value_nodes/ |
H A D | CompoundValueNode.cpp | 166 for (int32 i = 0; Child* child = fChildren.ItemAt(i); i++) 197 if (!fChildren.IsEmpty()) 205 if (child == NULL || !fChildren.AddItem(child)) { 218 if (child == NULL || !fChildren.AddItem(child)) { 236 return fChildren.CountItems(); 243 return fChildren.ItemAt(index);
|
H A D | ArrayValueNode.cpp | 47 for (int32 i = 0; AbstractArrayValueNodeChild* child = fChildren.ItemAt(i); 80 if (!fChildren.IsEmpty()) 90 return fChildren.CountItems(); 97 return fChildren.ItemAt(index); 111 fChildren.MakeEmpty(); 163 if (child == NULL || !fChildren.AddItem(child)) {
|
H A D | BListValueNode.cpp | 178 for (int32 i = 0; i < fChildren.CountItems(); i++) 179 fChildren.ItemAt(i)->ReleaseReference(); 309 return fChildren.CountItems(); 316 return fChildren.ItemAt(index); 337 fChildren.MakeEmpty(); 365 fChildren.AddItem(countChild); 398 fChildren.AddItem(child);
|
H A D | BMessageValueNode.cpp | 125 for (int32 i = 0; i < fChildren.CountItems(); i++) 126 fChildren.ItemAt(i)->ReleaseReference(); 341 fChildren.AddItem(whatNode); 367 fChildren.AddItem(node); 382 return fChildren.CountItems(); 389 return fChildren.ItemAt(index); 667 fChildren.AddItem(child); 682 return fChildren.CountItems(); 688 return fChildren.ItemAt(index);
|
/haiku/src/apps/debuganalyzer/gui/ |
H A D | AbstractWaitObjectsPage.h | 281 fChildren(20, true) 287 fChildren(20, true) 289 fChildren.AddList(&nodes); 295 for (int32 i = 0; Node* node = fChildren.ItemAt(i); i++) { 303 Node* child = fChildren.ItemAt(0); 309 Node* child = fChildren.ItemAt(0); 335 return fChildren.CountItems(); 340 return fChildren.ItemAt(index); 344 BObjectList<Node> fChildren; member in struct:AbstractWaitObjectsPage::WaitObjectsTreeModel::NodeContainerNode 359 = groupByName ? tempChildren : NodeContainerNode::fChildren; [all...] |
/haiku/headers/private/debugger/value/value_nodes/ |
H A D | CompoundValueNode.h | 50 ChildList fChildren; member in class:CompoundValueNode
|
H A D | BListValueNode.h | 60 ChildNodeList fChildren; member in class:BListValueNode
|
H A D | BMessageValueNode.h | 65 ChildNodeList fChildren; member in class:BMessageValueNode 103 ChildNodeList fChildren; member in class:BMessageValueNode::BMessageFieldNode
|
/haiku/src/tests/kits/interface/layout/widget_layout_test/ |
H A D | View.cpp | 18 fChildren(), 29 fChildren(), 207 if (!fChildren.AddItem(child)) 232 if (index < 0 || index >= fChildren.CountItems()) 238 fChildren.RemoveItem(index); 249 return fChildren.CountItems(); 256 return (View*)fChildren.ItemAt(index); 299 return (child ? fChildren.IndexOf(child) : -1);
|
/haiku/src/system/boot/loader/ |
H A D | partitions.cpp | 156 if (!p->fChildren.IsEmpty()) { 157 Partition *c = Lookup(id, &p->fChildren); 248 fChildren.Add(child); 397 NodeIterator iterator = fChildren.GetIterator(); 410 fChildren.Remove(child); 417 while ((child = (Partition *)fChildren.Head()) != NULL) { 418 fChildren.Remove(child);
|
/haiku/src/kits/storage/disk_device/ |
H A D | MutablePartition.cpp | 338 index = fChildren.CountItems(); 339 else if (index > fChildren.CountItems()) 358 if (!fChildren.AddItem(child, index)) { 365 fChildren.RemoveItem(child); 420 BMutablePartition* child = (BMutablePartition*)fChildren.RemoveItem(index); 464 return (BMutablePartition*)fChildren.ItemAt(index); 472 return fChildren.CountItems(); 482 return fChildren.IndexOf(child); 550 if (!fParent->fChildren.AddItem(this))
|
/haiku/src/apps/debuganalyzer/gui/table/ |
H A D | TreeTable.cpp | 466 NodeList* fChildren; member in class:TreeTableNode 474 fChildren(NULL) 481 delete fChildren; 516 if (fChildren != NULL) { 517 for (int32 i = 0; TreeTableNode* child = fChildren->ItemAt(i); i++) 534 if (fChildren == NULL) { 535 fChildren = new(std::nothrow) NodeList(10, true); 536 if (fChildren == NULL) 540 return fChildren->AddItem(child, index); 547 return fChildren ! [all...] |
/haiku/headers/private/debugger/value/ |
H A D | ValueNodeContainer.h | 56 NodeChildList fChildren; member in class:ValueNodeContainer
|
/haiku/headers/private/kernel/boot/ |
H A D | partitions.h | 48 NodeList fChildren; member in class:boot::Partition
|
/haiku/headers/private/storage/ |
H A D | MutablePartition.h | 101 BList fChildren; member in class:BMutablePartition
|
/haiku/src/kits/tracker/ |
H A D | VirtualDirectoryManager.cpp | 56 fChildren(10, true) 96 return fChildren; 121 for (int32 i = 0; Info* child = fChildren.ItemAt(i); i++) { 143 if (info == NULL || !fChildren.AddItem(info)) { 152 return fChildren.RemoveItem(info, true); 157 delete fChildren.RemoveItemAt(index); 168 InfoList fChildren; member in class:BPrivate::VirtualDirectoryManager::Info
|
/haiku/src/tests/system/kernel/device_manager/playground/ |
H A D | device_manager.cpp | 125 const NodeList& Children() const { return fChildren; } 166 NodeList fChildren; member in struct:device_node 1009 NodeList::Iterator nodeIterator = fChildren.GetIterator(); 1119 fChildren.Add(node); 1127 fChildren.Remove(node); 1178 if (!fChildren.IsEmpty()) { 1508 NodeList::Iterator iterator = fChildren.GetIterator(); 1520 NodeList::Iterator iterator = fChildren.GetIterator(); 1526 return fChildren.IsEmpty() ? B_OK : B_BUSY; 1533 NodeList::Iterator iterator = fChildren [all...] |