Home
last modified time | relevance | path

Searched refs:mEdges (Results 1 – 25 of 52) sorted by relevance

123

/dports/www/firefox-legacy/firefox-52.8.0esr/mobile/android/geckoview/src/main/java/org/mozilla/gecko/gfx/
H A DOverscrollEdgeEffect.java64 mEdges[LEFT].setSize(height, width); in setSize()
65 mEdges[RIGHT].setSize(height, width); in setSize()
66 mEdges[TOP].setSize(width, height); in setSize()
73 return mEdges[TOP]; in getEdgeForAxisAndSide()
75 return mEdges[BOTTOM]; in getEdgeForAxisAndSide()
79 return mEdges[LEFT]; in getEdgeForAxisAndSide()
81 return mEdges[RIGHT]; in getEdgeForAxisAndSide()
131 if (!mEdges[TOP].isFinished()) { in draw()
135 if (!mEdges[BOTTOM].isFinished()) { in draw()
139 if (!mEdges[LEFT].isFinished()) { in draw()
[all …]
/dports/lang/spidermonkey60/firefox-60.9.0/mobile/android/geckoview/src/main/java/org/mozilla/gecko/gfx/
H A DOverscrollEdgeEffect.java108 mEdges[LEFT].setSize(height, width); in setSize()
109 mEdges[RIGHT].setSize(height, width); in setSize()
110 mEdges[TOP].setSize(width, height); in setSize()
120 return mEdges[TOP]; in getEdgeForAxisAndSide()
122 return mEdges[BOTTOM]; in getEdgeForAxisAndSide()
126 return mEdges[LEFT]; in getEdgeForAxisAndSide()
128 return mEdges[RIGHT]; in getEdgeForAxisAndSide()
176 if (!mEdges[TOP].isFinished()) { in draw()
180 if (!mEdges[BOTTOM].isFinished()) { in draw()
184 if (!mEdges[LEFT].isFinished()) { in draw()
[all …]
/dports/lang/spidermonkey78/firefox-78.9.0/mobile/android/geckoview/src/main/java/org/mozilla/geckoview/
H A DOverscrollEdgeEffect.java111 mEdges[LEFT].setSize(height, width); in setSize()
112 mEdges[RIGHT].setSize(height, width); in setSize()
113 mEdges[TOP].setSize(width, height); in setSize()
123 return mEdges[TOP]; in getEdgeForAxisAndSide()
125 return mEdges[BOTTOM]; in getEdgeForAxisAndSide()
129 return mEdges[LEFT]; in getEdgeForAxisAndSide()
131 return mEdges[RIGHT]; in getEdgeForAxisAndSide()
179 if (!mEdges[TOP].isFinished()) { in draw()
183 if (!mEdges[BOTTOM].isFinished()) { in draw()
187 if (!mEdges[LEFT].isFinished()) { in draw()
[all …]
/dports/cad/librepcb/librepcb-0.1.6/libs/librepcb/common/algorithm/
H A Dairwiresbuilder.cpp55 mEdges.emplace_back(mPoints[p1], mPoints[p2], -1); in addEdge()
60 uint connectedEdges = mEdges.size(); in buildAirWires()
64 mEdges.emplace_back(mPoints[0], mPoints[1], -1); in buildAirWires()
68 mEdges.emplace_back(mPoints[0], mPoints[1], -1); in buildAirWires()
69 mEdges.emplace_back(mPoints[1], mPoints[2], -1); in buildAirWires()
70 mEdges.emplace_back(mPoints[2], mPoints[0], -1); in buildAirWires()
81 mEdges.insert(mEdges.end(), del.getEdges().begin(), del.getEdges().end()); in buildAirWires()
86 mEdges[i].weight = mEdges[i].p1.dist2(mEdges[i].p2); in buildAirWires()
124 std::sort(mEdges.begin(), mEdges.end(), in kruskalMst()
130 auto& dt = mEdges.back(); in kruskalMst()
[all …]
/dports/www/firefox/firefox-99.0/mobile/android/geckoview/src/main/java/org/mozilla/geckoview/
H A DOverscrollEdgeEffect.java95 mEdges[i] = edgeEffect; in setTheme()
124 mEdges[LEFT].setSize(height, width); in setSize()
126 mEdges[TOP].setSize(width, height); in setSize()
136 return mEdges[TOP]; in getEdgeForAxisAndSide()
138 return mEdges[BOTTOM]; in getEdgeForAxisAndSide()
142 return mEdges[LEFT]; in getEdgeForAxisAndSide()
144 return mEdges[RIGHT]; in getEdgeForAxisAndSide()
192 if (!mEdges[TOP].isFinished()) { in draw()
196 if (!mEdges[BOTTOM].isFinished()) { in draw()
200 if (!mEdges[LEFT].isFinished()) { in draw()
[all …]
/dports/games/openjk/OpenJK-07675e2/code/Ragl/
H A Dgraph_triangulate.h158 mEdges.clear(); in clear()
247 for (TEdges::iterator it=mEdges.begin(); it!=mEdges.end(); it++) in floor_shape()
274 nEdge= mEdges.alloc(); in floor_shape()
315 for (TEdges::iterator it=mEdges.begin(); it!=mEdges.end(); it++)
341 for (TEdges::iterator it=mEdges.begin(); it!=mEdges.end(); it++) in finish()
511 TEdges mEdges; variable
553 nEdge= mEdges.alloc();
558 mEdges[nEdge].mA = A;
559 mEdges[nEdge].mB = B;
591 if (mEdges[nEdge].mA==A)
[all …]
H A Dgraph_region.h113 if (mEdges.is_used(i)) in clear()
115 mEdges[i].resize(0, NULL_EDGE); in clear()
118 mEdges.clear(); in clear()
264 if (mEdges.full()) in find_region_edges()
271 RegionLink = mEdges.alloc(); in find_region_edges()
272 mEdges[RegionLink].resize(0, NULL_EDGE); in find_region_edges()
359 assert(mEdges[CurRegionEdge].size()>0); in has_valid_region_edge()
360 for (int j=0; j<mEdges[CurRegionEdge].size(); j++) in has_valid_region_edge()
363 mGraph.get_edge(mEdges[CurRegionEdge][j]), in has_valid_region_edge()
401 TEdges mEdges; variable
[all …]
H A Dgraph_vs.h254 TCellNodes mEdges; member
486 cell.mEdges.clear(); in fill_cells_edges()
502 mcell.mEdges = scell.mEdges; in fill_cells_edges()
526 mEdges.clear(); in clear_edges()
612 return (mEdges.size()-1); in size_edges()
620 return mEdges[i]; in get_edge()
660 return mEdges.end(); in edges_end()
713 mEdges.free(curEdge); in remove_node()
749 if (mEdges.full())
759 mEdges[nNbr.mEdge] = t;
[all …]
/dports/www/firefox-esr/firefox-91.8.0/mobile/android/geckoview/src/main/java/org/mozilla/geckoview/
H A DOverscrollEdgeEffect.java117 mEdges[i] = edgeEffect; in setTheme()
146 mEdges[LEFT].setSize(height, width); in setSize()
148 mEdges[TOP].setSize(width, height); in setSize()
158 return mEdges[TOP]; in getEdgeForAxisAndSide()
160 return mEdges[BOTTOM]; in getEdgeForAxisAndSide()
164 return mEdges[LEFT]; in getEdgeForAxisAndSide()
166 return mEdges[RIGHT]; in getEdgeForAxisAndSide()
214 if (!mEdges[TOP].isFinished()) { in draw()
218 if (!mEdges[BOTTOM].isFinished()) { in draw()
222 if (!mEdges[LEFT].isFinished()) { in draw()
[all …]
/dports/mail/thunderbird/thunderbird-91.8.0/mobile/android/geckoview/src/main/java/org/mozilla/geckoview/
H A DOverscrollEdgeEffect.java117 mEdges[i] = edgeEffect; in setTheme()
146 mEdges[LEFT].setSize(height, width); in setSize()
148 mEdges[TOP].setSize(width, height); in setSize()
158 return mEdges[TOP]; in getEdgeForAxisAndSide()
160 return mEdges[BOTTOM]; in getEdgeForAxisAndSide()
164 return mEdges[LEFT]; in getEdgeForAxisAndSide()
166 return mEdges[RIGHT]; in getEdgeForAxisAndSide()
214 if (!mEdges[TOP].isFinished()) { in draw()
218 if (!mEdges[BOTTOM].isFinished()) { in draw()
222 if (!mEdges[LEFT].isFinished()) { in draw()
[all …]
/dports/www/firefox-esr/firefox-91.8.0/gfx/layers/
H A DDirectedGraph.h41 mEdges.AppendElement(aEdge); in AddEdge()
49 const nsTArray<Edge>& GetEdgeList() const { return mEdges; } in GetEdgeList()
54 void RemoveEdge(Edge aEdge) { mEdges.RemoveElement(aEdge); } in RemoveEdge()
61 while (mEdges.RemoveElement(aNode, c)) { in RemoveEdgesTo()
70 for (unsigned int i = 0; i < mEdges.Length(); i++) { in NumEdgesTo()
71 if (mEdges.ElementAt(i).mTo == aNode) { in NumEdgesTo()
82 for (unsigned int i = 0; i < mEdges.Length(); i++) { in GetEdgesFrom()
83 if (mEdges.ElementAt(i).mFrom == aNode) { in GetEdgesFrom()
84 aResult.AppendElement(mEdges.ElementAt(i)); in GetEdgesFrom()
92 unsigned int GetEdgeCount() { return mEdges.Length(); } in GetEdgeCount()
[all …]
/dports/lang/spidermonkey78/firefox-78.9.0/gfx/layers/
H A DDirectedGraph.h41 mEdges.AppendElement(aEdge); in AddEdge()
49 const nsTArray<Edge>& GetEdgeList() const { return mEdges; } in GetEdgeList()
54 void RemoveEdge(Edge aEdge) { mEdges.RemoveElement(aEdge); } in RemoveEdge()
61 while (mEdges.RemoveElement(aNode, c)) { in RemoveEdgesTo()
70 for (unsigned int i = 0; i < mEdges.Length(); i++) { in NumEdgesTo()
71 if (mEdges.ElementAt(i).mTo == aNode) { in NumEdgesTo()
82 for (unsigned int i = 0; i < mEdges.Length(); i++) { in GetEdgesFrom()
83 if (mEdges.ElementAt(i).mFrom == aNode) { in GetEdgesFrom()
84 aResult.AppendElement(mEdges.ElementAt(i)); in GetEdgesFrom()
92 unsigned int GetEdgeCount() { return mEdges.Length(); } in GetEdgeCount()
[all …]
/dports/mail/thunderbird/thunderbird-91.8.0/gfx/layers/
H A DDirectedGraph.h41 mEdges.AppendElement(aEdge); in AddEdge()
49 const nsTArray<Edge>& GetEdgeList() const { return mEdges; } in GetEdgeList()
54 void RemoveEdge(Edge aEdge) { mEdges.RemoveElement(aEdge); } in RemoveEdge()
61 while (mEdges.RemoveElement(aNode, c)) { in RemoveEdgesTo()
70 for (unsigned int i = 0; i < mEdges.Length(); i++) { in NumEdgesTo()
71 if (mEdges.ElementAt(i).mTo == aNode) { in NumEdgesTo()
82 for (unsigned int i = 0; i < mEdges.Length(); i++) { in GetEdgesFrom()
83 if (mEdges.ElementAt(i).mFrom == aNode) { in GetEdgesFrom()
84 aResult.AppendElement(mEdges.ElementAt(i)); in GetEdgesFrom()
92 unsigned int GetEdgeCount() { return mEdges.Length(); } in GetEdgeCount()
[all …]
/dports/lang/spidermonkey60/firefox-60.9.0/gfx/layers/
H A DDirectedGraph.h41 mEdges.AppendElement(aEdge); in AddEdge()
49 const nsTArray<Edge>& GetEdgeList() const { return mEdges; } in GetEdgeList()
54 void RemoveEdge(Edge aEdge) { mEdges.RemoveElement(aEdge); } in RemoveEdge()
61 while (mEdges.RemoveElement(aNode, c)) { in RemoveEdgesTo()
70 for (unsigned int i = 0; i < mEdges.Length(); i++) { in NumEdgesTo()
71 if (mEdges.ElementAt(i).mTo == aNode) { in NumEdgesTo()
82 for (unsigned int i = 0; i < mEdges.Length(); i++) { in GetEdgesFrom()
83 if (mEdges.ElementAt(i).mFrom == aNode) { in GetEdgesFrom()
84 aResult.AppendElement(mEdges.ElementAt(i)); in GetEdgesFrom()
92 unsigned int GetEdgeCount() { return mEdges.Length(); } in GetEdgeCount()
[all …]
/dports/www/firefox-legacy/firefox-52.8.0esr/gfx/layers/
H A DDirectedGraph.h44 mEdges.AppendElement(aEdge); in AddEdge()
57 return mEdges; in GetEdgeList()
65 mEdges.RemoveElement(aEdge); in RemoveEdge()
74 while (mEdges.RemoveElement(aNode, c)) {} in RemoveEdgesTo()
83 for (unsigned int i = 0; i < mEdges.Length(); i++) { in NumEdgesTo()
84 if (mEdges.ElementAt(i).mTo == aNode) { in NumEdgesTo()
96 for (unsigned int i = 0; i < mEdges.Length(); i++) { in GetEdgesFrom()
97 if (mEdges.ElementAt(i).mFrom == aNode) { in GetEdgesFrom()
98 aResult.AppendElement(mEdges.ElementAt(i)); in GetEdgesFrom()
106 unsigned int GetEdgeCount() { return mEdges.Length(); } in GetEdgeCount()
[all …]
/dports/graphics/reactphysics3d/reactphysics3d-0.8.0/src/collision/shapes/
H A DTriangleShape.cpp81 mEdges[0].vertexIndex = 0;
83 mEdges[0].faceIndex = 0;
87 mEdges[1].vertexIndex = 1;
89 mEdges[1].faceIndex = 1;
93 mEdges[2].vertexIndex = 1;
95 mEdges[2].faceIndex = 0;
99 mEdges[3].vertexIndex = 2;
101 mEdges[3].faceIndex = 1;
105 mEdges[4].vertexIndex = 2;
107 mEdges[4].faceIndex = 0;
[all …]
/dports/games/openmw/openmw-openmw-0.47.0/apps/opencs/model/tools/
H A Dpathgridcheck.cpp47 for (unsigned int i = 0; i < pathgrid.mEdges.size(); ++i) in perform()
49 …if (pathgrid.mEdges[i].mV0 < static_cast<int>(pathgrid.mPoints.size()) && pathgrid.mEdges[i].mV0 >… in perform()
51 pointList[pathgrid.mEdges[i].mV0].mConnectionNum++; in perform()
54 for (; j < pointList[pathgrid.mEdges[i].mV0].mOtherIndex.size(); ++j) in perform()
56 if (pointList[pathgrid.mEdges[i].mV0].mOtherIndex[j] == pathgrid.mEdges[i].mV1) in perform()
59 …ss << "Duplicate edge between points #" << pathgrid.mEdges[i].mV0 << " and #" << pathgrid.mEdges[i… in perform()
66 if (j == pointList[pathgrid.mEdges[i].mV0].mOtherIndex.size()) in perform()
67 pointList[pathgrid.mEdges[i].mV0].mOtherIndex.push_back(pathgrid.mEdges[i].mV1); in perform()
72 ss << "An edge is connected to a non-existent point #" << pathgrid.mEdges[i].mV0; in perform()
/dports/astro/opencpn/OpenCPN-5.2.4/libs/libtess2/Source/
H A DAdjacency.cpp31 Adjacencies::Adjacencies() : mNbEdges(0), mCurrentNbFaces(0), mEdges(null), mNbFaces(0), mFaces(nul… in Adjacencies()
40 RELEASEARRAY(mEdges); in ~Adjacencies()
57 mEdges = new AdjEdge[mNbFaces*3]; if(!mEdges) return false; in Init()
125 mEdges[mNbEdges].Ref0 = ref0; in AddEdge()
126 mEdges[mNbEdges].Ref1 = ref1; in AddEdge()
127 mEdges[mNbEdges].FaceNb = face; in AddEdge()
153 FaceNb[i] = mEdges[i].FaceNb; in CreateDatabase()
154 VRefs0[i] = mEdges[i].Ref0; in CreateDatabase()
155 VRefs1[i] = mEdges[i].Ref1; in CreateDatabase()
215 RELEASEARRAY(mEdges); in CreateDatabase()
/dports/x11-toolkits/qt5-quick3d/kde-qtquick3d-5.15.2p19/src/runtimerender/
H A Dqssgrenderclippingfrustum_p.h74 BoxEdge mEdges; member
120 if (distance(corner(bounds, mEdges.lowerEdge)) > 0.0f) in intersect()
124 if (distance(corner(bounds, mEdges.upperEdge)) < 0.0f) in intersect()
134 …mEdges.upperEdge = QSSGRenderBoxEdge(static_cast<quint8>((normal[0] >= 0.0f ? BoxEdgeFlagValues::x… in calculateBBoxEdges()
138 mEdges.lowerEdge = QSSGRenderBoxEdge((~(quint8(mEdges.upperEdge))) & 7); in calculateBBoxEdges()
/dports/games/openmw/openmw-openmw-0.47.0/components/esm/
H A Dloadpgrd.cpp40 mEdges.clear(); in load()
99 mEdges.reserve(edgeCount); in load()
110 mEdges.push_back(edge); in load()
137 sortedEdges.reserve(mEdges.size()); in save()
143 for (EdgeList::const_iterator it = mEdges.begin(); it != mEdges.end(); ++it) in save()
192 mEdges.clear(); in blank()
/dports/graphics/reactphysics3d/reactphysics3d-0.8.0/include/reactphysics3d/collision/
H A DHalfEdgeStructure.h87 List<Edge> mEdges; variable
94 … mVertices(allocator, verticesCapacity), mEdges(allocator, edgesCapacity) {} in HalfEdgeStructure()
163 return static_cast<uint>(mEdges.size()); in getNbHalfEdges()
188 assert(index < mEdges.size()); in getHalfEdge()
189 return mEdges[index]; in getHalfEdge()
/dports/graphics/reactphysics3d/reactphysics3d-0.8.0/src/collision/
H A DHalfEdgeStructure.cpp85 const uint edgeIndex = mEdges.size(); in init()
99 mEdges.add(itEdge->second); in init()
100 mEdges.add(edge); in init()
110 for (uint i=0; i < mEdges.size(); i++) { in init()
111 mEdges[i].nextEdgeIndex = mapEdgeToIndex[nextEdges[mapEdgeIndexToKey[i]]]; in init()
/dports/games/openmw/openmw-openmw-0.47.0/apps/opencs/view/render/
H A Dpathgrid.cpp281 for (int row = source->mEdges.size() - 1; row >= 0; --row) in applyPoint()
385 for (size_t edge = 0; edge < source->mEdges.size(); ++edge) in applyRemoveNodes()
393 if (source->mEdges[edge].mV0 == *point || source->mEdges[edge].mV1 == *point) in applyRemoveNodes()
402 if (source->mEdges[edge].mV0 > *point) in applyRemoveNodes()
405 if (source->mEdges[edge].mV1 > *point) in applyRemoveNodes()
411 int adjustedEdge = source->mEdges[edge].mV0 + adjustment0; in applyRemoveNodes()
418 int adjustedEdge = source->mEdges[edge].mV1 + adjustment1; in applyRemoveNodes()
620 for (size_t i = 0; i < source.mEdges.size(); ++i) in edgeExists()
622 if (source.mEdges[i].mV0 == node1 && source.mEdges[i].mV1 == node2) in edgeExists()
644 int row = static_cast<int>(source.mEdges.size()); in addEdge()
/dports/games/openmw/openmw-openmw-0.47.0/apps/openmw/mwmechanics/
H A Dpathgrid.cpp114 for(int i = 0; i < static_cast<int> (mPathgrid->mEdges.size()); i++) in load()
117 neighbour.cost = costAStar(mPathgrid->mPoints[mPathgrid->mEdges[i].mV0], in load()
118 mPathgrid->mPoints[mPathgrid->mEdges[i].mV1]); in load()
120 neighbour.index = mPathgrid->mEdges[i].mV1; in load()
121 mGraph[mPathgrid->mEdges[i].mV0].edges.push_back(neighbour); in load()
/dports/graphics/qgis-ltr/qgis-3.16.16/external/mdal/
H A Dmdal_memory_data_model.hpp187 const Edges &edges() const {return mEdges;} in edges()
199 size_t edgesCount() const override {return mEdges.size();} in edgesCount()
211 Edges mEdges; member in MDAL::MemoryMesh

123