/dports/multimedia/opentoonz/opentoonz-1.5.0/thirdparty/superlu/SuperLU_4.1/SRC/ |
H A D | sp_coletree.c | 245 int first_kid[], in etdfs() argument 253 for (w = first_kid[v]; w != -1; w = next_kid[w]) { in etdfs() 254 etdfs (w, first_kid, next_kid, post, postnum); in etdfs() 267 int *first_kid, int *next_kid, in nr_etdfs() argument 275 first = first_kid[current]; in nr_etdfs() 324 first_kid = mxCallocInt (n+1); in TreePostorder() 329 for (v = 0; v <= n; first_kid[v++] = -1); in TreePostorder() 332 next_kid[v] = first_kid[dad]; in TreePostorder() 333 first_kid[dad] = v; in TreePostorder() 340 etdfs (n, first_kid, next_kid, post, &postnum); in TreePostorder() [all …]
|
/dports/math/geogram/geogram-1.7.7/src/lib/third_party/numerics/SUPERLU/ |
H A D | sp_coletree.c | 255 int first_kid[], in etdfs() argument 263 for (w = first_kid[v]; w != -1; w = next_kid[w]) { in etdfs() 264 etdfs (w, first_kid, next_kid, post, postnum); in etdfs() 277 int *first_kid, int *next_kid, in nr_etdfs() argument 285 first = first_kid[current]; in nr_etdfs() 334 first_kid = mxCallocInt (n+1); in TreePostorder() 339 for (v = 0; v <= n; first_kid[v++] = -1); in TreePostorder() 342 next_kid[v] = first_kid[dad]; in TreePostorder() 343 first_kid[dad] = v; in TreePostorder() 350 etdfs (n, first_kid, next_kid, post, &postnum); in TreePostorder() [all …]
|
/dports/science/apbs/apbs-pdb2pqr-apbs-1.5-102-g500c1473/apbs/externals/fetk/punc/src/superlu/ |
H A D | sp_coletree.c | 245 int first_kid[], in etdfs() argument 253 for (w = first_kid[v]; w != -1; w = next_kid[w]) { in etdfs() 254 etdfs (w, first_kid, next_kid, post, postnum); in etdfs() 267 int *first_kid, int *next_kid, in nr_etdfs() argument 275 first = first_kid[current]; in nr_etdfs() 324 first_kid = mxCallocInt (n+1); in TreePostorder() 329 for (v = 0; v <= n; first_kid[v++] = -1); in TreePostorder() 332 next_kid[v] = first_kid[dad]; in TreePostorder() 333 first_kid[dad] = v; in TreePostorder() 340 etdfs (n, first_kid, next_kid, post, &postnum); in TreePostorder() [all …]
|
/dports/science/py-scipy/scipy-1.7.1/scipy/sparse/linalg/dsolve/SuperLU/SRC/ |
H A D | sp_coletree.c | 255 int first_kid[], in etdfs() argument 263 for (w = first_kid[v]; w != -1; w = next_kid[w]) { in etdfs() 264 etdfs (w, first_kid, next_kid, post, postnum); in etdfs() 277 int *first_kid, int *next_kid, in nr_etdfs() argument 285 first = first_kid[current]; in nr_etdfs() 334 first_kid = mxCallocInt (n+1); in TreePostorder() 339 for (v = 0; v <= n; first_kid[v++] = -1); in TreePostorder() 342 next_kid[v] = first_kid[dad]; in TreePostorder() 343 first_kid[dad] = v; in TreePostorder() 350 etdfs (n, first_kid, next_kid, post, &postnum); in TreePostorder() [all …]
|
/dports/math/superlu/superlu-5.2.2/SRC/ |
H A D | sp_coletree.c | 255 int first_kid[], in etdfs() argument 263 for (w = first_kid[v]; w != -1; w = next_kid[w]) { in etdfs() 264 etdfs (w, first_kid, next_kid, post, postnum); in etdfs() 277 int *first_kid, int *next_kid, in nr_etdfs() argument 285 first = first_kid[current]; in nr_etdfs() 334 first_kid = mxCallocInt (n+1); in TreePostorder() 339 for (v = 0; v <= n; first_kid[v++] = -1); in TreePostorder() 342 next_kid[v] = first_kid[dad]; in TreePostorder() 343 first_kid[dad] = v; in TreePostorder() 350 etdfs (n, first_kid, next_kid, post, &postnum); in TreePostorder() [all …]
|
/dports/science/apbs/apbs-pdb2pqr-apbs-1.5-102-g500c1473/apbs/include/Eigen/src/SparseCore/ |
H A D | SparseColEtree.h | 129 void nr_etdfs (Index n, IndexVector& parent, IndexVector& first_kid, IndexVector& next_kid, IndexVe… in nr_etdfs() argument 135 first = first_kid(current); in nr_etdfs() 178 IndexVector first_kid, next_kid; // Linked list of children in treePostorder() local 181 first_kid.resize(n+1); in treePostorder() 187 first_kid.setConstant(-1); in treePostorder() 191 next_kid(v) = first_kid(dad); in treePostorder() 192 first_kid(dad) = v; in treePostorder() 197 internal::nr_etdfs(n, parent, first_kid, next_kid, post, postnum); in treePostorder()
|
/dports/math/libmesh/libmesh-1.6.2/contrib/eigen/3.2.9/Eigen/src/SparseCore/ |
H A D | SparseColEtree.h | 131 void nr_etdfs (Index n, IndexVector& parent, IndexVector& first_kid, IndexVector& next_kid, IndexVe… in nr_etdfs() argument 137 first = first_kid(current); in nr_etdfs() 180 IndexVector first_kid, next_kid; // Linked list of children in treePostorder() local 183 first_kid.resize(n+1); in treePostorder() 189 first_kid.setConstant(-1); in treePostorder() 193 next_kid(v) = first_kid(dad); in treePostorder() 194 first_kid(dad) = v; in treePostorder() 199 internal::nr_etdfs(n, parent, first_kid, next_kid, post, postnum); in treePostorder()
|
/dports/graphics/wdune/wdune-1.926/vcglib/eigenlib/Eigen/src/SparseCore/ |
H A D | SparseColEtree.h | 131 void nr_etdfs (Index n, IndexVector& parent, IndexVector& first_kid, IndexVector& next_kid, IndexVe… in nr_etdfs() argument 137 first = first_kid(current); in nr_etdfs() 180 IndexVector first_kid, next_kid; // Linked list of children in treePostorder() local 183 first_kid.resize(n+1); in treePostorder() 189 first_kid.setConstant(-1); in treePostorder() 193 next_kid(v) = first_kid(dad); in treePostorder() 194 first_kid(dad) = v; in treePostorder() 199 internal::nr_etdfs(n, parent, first_kid, next_kid, post, postnum); in treePostorder()
|
/dports/devel/bullet/bullet3-3.21/examples/ThirdPartyLibs/Eigen/src/SparseCore/ |
H A D | SparseColEtree.h | 130 void nr_etdfs (typename IndexVector::Scalar n, IndexVector& parent, IndexVector& first_kid, IndexVe… in nr_etdfs() argument 137 first = first_kid(current); in nr_etdfs() 181 IndexVector first_kid, next_kid; // Linked list of children in treePostorder() local 184 first_kid.resize(n+1); in treePostorder() 189 first_kid.setConstant(-1); in treePostorder() 193 next_kid(v) = first_kid(dad); in treePostorder() 194 first_kid(dad) = v; in treePostorder() 199 internal::nr_etdfs(n, parent, first_kid, next_kid, post, postnum); in treePostorder()
|
/dports/math/vtk9/VTK-9.1.0/ThirdParty/eigen/vtkeigen/eigen/src/SparseCore/ |
H A D | SparseColEtree.h | 130 void nr_etdfs (typename IndexVector::Scalar n, IndexVector& parent, IndexVector& first_kid, IndexVe… in nr_etdfs() argument 137 first = first_kid(current); in nr_etdfs() 181 IndexVector first_kid, next_kid; // Linked list of children in treePostorder() local 184 first_kid.resize(n+1); in treePostorder() 189 first_kid.setConstant(-1); in treePostorder() 193 next_kid(v) = first_kid(dad); in treePostorder() 194 first_kid(dad) = v; in treePostorder() 199 internal::nr_etdfs(n, parent, first_kid, next_kid, post, postnum); in treePostorder()
|
/dports/math/pdal/PDAL-2.3.0/vendor/eigen/Eigen/src/SparseCore/ |
H A D | SparseColEtree.h | 130 void nr_etdfs (typename IndexVector::Scalar n, IndexVector& parent, IndexVector& first_kid, IndexVe… in nr_etdfs() argument 137 first = first_kid(current); in nr_etdfs() 181 IndexVector first_kid, next_kid; // Linked list of children in treePostorder() local 184 first_kid.resize(n+1); in treePostorder() 189 first_kid.setConstant(-1); in treePostorder() 193 next_kid(v) = first_kid(dad); in treePostorder() 194 first_kid(dad) = v; in treePostorder() 199 internal::nr_etdfs(n, parent, first_kid, next_kid, post, postnum); in treePostorder()
|
/dports/graphics/blender/blender-2.91.0/extern/Eigen3/Eigen/src/SparseCore/ |
H A D | SparseColEtree.h | 130 void nr_etdfs (typename IndexVector::Scalar n, IndexVector& parent, IndexVector& first_kid, IndexVe… in nr_etdfs() argument 137 first = first_kid(current); in nr_etdfs() 181 IndexVector first_kid, next_kid; // Linked list of children in treePostorder() local 184 first_kid.resize(n+1); in treePostorder() 189 first_kid.setConstant(-1); in treePostorder() 193 next_kid(v) = first_kid(dad); in treePostorder() 194 first_kid(dad) = v; in treePostorder() 199 internal::nr_etdfs(n, parent, first_kid, next_kid, post, postnum); in treePostorder()
|
/dports/math/eigen3/eigen-3.3.9/Eigen/src/SparseCore/ |
H A D | SparseColEtree.h | 130 void nr_etdfs (typename IndexVector::Scalar n, IndexVector& parent, IndexVector& first_kid, IndexVe… in nr_etdfs() argument 137 first = first_kid(current); in nr_etdfs() 181 IndexVector first_kid, next_kid; // Linked list of children in treePostorder() local 184 first_kid.resize(n+1); in treePostorder() 189 first_kid.setConstant(-1); in treePostorder() 193 next_kid(v) = first_kid(dad); in treePostorder() 194 first_kid(dad) = v; in treePostorder() 199 internal::nr_etdfs(n, parent, first_kid, next_kid, post, postnum); in treePostorder()
|
/dports/graphics/appleseed/appleseed-2.1.0-beta/src/thirdparty/bcd/ext/eigen/Eigen/src/SparseCore/ |
H A D | SparseColEtree.h | 130 void nr_etdfs (typename IndexVector::Scalar n, IndexVector& parent, IndexVector& first_kid, IndexVe… in nr_etdfs() argument 137 first = first_kid(current); in nr_etdfs() 181 IndexVector first_kid, next_kid; // Linked list of children in treePostorder() local 184 first_kid.resize(n+1); in treePostorder() 189 first_kid.setConstant(-1); in treePostorder() 193 next_kid(v) = first_kid(dad); in treePostorder() 194 first_kid(dad) = v; in treePostorder() 199 internal::nr_etdfs(n, parent, first_kid, next_kid, post, postnum); in treePostorder()
|
/dports/math/stanmath/math-4.2.0/lib/eigen_3.3.9/Eigen/src/SparseCore/ |
H A D | SparseColEtree.h | 130 void nr_etdfs (typename IndexVector::Scalar n, IndexVector& parent, IndexVector& first_kid, IndexVe… in nr_etdfs() argument 137 first = first_kid(current); in nr_etdfs() 181 IndexVector first_kid, next_kid; // Linked list of children in treePostorder() local 184 first_kid.resize(n+1); in treePostorder() 189 first_kid.setConstant(-1); in treePostorder() 193 next_kid(v) = first_kid(dad); in treePostorder() 194 first_kid(dad) = v; in treePostorder() 199 internal::nr_etdfs(n, parent, first_kid, next_kid, post, postnum); in treePostorder()
|
/dports/science/InsightToolkit/ITK-5.0.1/Modules/ThirdParty/Eigen3/src/itkeigen/Eigen/src/SparseCore/ |
H A D | SparseColEtree.h | 130 void nr_etdfs (typename IndexVector::Scalar n, IndexVector& parent, IndexVector& first_kid, IndexVe… in nr_etdfs() argument 137 first = first_kid(current); in nr_etdfs() 181 IndexVector first_kid, next_kid; // Linked list of children in treePostorder() local 184 first_kid.resize(n+1); in treePostorder() 189 first_kid.setConstant(-1); in treePostorder() 193 next_kid(v) = first_kid(dad); in treePostorder() 194 first_kid(dad) = v; in treePostorder() 199 internal::nr_etdfs(n, parent, first_kid, next_kid, post, postnum); in treePostorder()
|
/dports/math/py-cvxpy/cvxpy-1.1.17/cvxpy/cvxcore/include/Eigen/src/SparseCore/ |
H A D | SparseColEtree.h | 130 void nr_etdfs (typename IndexVector::Scalar n, IndexVector& parent, IndexVector& first_kid, IndexVe… in nr_etdfs() argument 137 first = first_kid(current); in nr_etdfs() 181 IndexVector first_kid, next_kid; // Linked list of children in treePostorder() local 184 first_kid.resize(n+1); in treePostorder() 189 first_kid.setConstant(-1); in treePostorder() 193 next_kid(v) = first_kid(dad); in treePostorder() 194 first_kid(dad) = v; in treePostorder() 199 internal::nr_etdfs(n, parent, first_kid, next_kid, post, postnum); in treePostorder()
|
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/eigen/Eigen/src/SparseCore/ |
H A D | SparseColEtree.h | 130 void nr_etdfs (typename IndexVector::Scalar n, IndexVector& parent, IndexVector& first_kid, IndexVe… in nr_etdfs() argument 137 first = first_kid(current); in nr_etdfs() 181 IndexVector first_kid, next_kid; // Linked list of children in treePostorder() local 184 first_kid.resize(n+1); in treePostorder() 189 first_kid.setConstant(-1); in treePostorder() 193 next_kid(v) = first_kid(dad); in treePostorder() 194 first_kid(dad) = v; in treePostorder() 199 internal::nr_etdfs(n, parent, first_kid, next_kid, post, postnum); in treePostorder()
|
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/eigen/Eigen/src/SparseCore/ |
H A D | SparseColEtree.h | 130 void nr_etdfs (typename IndexVector::Scalar n, IndexVector& parent, IndexVector& first_kid, IndexVe… in nr_etdfs() argument 137 first = first_kid(current); in nr_etdfs() 181 IndexVector first_kid, next_kid; // Linked list of children in treePostorder() local 184 first_kid.resize(n+1); in treePostorder() 189 first_kid.setConstant(-1); in treePostorder() 193 next_kid(v) = first_kid(dad); in treePostorder() 194 first_kid(dad) = v; in treePostorder() 199 internal::nr_etdfs(n, parent, first_kid, next_kid, post, postnum); in treePostorder()
|
/dports/math/R-cran-RcppEigen/RcppEigen/inst/include/Eigen/src/SparseCore/ |
H A D | SparseColEtree.h | 130 void nr_etdfs (typename IndexVector::Scalar n, IndexVector& parent, IndexVector& first_kid, IndexVe… in nr_etdfs() argument 137 first = first_kid(current); in nr_etdfs() 181 IndexVector first_kid, next_kid; // Linked list of children in treePostorder() local 184 first_kid.resize(n+1); in treePostorder() 189 first_kid.setConstant(-1); in treePostorder() 193 next_kid(v) = first_kid(dad); in treePostorder() 194 first_kid(dad) = v; in treePostorder() 199 internal::nr_etdfs(n, parent, first_kid, next_kid, post, postnum); in treePostorder()
|
/dports/science/getdp/getdp-3.4.0-source/contrib/eigen/Eigen/src/SparseCore/ |
H A D | SparseColEtree.h | 130 void nr_etdfs (typename IndexVector::Scalar n, IndexVector& parent, IndexVector& first_kid, IndexVe… in nr_etdfs() argument 137 first = first_kid(current); in nr_etdfs() 181 IndexVector first_kid, next_kid; // Linked list of children in treePostorder() local 184 first_kid.resize(n+1); in treePostorder() 189 first_kid.setConstant(-1); in treePostorder() 193 next_kid(v) = first_kid(dad); in treePostorder() 194 first_kid(dad) = v; in treePostorder() 199 internal::nr_etdfs(n, parent, first_kid, next_kid, post, postnum); in treePostorder()
|
/dports/devel/upp/upp/uppsrc/plugin/Eigen/Eigen/src/SparseCore/ |
H A D | SparseColEtree.h | 130 void nr_etdfs (typename IndexVector::Scalar n, IndexVector& parent, IndexVector& first_kid, IndexVe… in nr_etdfs() argument 137 first = first_kid(current); in nr_etdfs() 181 IndexVector first_kid, next_kid; // Linked list of children in treePostorder() local 184 first_kid.resize(n+1); in treePostorder() 189 first_kid.setConstant(-1); in treePostorder() 193 next_kid(v) = first_kid(dad); in treePostorder() 194 first_kid(dad) = v; in treePostorder() 199 internal::nr_etdfs(n, parent, first_kid, next_kid, post, postnum); in treePostorder()
|
/dports/devel/vcglib/vcglib-2020.09/eigenlib/Eigen/src/SparseCore/ |
H A D | SparseColEtree.h | 130 void nr_etdfs (typename IndexVector::Scalar n, IndexVector& parent, IndexVector& first_kid, IndexVe… in nr_etdfs() argument 137 first = first_kid(current); in nr_etdfs() 181 IndexVector first_kid, next_kid; // Linked list of children in treePostorder() local 184 first_kid.resize(n+1); in treePostorder() 189 first_kid.setConstant(-1); in treePostorder() 193 next_kid(v) = first_kid(dad); in treePostorder() 194 first_kid(dad) = v; in treePostorder() 199 internal::nr_etdfs(n, parent, first_kid, next_kid, post, postnum); in treePostorder()
|
/dports/math/libsemigroups/libsemigroups-1.3.7/extern/eigen-3.3.7/Eigen/src/SparseCore/ |
H A D | SparseColEtree.h | 130 void nr_etdfs (typename IndexVector::Scalar n, IndexVector& parent, IndexVector& first_kid, IndexVe… in nr_etdfs() argument 137 first = first_kid(current); in nr_etdfs() 181 IndexVector first_kid, next_kid; // Linked list of children in treePostorder() local 184 first_kid.resize(n+1); in treePostorder() 189 first_kid.setConstant(-1); in treePostorder() 193 next_kid(v) = first_kid(dad); in treePostorder() 194 first_kid(dad) = v; in treePostorder() 199 internal::nr_etdfs(n, parent, first_kid, next_kid, post, postnum); in treePostorder()
|
/dports/science/pcmsolver/pcmsolver-1.3.0/external/eigen3/include/eigen3/Eigen/src/SparseCore/ |
H A D | SparseColEtree.h | 130 void nr_etdfs (typename IndexVector::Scalar n, IndexVector& parent, IndexVector& first_kid, IndexVe… in nr_etdfs() argument 137 first = first_kid(current); in nr_etdfs() 181 IndexVector first_kid, next_kid; // Linked list of children in treePostorder() local 184 first_kid.resize(n+1); in treePostorder() 189 first_kid.setConstant(-1); in treePostorder() 193 next_kid(v) = first_kid(dad); in treePostorder() 194 first_kid(dad) = v; in treePostorder() 199 internal::nr_etdfs(n, parent, first_kid, next_kid, post, postnum); in treePostorder()
|