/dports/math/cbc/Cbc-releases-2.10.5/Cbc/src/ |
H A D | CbcModel.cpp | 17723 ClpDualRowDantzig *pivot = dynamic_cast< ClpDualRowDantzig * >(pivotMethod); local 17724 if (!pivot) {
|
/dports/math/py-yt/yt-4.0.1/yt/utilities/lib/cykdtree/ |
H A D | c_utils.cpp | 106 int64_t pivot(double *pts, uint64_t *idx, in pivot() function 132 return pivot(pts, idx, ndim, d, l, l+nsub-1); in pivot() 138 int64_t l, int64_t r, double pivot) { in partition_given_pivot() argument 146 if ((pts[ndim*idx[i]+d] > pivot) && (pts[ndim*idx[j]+d] <= pivot)) { in partition_given_pivot() 149 if (isEqual(pts[ndim*idx[i]+d], pivot)) tp = i; in partition_given_pivot() 151 if (pts[ndim*idx[i]+d] <= pivot) i++; in partition_given_pivot() 152 if (pts[ndim*idx[j]+d] > pivot) j--; in partition_given_pivot() 165 double pivot; in partition() local 170 pivot = pts[ndim*idx[p]+d]; in partition() 173 j = partition_given_pivot(pts, idx, ndim, d, l+1, r, pivot); in partition() [all …]
|
H A D | utils.pyx | 192 pivot. All elements of idx before the pivot will be less than 193 the pivot. If there is an odd number of points, the pivot will 207 cdef int64_t q = pivot(ptr_pos, ptr_idx, ndim, d, l, r) 217 p (np.int64_t): Element of pos[:,d] that should be used as the pivot 221 tuple of int64 and np.ndarray of uint64: Location of the pivot in the 223 such that elements before the pivot are smaller and elements after 224 the pivot are larger. 252 required to partition the array such that elements before the pivot 253 are smaller and elements after the pivot are larger. 285 the pivot are larger.
|
H A D | utils.cpp | 4997 …__pyx_v_q = pivot(__pyx_v_ptr_pos, __pyx_v_ptr_idx, __pyx_v_ndim, __pyx_v_d, __pyx_v_l, __pyx_v_r); in __pyx_pf_2yt_9utilities_3lib_8cykdtree_5utils_12py_pivot()
|
H A D | c_utils.hpp | 25 int64_t pivot(double *pts, uint64_t *idx, 30 int64_t l, int64_t r, double pivot);
|
H A D | utils.pxd | 25 int64_t l, int64_t r, double pivot) 29 int64_t pivot(double *pts, uint64_t *idx,
|
/dports/math/py-yt/yt-4.0.1/yt/utilities/lib/ |
H A D | geometry_utils.pyx | 747 cdef np.uint64_t done, pivot 751 # Set starting point & pivot 755 # Loop over array moving ind for points smaller than pivot to front 762 # Swap the pivot to the midpoint in the partition 767 # Set starting point & pivot 771 pivot = ind[h] 773 ppos[k] = pos[pivot,k] 798 ind[j] = pivot 878 # Do remaining parts on either side of pivot, sort side first
|
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/ |
H A D | fmpq_matxx.h | 159 bool pivot(slong r, slong c, permxx* perm = 0)
|
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/doc/source/ |
H A D | nmod_poly_mat.rst | 266 Attempts to find a pivot entry for row reduction. 278 Attempts to find a pivot entry for row reduction.
|
H A D | fq_mat.rst | 355 `P` is the row of `A` which has a pivot in the `i`-th column. If no such 357 in which the `n`-th row has a pivot after reduction. This will always be 358 chosen to be the first available column for a pivot from the left. This
|
H A D | fq_nmod_mat.rst | 356 `P` is the row of `A` which has a pivot in the `i`-th column. If no such 358 in which the `n`-th row has a pivot after reduction. This will always be 359 chosen to be the first available column for a pivot from the left. This
|
H A D | fq_zech_mat.rst | 323 `P` is the row of `A` which has a pivot in the `i`-th column. If no such 325 in which the `n`-th row has a pivot after reduction. This will always be 326 chosen to be the first available column for a pivot from the left. This
|
H A D | fmpz_mat.rst | 912 Attempts to find a pivot entry for row reduction. 979 modulo a prime `p` using ``nmod_mat_rref``. The pivot columns and rows 1043 the pivot entries in `B` will generally differ from unity.
|
H A D | fmpq_mat.rst | 467 nonzero pivot entry is found, leaves the inputs unchanged and returns 0.
|
H A D | nmod_mat.rst | 534 `P` is the row of `A` which has a pivot in the `i`-th column. If no such 536 in which the `n`-th row has a pivot after reduction. This will always be 537 chosen to be the first available column for a pivot from the left. This
|
H A D | flintxx_functions.rst | 1637 .. function:: bool Fmpq_mat_target::pivot(slong r, slong c, permxx* perm = 0)
|
H A D | fmpz_poly_mat.rst | 290 Attempts to find a pivot entry for row reduction. 302 Attempts to find a pivot entry for row reduction.
|
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/flintxx/test/ |
H A D | t-fmpq_matxx.cpp | 288 tassert(B.pivot(1, 1, &p1) == fmpq_mat_pivot(p1._data(), A._mat(), 1, 1)); in test_row_reduction()
|
/dports/math/gambit/gambit-16.0.1/src/tools/enumpoly/ |
H A D | pelqhull.cc | 1594 realT n, pivot, pivot_abs= 0.0, temp; in qh_gausselim() local 1632 pivot= *pivotrow++; /* signed value of pivot, and remainder of row */ in qh_gausselim() 1636 n= (*ai++)/pivot; /* divzero() not needed since |pivot| >= |*ai| */ in qh_gausselim()
|
/dports/math/frobby/frobby-0.9.1/test/testScripts/ |
H A D | run_euler_test | 20 $testhelper euler $tmpFile $test.euler -pivot hybrid $* 29 $testhelper euler $tmpFile $test.euler -pivot gen -autotranspose off $* 31 $testhelper euler $tmpFile $test.euler -pivot std -autotranspose off $* 47 -pivot gen -autotranspose off $* 50 -pivot std -autotranspose off $* 53 -pivot hybrid -autotranspose off $* 59 $testhelper euler $tmpFile $test.euler -pivot gen -genPivot $genp $* 63 $testhelper euler $tmpFile $test.euler -pivot gen \ 74 $testhelper euler $tmpFile $test.euler -pivot std \ 80 $testhelper euler $tmpFile $test.euler -pivot gen $* [all …]
|
/dports/math/pspp/pspp-1.4.1/ |
H A D | Makefile.in | 1177 src/output/page-setup-item.h src/output/pivot-output.c \ 1178 src/output/pivot-table.c src/output/pivot-table.h \ 1244 src/output/liboutput_la-pivot-output.lo \ 1245 src/output/liboutput_la-pivot-table.lo \ 2181 src/output/$(DEPDIR)/liboutput_la-pivot-output.Plo \ 2182 src/output/$(DEPDIR)/liboutput_la-pivot-table.Plo \
|
/dports/math/py-statsmodels/statsmodels-0.13.1/statsmodels/nonparametric/ |
H A D | kernel_regression.py | 398 def sig_test(self, var_pos, nboot=50, nested_res=25, pivot=False): 423 Sig = TestRegCoefC(self, var_pos, nboot, nested_res, pivot) 752 pivot=False): 764 self.pivot = pivot 777 if self.pivot:
|
/dports/math/gmp-ecm/ecm-7.0.4/ |
H A D | sets_long.c | 107 long pivot; in quicksort_long() local 123 pivot = a[i]; /* Median of three */ in quicksort_long() 129 if (a[i] > pivot) in quicksort_long() 131 for (; a[j] > pivot; j--); in quicksort_long() 140 ASSERT (a[j] <= pivot); in quicksort_long() 142 ASSERT(a[j] > pivot); in quicksort_long()
|
/dports/math/py-statsmodels/statsmodels-0.13.1/statsmodels/examples/ |
H A D | ex_kernel_regression_sigtest.py | 83 res1 = smkr.TestRegCoefC(model, [1], pivot=True, nboot=200, nested_res=50)
|
/dports/math/clp/Clp-1.17.3/Clp/src/ |
H A D | ClpPackedMatrix.cpp | 2443 double pivot = value * scaleFactor; in transposeTimes2UnscaledBit() local 2444 double pivotSquared = pivot * pivot; in transposeTimes2UnscaledBit() 2559 double pivot = value * scaleFactor; in transposeTimes2ScaledBit() local 2560 double pivotSquared = pivot * pivot; in transposeTimes2ScaledBit() 2741 double pivotSquared = pivot * pivot; in transposeTimes2() 2922 double pivotSquared = pivot * pivot; in transposeTimes2() 3126 double pivotSquared = pivot * pivot; in transposeTimes2() 3185 double pivotSquared = pivot * pivot; in transposeTimes2() 3252 double pivotSquared = pivot * pivot; in subsetTimes2() 3290 double pivotSquared = pivot * pivot; in subsetTimes2() [all …]
|