Home
last modified time | relevance | path

Searched refs:myChildren (Results 1 – 25 of 68) sorted by relevance

123

/dports/deskutils/fbreader/FBReader-0.99.6-freebsdport/zlibrary/core/src/blockTreeView/
H A DZLBlockTreeNode.cpp33 myChildIndex = parent->myChildren.size(); in ZLBlockTreeNode()
34 parent->myChildren.push_back(this); in ZLBlockTreeNode()
38 it = parent->myChildren.insert(it, this); in ZLBlockTreeNode()
46 for (List::iterator it = myChildren.begin(); it != myChildren.end(); ++it) { in clear()
50 myChildren.clear(); in clear()
55 List &children = myParent->myChildren; in ~ZLBlockTreeNode()
146 node = node->myChildren.back(); in previous()
152 if (myIsOpen && !myChildren.empty()) { in next()
153 return myChildren.front(); in next()
161 return current->myChildren[index]; in next()
[all …]
/dports/cad/opencascade/opencascade-7.6.0/src/NCollection/
H A DNCollection_UBTree.hxx177 myChildren[0].myParent = children; in Gemmate()
178 myChildren[1].myParent = children; in Gemmate()
180 myChildren = children; in Gemmate()
192 TreeNode *oldChildren = myChildren; in Kill()
196 myChildren = oldChildren[iopp].myChildren; in Kill()
198 myChildren[0].myParent = this; in Kill()
199 myChildren[1].myParent = this; in Kill()
210 ~TreeNode () { myChildren = 0L; } in ~TreeNode()
220 if (theNode -> myChildren) { in delNode()
223 theAlloc->Free(theNode -> myChildren); in delNode()
[all …]
/dports/cad/opencascade/opencascade-7.6.0/inc/
H A DNCollection_UBTree.hxx177 myChildren[0].myParent = children; in Gemmate()
178 myChildren[1].myParent = children; in Gemmate()
180 myChildren = children; in Gemmate()
192 TreeNode *oldChildren = myChildren; in Kill()
196 myChildren = oldChildren[iopp].myChildren; in Kill()
198 myChildren[0].myParent = this; in Kill()
199 myChildren[1].myParent = this; in Kill()
210 ~TreeNode () { myChildren = 0L; } in ~TreeNode()
220 if (theNode -> myChildren) { in delNode()
223 theAlloc->Free(theNode -> myChildren); in delNode()
[all …]
/dports/devel/py-cadquery-pywrap/pywrap-e8c7bc9/opencascade/
H A DNCollection_UBTree.hxx177 myChildren[0].myParent = children; in Gemmate()
178 myChildren[1].myParent = children; in Gemmate()
180 myChildren = children; in Gemmate()
192 TreeNode *oldChildren = myChildren; in Kill()
196 myChildren = oldChildren[iopp].myChildren; in Kill()
198 myChildren[0].myParent = this; in Kill()
199 myChildren[1].myParent = this; in Kill()
210 ~TreeNode () { myChildren = 0L; } in ~TreeNode()
220 if (theNode -> myChildren) { in delNode()
223 theAlloc->Free(theNode -> myChildren); in delNode()
[all …]
/dports/games/oonsoo/oonsoo-1.2/UI/
H A DContainerWidget.cxx48 for(BasicWidget* p = myChildren.first(); p != (BasicWidget*)0; in manage()
49 p = myChildren.next()) in manage()
61 for(BasicWidget* p = myChildren.first(); p != (BasicWidget*)0; in unmanage()
62 p = myChildren.next()) in unmanage()
75 myChildren.append(child); in addChild()
83 myChildren.remove(child); in removeChild()
96 for(BasicWidget* p = myChildren.first(); p != (BasicWidget*)0; in findWidget()
97 p = myChildren.next()) in findWidget()
/dports/cad/opencascade/opencascade-7.6.0/src/XCAFDoc/
H A DXCAFDoc_GraphNode.cxx132 Standard_Integer Chindex = myChildren.Length(); in SetChild()
133 myChildren.Append(Ch); in SetChild()
223 myChildren.Remove (Chindex); in UnSetChildlink()
282 if (Ch == myChildren.Value (Chindex)) in ChildIndex()
330 return myChildren.Length(); in NbChildren()
358 myChildren = F->myChildren; in Restore()
424 fct = myChildren(i); in References()
456 if ( myChildren.Length()!= 0 ) { in Dump()
459 if ( !myChildren(i)->Label().IsNull() ) in Dump()
460 myChildren(i)->Label().EntryDump(anOS); in Dump()
[all …]
/dports/net-p2p/transmission-cli/transmission-3.00/qt/
H A DFileTreeItem.cc38 assert(myChildren.isEmpty()); in ~FileTreeItem()
44 myParent->myChildren.removeAt(pos); in ~FileTreeItem()
54 myChildren.append(child); in appendChild()
80 assert(this == myParent->myChildren[i]); in row()
191 for (FileTreeItem const* const i : myChildren) in getSubtreeWantedSize()
220 if (myChildren.isEmpty()) in size()
307 if (myChildren.isEmpty()) in priority()
325 for (FileTreeItem const* const child : myChildren) in priority()
345 for (FileTreeItem* const child : myChildren) in setSubtreePriority()
353 if (myChildren.isEmpty()) in isSubtreeWanted()
[all …]
H A DFileTreeItem.h56 return myChildren.at(row); in child()
61 return myChildren.size(); in childCount()
115 QList<FileTreeItem*> myChildren; variable
/dports/net-p2p/transmission-qt/transmission-3.00/qt/
H A DFileTreeItem.cc38 assert(myChildren.isEmpty()); in ~FileTreeItem()
44 myParent->myChildren.removeAt(pos); in ~FileTreeItem()
54 myChildren.append(child); in appendChild()
80 assert(this == myParent->myChildren[i]); in row()
191 for (FileTreeItem const* const i : myChildren) in getSubtreeWantedSize()
220 if (myChildren.isEmpty()) in size()
307 if (myChildren.isEmpty()) in priority()
325 for (FileTreeItem const* const child : myChildren) in priority()
345 for (FileTreeItem* const child : myChildren) in setSubtreePriority()
353 if (myChildren.isEmpty()) in isSubtreeWanted()
[all …]
H A DFileTreeItem.h56 return myChildren.at(row); in child()
61 return myChildren.size(); in childCount()
115 QList<FileTreeItem*> myChildren; variable
/dports/net-p2p/transmission-daemon/transmission-3.00/qt/
H A DFileTreeItem.cc38 assert(myChildren.isEmpty()); in ~FileTreeItem()
44 myParent->myChildren.removeAt(pos); in ~FileTreeItem()
54 myChildren.append(child); in appendChild()
80 assert(this == myParent->myChildren[i]); in row()
191 for (FileTreeItem const* const i : myChildren) in getSubtreeWantedSize()
220 if (myChildren.isEmpty()) in size()
307 if (myChildren.isEmpty()) in priority()
325 for (FileTreeItem const* const child : myChildren) in priority()
345 for (FileTreeItem* const child : myChildren) in setSubtreePriority()
353 if (myChildren.isEmpty()) in isSubtreeWanted()
[all …]
H A DFileTreeItem.h56 return myChildren.at(row); in child()
61 return myChildren.size(); in childCount()
115 QList<FileTreeItem*> myChildren; variable
/dports/net-p2p/transmission-gtk/transmission-3.00/qt/
H A DFileTreeItem.cc38 assert(myChildren.isEmpty()); in ~FileTreeItem()
44 myParent->myChildren.removeAt(pos); in ~FileTreeItem()
54 myChildren.append(child); in appendChild()
80 assert(this == myParent->myChildren[i]); in row()
191 for (FileTreeItem const* const i : myChildren) in getSubtreeWantedSize()
220 if (myChildren.isEmpty()) in size()
307 if (myChildren.isEmpty()) in priority()
325 for (FileTreeItem const* const child : myChildren) in priority()
345 for (FileTreeItem* const child : myChildren) in setSubtreePriority()
353 if (myChildren.isEmpty()) in isSubtreeWanted()
[all …]
H A DFileTreeItem.h56 return myChildren.at(row); in child()
61 return myChildren.size(); in childCount()
115 QList<FileTreeItem*> myChildren; variable
/dports/net-p2p/transmission-utils/transmission-3.00/qt/
H A DFileTreeItem.cc38 assert(myChildren.isEmpty()); in ~FileTreeItem()
44 myParent->myChildren.removeAt(pos); in ~FileTreeItem()
54 myChildren.append(child); in appendChild()
80 assert(this == myParent->myChildren[i]); in row()
191 for (FileTreeItem const* const i : myChildren) in getSubtreeWantedSize()
220 if (myChildren.isEmpty()) in size()
307 if (myChildren.isEmpty()) in priority()
325 for (FileTreeItem const* const child : myChildren) in priority()
345 for (FileTreeItem* const child : myChildren) in setSubtreePriority()
353 if (myChildren.isEmpty()) in isSubtreeWanted()
[all …]
H A DFileTreeItem.h56 return myChildren.at(row); in child()
61 return myChildren.size(); in childCount()
115 QList<FileTreeItem*> myChildren; variable
/dports/www/transmission-web/transmission-3.00/qt/
H A DFileTreeItem.cc38 assert(myChildren.isEmpty()); in ~FileTreeItem()
44 myParent->myChildren.removeAt(pos); in ~FileTreeItem()
54 myChildren.append(child); in appendChild()
80 assert(this == myParent->myChildren[i]); in row()
191 for (FileTreeItem const* const i : myChildren) in getSubtreeWantedSize()
220 if (myChildren.isEmpty()) in size()
307 if (myChildren.isEmpty()) in priority()
325 for (FileTreeItem const* const child : myChildren) in priority()
345 for (FileTreeItem* const child : myChildren) in setSubtreePriority()
353 if (myChildren.isEmpty()) in isSubtreeWanted()
[all …]
H A DFileTreeItem.h56 return myChildren.at(row); in child()
61 return myChildren.size(); in childCount()
115 QList<FileTreeItem*> myChildren; variable
/dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.platform.ui/bundles/org.eclipse.ui.ide/src/org/eclipse/ui/internal/views/markers/
H A DMarkerCategory.java57 MarkerEntry[] myChildren = children; in getChildren() local
58 if (myChildren != null) { in getChildren()
59 return myChildren; in getChildren()
71 myChildren = new MarkerEntry[totalSize]; in getChildren()
72 System.arraycopy(allMarkers, start, myChildren, 0, totalSize); in getChildren()
73 for (MarkerEntry markerEntry : myChildren) { in getChildren()
76 children = myChildren; in getChildren()
77 return myChildren; in getChildren()
/dports/cad/sumo/sumo-1.2.0/src/activitygen/city/
H A DAGHousehold.cpp61 while (static_cast<int>(myChildren.size()) < numChilds) { in generatePeople()
63 myChildren.push_back(chl); in generatePeople()
91 return static_cast<int>(myAdults.size() + myChildren.size()); in getPeopleNbr()
106 return myChildren; in getChildren()
137 for (itC = myChildren.begin(); itC != myChildren.end(); ++itC) { in regenerate()
165 for (it = myChildren.begin(); it != myChildren.end(); ++it) { in allocateChildrenSchool()
/dports/games/warzone2100/warzone2100/lib/widget/
H A Dlistwidget.cpp186 for (auto childIt = myChildren.begin(); childIt != myChildren.end(); childIt++) in widgetLost()
189 myChildren.erase(childIt); in widgetLost()
217 myChildren.push_back(widget); in addWidgetToLayout()
218 doLayout(myChildren.size() - 1); in addWidgetToLayout()
231 for (size_t n = pp * previousPage; n < pp * (previousPage + 1) && n < myChildren.size(); ++n) in setCurrentPage()
233 myChildren[n]->hide(); in setCurrentPage()
235 for (size_t n = pp * currentPage_; n < pp * (currentPage_ + 1) && n < myChildren.size(); ++n) in setCurrentPage()
237 myChildren[n]->show(); in setCurrentPage()
253 for (size_t n = 0; n < myChildren.size(); ++n) in doLayoutAll()
276 myChildren[num]->show(page == currentPage_); in doLayout()
[all …]
/dports/lang/gawk/gawk-5.1.1/test/
H A Ddtdgport.awk34 function print_elem(depth, element, c, atn, chl, n, i, myChildren) {
38 myChildren=""
42 if (myChildren=="")
43 myChildren = chl[2]
45 myChildren = myChildren " | " chl[2]
49 if (myChildren=="")
52 print indent "<!ELEMENT", element , "(", myChildren, ")* >"
66 gsub(/[\|]/, " ", myChildren)
67 n=split(myChildren, chl)
70 split(myChildren, chl)
/dports/deskutils/fbreader/FBReader-0.99.6-freebsdport/zlibrary/core/src/resources/
H A DZLResource.cpp55 std::map<std::string,shared_ptr<ZLTreeResource> > myChildren; member in ZLTreeResource
168 std::map<std::string,shared_ptr<ZLTreeResource> >::const_iterator it = myChildren.find(key); in operator []()
169 if (it != myChildren.end()) { in operator []()
210 shared_ptr<ZLTreeResource> node = myStack.top()->myChildren[sName]; in startElementHandler()
217 myStack.top()->myChildren[sName] = node; in startElementHandler()
/dports/deskutils/fbreader/FBReader-0.99.6-freebsdport/zlibrary/text/src/model/
H A DZLTextParagraph.cpp240 …myParent->myChildren.erase(std::find(myParent->myChildren.begin(), myParent->myChildren.end(), thi… in removeFromParent()
246 …for (std::vector<ZLTextTreeParagraph*>::const_iterator it = myChildren.begin(); it != myChildren.e… in fullSize()
/dports/games/trenchbroom/TrenchBroom-ed46601/common/src/Model/
H A DWorld.cpp113 const NodeList& myChildren = children(); in doCloneRecursively() local
114 assert(myChildren[0] == m_defaultLayer); in doCloneRecursively()
121 if (myChildren.size() > 1) { in doCloneRecursively()
123 childClones.reserve(myChildren.size() - 1); in doCloneRecursively()
124 …cloneRecursively(worldBounds, myChildren.begin() + 1, myChildren.end(), std::back_inserter(childCl… in doCloneRecursively()

123