Searched refs:fComponents (Results 1 - 5 of 5) sorted by relevance

/haiku/src/kits/debugger/model/
H A DTypeComponentPath.cpp112 fComponents(10, true)
119 fComponents(10, true)
133 return fComponents.CountItems();
140 TypeComponent* component = fComponents.ItemAt(index);
149 if (myComponent == NULL || !fComponents.AddItem(myComponent)) {
161 fComponents.MakeEmpty();
168 if (componentCount < 0 || componentCount > fComponents.CountItems())
169 componentCount = fComponents.CountItems();
177 if (!path->AddComponent(*fComponents.ItemAt(i)))
188 int32 count = fComponents
[all...]
/haiku/src/servers/package/
H A DFSUtils.h33 fComponents[0] = component1;
34 fComponents[1] = component2;
35 fComponents[2] = component3;
38 if (fComponents[i] == NULL) {
57 result.fComponents[i] = fComponents[i];
66 ? fComponents[fComponentCount - 1] : NULL;
76 length += strlen(fComponents[i]);
88 strcpy(buffer, fComponents[i]);
98 const char* fComponents[kMaxComponentCoun member in struct:FSUtils::RelativePath
[all...]
/haiku/src/apps/debuganalyzer/gui/table/
H A DTreeTable.cpp63 fComponents.push_back(childIndex);
74 if (fComponents.empty())
77 int32 index = fComponents.back();
78 fComponents.pop_back();
85 fComponents.clear();
92 return fComponents.size();
99 if (index < 0 || (size_t)index >= fComponents.size())
101 return fComponents[index];
109 fComponents = other.fComponents;
[all...]
H A DTreeTable.h47 ComponentVector fComponents; member in class:TreeTablePath
/haiku/headers/private/debugger/model/
H A DTypeComponentPath.h144 ComponentList fComponents; member in class:TypeComponentPath

Completed in 132 milliseconds