/dports/games/0ad/0ad-0.0.23b-alpha/source/simulation2/components/tests/ |
H A D | test_Pathfinder.h | 251 const Grid<NavcellData>& obstructions = cmpPathfinder->GetPassabilityGrid(); in test_perf2_DISABLED() local 262 …stream << "<svg width='" << obstructions.m_W*scale << "' height='" << obstructions.m_H*scale << "'… in test_perf2_DISABLED() 263 …stream << "<g transform='translate(0 " << obstructions.m_H*scale << ") scale(" << scale << " -" <<… in test_perf2_DISABLED() 266 DumpGrid(stream, obstructions, obstructionsMask); in test_perf2_DISABLED() 306 const Grid<NavcellData>& obstructions = cmpPathfinder->GetPassabilityGrid(); in test_perf3_DISABLED() local 316 …stream << "<svg width='" << obstructions.m_W*scale << "' height='" << obstructions.m_H*scale << "'… in test_perf3_DISABLED() 320 …stream << "<g transform='translate(0 " << obstructions.m_H*scale << ") scale(" << scale << " -" <<… in test_perf3_DISABLED() 323 DumpGrid(stream, obstructions, obstructionsMask); in test_perf3_DISABLED()
|
/dports/editors/calligra/calligra-3.2.1/words/part/ |
H A D | KWRootAreaProviderBase.cpp | 146 QList<KoTextLayoutObstruction*> obstructions; in relevantObstructions() local 152 return obstructions; in relevantObstructions() 204 obstructions.append(obstruction); in relevantObstructions() 208 return obstructions; in relevantObstructions()
|
/dports/editors/calligra/calligra-3.2.1/libs/textlayout/tests/ |
H A D | MockRootAreaProvider.cpp | 76 QList<KoTextLayoutObstruction*> obstructions; in relevantObstructions() local 77 return obstructions; in relevantObstructions()
|
/dports/games/0ad/0ad-0.0.23b-alpha/source/simulation2/helpers/ |
H A D | Pathfinding.h | 342 std::wstring obstructions = node.GetChild("Obstructions").ToString(); in PathfinderPassability() local 343 if (obstructions == L"none") in PathfinderPassability() 345 else if (obstructions == L"pathfinding") in PathfinderPassability() 347 else if (obstructions == L"foundation") in PathfinderPassability()
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/ios/chrome/browser/ui/bookmarks/ |
H A D | bookmark_utils_ios.mm | 432 const NodeSet& obstructions); 438 // of any of the nodes in |obstructions|. 439 bool IsObstructed(const BookmarkNode* node, const NodeSet& obstructions); 473 bool IsObstructed(const BookmarkNode* node, const NodeSet& obstructions) { 478 if (FolderHasAncestorInBookmarkNodes(node, obstructions)) 485 const NodeSet& obstructions) { 488 if (!IsObstructed(subfolder.get(), obstructions)) 501 UpdateFoldersFromNode(node, results, obstructions); 513 NodeVector VisibleNonDescendantNodes(const NodeSet& obstructions, 520 if (IsObstructed(node, obstructions)) [all …]
|
H A D | bookmark_utils_ios_unittest.mm | 214 std::set<const BookmarkNode*> obstructions; 216 obstructions.insert(gaga); 217 obstructions.insert(lindsey); 220 bookmark_utils_ios::VisibleNonDescendantNodes(obstructions,
|
/dports/math/gap/gap-4.11.0/pkg/gbnp/lib/ |
H A D | graphs.gi | 165 ### Given some set of `obstructions' <A>O</A> and an alphabet size <A>n</A> 173 ### - Given some set of obstructions and an alphabet size 179 ### O - a set of obstructions 210 # 2. The proper suffices of obstructions 403 ### - Given obstructions and an alphabet size <A>n</A>, compute the growth 407 ### O - list of obstructions, none divides another 460 ### Computes the graph of chains of a given set of `obstructions' <A>O</A> with 465 ### - Computes the graph of chains of a given set of obstructions 468 ### O - Set of obstructions 496 # Create tree of obstructions [all …]
|
H A D | grobner.gi | 237 ### [] - if R[j] has no self obstructions 269 ### ans - List of found left-obstructions 316 ### obstructions 748 ### obstructions 911 # - Compute all possible obstructions 1065 # - Compute all possible obstructions 1460 ### ans - List of found left-obstructions 1540 ### ans - List of found left-obstructions 1806 # calculate all obstructions from Gsingle 1865 obs, # the set of obstructions [all …]
|
H A D | fincheck.gi | 55 # HilbertSeriesQA starts from a set of obstructions. 97 ### Tree - a tree of reversed obstructions 132 ### The left-reduced list of `obstructions', 157 ### ulist - a list of obstructions 163 ### - the left-reduced list of obstructions, obtained by applying 178 # Add the obstructions to the tree 610 ### - Given a set of obstructions, it computes the Hilbert series up to 619 ### O - Set of obstructions 650 # Create tree of obstructions 653 # Create left-tree of obstructions
|
/dports/games/xataxx/xataxx/ |
H A D | input.format | 3 Xobstruct, Yobstruct (Positions of obstructions)
|
/dports/comms/splat/splat-1.4.2/ |
H A D | splat-1.4.2.lsm | 11 terrain, bearings and distances to known obstructions, 16 clearance and line-of-sight RF paths absent of obstructions
|
/dports/graphics/krita/krita-4.4.8/plugins/flake/textshape/ |
H A D | SimpleRootAreaProvider.cpp | 183 QList<KoTextLayoutObstruction *> obstructions; in relevantObstructions() local 189 return obstructions; in relevantObstructions()
|
/dports/cad/openroad/OpenROAD-2.0/src/grt/src/ |
H A D | Grid.cpp | 57 const std::map<int, std::vector<odb::Rect>>& obstructions) in init() argument 74 obstructions_ = obstructions; in init()
|
H A D | Grid.h | 88 const std::map<int, std::vector<odb::Rect>>& obstructions);
|
/dports/cad/openroad/OpenROAD-2.0/src/OpenDB/src/db/ |
H A D | dbHierInstShapeItr.cpp | 203 dbSet<dbObstruction> obstructions = child->getObstructions(); in iterate_inst() local 206 for (oitr = obstructions.begin(); oitr != obstructions.end(); ++oitr) { in iterate_inst()
|
/dports/graphics/krita/krita-4.4.8/plugins/flake/textshape/textlayout/ |
H A D | RunAroundHelper.h | 35 void setObstructions(const QList<KoTextLayoutObstruction *> &obstructions);
|
H A D | RunAroundHelper.cpp | 42 void RunAroundHelper::setObstructions(const QList<KoTextLayoutObstruction*> &obstructions) in setObstructions() argument 44 m_obstructions = obstructions; in setObstructions()
|
/dports/editors/calligra/calligra-3.2.1/libs/textlayout/ |
H A D | RunAroundHelper.h | 35 void setObstructions(const QList<KoTextLayoutObstruction *> &obstructions);
|
H A D | RunAroundHelper.cpp | 46 void RunAroundHelper::setObstructions(const QList<KoTextLayoutObstruction*> &obstructions) in setObstructions() argument 48 m_obstructions = obstructions; in setObstructions()
|
/dports/editors/calligra/calligra-3.2.1/plugins/textshape/ |
H A D | SimpleRootAreaProvider.cpp | 205 QList<KoTextLayoutObstruction*> obstructions; in relevantObstructions() local 211 return obstructions; in relevantObstructions()
|
/dports/cad/qrouter/qrouter-1.4.85/ |
H A D | README | 182 can interpreted as obstructions when routing a 215 of obstructions. Analyze all the resultant 242 to identify positions as obstructions to 253 already routed by adding them as obstructions
|
/dports/games/openage/openage-0.3.0-1262-ga554ab49/doc/code/ |
H A D | pathfinding.md | 22 For speedup: assemble multiple obstructions to convex hulls.
|
/dports/graphics/ossim/ossim-OrchidIsland-2.11.1/share/ossim/util/ |
H A D | ossimHlzUtil.kwl | 25 // Specifies ancillary point-cloud data file(s) for level-2 search for obstructions.
|
/dports/math/gap/gap-4.11.0/pkg/fr-2.4.6/ |
H A D | TODO | 43 … given obstruction, compute quotient machine. More generally, find a common format for obstructions
|
/dports/cad/openroad/OpenROAD-2.0/src/dpl/src/ |
H A D | Grid.cpp | 126 auto obstructions = master->getObstructions(); in visitCellPixels() local 128 for (dbBox *obs : obstructions) { in visitCellPixels()
|