Home
last modified time | relevance | path

Searched +defs:p +defs:dense (Results 1 – 25 of 245) sorted by relevance

12345678910

/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fq/profile/
H A Dp-reduce.c21 fmpz_t p; in main() local
25 double dense; in main() local
/dports/math/e-antic/flint2-ae7ec89/fq/profile/
H A Dp-reduce.c21 fmpz_t p; in main() local
25 double dense; in main() local
/dports/math/flint2/flint-2.8.4/fq/profile/
H A Dp-reduce.c21 fmpz_t p; in main() local
25 double dense; in main() local
/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/test/java/org/apache/commons/math3/linear/
H A DDiagonalMatrixTest.java90 final RealMatrix p = m.createMatrix(5, 5); in testCreate() local
100 final DiagonalMatrix p = (DiagonalMatrix) m.copy(); in testCopy() local
239 final RealMatrix dense = new Array2DRowRealMatrix(diag.getData()); in testOperate() local
252 final RealMatrix dense = new Array2DRowRealMatrix(diag.getData()); in testPreMultiply() local
265 final RealMatrix dense = new Array2DRowRealMatrix(diag.getData()); in testPreMultiplyVector() local
/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-core-distance/src/test/java/de/lmu/ifi/dbs/elki/distance/distancefunction/
H A DArcCosineUnitlengthDistanceFunctionTest.java86 int p = r.nextInt(dim - j) + j; in compareSparseUnitSphere() local
100 DoubleVector[] dense = new DoubleVector[10]; in compareSparseUnitSphere() local
H A DCosineUnitlengthDistanceFunctionTest.java86 int p = r.nextInt(dim - j) + j; in compareSparseUnitSphere() local
100 DoubleVector[] dense = new DoubleVector[10]; in compareSparseUnitSphere() local
/dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/hana/fwd/
H A Dis_disjoint.hpp17 BOOST_HANA_NAMESPACE_BEGIN
41 struct is_disjoint_t {
/dports/devel/cgit/cgit-1.2.3/git/
H A Dcombine-diff.c38 struct combine_diff_path *p, **tail = &curr; in intersect_paths() local
610 int num_parent, int dense) in make_hunks()
926 int dense, in show_combined_header()
1015 int dense, int working_tree_file, in show_patch_diff()
1285 void show_combined_diff(struct combine_diff_path *p, in show_combined_diff()
1287 int dense, in show_combined_diff()
1315 static struct diff_filepair *combined_pair(struct combine_diff_path *p, in combined_pair()
1348 struct combine_diff_path *p; in handle_combined_callback() local
1457 int dense, in diff_tree_combined()
1462 struct combine_diff_path *p, *paths; in diff_tree_combined() local
[all …]
/dports/math/pdal/PDAL-2.3.0/filters/private/hexer/
H A DHexGrid.cpp69 bool HexGrid::dense(Hexagon *h) in dense() function in hexer::HexGrid
74 void HexGrid::addPoint(Point p) in addPoint()
181 Hexagon *HexGrid::findHexagon(Point p) in findHexagon()
302 Path *p = m_paths[i]; in findParentPaths() local
316 void HexGrid::findParentPath(Path *p) in findParentPath()
345 Path *p = new Path(this, CLOCKWISE); in findShape() local
359 void HexGrid::cleanPossibleRoot(Segment s, Path *p) in cleanPossibleRoot()
/dports/graphics/mahotas/mahotas-1.4.11/mahotas/features/
H A Dsurf.py183 def dense(f, spacing, scale=None, is_integral=False, include_interest_point=False): function
276 def rotate_around(p, c, a): argument
/dports/science/colt/colt/src/cern/colt/matrix/impl/
H A DBenchmark.java86 DoubleMatrix2D dense = DoubleFactory2D.dense.make(size,size); in benchmark() local
123 int p = B.rows(); in benchmark() local
/dports/math/gap/gap-4.11.0/pkg/kbmag-1.5.9/standalone/lib/
H A Dfsa.c1307 boolean *got, dense; in fsa_bfs() local
1376 boolean dense; in fsa_count() local
1480 boolean dense, done, backtrack, foundword, prod, numbers; in fsa_enumerate() local
1696 unsigned *fsa_mod_count(fsa *fsaptr, unsigned p, unsigned num) in fsa_mod_count()
1700 boolean dense; in fsa_mod_count() local
1753 unsigned mod_inverse(unsigned i, unsigned p) in mod_inverse()
1773 int mod_solve(int **A, int *B, unsigned p, unsigned n) in mod_solve()
1815 int fsa_mod_growth(fsa *fsaptr, fraction *f, unsigned p) in fsa_mod_growth()
1855 void mod_normal(int *poly, unsigned d, unsigned p) in mod_normal()
/dports/math/dbcsr/dbcsr-2.1.0/src/ops/
H A Ddbcsr_test_methods.F104 SUBROUTINE dbcsr_impose_sparsity(sparse, dense) argument
109 TYPE(dbcsr_data_obj), INTENT(inout) :: dense local
215 SUBROUTINE dbcsr_to_dense_local(sparse, dense) argument
220 TYPE(dbcsr_data_obj), INTENT(inout) :: dense local
337 numproc, nze, p, row, s_col, s_row local
/dports/math/algae/algae-4.3.6/src/
H A Dentity.h55 dense, enumerator
144 #define EAT( p ) eat( (void **) &(p) ) argument
146 #define ENT( p ) ( (ENTITY *) ( p ) ) argument
153 #define FREE_CHAR( p ) if ( p != NULL_string ) FREE( p ); else ; argument
154 #define ASSIGN_CHAR( p, q ) FREE_CHAR( p ); p = q argument
155 #define TFREE( p ) if ( p ) FREE( EAT( p ) ); else ; argument
166 #define delete_entity( p ) DB_delete_entity( p, __FILE__, __LINE__ ) argument
167 #define copy_entity( p ) DB_copy_entity( ENT(p), __FILE__, __LINE__ ) argument
169 #define delete_entity( p ) if ( (p) && --ENT(p)->ref_count == 0 ) \ argument
171 #define copy_entity( p ) ( ++ENT(p)->ref_count, ENT(p) ) argument
/dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/exts/dbcsr/src/ops/
H A Ddbcsr_test_methods.F104 SUBROUTINE dbcsr_impose_sparsity(sparse, dense) argument
109 TYPE(dbcsr_data_obj), INTENT(inout) :: dense local
216 SUBROUTINE dbcsr_to_dense_local(sparse, dense) argument
221 TYPE(dbcsr_data_obj), INTENT(inout) :: dense local
340 numproc, nze, p, row, s_col, s_row local
/dports/lang/gcc48/gcc-4.8.5/libgo/go/regexp/
H A Dexec.go16 dense []entry member
39 p *syntax.Prog // compiled program member
/dports/games/hyperrogue/hyperrogue-12.0f/rogueviz/
H A Dinner-maps.cpp33 bool dense = false; variable
176 auto& p = lti[c]; in render() local
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/libgo/go/regexp/
H A Dexec.go16 dense []entry member
39 p *syntax.Prog // compiled program member
/dports/devel/mingw32-gcc/gcc-4.8.1/libgo/go/regexp/
H A Dexec.go16 dense []entry member
39 p *syntax.Prog // compiled program member
/dports/devel/bullet/bullet3-3.21/examples/ThirdPartyLibs/Eigen/src/OrderingMethods/
H A DAmd.h52 StorageIndex i, p, top = 0; in cs_tdfs() local
89 k2, k3, jlast, ln, dense, nzmax, mindeg = 0, nvi, nvj, nvk, mark, wnvi, in minimum_degree_ordering() local
90 ok, nel = 0, p, p1, p2, p3, p4, pj, pk, pk1, pk2, pn, q, t, h; in minimum_degree_ordering() local
/dports/math/pdal/PDAL-2.3.0/vendor/eigen/Eigen/src/OrderingMethods/
H A DAmd.h52 StorageIndex i, p, top = 0; in cs_tdfs() local
89 k2, k3, jlast, ln, dense, nzmax, mindeg = 0, nvi, nvj, nvk, mark, wnvi, in minimum_degree_ordering() local
90 ok, nel = 0, p, p1, p2, p3, p4, pj, pk, pk1, pk2, pn, q, t, h; in minimum_degree_ordering() local
/dports/graphics/blender/blender-2.91.0/extern/Eigen3/Eigen/src/OrderingMethods/
H A DAmd.h62 StorageIndex i, p, top = 0; in cs_tdfs() local
99 k2, k3, jlast, ln, dense, nzmax, mindeg = 0, nvi, nvj, nvk, mark, wnvi, in minimum_degree_ordering() local
100 ok, nel = 0, p, p1, p2, p3, p4, pj, pk, pk1, pk2, pn, q, t, h; in minimum_degree_ordering() local
/dports/math/eigen3/eigen-3.3.9/Eigen/src/OrderingMethods/
H A DAmd.h62 StorageIndex i, p, top = 0; in cs_tdfs() local
99 k2, k3, jlast, ln, dense, nzmax, mindeg = 0, nvi, nvj, nvk, mark, wnvi, in minimum_degree_ordering() local
100 ok, nel = 0, p, p1, p2, p3, p4, pj, pk, pk1, pk2, pn, q, t, h; in minimum_degree_ordering() local
/dports/graphics/appleseed/appleseed-2.1.0-beta/src/thirdparty/bcd/ext/eigen/Eigen/src/OrderingMethods/
H A DAmd.h62 StorageIndex i, p, top = 0; in cs_tdfs() local
99 k2, k3, jlast, ln, dense, nzmax, mindeg = 0, nvi, nvj, nvk, mark, wnvi, in minimum_degree_ordering() local
100 ok, nel = 0, p, p1, p2, p3, p4, pj, pk, pk1, pk2, pn, q, t, h; in minimum_degree_ordering() local
/dports/astro/merkaartor/merkaartor-0.19.0/src/ImportExport/
H A DImportExportPBF.cpp57 static void *SzAlloc( void *p, size_t size) in SzAlloc()
63 static void SzFree( void *p, void *address) in SzFree()
453 const OSMPBF::DenseNodes& dense = m_primitiveBlock.primitivegroup( m_currentGroup ).dense(); in parseDense() local

12345678910