| /dports/games/dunelegacy/dunelegacy-0.96.4/include/ |
| H A D | AStarSearch.h | 80 openList[current] = openList[parent]; in trickleUp()
88 openList[current] = bottom; in trickleUp()
102 openList.push_back(coord); in putOnOpenListIfBetter()
105 trickleUp(openList.size() - 1); in putOnOpenListIfBetter()
123 Coord ret = openList[0]; in extractMin()
126 openList[0] = openList.back(); in extractMin()
128 openList.pop_back(); in extractMin()
133 while(current < openList.size()/2) { in extractMin()
163 openList[current] = openList[smallerChild]; in extractMin()
170 openList[current] = top; in extractMin()
[all …]
|
| /dports/games/kapman/kapman-21.12.3/src/ |
| H A D | maze.cpp | 79 QList<QPoint> openList; in getPathToGhostCamp() local
96 if (m_cells[openList[i].y()][openList[i].x()].getCost() < lowestCost) { in getPathToGhostCamp()
97 lowestCost = m_cells[openList[i].y()][openList[i].x()].getCost(); in getPathToGhostCamp()
98 currentCell = openList[i]; in getPathToGhostCamp()
104 openList.removeAt(icurrent); in getPathToGhostCamp()
105 oldSize = openList.size(); in getPathToGhostCamp()
118 openList.append(tmpCell); in getPathToGhostCamp()
132 openList.append(tmpCell); in getPathToGhostCamp()
146 openList.append(tmpCell); in getPathToGhostCamp()
160 openList.append(tmpCell); in getPathToGhostCamp()
[all …]
|
| /dports/games/klines/klines-21.12.3/src/ |
| H A D | animator.cpp | 184 QList<PathNode*> openList; in findPath() local
189 openList.append( new PathNode(from) ); in findPath()
197 PathNode *minF = openList.at(0); in findPath()
198 for(int i=1; i<openList.count(); ++i) in findPath()
199 if( openList.at(i)->F < minF->F ) in findPath()
200 minF = openList.at(i); in findPath()
204 openList.removeAll(minF); in findPath()
235 openList.append( node ); in findPath()
239 PathNode *node = openList.at(idx); in findPath()
263 else if(openList.isEmpty()) in findPath()
[all …]
|
| /dports/graphics/krita/krita-4.4.8/plugins/flake/textshape/kotext/commands/ |
| H A D | DeleteCommand.cpp | 173 foreach (KoSection *sec, openList) { in visitBlock()
283 QList<KoSection *> openList; in finalizeSectionHandling() local
287 openList << handle.dataSec; in finalizeSectionHandling()
305 while (!openList.empty() && !closeListEndBlock.empty() in finalizeSectionHandling()
306 && openList.last()->name() == closeListEndBlock.first()->name()) { in finalizeSectionHandling()
309 .sectionModel()->findRowOfChild(openList.back()); in finalizeSectionHandling()
312 openList.back(), in finalizeSectionHandling()
317 openList.pop_back(); in finalizeSectionHandling()
320 openList << KoSectionUtils::sectionStartings(fmt2); in finalizeSectionHandling()
324 KoSectionUtils::setSectionStartings(fmt2, openList); in finalizeSectionHandling()
[all …]
|
| /dports/editors/calligra/calligra-3.2.1/libs/text/commands/ |
| H A D | DeleteCommand.cpp | 175 foreach (KoSection *sec, openList) { in visitBlock()
285 QList<KoSection *> openList; in finalizeSectionHandling() local
289 openList << handle.dataSec; in finalizeSectionHandling()
307 while (!openList.empty() && !closeListEndBlock.empty() in finalizeSectionHandling()
308 && openList.last()->name() == closeListEndBlock.first()->name()) { in finalizeSectionHandling()
311 .sectionModel()->findRowOfChild(openList.back()); in finalizeSectionHandling()
314 openList.back(), in finalizeSectionHandling()
319 openList.pop_back(); in finalizeSectionHandling()
322 openList << KoSectionUtils::sectionStartings(fmt2); in finalizeSectionHandling()
326 KoSectionUtils::setSectionStartings(fmt2, openList); in finalizeSectionHandling()
[all …]
|
| /dports/lang/intel-compute-runtime/compute-runtime-21.52.22081/shared/test/unit_test/compiler_interface/ |
| H A D | compiler_cache_tests.cpp | 242 auto openList = std::make_unique<std::list<std::string>>(2); in TEST() local
244 VariableBackup<std::list<std::string> *> openListBkp(&openListPtr, openList.get()); in TEST()
250 openList->clear(); in TEST()
276 EXPECT_EQ(openList->size(), static_cast<size_t>(2)); in TEST()
279 EXPECT_NE(std::find(openList->begin(), openList->end(), traceFile), openList->end()); in TEST()
280 EXPECT_NE(std::find(openList->begin(), openList->end(), inputFile), openList->end()); in TEST()
282 openList->clear(); in TEST()
|
| /dports/games/barony/Barony-3.3.7/src/ |
| H A D | paths.cpp | 194 list_t* openList, *closedList; in generatePath() local
357 openList = (list_t*) malloc(sizeof(list_t)); in generatePath()
358 openList->first = NULL; in generatePath()
359 openList->last = NULL; in generatePath()
398 list_FreeAll(openList); in generatePath()
399 free(openList); in generatePath()
502 if ( list_Size(openList) >= 1000 ) in generatePath()
504 list_FreeAll(openList); in generatePath()
506 free(openList); in generatePath()
530 list_FreeAll(openList); in generatePath()
[all …]
|
| /dports/devel/doxygen/doxygen-1.9.3/src/ |
| H A D | perlmodgen.cpp | 432 m_output.openList("doc"); in PerlModDocVisitor()
490 m_output.openList(s); in openSubBlock()
1308 .openList("parameters"); in visitPre()
1351 .openList("doc"); in visitPre()
1753 m_output.openList("members"); in generatePerlModSection()
1862 m_output.openList("base"); in generatePerlModForClass()
1889 m_output.openList("inner"); in generatePerlModForClass()
2110 m_output.openList("files"); in generatePerlModForGroup()
2217 m_output.openList("files"); in generatePerlModOutput()
2227 m_output.openList("groups"); in generatePerlModOutput()
[all …]
|
| /dports/graphics/recastnavigation/recastnavigation-e75adf86f91eb3082220085e42dda62679f9a3ea/RecastDemo/Source/ |
| H A D | NavMeshPruneTool.cpp | 141 std::vector<dtPolyRef> openList; in floodNavmesh() local
142 openList.push_back(start); in floodNavmesh()
144 while (openList.size()) in floodNavmesh()
146 const dtPolyRef ref = openList.back(); in floodNavmesh()
147 openList.pop_back(); in floodNavmesh()
165 openList.push_back(neiRef); in floodNavmesh()
|
| /dports/games/stendhal/stendhal-1.35/src/games/stendhal/server/core/pathfinder/ |
| H A D | Pathfinder.java | 80 private final PriorityQueue<TreeNode> openList = new PriorityQueue<TreeNode>(16, field in Pathfinder
134 openList.clear(); in Pathfinder()
152 openList.offer(startNode); in init()
218 if (openList.isEmpty()) { in getBest()
222 final TreeNode first = openList.poll(); in getBest()
559 openList.offer(child); in linkChild()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/pdfium/testing/resources/javascript/xfa_specific/ |
| H A D | xfa_host_pseudomodel.in | 66 expectError("xfa.host.openList()");
67 expectError("xfa.host.openList(1, 2)");
68 expect("xfa.host.openList('my_doc.subform_combox_0.combox')");
69 expect("xfa.host.openList(eval('my_doc.subform_combox_0'))");
|
| H A D | bug_996123.in | 31 xfa.host.openList("subform1.subform2.combobox")
|
| H A D | bug_1043508.in | 50 $host.openList("$form.#field[0]")
|
| H A D | bug_1109108.in | 47 xfa.host.openList(this);
|
| H A D | bug_1069789.in | 36 xfa.host.openList(f1);
|
| /dports/devel/eric6/eric6-21.11/eric/eric6/QScintilla/TypingCompleters/ |
| H A D | CompleterRuby.py | 149 openList = list(re.finditer("[({[]", txt))
150 index = len(openList) - 1
152 lastOpenIndex = openList[index].start()
|
| /dports/games/maxr/maxr-0.2.9/src/game/logic/ |
| H A D | movejobs.cpp | 130 openList.resize (Map->getSize().x() * Map->getSize().y() + 1, nullptr); in calcPath()
141 openList[Map->getOffset (source)] = StartNode; in calcPath()
150 openList[Map->getOffset (CurrentNode->position)] = nullptr; in calcPath()
230 if (openList[Map->getOffset (currentPosition)] == nullptr) in expandNodes()
239 openList[Map->getOffset (currentPosition)] = NewNode; in expandNodes()
249 if (costF < openList[Map->getOffset (currentPosition)]->costF) in expandNodes()
251 openList[Map->getOffset (currentPosition)]->costG = costG; in expandNodes()
252 openList[Map->getOffset (currentPosition)]->costH = costH; in expandNodes()
253 openList[Map->getOffset (currentPosition)]->costF = costF; in expandNodes()
254 openList[Map->getOffset (currentPosition)]->prev = ParentNode; in expandNodes()
[all …]
|
| /dports/www/p5-Newsletter/Newsletter-0.033/lib/Newsletter/ |
| H A D | Html.pm | 103 $self->openList;
132 $self->openList;
189 $self->openList;
|
| /dports/editors/abiword/abiword-3.0.5/src/wp/impexp/xp/ |
| H A D | ie_exp_HTML_DocumentWriter.h | 97 void openList(bool ordered, const gchar *szStyleName,
163 void openList(bool ordered, const gchar *szStyleName, const PP_AttrProp *pAP);
|
| H A D | ie_exp_HTML_DocumentWriter.cpp | 176 void IE_Exp_HTML_DocumentWriter::openList(bool ordered, const gchar *szStyleName, in openList() function in IE_Exp_HTML_DocumentWriter
557 void IE_Exp_HTML_XHTMLWriter::openList(bool ordered, in openList() function in IE_Exp_HTML_XHTMLWriter
560 IE_Exp_HTML_DocumentWriter::openList(ordered, szStyleName, pAP); in openList()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/pdfium/testing/resources/pixel/xfa_specific/ |
| H A D | bug_1273.in | 12 <script>host.openList("""")</script>
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/pdfium/fxjs/xfa/ |
| H A D | cjx_hostpseudomodel.h | 33 JSE_METHOD(openList);
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/pdfium/fxjs/xfa/ |
| H A D | cjx_hostpseudomodel.h | 32 JSE_METHOD(openList);
|
| /dports/games/opendungeons/OpenDungeons-0.7.1/source/gamemap/ |
| H A D | GameMap.cpp | 1460 std::vector<AstarEntry*> openList; in path() local
1461 openList.push_back(currentEntry); in path()
1471 if (openList.empty()) in path()
1475 auto smallestAstar = openList.rbegin(); in path()
1476 openList.pop_back(); in path()
1574 auto itr = openList.begin(); in path()
1575 while((itr != openList.end()) && in path()
1581 openList.insert(itr, entry); in path()
1602 auto itr = std::find(openList.begin(), openList.end(), neighborEntry); in path()
1603 if(itr == openList.end()) in path()
[all …]
|
| /dports/games/minetest/minetest-5.4.1/src/ |
| H A D | pathfinder.cpp | 1114 openList(PathfinderCompareHeuristic(this)); in updateCostHeuristic() local
1120 openList.push(source); in updateCostHeuristic()
1139 while (!openList.empty()) { in updateCostHeuristic()
1142 current_pos = openList.top(); in updateCostHeuristic()
1143 openList.pop(); in updateCostHeuristic()
1194 openList.push(neighbor); in updateCostHeuristic()
|