| /dports/biology/ugene/ugene-40.1/src/plugins/GUITestBase/src/ |
| H A D | GTUtilsPhyTree.cpp | 270 GraphicsRectangularBranchItem *rootBranch = getRootRectangularBranch(os); in getRootRectangularNode() local
271 GT_CHECK_RESULT(nullptr != rootBranch, "Root branch is NULL", nullptr); in getRootRectangularNode()
272 return rootBranch->getButton(); in getRootRectangularNode()
294 …reeOrderedRectangularBranches(HI::GUITestOpStatus &os, GraphicsRectangularBranchItem *rootBranch) { in getSubtreeOrderedRectangularBranches() argument
295 …GT_CHECK_RESULT(nullptr != rootBranch, "Subtree root branch is NULL", QList<GraphicsRectangularBra… in getSubtreeOrderedRectangularBranches()
297 const QList<QGraphicsItem *> childItems = rootBranch->getChildItems(); in getSubtreeOrderedRectangularBranches()
312 subtreeOrderedRectangularBranches << rootBranch; in getSubtreeOrderedRectangularBranches()
|
| H A D | GTUtilsPhyTree.h | 82 …treeOrderedRectangularBranches(HI::GUITestOpStatus &os, GraphicsRectangularBranchItem *rootBranch);
|
| /dports/x11-toolkits/plib/plib-1.8.5/src/ssg/ |
| H A D | ssgLoadIV.cxx | 87 ssgBranch *rootBranch = new ssgBranch(); in ssgLoadIV() local
91 if( !iv_parseSeparator( rootBranch, NULL, NULL ) ) in ssgLoadIV()
94 delete( rootBranch ); in ssgLoadIV()
102 return rootBranch ; in ssgLoadIV()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/include/llvm/ADT/ |
| H A D | IntervalMap.h | 1068 rootBranch().stop(rootSize - 1); in stop()
1158 IntervalMapImpl::NodeRef NR = rootBranch().safeLookup(x); in treeSafeLookup()
1198 rootBranch().subtree(n) = node[n]; in branchRoot()
1230 B->copy(rootBranch(), Pos, 0, Size[n]); in splitRoot()
1237 rootBranch().subtree(n) = Node[n]; in splitRoot()
1254 Refs.push_back(rootBranch().subtree(i)); in visitNodes()
1319 path.setRoot(&map->rootBranch(), map->rootSize, Offset); in setRoot()
1472 setRoot(map->rootBranch().findFrom(0, map->rootSize, x)); in treeFind()
1754 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insertNode()
1798 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insert()
[all …]
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/include/llvm/ADT/ |
| H A D | IntervalMap.h | 1069 rootBranch().stop(rootSize - 1); in stop()
1159 IntervalMapImpl::NodeRef NR = rootBranch().safeLookup(x); in treeSafeLookup()
1199 rootBranch().subtree(n) = node[n]; in branchRoot()
1231 B->copy(rootBranch(), Pos, 0, Size[n]); in splitRoot()
1238 rootBranch().subtree(n) = Node[n]; in splitRoot()
1255 Refs.push_back(rootBranch().subtree(i)); in visitNodes()
1325 path.setRoot(&map->rootBranch(), map->rootSize, Offset); in setRoot()
1478 setRoot(map->rootBranch().findFrom(0, map->rootSize, x)); in treeFind()
1760 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insertNode()
1804 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insert()
[all …]
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/include/llvm/ADT/ |
| H A D | IntervalMap.h | 1068 rootBranch().stop(rootSize - 1); in stop()
1158 IntervalMapImpl::NodeRef NR = rootBranch().safeLookup(x); in treeSafeLookup()
1198 rootBranch().subtree(n) = node[n]; in branchRoot()
1230 B->copy(rootBranch(), Pos, 0, Size[n]); in splitRoot()
1237 rootBranch().subtree(n) = Node[n]; in splitRoot()
1254 Refs.push_back(rootBranch().subtree(i)); in visitNodes()
1319 path.setRoot(&map->rootBranch(), map->rootSize, Offset); in setRoot()
1472 setRoot(map->rootBranch().findFrom(0, map->rootSize, x)); in treeFind()
1754 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insertNode()
1798 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insert()
[all …]
|
| /dports/devel/llvm10/llvm-10.0.1.src/include/llvm/ADT/ |
| H A D | IntervalMap.h | 1068 rootBranch().stop(rootSize - 1); in stop()
1158 IntervalMapImpl::NodeRef NR = rootBranch().safeLookup(x); in treeSafeLookup()
1198 rootBranch().subtree(n) = node[n]; in branchRoot()
1230 B->copy(rootBranch(), Pos, 0, Size[n]); in splitRoot()
1237 rootBranch().subtree(n) = Node[n]; in splitRoot()
1254 Refs.push_back(rootBranch().subtree(i)); in visitNodes()
1319 path.setRoot(&map->rootBranch(), map->rootSize, Offset); in setRoot()
1472 setRoot(map->rootBranch().findFrom(0, map->rootSize, x)); in treeFind()
1754 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insertNode()
1798 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insert()
[all …]
|
| /dports/graphics/llvm-mesa/llvm-13.0.1.src/include/llvm/ADT/ |
| H A D | IntervalMap.h | 1069 rootBranch().stop(rootSize - 1); in stop()
1159 IntervalMapImpl::NodeRef NR = rootBranch().safeLookup(x); in treeSafeLookup()
1199 rootBranch().subtree(n) = node[n]; in branchRoot()
1231 B->copy(rootBranch(), Pos, 0, Size[n]); in splitRoot()
1238 rootBranch().subtree(n) = Node[n]; in splitRoot()
1255 Refs.push_back(rootBranch().subtree(i)); in visitNodes()
1325 path.setRoot(&map->rootBranch(), map->rootSize, Offset); in setRoot()
1478 setRoot(map->rootBranch().findFrom(0, map->rootSize, x)); in treeFind()
1760 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insertNode()
1804 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insert()
[all …]
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/llvm/include/llvm/ADT/ |
| H A D | IntervalMap.h | 1064 rootBranch().stop(rootSize - 1); in stop()
1154 IntervalMapImpl::NodeRef NR = rootBranch().safeLookup(x); in treeSafeLookup()
1194 rootBranch().subtree(n) = node[n]; in branchRoot()
1226 B->copy(rootBranch(), Pos, 0, Size[n]); in splitRoot()
1233 rootBranch().subtree(n) = Node[n]; in splitRoot()
1250 Refs.push_back(rootBranch().subtree(i)); in visitNodes()
1315 path.setRoot(&map->rootBranch(), map->rootSize, Offset); in setRoot()
1468 setRoot(map->rootBranch().findFrom(0, map->rootSize, x)); in treeFind()
1750 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insertNode()
1794 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insert()
[all …]
|
| /dports/devel/llvm11/llvm-11.0.1.src/include/llvm/ADT/ |
| H A D | IntervalMap.h | 1068 rootBranch().stop(rootSize - 1); in stop()
1158 IntervalMapImpl::NodeRef NR = rootBranch().safeLookup(x); in treeSafeLookup()
1198 rootBranch().subtree(n) = node[n]; in branchRoot()
1230 B->copy(rootBranch(), Pos, 0, Size[n]); in splitRoot()
1237 rootBranch().subtree(n) = Node[n]; in splitRoot()
1254 Refs.push_back(rootBranch().subtree(i)); in visitNodes()
1319 path.setRoot(&map->rootBranch(), map->rootSize, Offset); in setRoot()
1472 setRoot(map->rootBranch().findFrom(0, map->rootSize, x)); in treeFind()
1754 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insertNode()
1798 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insert()
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| H A D | IntervalMap.h | 1068 rootBranch().stop(rootSize - 1); in stop()
1158 IntervalMapImpl::NodeRef NR = rootBranch().safeLookup(x); in treeSafeLookup()
1198 rootBranch().subtree(n) = node[n]; in branchRoot()
1230 B->copy(rootBranch(), Pos, 0, Size[n]); in splitRoot()
1237 rootBranch().subtree(n) = Node[n]; in splitRoot()
1254 Refs.push_back(rootBranch().subtree(i)); in visitNodes()
1319 path.setRoot(&map->rootBranch(), map->rootSize, Offset); in setRoot()
1472 setRoot(map->rootBranch().findFrom(0, map->rootSize, x)); in treeFind()
1754 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insertNode()
1798 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insert()
[all …]
|
| /dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/include/llvm/ADT/ |
| H A D | IntervalMap.h | 1072 rootBranch().stop(rootSize - 1); in stop()
1162 IntervalMapImpl::NodeRef NR = rootBranch().safeLookup(x); in treeSafeLookup()
1202 rootBranch().subtree(n) = node[n]; in branchRoot()
1234 B->copy(rootBranch(), Pos, 0, Size[n]); in splitRoot()
1241 rootBranch().subtree(n) = Node[n]; in splitRoot()
1258 Refs.push_back(rootBranch().subtree(i)); in visitNodes()
1328 path.setRoot(&map->rootBranch(), map->rootSize, Offset); in setRoot()
1481 setRoot(map->rootBranch().findFrom(0, map->rootSize, x)); in treeFind()
1763 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insertNode()
1807 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insert()
[all …]
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/include/llvm/ADT/ |
| H A D | IntervalMap.h | 1069 rootBranch().stop(rootSize - 1); in stop()
1159 IntervalMapImpl::NodeRef NR = rootBranch().safeLookup(x); in treeSafeLookup()
1199 rootBranch().subtree(n) = node[n]; in branchRoot()
1231 B->copy(rootBranch(), Pos, 0, Size[n]); in splitRoot()
1238 rootBranch().subtree(n) = Node[n]; in splitRoot()
1255 Refs.push_back(rootBranch().subtree(i)); in visitNodes()
1325 path.setRoot(&map->rootBranch(), map->rootSize, Offset); in setRoot()
1478 setRoot(map->rootBranch().findFrom(0, map->rootSize, x)); in treeFind()
1760 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insertNode()
1804 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insert()
[all …]
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/include/llvm/ADT/ |
| H A D | IntervalMap.h | 1069 rootBranch().stop(rootSize - 1); in stop()
1159 IntervalMapImpl::NodeRef NR = rootBranch().safeLookup(x); in treeSafeLookup()
1199 rootBranch().subtree(n) = node[n]; in branchRoot()
1231 B->copy(rootBranch(), Pos, 0, Size[n]); in splitRoot()
1238 rootBranch().subtree(n) = Node[n]; in splitRoot()
1255 Refs.push_back(rootBranch().subtree(i)); in visitNodes()
1325 path.setRoot(&map->rootBranch(), map->rootSize, Offset); in setRoot()
1478 setRoot(map->rootBranch().findFrom(0, map->rootSize, x)); in treeFind()
1760 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insertNode()
1804 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insert()
[all …]
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/include/llvm/ADT/ |
| H A D | IntervalMap.h | 1064 rootBranch().stop(rootSize - 1); in stop()
1154 IntervalMapImpl::NodeRef NR = rootBranch().safeLookup(x); in treeSafeLookup()
1194 rootBranch().subtree(n) = node[n]; in branchRoot()
1226 B->copy(rootBranch(), Pos, 0, Size[n]); in splitRoot()
1233 rootBranch().subtree(n) = Node[n]; in splitRoot()
1250 Refs.push_back(rootBranch().subtree(i)); in visitNodes()
1315 path.setRoot(&map->rootBranch(), map->rootSize, Offset); in setRoot()
1468 setRoot(map->rootBranch().findFrom(0, map->rootSize, x)); in treeFind()
1750 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insertNode()
1794 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insert()
[all …]
|
| /dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/include/llvm/ADT/ |
| H A D | IntervalMap.h | 1068 rootBranch().stop(rootSize - 1); in stop()
1158 IntervalMapImpl::NodeRef NR = rootBranch().safeLookup(x); in treeSafeLookup()
1198 rootBranch().subtree(n) = node[n]; in branchRoot()
1230 B->copy(rootBranch(), Pos, 0, Size[n]); in splitRoot()
1237 rootBranch().subtree(n) = Node[n]; in splitRoot()
1254 Refs.push_back(rootBranch().subtree(i)); in visitNodes()
1319 path.setRoot(&map->rootBranch(), map->rootSize, Offset); in setRoot()
1472 setRoot(map->rootBranch().findFrom(0, map->rootSize, x)); in treeFind()
1754 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insertNode()
1798 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insert()
[all …]
|
| /dports/devel/llvm13/llvm-project-13.0.1.src/llvm/include/llvm/ADT/ |
| H A D | IntervalMap.h | 1069 rootBranch().stop(rootSize - 1); in stop()
1159 IntervalMapImpl::NodeRef NR = rootBranch().safeLookup(x); in treeSafeLookup()
1199 rootBranch().subtree(n) = node[n]; in branchRoot()
1231 B->copy(rootBranch(), Pos, 0, Size[n]); in splitRoot()
1238 rootBranch().subtree(n) = Node[n]; in splitRoot()
1255 Refs.push_back(rootBranch().subtree(i)); in visitNodes()
1325 path.setRoot(&map->rootBranch(), map->rootSize, Offset); in setRoot()
1478 setRoot(map->rootBranch().findFrom(0, map->rootSize, x)); in treeFind()
1760 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insertNode()
1804 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insert()
[all …]
|
| /dports/devel/llvm90/llvm-9.0.1.src/include/llvm/ADT/ |
| H A D | IntervalMap.h | 1068 rootBranch().stop(rootSize - 1); in stop()
1158 IntervalMapImpl::NodeRef NR = rootBranch().safeLookup(x); in treeSafeLookup()
1198 rootBranch().subtree(n) = node[n]; in branchRoot()
1230 B->copy(rootBranch(), Pos, 0, Size[n]); in splitRoot()
1237 rootBranch().subtree(n) = Node[n]; in splitRoot()
1254 Refs.push_back(rootBranch().subtree(i)); in visitNodes()
1319 path.setRoot(&map->rootBranch(), map->rootSize, Offset); in setRoot()
1472 setRoot(map->rootBranch().findFrom(0, map->rootSize, x)); in treeFind()
1754 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insertNode()
1798 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insert()
[all …]
|
| /dports/devel/llvm80/llvm-8.0.1.src/include/llvm/ADT/ |
| H A D | IntervalMap.h | 1069 rootBranch().stop(rootSize - 1); in stop()
1159 IntervalMapImpl::NodeRef NR = rootBranch().safeLookup(x); in treeSafeLookup()
1199 rootBranch().subtree(n) = node[n]; in branchRoot()
1231 B->copy(rootBranch(), Pos, 0, Size[n]); in splitRoot()
1238 rootBranch().subtree(n) = Node[n]; in splitRoot()
1255 Refs.push_back(rootBranch().subtree(i)); in visitNodes()
1320 path.setRoot(&map->rootBranch(), map->rootSize, Offset); in setRoot()
1473 setRoot(map->rootBranch().findFrom(0, map->rootSize, x)); in treeFind()
1755 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insertNode()
1799 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insert()
[all …]
|
| /dports/devel/llvm70/llvm-7.0.1.src/include/llvm/ADT/ |
| H A D | IntervalMap.h | 1072 rootBranch().stop(rootSize - 1); in stop()
1149 IntervalMapImpl::NodeRef NR = rootBranch().safeLookup(x); in treeSafeLookup()
1189 rootBranch().subtree(n) = node[n]; in branchRoot()
1221 B->copy(rootBranch(), Pos, 0, Size[n]); in splitRoot()
1228 rootBranch().subtree(n) = Node[n]; in splitRoot()
1245 Refs.push_back(rootBranch().subtree(i)); in visitNodes()
1310 path.setRoot(&map->rootBranch(), map->rootSize, Offset); in setRoot()
1463 setRoot(map->rootBranch().findFrom(0, map->rootSize, x)); in treeFind()
1745 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insertNode()
1789 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); in insert()
[all …]
|
| /dports/www/nift/nsm-2.4.11/ |
| H A D | nsm.cpp | 642 if(!branches.count(project.rootBranch)) in main()
644 …start_err(std::cout) << "clone: rootBranch " << quote(project.rootBranch) << " is not present in t… in main()
653 if(project.outputBranch != project.rootBranch) in main()
1329 if(projectRootDirBranch != project.rootBranch) in main()
1331 …ctRootDirBranch) << " is not the same as rootBranch " << quote(project.rootBranch) << " in .nsm/ni… in main()
1718 if(projectRootDirBranch != project.rootBranch) in main()
1720 …ctRootDirBranch) << " is not the same as rootBranch " << quote(project.rootBranch) << " in .nsm/ni… in main()
|
| H A D | ProjectInfo.h | 52 rootBranch, member
|
| /dports/comms/cubicsdr/CubicSDR-0248e5a/src/forms/Bookmark/ |
| H A D | BookmarkView.cpp | 132 rootBranch = m_treeView->AddRoot("Root"); in BookmarkView()
133 activeBranch = m_treeView->AppendItem(rootBranch, "Active"); in BookmarkView()
134 rangeBranch = m_treeView->AppendItem(rootBranch, "View Ranges"); in BookmarkView()
135 bookmarkBranch = m_treeView->AppendItem(rootBranch, "Bookmarks"); in BookmarkView()
136 recentBranch = m_treeView->AppendItem(rootBranch, "Recents"); in BookmarkView()
|
| H A D | BookmarkView.h | 174 wxTreeItemId rootBranch, activeBranch, bookmarkBranch, recentBranch, rangeBranch; variable
|
| /dports/games/doomsday/doomsday-2.3.1/doomsday/sdk/libcore/src/data/ |
| H A D | pathtreenode.cpp | 106 return d->parent == &d->tree.rootBranch(); in isAtRootLevel()
|