| /dports/graphics/geos/geos-3.9.1/src/operation/valid/ |
| H A D | ConnectedInteriorTester.cpp | 146 EdgeRing* er = edgeRings[i]; in isInteriorsConnected() local
176 DirectedEdge* de = detail::down_cast<DirectedEdge*>((*ee)[i]); in setInteriorEdgesInResult() local
196 DirectedEdge* de = detail::down_cast<DirectedEdge*>((*dirEdges)[i]); in buildEdgeRings() local
204 MaximalEdgeRing* er = new MaximalEdgeRing(de, in buildEdgeRings() local
257 DirectedEdge* de = static_cast<DirectedEdge*>(graph.findEdgeEnd(e)); in visitInteriorRing() local
274 DirectedEdge* de = start; in visitLinkedDirectedEdges() local
300 EdgeRing* er = *it; in hasUnvisitedShellEdge() local
309 DirectedEdge* de = edges[0]; in hasUnvisitedShellEdge() local
|
| /dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/operation/overlay/ |
| H A D | MaximalEdgeRing.java | 51 public DirectedEdge getNext(DirectedEdge de) in getNext()
55 public void setEdgeRing(DirectedEdge de, EdgeRing er) in setEdgeRing()
66 DirectedEdge de = startDe; in linkDirectedEdgesForMinimalEdgeRings() local
77 DirectedEdge de = startDe; in buildMinimalRings() local
|
| H A D | MinimalEdgeRing.java | 37 public DirectedEdge getNext(DirectedEdge de) in getNext()
41 public void setEdgeRing(DirectedEdge de, EdgeRing er) in setEdgeRing()
|
| H A D | PolygonBuilder.java | 89 DirectedEdge de = (DirectedEdge) it.next(); in buildMaximalEdgeRings() local
93 MaximalEdgeRing er = new MaximalEdgeRing(de, geometryFactory); in buildMaximalEdgeRings() local
107 MaximalEdgeRing er = (MaximalEdgeRing) it.next(); in buildMinimalEdgeRings() local
143 EdgeRing er = (MinimalEdgeRing) it.next(); in findShell() local
166 MinimalEdgeRing er = (MinimalEdgeRing) it.next(); in placePolygonHoles() local
182 EdgeRing er = (EdgeRing) it.next(); in sortShellsAndHoles() local
273 EdgeRing er = (EdgeRing) it.next(); in computePolygons() local
|
| /dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/operation/valid/ |
| H A D | ConnectedInteriorTester.java | 109 DirectedEdge de = (DirectedEdge) it.next(); in setInteriorEdgesInResult() local
125 DirectedEdge de = (DirectedEdge) it.next(); in buildEdgeRings() local
129 MaximalEdgeRing er = new MaximalEdgeRing(de, geometryFactory); in buildEdgeRings() local
171 DirectedEdge de = (DirectedEdge) graph.findEdgeEnd(e); in visitInteriorRing() local
187 DirectedEdge de = start; in visitLinkedDirectedEdges() local
208 EdgeRing er = (EdgeRing) edgeRings.get(i); in hasUnvisitedShellEdge() local
213 DirectedEdge de = (DirectedEdge) edges.get(0); in hasUnvisitedShellEdge() local
|
| /dports/graphics/geos/geos-3.9.1/include/geos/operation/overlay/ |
| H A D | MinimalEdgeRing.inl | 33 MinimalEdgeRing::setEdgeRing(geomgraph::DirectedEdge* de, geomgraph::EdgeRing* er)
39 MinimalEdgeRing::getNext(geomgraph::DirectedEdge* de)
|
| /dports/games/doomsday/doomsday-2.3.1/doomsday/sdk/libcore/src/concurrency/ |
| H A D | task.cpp | 23 namespace de { namespace
34 catch (Error const &er) in run() local
|
| /dports/graphics/geos/geos-3.9.1/src/operation/overlay/ |
| H A D | MaximalEdgeRing.cpp | 64 MaximalEdgeRing::getNext(DirectedEdge* de) in getNext()
71 MaximalEdgeRing::setEdgeRing(DirectedEdge* de, EdgeRing* er) in setEdgeRing()
80 DirectedEdge* de = startDe; in linkDirectedEdgesForMinimalEdgeRings() local
108 DirectedEdge* de = startDe; in buildMinimalRings() local
123 DirectedEdge* de = startDe; in buildMinimalRings() local
|
| H A D | PolygonBuilder.cpp | 84 DirectedEdge* de = detail::down_cast<DirectedEdge*>(ee[i]); in add() local
152 DirectedEdge* de = (*dirEdges)[i]; in buildMaximalEdgeRings() local
162 MaximalEdgeRing* er; in buildMaximalEdgeRings() local
194 MaximalEdgeRing* er = maxEdgeRings[i]; in buildMinimalEdgeRings() local
234 EdgeRing* er = (*minEdgeRings)[i]; in findShell() local
254 MinimalEdgeRing* er = (*minEdgeRings)[i]; in placePolygonHoles() local
267 EdgeRing* er = edgeRings[i]; in sortShellsAndHoles() local
374 EdgeRing* er = newShellList[i]; in computePolygons() local
|
| /dports/games/doomsday/doomsday-2.3.1/doomsday/sdk/libcore/src/data/ |
| H A D | refuge.cpp | 26 namespace de { namespace
42 catch (Error const &er) in Refuge() local
61 catch (Error const &er) in ~Refuge() local
|
| H A D | infobank.cpp | 25 namespace de { namespace
94 catch (Error const &er) in parse() local
108 catch (Error const &er) in parse() local
|
| /dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/geomgraph/ |
| H A D | DirectedEdgeStar.java | 52 DirectedEdge de = (DirectedEdge) ee; in insert() local
62 DirectedEdge de = (DirectedEdge) it.next(); in getOutgoingDegree() local
67 public int getOutgoingDegree(EdgeRing er) in getOutgoingDegree()
71 DirectedEdge de = (DirectedEdge) it.next(); in getOutgoingDegree() local
137 DirectedEdge de = (DirectedEdge) it.next(); in mergeSymLabels() local
149 DirectedEdge de = (DirectedEdge) it.next(); in updateLabelling() local
162 DirectedEdge de = (DirectedEdge) it.next(); in getResultAreaEdges() local
232 public void linkMinimalDirectedEdges(EdgeRing er) in linkMinimalDirectedEdges()
344 public void computeDepths(DirectedEdge de) in computeDepths()
380 DirectedEdge de = (DirectedEdge) it.next(); in print() local
|
| H A D | EdgeRing.java | 105 abstract public DirectedEdge getNext(DirectedEdge de); in getNext()
106 abstract public void setEdgeRing(DirectedEdge de, EdgeRing er); in setEdgeRing()
120 DirectedEdge de = start; in computePoints() local
151 DirectedEdge de = startDe; in computeMaxNodeDegree() local
164 DirectedEdge de = startDe; in setInResult() local
|
| /dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/operation/polygonize/ |
| H A D | PolygonizeGraph.java | 55 PolygonizeDirectedEdge de = (PolygonizeDirectedEdge) i.next(); in getDegreeNonDeleted() local
66 PolygonizeDirectedEdge de = (PolygonizeDirectedEdge) i.next(); in getDegree() local
79 PolygonizeDirectedEdge de = (PolygonizeDirectedEdge) i.next(); in deleteAllEdges() local
152 PolygonizeDirectedEdge de = (PolygonizeDirectedEdge) i.next(); in convertMaximalToMinimalEdgeRings() local
174 PolygonizeDirectedEdge de = startDE; in findIntersectionNodes() local
209 PolygonizeDirectedEdge de = (PolygonizeDirectedEdge) i.next(); in getEdgeRings() local
213 EdgeRing er = findEdgeRing(de); in getEdgeRings() local
233 PolygonizeDirectedEdge de = (PolygonizeDirectedEdge) i.next(); in findLabeledEdgeRings() local
357 EdgeRing er = new EdgeRing(factory); in findEdgeRing() local
419 PolygonizeDirectedEdge de = null; //findLowestDirEdge(); in computeDepthParity() local
[all …]
|
| /dports/games/doomsday/doomsday-2.3.1/doomsday/sdk/libappfw/src/widgets/ |
| H A D | scriptcommandwidget.cpp | 34 namespace de { namespace
132 catch (Error const &er) in isAcceptedAsCommand() local
151 catch (Error const &er) in executeCommand() local
|
| /dports/graphics/geos/geos-3.9.1/src/geomgraph/ |
| H A D | DirectedEdgeStar.cpp | 52 DirectedEdge* de = detail::down_cast<DirectedEdge*>(ee); in insert() local
62 DirectedEdge* de = detail::down_cast<DirectedEdge*>(ee); in getOutgoingDegree() local
72 DirectedEdgeStar::getOutgoingDegree(EdgeRing* er) in getOutgoingDegree()
78 DirectedEdge* de = detail::down_cast<DirectedEdge*>(*it); in getOutgoingDegree() local
167 DirectedEdge* de = detail::down_cast<DirectedEdge*>(*it); in mergeSymLabels() local
186 DirectedEdge* de = detail::down_cast<DirectedEdge*>(*it); in updateLabelling() local
204 DirectedEdge* de = detail::down_cast<DirectedEdge*>(*it); in getResultAreaEdges() local
272 DirectedEdgeStar::linkMinimalDirectedEdges(EdgeRing* er) in linkMinimalDirectedEdges()
423 DirectedEdgeStar::computeDepths(DirectedEdge* de) in computeDepths()
470 DirectedEdge* de = detail::down_cast<DirectedEdge*>(*it); in print() local
|
| H A D | EdgeRing.cpp | 195 DirectedEdge* de = newStart; in computePoints() local
242 DirectedEdge* de = startDe; in computeMaxNodeDegree() local
264 DirectedEdge* de = startDe; in setInResult() local
372 operator<< (std::ostream& os, const EdgeRing& er) in operator <<()
|
| /dports/games/doomsday/doomsday-2.3.1/doomsday/sdk/libgui/src/graphics/ |
| H A D | gltextureframebuffer.cpp | 27 namespace de { namespace
179 catch (ConfigError const &er) in DENG2_STATIC_PROPERTY() local
190 catch (ConfigError const &er) in DENG2_STATIC_PROPERTY() local
201 catch (ConfigError const &er) in DENG2_STATIC_PROPERTY() local
|
| /dports/graphics/geos/geos-3.9.1/src/operation/polygonize/ |
| H A D | PolygonizeGraph.cpp | 52 for(const auto& de : edges) { in getDegreeNonDeleted() local
65 for(const auto& de : edges) { in getDegree() local
81 for(const auto& de : edges) { in deleteAllEdges() local
208 PolygonizeDirectedEdge* de = startDE; in findIntersectionNodes() local
246 EdgeRing* er = findEdgeRing(pde); in getEdgeRings() local
326 for(auto& de : dirEdges) { in label() local
378 PolygonizeDirectedEdge* de = detail::down_cast<PolygonizeDirectedEdge*>(edges[i - 1]); in computeNextCCWEdges() local
413 PolygonizeDirectedEdge* de = startDE; in findEdgeRing() local
414 EdgeRing* er = new EdgeRing(factory); in findEdgeRing() local
|
| /dports/graphics/geos/geos-3.9.1/include/geos/geomgraph/ |
| H A D | DirectedEdge.inl | 57 DirectedEdge::setEdgeRing(EdgeRing* er)
99 DirectedEdge::setSym(DirectedEdge* de)
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/intrusive/test/ |
| H A D | test_container.hpp | 189 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
287 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
353 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
405 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
410 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
424 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_associative_container_invariants() local
433 std::pair<const_iterator, const_iterator> er = c.equal_range(key_of_value()(*di)); in test_associative_container_invariants() local
472 for( typename Data::const_iterator di = d.begin(), de = d.end() ; in test_unordered_associative_container_invariants() local
482 std::pair<const_iterator, const_iterator> er = c.equal_range(key_of_value()(*di)); in test_unordered_associative_container_invariants() local
|
| /dports/devel/boost-docs/boost_1_72_0/libs/intrusive/test/ |
| H A D | test_container.hpp | 189 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
287 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
353 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
405 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
410 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
424 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_associative_container_invariants() local
433 std::pair<const_iterator, const_iterator> er = c.equal_range(key_of_value()(*di)); in test_associative_container_invariants() local
472 for( typename Data::const_iterator di = d.begin(), de = d.end() ; in test_unordered_associative_container_invariants() local
482 std::pair<const_iterator, const_iterator> er = c.equal_range(key_of_value()(*di)); in test_unordered_associative_container_invariants() local
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/intrusive/test/ |
| H A D | test_container.hpp | 187 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
285 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
351 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
403 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
408 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
422 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_associative_container_invariants() local
431 std::pair<const_iterator, const_iterator> er = c.equal_range(key_of_value()(*di)); in test_associative_container_invariants() local
470 for( typename Data::const_iterator di = d.begin(), de = d.end() ; in test_unordered_associative_container_invariants() local
480 std::pair<const_iterator, const_iterator> er = c.equal_range(key_of_value()(*di)); in test_unordered_associative_container_invariants() local
|
| /dports/databases/percona57-server/boost_1_59_0/libs/intrusive/test/ |
| H A D | test_container.hpp | 187 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
285 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
351 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
403 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
408 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
422 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_associative_container_invariants() local
431 std::pair<const_iterator, const_iterator> er = c.equal_range(key_of_value()(*di)); in test_associative_container_invariants() local
470 for( typename Data::const_iterator di = d.begin(), de = d.end() ; in test_unordered_associative_container_invariants() local
480 std::pair<const_iterator, const_iterator> er = c.equal_range(key_of_value()(*di)); in test_unordered_associative_container_invariants() local
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/intrusive/test/ |
| H A D | test_container.hpp | 187 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
285 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
351 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
403 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
408 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_common_unordered_and_associative_container() local
422 for( typename Data::const_iterator di = d.begin(), de = d.end(); in test_associative_container_invariants() local
431 std::pair<const_iterator, const_iterator> er = c.equal_range(key_of_value()(*di)); in test_associative_container_invariants() local
470 for( typename Data::const_iterator di = d.begin(), de = d.end() ; in test_unordered_associative_container_invariants() local
480 std::pair<const_iterator, const_iterator> er = c.equal_range(key_of_value()(*di)); in test_unordered_associative_container_invariants() local
|