Home
last modified time | relevance | path

Searched refs:adjacency (Results 1 – 25 of 2375) sorted by relevance

12345678910>>...95

/dports/net-mgmt/py-junos-eznc/junos-eznc-2.5.4/lib/jnpr/junos/op/
H A Disis.yml2 rpc: get-isis-adjacency-information
5 item: isis-adjacency
16 adjacency_state: adjacency-state
21 adjacency_flag: adjacency-flag
22 adjacency_topologies: adjacency-topologies
28 item: isis-adjacency-log
30 - adjacency-when
31 - adjacency-state
36 when: adjacency-when
37 state: adjacency-state
[all …]
H A Dppm.yml6 item: adjacency-data
13 holdtime: adjacency-holdtime
14 interface_index: adjacency-interface-index
15 distributed: adjacency-distributed
16 ospf_src_key: adjacency-ospf-src-key
17 ospf_area_id: adjacency-ospf-area-id
/dports/emulators/mess/mame-mame0226/3rdparty/bgfx/3rdparty/meshoptimizer/src/
H A Dvcacheoptimizer.cpp47 adjacency.counts[indices[i]]++; in buildTriangleAdjacency()
55 adjacency.offsets[i] = offset; in buildTriangleAdjacency()
56 offset += adjacency.counts[i]; in buildTriangleAdjacency()
66 adjacency.data[adjacency.offsets[a]++] = unsigned(i); in buildTriangleAdjacency()
67 adjacency.data[adjacency.offsets[b]++] = unsigned(i); in buildTriangleAdjacency()
68 adjacency.data[adjacency.offsets[c]++] = unsigned(i); in buildTriangleAdjacency()
74 assert(adjacency.offsets[i] >= adjacency.counts[i]); in buildTriangleAdjacency()
76 adjacency.offsets[i] -= adjacency.counts[i]; in buildTriangleAdjacency()
274 unsigned int* neighbours = &adjacency.data[0] + adjacency.offsets[index]; in meshopt_optimizeVertexCache()
284 adjacency.counts[index]--; in meshopt_optimizeVertexCache()
[all …]
/dports/emulators/mame/mame-mame0226/3rdparty/bgfx/3rdparty/meshoptimizer/src/
H A Dvcacheoptimizer.cpp47 adjacency.counts[indices[i]]++; in buildTriangleAdjacency()
55 adjacency.offsets[i] = offset; in buildTriangleAdjacency()
56 offset += adjacency.counts[i]; in buildTriangleAdjacency()
66 adjacency.data[adjacency.offsets[a]++] = unsigned(i); in buildTriangleAdjacency()
67 adjacency.data[adjacency.offsets[b]++] = unsigned(i); in buildTriangleAdjacency()
68 adjacency.data[adjacency.offsets[c]++] = unsigned(i); in buildTriangleAdjacency()
74 assert(adjacency.offsets[i] >= adjacency.counts[i]); in buildTriangleAdjacency()
76 adjacency.offsets[i] -= adjacency.counts[i]; in buildTriangleAdjacency()
274 unsigned int* neighbours = &adjacency.data[0] + adjacency.offsets[index]; in meshopt_optimizeVertexCache()
284 adjacency.counts[index]--; in meshopt_optimizeVertexCache()
[all …]
/dports/math/py-PyMetis/PyMetis-2020.1/pymetis/
H A D__init__.py35 def _prepare_graph(adjacency, xadj, adjncy): argument
36 if adjacency is not None:
43 for i in range(len(adjacency)):
44 adj = adjacency[i]
46 assert max(adj) < len(adjacency)
56 def nested_dissection(adjacency=None, xadj=None, adjncy=None): argument
64 xadj, adjncy = _prepare_graph(adjacency, xadj, adjncy)
70 def part_graph(nparts, adjacency=None, xadj=None, adjncy=None, argument
105 xadj, adjncy = _prepare_graph(adjacency, xadj, adjncy)
/dports/misc/usd/USD-21.11/pxr/imaging/hd/
H A DsmoothNormals.cpp108 Hd_VertexAdjacency const * adjacency, in ComputeSmoothNormals() argument
113 adjacency->GetAdjacencyTable(), adjacency->GetNumPoints()); in ComputeSmoothNormals()
119 Hd_VertexAdjacency const * adjacency, in ComputeSmoothNormals() argument
124 adjacency->GetAdjacencyTable(), adjacency->GetNumPoints()); in ComputeSmoothNormals()
130 Hd_VertexAdjacency const * adjacency, in ComputeSmoothNormalsPacked() argument
135 numPoints, pointsPtr, adjacency->GetAdjacencyTable(), in ComputeSmoothNormalsPacked()
136 adjacency->GetNumPoints()); in ComputeSmoothNormalsPacked()
142 Hd_VertexAdjacency const * adjacency, in ComputeSmoothNormalsPacked() argument
147 numPoints, pointsPtr, adjacency->GetAdjacencyTable(), in ComputeSmoothNormalsPacked()
148 adjacency->GetNumPoints()); in ComputeSmoothNormalsPacked()
[all …]
H A DvertexAdjacency.cpp168 Hd_VertexAdjacency *adjacency, HdMeshTopology const *topology) in Hd_AdjacencyBuilderComputation() argument
169 : _adjacency(adjacency), _topology(topology) in Hd_AdjacencyBuilderComputation()
199 Hd_VertexAdjacency const *adjacency, in Hd_AdjacencyBufferSource() argument
201 : _adjacency(adjacency), _adjacencyBuilder(adjacencyBuilder) in Hd_AdjacencyBufferSource()
215 VtIntArray const &adjacency = _adjacency->GetAdjacencyTable(); in Resolve() local
217 new HdVtBufferSource(HdTokens->adjacency, VtValue(adjacency)))); in Resolve()
226 specs->emplace_back(HdTokens->adjacency, HdTupleType{HdTypeInt32, 1}); in GetBufferSpecs()
/dports/science/py-ase/ase-3.22.0/ase/geometry/dimensionality/
H A Drank_determination.py49 def bfs(adjacency, start): argument
70 for nc, offset in adjacency[c]:
83 def traverse_component_graphs(adjacency): argument
84 vertices = adjacency.keys()
88 visited, rank = bfs(adjacency, v)
97 adjacency = {e: set() for e in graph}
101 adjacency[component_a].add((component_b, offset))
102 return adjacency
150 self.adjacency = None
190 if adjacency == self.adjacency:
[all …]
/dports/net-mgmt/librenms/librenms-21.5.1/includes/html/pages/device/routing/
H A Dcisco-otv.inc.php30 foreach ($components as $aid => $adjacency) {
31 … if (($adjacency['otvtype'] == 'adjacency') && ($adjacency['index'] == $overlay['index'])) {
32 if ($adjacency['status'] == 0) {
36 …$adj_status = "<span class='pull-right'>" . $adjacency['error'] . " - <span class='red'>Alert</spa…
39 …fa-chevron-right" aria-hidden="true"></i> <?php echo $adjacency['label']?> - <?php echo $adjacency…
/dports/lang/zig/zig-0.9.0/lib/libc/include/any-windows-any/
H A Dd3dx9shape.h30 float depth, struct ID3DXMesh **mesh, struct ID3DXBuffer **adjacency);
32 … float length, UINT slices, UINT stacks, struct ID3DXMesh **mesh, struct ID3DXBuffer **adjacency);
34 ID3DXBuffer **adjacency);
36 UINT stacks, struct ID3DXMesh **mesh, struct ID3DXBuffer **adjacency);
38 struct ID3DXMesh **mesh, struct ID3DXBuffer **adjacency);
40 …float extrusion, struct ID3DXMesh **mesh, struct ID3DXBuffer **adjacency, GLYPHMETRICSFLOAT *glyph…
42 …FLOAT extrusion, struct ID3DXMesh **mesh, struct ID3DXBuffer **adjacency, GLYPHMETRICSFLOAT *glyph…
44 …dius, float outerradius, UINT sides, UINT rings, struct ID3DXMesh **mesh, ID3DXBuffer **adjacency);
/dports/lang/zig-devel/zig-0.9.0/lib/libc/include/any-windows-any/
H A Dd3dx9shape.h30 float depth, struct ID3DXMesh **mesh, struct ID3DXBuffer **adjacency);
32 … float length, UINT slices, UINT stacks, struct ID3DXMesh **mesh, struct ID3DXBuffer **adjacency);
34 ID3DXBuffer **adjacency);
36 UINT stacks, struct ID3DXMesh **mesh, struct ID3DXBuffer **adjacency);
38 struct ID3DXMesh **mesh, struct ID3DXBuffer **adjacency);
40 …float extrusion, struct ID3DXMesh **mesh, struct ID3DXBuffer **adjacency, GLYPHMETRICSFLOAT *glyph…
42 …FLOAT extrusion, struct ID3DXMesh **mesh, struct ID3DXBuffer **adjacency, GLYPHMETRICSFLOAT *glyph…
44 …dius, float outerradius, UINT sides, UINT rings, struct ID3DXMesh **mesh, ID3DXBuffer **adjacency);
/dports/sysutils/ansible/ansible-4.7.0/ansible_collections/cisco/ios/tests/integration/targets/ios_ospf_interfaces/vars/
H A Dmain.yaml8 - ip ospf adjacency stagger disable
19 - ipv6 ospf adjacency stagger disable
30 - adjacency: true
51 - adjacency: true
65 - ipv6 ospf adjacency stagger disable
74 - adjacency: true
95 - adjacency: true
105 - adjacency: true
115 - ip ospf adjacency stagger disable
142 - adjacency: true
[all …]
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vic/vendor/github.com/GoASTScanner/gas/vendor/github.com/nbutton23/zxcvbn-go/matching/
H A Dmatching.go13 ADJACENCY_GRAPHS []adjacency.AdjacencyGraph
14 L33T_TABLE adjacency.AdjacencyGraph
54 L33T_TABLE = adjacency.AdjacencyGph["l33t"]
56 ADJACENCY_GRAPHS = append(ADJACENCY_GRAPHS, adjacency.AdjacencyGph["qwerty"])
57 ADJACENCY_GRAPHS = append(ADJACENCY_GRAPHS, adjacency.AdjacencyGph["dvorak"])
58 ADJACENCY_GRAPHS = append(ADJACENCY_GRAPHS, adjacency.AdjacencyGph["keypad"])
59 ADJACENCY_GRAPHS = append(ADJACENCY_GRAPHS, adjacency.AdjacencyGph["macKeypad"])
/dports/security/gopass/gopass-1.13.0/vendor/github.com/nbutton23/zxcvbn-go/matching/
H A Dmatching.go14 adjacencyGraphs []adjacency.Graph
15 l33tTable adjacency.Graph
59 l33tTable = adjacency.GraphMap["l33t"]
61 adjacencyGraphs = append(adjacencyGraphs, adjacency.GraphMap["qwerty"])
62 adjacencyGraphs = append(adjacencyGraphs, adjacency.GraphMap["dvorak"])
63 adjacencyGraphs = append(adjacencyGraphs, adjacency.GraphMap["keypad"])
64 adjacencyGraphs = append(adjacencyGraphs, adjacency.GraphMap["macKeypad"])
/dports/dns/dnscrypt-proxy2/dnscrypt-proxy-2.1.1/vendor/github.com/nbutton23/zxcvbn-go/matching/
H A Dmatching.go14 adjacencyGraphs []adjacency.Graph
15 l33tTable adjacency.Graph
59 l33tTable = adjacency.GraphMap["l33t"]
61 adjacencyGraphs = append(adjacencyGraphs, adjacency.GraphMap["qwerty"])
62 adjacencyGraphs = append(adjacencyGraphs, adjacency.GraphMap["dvorak"])
63 adjacencyGraphs = append(adjacencyGraphs, adjacency.GraphMap["keypad"])
64 adjacencyGraphs = append(adjacencyGraphs, adjacency.GraphMap["macKeypad"])
/dports/multimedia/navidrome/navidrome-0.40.0/vendor/github.com/nbutton23/zxcvbn-go/matching/
H A Dmatching.go14 adjacencyGraphs []adjacency.Graph
15 l33tTable adjacency.Graph
59 l33tTable = adjacency.GraphMap["l33t"]
61 adjacencyGraphs = append(adjacencyGraphs, adjacency.GraphMap["qwerty"])
62 adjacencyGraphs = append(adjacencyGraphs, adjacency.GraphMap["dvorak"])
63 adjacencyGraphs = append(adjacencyGraphs, adjacency.GraphMap["keypad"])
64 adjacencyGraphs = append(adjacencyGraphs, adjacency.GraphMap["macKeypad"])
/dports/multimedia/navidrome/navidrome-0.40.0/vendor/github.com/kunwardeep/paralleltest/tools/vendor/github.com/nbutton23/zxcvbn-go/matching/
H A Dmatching.go14 adjacencyGraphs []adjacency.Graph
15 l33tTable adjacency.Graph
59 l33tTable = adjacency.GraphMap["l33t"]
61 adjacencyGraphs = append(adjacencyGraphs, adjacency.GraphMap["qwerty"])
62 adjacencyGraphs = append(adjacencyGraphs, adjacency.GraphMap["dvorak"])
63 adjacencyGraphs = append(adjacencyGraphs, adjacency.GraphMap["keypad"])
64 adjacencyGraphs = append(adjacencyGraphs, adjacency.GraphMap["macKeypad"])
/dports/graphics/py-pyqtgraph/pyqtgraph-0.12.3/pyqtgraph/graphicsItems/
H A DGraphItem.py22 self.adjacency = None
58 self.adjacency = kwds.pop('adj')
59 if hasattr(self.adjacency, '__len__') and len(self.adjacency) == 0:
60 self.adjacency = None
61 elif self.adjacency is not None and self.adjacency.dtype.kind not in 'iu':
103 if self.pen is None or self.pos is None or self.adjacency is None:
108 pts = self.pos[self.adjacency]
/dports/sysutils/ansible/ansible-4.7.0/ansible_collections/cisco/ios/tests/integration/targets/ios_ospfv3/vars/
H A Dmain.yaml10 - adjacency stagger 25 25
17 - adjacency stagger 200 200
23 - adjacency:
46 - adjacency:
66 - adjacency stagger 50 50
78 - adjacency stagger 50 50
95 - adjacency stagger 25 25
104 - adjacency stagger 200 200
/dports/graphics/R-cran-DiagrammeR/DiagrammeR/man/
H A Dfrom_adj_matrix.Rd5 \title{Create a graph using an adjacency matrix}
18 \item{x}{A square \code{matrix} object serving as the adjacency matrix.}
20 \item{mode}{The method in which to interpret the input adjacency matrix.
24 \item{weighted}{Whether to create a weighted graph from the adjacency matrix.}
26 \item{use_diag}{Whether to use the diagonal of the adjacency matrix in
45 Using an adjacency matrix object, generate a graph of class \code{dgr_graph}.
48 # Create an adjacency matrix
57 # Create a graph from the adjacency matrix
/dports/net-mgmt/py-napalm-logs/napalm-logs-0.9.0/napalm_logs/config/junos/
H A DOSPF_NEIGHBOR_UP.yml17 …rfaces//interface//{interface}//neighbors//neighbor//{neighbor}//state//adjacency-state-change-rea…
19 …rfaces//interface//{interface}//neighbors//neighbor//{neighbor}//state//adjacency-state: EXCHANGE_…
20 …rfaces//interface//{interface}//neighbors//neighbor//{neighbor}//state//adjacency-state-change-rea…
33 …rfaces//interface//{interface}//neighbors//neighbor//{neighbor}//state//adjacency-state-change-rea…
35 …nterfaces//interface//{interface}//neighbors//neighbor//{neighbor}//state//adjacency-state: TWO_WAY
36 …rfaces//interface//{interface}//neighbors//neighbor//{neighbor}//state//adjacency-state-change-rea…
49 …rfaces//interface//{interface}//neighbors//neighbor//{neighbor}//state//adjacency-state-change-rea…
51 …//interfaces//interface//{interface}//neighbors//neighbor//{neighbor}//state//adjacency-state: FULL
52 …rfaces//interface//{interface}//neighbors//neighbor//{neighbor}//state//adjacency-state-change-rea…
67 …//interfaces//interface//{interface}//neighbors//neighbor//{neighbor}//state//adjacency-state: FULL
[all …]
H A DISIS_NEIGHBOR_DOWN.yml10 line: 'IS-IS lost {level} adjacency to {neighbor} on {interface}, reason: {downReason}'
14 …rface//{interface}//levels//level//{level}//adjacencies//adjacency//{neighbor}//state//adjacency-s…
16 …rface//{interface}//levels//level//{level}//adjacencies//adjacency//{neighbor}//state//adjacency-s…
/dports/audio/praat/praat-6.2.03/fon/
H A DDistributions_and_Transition.cpp22 Transition adjacency, bool greedy)
34 if (adjacency && adjacency -> numberOfStates != underlying -> numberOfColumns)
35 Melder_throw (U"Number of states (", adjacency -> numberOfStates, U") in adjacency matrix "
65 if (adjacency) {
68 if (i != j && adjacency -> data [i] [j] != 0.0)
82 if (adjacency && adjacency -> data [i] [j] == 0) continue;
/dports/devel/py-trimesh/trimesh-3.5.25/trimesh/
H A Dgraph.py103 adjacency = edges_face[edge_groups]
106 nondegenerate = adjacency[:, 0] != adjacency[:, 1]
107 adjacency = adjacency[nondegenerate]
110 adjacency.sort(axis=1)
115 return adjacency, adjacency_edges
116 return adjacency
315 adjacency=None, argument
341 if adjacency is None:
351 edges=adjacency,
817 adjacency = adjacency[
[all …]
/dports/math/gfan/gfan0.6.2/src/
H A Dapp_fancoarsening.cpp87 map<IntegerVector,list<int> > adjacency; member in FanCoarseningApplication::MyTraverser
92 SphereTraverser traverser(cones,adjacency,v,normal); in moveToCone()
104 adjacency(adjacency_) in MyTraverser()
135 map<IntegerVector,list<int> > adjacency; in main() local
142 adjacency[j->getUniquePoint()].push_back(i); in main()
146 SphereTraverser traverser(F1,adjacency,F1[0].getUniquePoint(),*F1[0].getEquations().begin()); in main()
159 MyTraverser traverser(F1,adjacency,F1[0].getUniquePoint(),*F1[0].getEquations().begin()); in main()

12345678910>>...95