Home
last modified time | relevance | path

Searched refs:_edges (Results 1 – 25 of 349) sorted by relevance

12345678910>>...14

/dports/science/yoda/YODA-1.9.1/include/YODA/
H A DBin1D.h47 if (_edges.second < _edges.first) { in Bin1D()
59 if (_edges.second < _edges.first) { in Bin1D()
67 : _edges(b._edges), in Bin1D()
74 _edges = b._edges;
145 return ( _edges.second + _edges.first ) / 2; in xMid()
153 return _edges.second - _edges.first; in xWidth()
271 if (fuzzyEquals(_edges.second, b._edges.first)) { in merge()
272 _edges.second = b._edges.second; in merge()
274 _edges.first = b._edges.first; in merge()
290 if (!fuzzyEquals(_edges.first, b._edges.first) || in add()
[all …]
/dports/science/yoda/YODA-1.9.1/include/YODA/Utils/
H A DBinSearcher.h151 _edges = bs._edges; in BinSearcher()
204 if (x >= _edges[index] && x < _edges[index+1]) return index; in index()
207 if (x > _edges[index]) { in index()
215 assert(x >= _edges[index] && (x < _edges[index+1] || std::isinf(x))); in index()
306 _edges.clear(); in _updateEdges()
312 _edges[_edges.size()-1] = std::numeric_limits<double>::infinity(); in _updateEdges()
324 if (x < _edges[j]) { in _linsearch_forward()
325 assert(x >= _edges[j-1] && (x < _edges[j] || std::isinf(x))); in _linsearch_forward()
340 if (x >= _edges[j]) { in _linsearch_backward()
341 assert(x >= _edges[j] && (x < _edges[j+1] || std::isinf(x))); in _linsearch_backward()
[all …]
/dports/graphics/tikzit/tikzit-2.1.6/src/data/
H A Dpath.cpp10 return _edges.length(); in length()
16 _edges << e; in addEdge()
21 foreach(Edge *e, _edges) { in removeEdges()
24 _edges.clear(); in removeEdges()
29 return !_edges.isEmpty() && _edges.first()->source() == _edges.last()->target(); in isCycle()
34 return _edges; in edges()
/dports/x11-wm/awesome/awesome-4.3/lib/gears/sort/
H A Dtopological.lua13 if not self._edges[node] then
14 self._edges[node] = {}
25 self._edges[node][dep] = true
54 for dep in pairs(self._edges[node]) do
70 new._edges = gtable.clone(self._edges, false)
79 self._edges[node] = nil
80 for _, deps in pairs(self._edges) do
91 for node in pairs(self._edges) do
111 _edges = {},
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/hotspot/share/jfr/leakprofiler/chains/
H A DedgeStore.cpp65 EdgeStore::EdgeStore() : _edges(NULL) { in EdgeStore()
66 _edges = new EdgeHashTable(this); in EdgeStore()
70 assert(_edges != NULL, "invariant"); in ~EdgeStore()
71 delete _edges; in ~EdgeStore()
72 _edges = NULL; in ~EdgeStore()
77 EdgeEntry* const entry = _edges->lookup_only(*edge, (uintptr_t)edge->reference()); in get_edge()
84 assert(NULL == _edges->lookup_only(e, (uintptr_t)e.reference()), "invariant"); in put()
85 EdgeEntry& entry = _edges->put(e, (uintptr_t)e.reference()); in put()
91 EdgeEntry* const entry = _edges->lookup_only(*edge, (uintptr_t)edge->reference()); in get_id()
138 return !_edges->has_entries(); in is_empty()
[all …]
/dports/games/residualvm/residualvm-0.3.1/engines/stark/resources/
H A Dfloor.cpp114 for (uint i = 0; i < _edges.size(); i++) { in isSegmentInside()
115 const FloorEdge &edge = _edges[i]; in isSegmentInside()
143 for (uint i = 0; i < _edges.size(); i++) { in saveLoad()
144 _edges[i].saveLoad(serializer); in saveLoad()
149 _edges.clear(); in buildEdgeList()
161 for (uint i = 0; i < _edges.size(); i++) { in buildEdgeList()
166 _faces[faceIndex1]->addEdge(&_edges[i]); in buildEdgeList()
170 _faces[faceIndex2]->addEdge(&_edges[i]); in buildEdgeList()
176 _edges[i].buildNeighbours(this); in buildEdgeList()
177 _edges[i].computeMiddle(this); in buildEdgeList()
[all …]
H A Dfloorface.cpp139 _edges.push_back(edge); in addEdge()
143 return _edges; in getEdges()
150 for (uint i = 0; i < _edges.size(); i++) { in findNearestEdge()
151 if (!_edges[i]->isEnabled()) { in findNearestEdge()
155 float distance = (point - _edges[i]->getPosition()).getSquareMagnitude(); in findNearestEdge()
160 edge = _edges[i]; in findNearestEdge()
176 for (uint i = 0; i < _edges.size(); i++) { in enable()
177 _edges[i]->enable(e); in enable()
/dports/games/scummvm/scummvm-2.5.1/engines/stark/resources/
H A Dfloor.cpp125 for (uint i = 0; i < _edges.size(); i++) { in isSegmentInside()
126 const FloorEdge &edge = _edges[i]; in isSegmentInside()
154 for (uint i = 0; i < _edges.size(); i++) { in saveLoad()
155 _edges[i].saveLoad(serializer); in saveLoad()
160 _edges.clear(); in buildEdgeList()
172 for (uint i = 0; i < _edges.size(); i++) { in buildEdgeList()
177 _faces[faceIndex1]->addEdge(&_edges[i]); in buildEdgeList()
181 _faces[faceIndex2]->addEdge(&_edges[i]); in buildEdgeList()
187 _edges[i].buildNeighbours(this); in buildEdgeList()
188 _edges[i].computeMiddle(this); in buildEdgeList()
[all …]
H A Dfloorface.cpp139 _edges.push_back(edge); in addEdge()
143 return _edges; in getEdges()
150 for (uint i = 0; i < _edges.size(); i++) { in findNearestEdge()
151 if (!_edges[i]->isEnabled()) { in findNearestEdge()
155 float distance = (point - _edges[i]->getPosition()).getSquareMagnitude(); in findNearestEdge()
160 edge = _edges[i]; in findNearestEdge()
176 for (uint i = 0; i < _edges.size(); i++) { in enable()
177 _edges[i]->enable(e); in enable()
182 for (uint i = 0; i < _edges.size(); i++) { in isEnabled()
183 if (_edges[i]->isEnabled()) { in isEnabled()
/dports/science/code_saturne/code_saturne-7.1.0/tests/
H A Dcs_matrix_test.c66 cs_lnum_2_t *_edges = NULL; variable
489 BFT_MALLOC(_edges, _n_edges, cs_lnum_2_t); in _base_data()
494 _edges[j][0] = cell_vtx[i][0]; _edges[j][1] = cell_vtx[i][1]; j+= j_step; in _base_data()
495 _edges[j][0] = cell_vtx[i][1]; _edges[j][1] = cell_vtx[i][2]; j+= j_step; in _base_data()
496 _edges[j][0] = cell_vtx[i][2]; _edges[j][1] = cell_vtx[i][3]; j+= j_step; in _base_data()
497 _edges[j][0] = cell_vtx[i][3]; _edges[j][1] = cell_vtx[i][0]; j+= j_step; in _base_data()
499 _edges[j][0] = cell_vtx[i][0]; _edges[j][1] = cell_vtx[i][2]; j+= j_step; in _base_data()
500 _edges[j][0] = cell_vtx[i][1]; _edges[j][1] = cell_vtx[i][3]; j+= j_step; in _base_data()
505 _edges[i+1][0] = _edges[i][1]; in _base_data()
506 _edges[i+1][1] = _edges[i][0]; in _base_data()
[all …]
/dports/graphics/py-pandana/pandana-0.6.1/src/contraction_hierarchies/src/DataStructures/
H A DStaticGraph.h68 _edges.resize( position ); //(edge) in StaticGraph()
73 _edges[i].target = graph[edge].target; in StaticGraph()
74 _edges[i].data = graph[edge].data; in StaticGraph()
75 if(0 >= _edges[i].data.distance) in StaticGraph()
77 assert(_edges[i].data.distance > 0); in StaticGraph()
96 return NodeIterator( _edges[e].target ); in GetTarget()
100 return _edges[e].data; in GetEdgeData()
104 return _edges[e].data; in GetEdgeData()
155 std::vector< _StrEdge > _edges; variable
/dports/math/frobby/frobby-0.9.1/src/
H A DSizeMaxIndepSetAlg.cpp48 _edges.push_back(Term::getSizeOfSupport(ideal[term], _varCount)); in run()
52 _edges.push_back(var); in run()
57 _endPos = _edges.size(); in run()
80 size_t nextPos = pos + _edges[pos] + 1; in isIndependentIncludingMaybe()
85 if (_state[_edges[pos]] == IsNotInSet) in isIndependentIncludingMaybe()
96 VarState varState = _state[_edges[p]]; in couldBeDependence()
141 size_t nextPos = pos + _edges[pos] + 1; in recurse()
162 size_t var = _edges[p]; in recurse()
/dports/math/dune-alugrid/dune-alugrid-08c6496d4d4a33df6456c3b402182f353dc2e76d/dune/alugrid/impl/parallel/
H A Daluzoltan.hh73 std::vector< std::vector< std::pair<edgeType,bool> > > _edges; member in ALUGridZoltan::ObjectCollection
82 _edges(0) in ObjectCollection()
89 … int edgeIdx(int i,int k) { alugrid_assert ( i < (int)_edges.size() && k < (int)_edges[i].size() ); in edgeIdx()
90 return ( (_edges[i][k].second) ? in edgeIdx()
91 _edges[i][k].first->rightNode() : in edgeIdx()
92 _edges[i][k].first->leftNode() ) ; } in edgeIdx()
93 …int edgeMaster(int i,int k) { alugrid_assert ( i < (int)_edges.size() && k < (int)_edges[i].size()… in edgeMaster()
94 return ( (_edges[i][k].second) ? in edgeMaster()
95 _edges[i][k].first->rightMaster() : in edgeMaster()
97 …int edgeWeight(int i,int k) { alugrid_assert ( i < (int)_edges.size() && k < (int)_edges[i].size()… in edgeWeight()
[all …]
/dports/science/mpqc/mpqc-2.3.1/src/lib/math/isosurf/
H A Dtriangle.cc76 _edges[0] = v1; in Triangle()
77 _edges[1] = v2; in Triangle()
78 _edges[2] = v3; in Triangle()
90 Ref<Edge> *e = _edges; in Triangle()
141 return _edges[i]->vertex(orientation(i)); in vertex()
155 if (_edges[0] == e) return 1; in contains()
156 if (_edges[1] == e) return 1; in contains()
157 if (_edges[2] == e) return 1; in contains()
163 double a = _edges[0]->straight_length(); in flat_area()
164 double b = _edges[1]->straight_length(); in flat_area()
[all …]
/dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/lemon/
H A Dnagamochi_ibaraki.h261 std::vector<EdgeData> _edges; variable
319 _nodes(0), _arcs(), _edges(), _min_cut(), in NagamochiIbaraki()
334 _nodes(0), _arcs(), _edges(), _min_cut(), in NagamochiIbaraki()
390 _edges.resize(edge_num); in init()
502 Value nv = _edges[a >> 1].capacity; in processNextPhase()
504 _edges[a >> 1].cut = nv; in processNextPhase()
510 _edges[a >> 1].cut = nv; in processNextPhase()
563 if (!(_edges[a >> 1].cut < pmc)) { in processNextPhase()
578 _edges[c >> 1].capacity += _edges[b >> 1].capacity; in processNextPhase()
580 if (_edges[b >> 1].cut < _edges[c >> 1].cut) { in processNextPhase()
[all …]
/dports/math/lemon/lemon-1.3.1/lemon/
H A Dnagamochi_ibaraki.h261 std::vector<EdgeData> _edges; variable
319 _nodes(0), _arcs(), _edges(), _min_cut(), in NagamochiIbaraki()
334 _nodes(0), _arcs(), _edges(), _min_cut(), in NagamochiIbaraki()
390 _edges.resize(edge_num); in init()
502 Value nv = _edges[a >> 1].capacity; in processNextPhase()
504 _edges[a >> 1].cut = nv; in processNextPhase()
510 _edges[a >> 1].cut = nv; in processNextPhase()
563 if (!(_edges[a >> 1].cut < pmc)) { in processNextPhase()
578 _edges[c >> 1].capacity += _edges[b >> 1].capacity; in processNextPhase()
580 if (_edges[b >> 1].cut < _edges[c >> 1].cut) { in processNextPhase()
[all …]
/dports/misc/openmvg/openMVG-2.0/src/third_party/lemon/lemon/
H A Dnagamochi_ibaraki.h261 std::vector<EdgeData> _edges; variable
319 _nodes(0), _arcs(), _edges(), _min_cut(), in NagamochiIbaraki()
334 _nodes(0), _arcs(), _edges(), _min_cut(), in NagamochiIbaraki()
390 _edges.resize(edge_num); in init()
502 Value nv = _edges[a >> 1].capacity; in processNextPhase()
504 _edges[a >> 1].cut = nv; in processNextPhase()
510 _edges[a >> 1].cut = nv; in processNextPhase()
563 if (!(_edges[a >> 1].cut < pmc)) { in processNextPhase()
578 _edges[c >> 1].capacity += _edges[b >> 1].capacity; in processNextPhase()
580 if (_edges[b >> 1].cut < _edges[c >> 1].cut) { in processNextPhase()
[all …]
/dports/math/symengine/symengine-0.8.1/symengine/utilities/matchpycpp/
H A Dbipartite.h24 map<Edge, TEdgeValue> _edges;
36 _edges = edges; in BipartiteGraph()
49 _edges[key] = value; in __setitem__()
68 if (_edges.find(key) != _edges.end()) { in setdefault()
69 return _edges[key]; in setdefault()
78 return _edges.at(key); in __getitem__()
83 _edges.erase(key); in __delitem__()
84 for (const pair<const Edge, TEdgeValue> &p : _edges) { in __delitem__()
160 _edges.clear(); in clear()
273 if (graph._edges.empty()) { in _enum_maximum_matchings_iter()
[all …]
/dports/graphics/p5-SWF-Builder/SWF-Builder-0.16/lib/SWF/Builder/Character/
H A DShape.pm32 $self->{_edges} = SWF::Element::SHAPEWITHSTYLE3->ShapeRecords->new;
192 …$self->{_anchors}{$anchor} = [$#{$self->{_edges}}, $self->{_current_X}, $self->{_current_Y}, $#{$s…
208 $m->[5] = [$#{$self->{_edges}}, $x, $y];
218 $m->[1] = $#{$self->{_edges}};
228 ($#{$self->{_edges}}, # start edge index
230 [$#{$self->{_edges}}], # STYLECHANGERECORD indice
233 [$#{$self->{_edges}}, $x, $y], # top left
243 if ($last_anchor->[0] == $#{$self->{_edges}} or $last_anchor->[0] == $#{$self->{_edges}}-1) {
244 $last_anchor->[0] = $#{$self->{_edges}};
254 …push @{$self->{_links}[-1][2]}, $#{$self->{_edges}} if $self->{_links}[-1][2][-1] != $#{$self->{_e…
[all …]
/dports/graphics/quickqanava/QuickQanava-ab88d77ec62175b9fd499a154ffaf92f7bf23989/GTpo/src/gtpo/
H A Dgraph.hpp55 for ( auto& edge: _edges ) // Do not maintain topology during edge deletion in clear()
58 _edges.clear(); in clear()
175 config_t::template container_adapter< shared_edges_t >::insert( edge, _edges ); in create_edge()
202 config_t::template container_adapter<shared_edges_t>::insert( edge, _edges ); in insert_edge()
228 if ( _edges.size() == 0 ) in remove_edge()
230 auto edgeIter = std::find_if( _edges.begin(), _edges.end(), in remove_edge()
236 if ( edgeIter != _edges.end() ) in remove_edge()
268 config_t::template container_adapter<shared_edges_t>::remove( edge, _edges ); in remove_edge()
276 auto edgeIter = std::find_if( _edges.begin(), _edges.end(), in find_edge()
281 …return ( edgeIter != _edges.end() ? *edgeIter : weak_edge_t{} ); // std::shared_ptr::operator* i… in find_edge()
[all …]
/dports/science/rdkit/rdkit-Release_2021_03_5/External/RingFamilies/RingDecomposerLib/src/python/py_rdl/
H A DGraph.py41 self._edges = {}
111 if index_pair in self._edges:
115 self._edges[index_pair] = edge_id
135 return self._edges[index_pair]
187 return self._edges
/dports/games/battletanks/btanks-0.9.8083/math/
H A Dgraph.h44 _edges[EdgeMap::key_type(a, b)] = w; in insert()
52 typename EdgeMap::const_iterator i = _edges.find(EdgeMap::key_type(a, b)); in get()
53 if (i == _edges.end()) in get()
59 EdgeMap _edges; variable
/dports/math/py-matplotlib/matplotlib-3.4.3/lib/matplotlib/tri/
H A Dtriangulation.py47 self._edges = None
99 if self._edges is None:
100 self._edges = self.get_cpp_triangulation().get_edges()
101 return self._edges
111 self.x, self.y, self.triangles, self.mask, self._edges,
215 self._edges = None
/dports/math/py-matplotlib2/matplotlib-2.2.4/lib/matplotlib/tri/
H A Dtriangulation.py48 self._edges = None
99 if self._edges is None:
100 self._edges = self.get_cpp_triangulation().get_edges()
101 return self._edges
108 self.x, self.y, self.triangles, self.mask, self._edges,
213 self._edges = None
/dports/graphics/py-visvis/visvis-1.13.0/utils/
H A Dgraph.py64 self._edges = []
75 for c in self._edges:
92 return len(self._edges)
161 self.end1._edges.append(self)
162 self.end2._edges.append(self)
170 while self in self.end1._edges:
171 self.end1._edges.remove(self)
172 while self in self.end2._edges:
321 node._edges[:] = []
339 count += len(node._edges)
[all …]

12345678910>>...14