/dports/math/py-PyMetis/PyMetis-2020.1/pymetis/ |
H A D | __init__.py | 35 def _prepare_graph(adjacency, xadj, adjncy): argument 56 def nested_dissection(adjacency=None, xadj=None, adjncy=None): argument 70 def part_graph(nparts, adjacency=None, xadj=None, adjncy=None, argument
|
/dports/misc/usd/USD-21.11/pxr/imaging/hd/ |
H A D | smoothNormals.cpp | 108 Hd_VertexAdjacency const * adjacency, in ComputeSmoothNormals() 119 Hd_VertexAdjacency const * adjacency, in ComputeSmoothNormals() 130 Hd_VertexAdjacency const * adjacency, in ComputeSmoothNormalsPacked() 142 Hd_VertexAdjacency const * adjacency, in ComputeSmoothNormalsPacked() 152 Hd_VertexAdjacency const *adjacency, in Hd_SmoothNormalsComputation()
|
H A D | vertexAdjacency.cpp | 168 Hd_VertexAdjacency *adjacency, HdMeshTopology const *topology) in Hd_AdjacencyBuilderComputation() 199 Hd_VertexAdjacency const *adjacency, in Hd_AdjacencyBufferSource() 215 VtIntArray const &adjacency = _adjacency->GetAdjacencyTable(); in Resolve() local
|
/dports/graphics/opensubdiv/OpenSubdiv-3_4_4/examples/glEvalLimit/ |
H A D | particles.cpp | 54 std::vector<STParticles::FaceInfo> const &adjacency, in TbbUpdateKernel() 237 WarpQuad(std::vector<STParticles::FaceInfo> const &adjacency, in WarpQuad() 271 std::vector<STParticles::FaceInfo> const &adjacency) { in ConstrainQuad() 348 std::vector<STParticles::FaceInfo> const &adjacency) { in ConstrainTri() 377 std::vector<STParticles::FaceInfo> const &adjacency, in UpdateParticle()
|
/dports/math/gfan/gfan0.6.2/src/ |
H A D | traverser_sphere.h | 14 map<IntegerVector,list<int> > adjacency; variable
|
H A D | app_fancoarsening.cpp | 87 map<IntegerVector,list<int> > adjacency; member in FanCoarseningApplication::MyTraverser 135 map<IntegerVector,list<int> > adjacency; in main() local
|
/dports/devel/llvm13/llvm-project-13.0.1.src/clang/test/SemaObjC/ |
H A D | attr-availability-priority.m | 39 void pragmaExplicitWinsOverPragmaImplicit(); // expected-note {{marked deprecated here}}
|
/dports/math/gfanlib/gfan0.6.2/src/ |
H A D | traverser_sphere.h | 14 map<IntegerVector,list<int> > adjacency; variable
|
H A D | app_fancoarsening.cpp | 87 map<IntegerVector,list<int> > adjacency; member in FanCoarseningApplication::MyTraverser 135 map<IntegerVector,list<int> > adjacency; in main() local
|
/dports/science/py-ase/ase-3.22.0/ase/geometry/dimensionality/ |
H A D | rank_determination.py | 49 def bfs(adjacency, start): argument 83 def traverse_component_graphs(adjacency): argument
|
/dports/misc/usd/USD-21.11/pxr/imaging/hdSt/ |
H A D | smoothNormals.cpp | 66 HgiBufferHandle const& adjacency) in _CreateResourceBindings() 123 Hd_VertexAdjacency const *adjacency, in HdSt_SmoothNormalsComputationGPU() 237 HdStBufferResourceSharedPtr adjacency = adjacencyRange->GetResource(); in Execute() local
|
/dports/security/gopass/gopass-1.13.0/vendor/github.com/nbutton23/zxcvbn-go/adjacency/ |
H A D | adjacmartix_test.go | 1 package adjacency package
|
/dports/multimedia/navidrome/navidrome-0.40.0/vendor/github.com/nbutton23/zxcvbn-go/adjacency/ |
H A D | adjacmartix_test.go | 1 package adjacency package
|
/dports/graphics/mesa-devel/mesa-22.0-branchpoint-2059-ge8a63cf61ec/src/panfrost/bifrost/ |
H A D | bi_opt_push_ubo.c | 191 bi_find_component(adjacency_row *adjacency, BITSET_WORD *visited, in bi_find_component() 230 bi_create_fau_interference_graph(bi_context *ctx, adjacency_row *adjacency) in bi_create_fau_interference_graph() 282 adjacency_row adjacency[PAN_MAX_PUSH] = { 0 }; in bi_opt_reorder_push() local
|
/dports/devel/llvm70/llvm-7.0.1.src/test/CodeGen/X86/ |
H A D | avx512-unsafe-fp-math.ll | 39 define <8 x double> @test_max_v8f64(<8 x double> * %a_ptr, <8 x double> %b) {
|
/dports/math/cddlib/cddlib-0.94l/src/ |
H A D | Makefile.am | 7 adjacency \ program
|
/dports/databases/postgresql96-pltcl/postgresql-9.6.24/src/include/lib/ |
H A D | bipartite_match.h | 32 short **adjacency; /* adjacency[u] = [k, v1,v2,v3,...,vk] */ member
|
/dports/databases/postgresql96-server/postgresql-9.6.24/src/include/lib/ |
H A D | bipartite_match.h | 32 short **adjacency; /* adjacency[u] = [k, v1,v2,v3,...,vk] */ member
|
/dports/databases/postgresql96-plpython/postgresql-9.6.24/src/include/lib/ |
H A D | bipartite_match.h | 32 short **adjacency; /* adjacency[u] = [k, v1,v2,v3,...,vk] */ member
|
/dports/databases/postgresql10-server/postgresql-10.19/src/include/lib/ |
H A D | bipartite_match.h | 32 short **adjacency; /* adjacency[u] = [k, v1,v2,v3,...,vk] */ member
|
/dports/databases/postgresql11-client/postgresql-11.14/src/include/lib/ |
H A D | bipartite_match.h | 32 short **adjacency; /* adjacency[u] = [k, v1,v2,v3,...,vk] */ member
|
/dports/databases/postgresql10-pltcl/postgresql-10.19/src/include/lib/ |
H A D | bipartite_match.h | 32 short **adjacency; /* adjacency[u] = [k, v1,v2,v3,...,vk] */ member
|
/dports/databases/postgresql10-client/postgresql-10.19/src/include/lib/ |
H A D | bipartite_match.h | 32 short **adjacency; /* adjacency[u] = [k, v1,v2,v3,...,vk] */ member
|
/dports/databases/postgresql10-contrib/postgresql-10.19/src/include/lib/ |
H A D | bipartite_match.h | 32 short **adjacency; /* adjacency[u] = [k, v1,v2,v3,...,vk] */ member
|
/dports/databases/postgresql10-plpython/postgresql-10.19/src/include/lib/ |
H A D | bipartite_match.h | 32 short **adjacency; /* adjacency[u] = [k, v1,v2,v3,...,vk] */ member
|