| /dports/audio/linuxsampler/linuxsampler-2.2.0/src/common/ |
| H A D | RTAVLTreeTest.cpp | 321 usedNodes.erase(usedNodes.begin()+idx); in testTreeInsertAndEraseWithRandomNumbers()
328 while (!usedNodes.empty()) { in testTreeInsertAndEraseWithRandomNumbers()
335 usedNodes.erase(usedNodes.begin()+idx); in testTreeInsertAndEraseWithRandomNumbers()
360 usedNodes.erase(usedNodes.begin()+idx); in testTreeInsertAndEraseWithRandomNumbers()
367 while (!usedNodes.empty()) { in testTreeInsertAndEraseWithRandomNumbers()
374 usedNodes.erase(usedNodes.begin()+idx); in testTreeInsertAndEraseWithRandomNumbers()
445 usedNodes.erase(usedNodes.begin()+idx); in testTwinsWithRandomNumbers()
452 while (!usedNodes.empty()) { in testTwinsWithRandomNumbers()
459 usedNodes.erase(usedNodes.begin()+idx); in testTwinsWithRandomNumbers()
484 usedNodes.erase(usedNodes.begin()+idx); in testTwinsWithRandomNumbers()
[all …]
|
| /dports/devel/rgbds/rgbds/src/asm/ |
| H A D | charmap.c | 40 size_t usedNodes; /* How many nodes are being used */ member
102 charmap->usedNodes = base->usedNodes; in charmap_New()
104 memcpy(charmap->nodes, base->nodes, sizeof(base->nodes[0]) * charmap->usedNodes); in charmap_New()
107 charmap->usedNodes = 1; in charmap_New()
173 node->next[c] = charmap->usedNodes; in charmap_Add()
175 if (charmap->usedNodes == charmap->capacity) { in charmap_Add()
182 node = &charmap->nodes[charmap->usedNodes++]; in charmap_Add()
|
| H A D | lexer.c | 605 uint16_t usedNodes = 1; in lexer_Init() local
619 assert(usedNodes < sizeof(keywordDict) / sizeof(*keywordDict)); in lexer_Init()
622 keywordDict[nodeID].children[*ptr - ' '] = usedNodes; in lexer_Init()
623 usedNodes++; in lexer_Init()
634 ARRAY_SIZE(keywords), usedNodes, ARRAY_SIZE(keywordDict)); in lexer_Init()
|
| /dports/devel/R-cran-future/future/tests/ |
| H A D | invalid-owner.R | 4 usedNodes <- function(future) { function
73 print(usedNodes(f1))
80 print(usedNodes(f2))
|
| /dports/astro/marble/marble-21.12.3/src/plugins/runner/osm/ |
| H A D | OsmRelation.cpp | 50 …Document *document, OsmWays &ways, const OsmNodes &nodes, QSet<qint64> &usedNodes, QSet<qint64> &u… in createMultipolygon() argument
102 OsmRings const inner = rings(innerRoles, ways, nodes, usedNodes, innerWays); in createMultipolygon()
155 usedNodes |= outerNodes; in createMultipolygon()
204 …gList &roles, const OsmWays &ways, const OsmNodes &nodes, QSet<qint64> &usedNodes, QSet<qint64> &u… in rings() argument
300 usedNodes |= currentNodes; in rings()
|
| H A D | OsmRelation.h | 28 …Document* document, OsmWays &ways, const OsmNodes &nodes, QSet<qint64> &usedNodes, QSet<qint64> &u…
46 …gList &roles, const OsmWays &ways, const OsmNodes &nodes, QSet<qint64> &usedNodes, QSet<qint64> &u…
|
| H A D | OsmParser.cpp | 227 QSet<qint64> usedNodes, usedWays; in createDocument() local
229 relation.createMultipolygon(document, ways, nodes, usedNodes, usedWays); in createDocument()
237 auto placemark = iter.value().create(nodes, usedNodes); in createDocument()
244 for(auto id: usedNodes) { in createDocument()
|
| H A D | OsmWay.cpp | 22 GeoDataPlacemark *OsmWay::create(const OsmNodes &nodes, QSet<qint64> &usedNodes) const in create()
41 usedNodes << nodeId; in create()
68 usedNodes << nodeId; in create()
|
| H A D | OsmWay.h | 30 GeoDataPlacemark* create(const OsmNodes &nodes, QSet<qint64> &usedNodes) const;
|
| /dports/math/ogdf/OGDF/src/ogdf/graphalg/ |
| H A D | EdgeIndependentSpanningTrees.cpp | 92 NodeArray<unsigned int> usedNodes(*m_G, 0); in pathExists() local
94 usedNodes[v1] = 1; in pathExists()
100 if (usedNodes[nv] == 1) { // node connected to v1, but environement of node not yet checked in pathExists()
101 usedNodes[nv] = 2; in pathExists()
109 if (usedNodes[nt] == 0) { in pathExists()
111 usedNodes[nt] = 1; in pathExists()
|
| /dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jaxws/src/share/jaxws_classes/com/sun/xml/internal/bind/v2/runtime/ |
| H A D | AssociationMap.java | 67 private final Set<XmlNode> usedNodes = new HashSet<XmlNode>(); field in AssociationMap
119 usedNodes.add(n); in addUsed()
|
| /dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/jaxws/src/share/jaxws_classes/com/sun/xml/internal/bind/v2/runtime/ |
| H A D | AssociationMap.java | 67 private final Set<XmlNode> usedNodes = new HashSet<XmlNode>(); field in AssociationMap
119 usedNodes.add(n); in addUsed()
|
| /dports/devel/R-cran-future/future/R/ |
| H A D | nbrOfWorkers.R | 120 usedNodes <- length(FutureRegistry(reg, action = "list", earlySignal = FALSE)) functionVar
122 workers <- workers - usedNodes
|
| H A D | ClusterFuture-class.R | 527 usedNodes <- function() { function
540 used <- usedNodes()
|
| /dports/games/libretro-scummvm/scummvm-7b1e929/engines/tinsel/ |
| H A D | heapmem.cpp | 77 int usedNodes = 0; in MemoryStats() local
87 usedNodes++; in MemoryStats()
98 usedNodes, allocedNodes, lockedNodes, lockedSize, totalSize); in MemoryStats()
|
| /dports/games/scummvm/scummvm-2.5.1/engines/tinsel/ |
| H A D | heapmem.cpp | 76 int usedNodes = 0; in MemoryStats() local
86 usedNodes++; in MemoryStats()
97 usedNodes, allocedNodes, lockedNodes, lockedSize, totalSize); in MemoryStats()
|
| /dports/mail/trojita/trojita-0.7/src/Imap/Model/ |
| H A D | ThreadingMsgListModel.cpp | 707 QSet<uint> usedNodes; in slotIncrementalThreadingAvailable() local
711 registerThreading(it->thread, 0, uidToPtrCache, usedNodes); in slotIncrementalThreadingAvailable()
921 QSet<uint> usedNodes; in applyThreading() local
957 usedNodes.insert(0); in applyThreading()
960 registerThreading(mapping, 0, uidToPtrCache, usedNodes); in applyThreading()
965 if (usedNodes.contains(it.key())) { in applyThreading()
984 …:ThreadingNode> &mapping, uint parentId, const QHash<uint,void *> &uidToPtr, QSet<uint> &usedNodes) in registerThreading() argument
1016 usedNodes.insert(nodeId); in registerThreading()
1017 registerThreading(node.children, nodeId, uidToPtr, usedNodes); in registerThreading()
|
| H A D | ThreadingMsgListModel.h | 217 const QHash<uint,void *> &uidToPtr, QSet<uint> &usedNodes);
|
| /dports/databases/pgadmin3/pgadmin3-1.22.2/pgadmin/include/slony/ |
| H A D | dlgRepCluster.h | 72 wxArrayLong usedNodes; variable
|
| /dports/cad/yosys/yosys-yosys-0.12/libs/subcircuit/ |
| H A D | subcircuit.cc | 297 std::vector<bool> usedNodes; member
923 else if (!allowOverlap && haystack.usedNodes[j]) in pruneEnumerationMatrix()
1168 haystack.usedNodes[*enumerationMatrix[j].begin()] = true; in ullmannRecursion()
1195 if (!allowOverlap && haystack.usedNodes[j]) in ullmannRecursion()
1208 if (!allowOverlap && haystack.usedNodes[j] && iter > 0) in ullmannRecursion()
1274 haystack.usedNodes.resize(haystack.graph.nodes.size()); in solveForMining()
1554 haystack.usedNodes.resize(haystack.graph.nodes.size()); in solve()
1580 it.second.usedNodes.clear(); in clearOverlapHistory()
|
| /dports/databases/pgadmin3/pgadmin3-1.22.2/pgadmin/slony/ |
| H A D | dlgRepCluster.cpp | 676 usedNodes.Clear(); in OnChangeCluster()
684 usedNodes.Add(set->GetLong(wxT("no_id"))); in OnChangeCluster()
952 for (i = 0 ; i < usedNodes.GetCount() && enable; i++) in CheckChange()
953 CheckValid(enable, nodeId != usedNodes[i], _("Node ID is already in use.")); in CheckChange()
|
| /dports/textproc/opensearch-dashboards/opensearch-dashboards-1.2.0-linux-x64/plugins/observabilityDashboards/node_modules/vis-network/esnext/esm/ |
| H A D | vis-network.min.js.map | 1 …usedNodes = {};\n let edge, edges, relevantEdgeCount;\n // collect the nodes that will be in…
|
| /dports/textproc/opensearch-dashboards/opensearch-dashboards-1.2.0-linux-x64/plugins/observabilityDashboards/node_modules/vis-network/esnext/umd/ |
| H A D | vis-network.min.js.map | 1 …usedNodes = {};\n let edge, edges, relevantEdgeCount;\n // collect the nodes that will be in…
|
| /dports/textproc/opensearch-dashboards/opensearch-dashboards-1.2.0-linux-x64/plugins/observabilityDashboards/node_modules/vis-network/peer/umd/ |
| H A D | vis-network.min.js.map | 1 …usedNodes = {};\n let edge, edges, relevantEdgeCount;\n // collect the nodes that will be in…
|
| /dports/textproc/opensearch-dashboards/opensearch-dashboards-1.2.0-linux-x64/plugins/observabilityDashboards/node_modules/vis-network/peer/esm/ |
| H A D | vis-network.min.js.map | 1 …usedNodes = {};\n let edge, edges, relevantEdgeCount;\n // collect the nodes that will be in…
|