/dports/devel/capnproto/capnproto-0.9.0/c++/src/kj/ |
H A D | units.h | 660 OP(/, maxN) 781 inline constexpr Bounded<maxN, Number> assumeMax(BoundedConst<maxN>, Number value) { 845 inline constexpr Bounded<maxN, newT> upgradeBound(Bounded<maxN, T> value) { 934 OP(/, maxN / cvalue) 938 REVERSE_OP(%, maxN - 1) 943 OP(>>, maxN >> cvalue) 944 REVERSE_OP(>>, cvalue >> maxN) 949 OP(|, maxN | cvalue) 950 REVERSE_OP(|, maxN | cvalue) 1020 inline constexpr SafeUnwrapper<maxN, T> unbound(Bounded<maxN, T> bounded) { [all …]
|
/dports/devel/capnproto080/capnproto-0.8.0/c++/src/kj/ |
H A D | units.h | 654 OP(/, maxN) 775 inline constexpr Bounded<maxN, Number> assumeMax(BoundedConst<maxN>, Number value) { 839 inline constexpr Bounded<maxN, newT> upgradeBound(Bounded<maxN, T> value) { 928 OP(/, maxN / cvalue) 932 REVERSE_OP(%, maxN - 1) 937 OP(>>, maxN >> cvalue) 938 REVERSE_OP(>>, cvalue >> maxN) 943 OP(|, maxN | cvalue) 944 REVERSE_OP(|, maxN | cvalue) 1014 inline constexpr SafeUnwrapper<maxN, T> unbound(Bounded<maxN, T> bounded) { [all …]
|
/dports/science/libecpint/libecpint-1.0.7/src/lib/ |
H A D | gaussquad.cpp | 40 maxN = other.maxN; in GCQuadrature() 59 maxN = pow(2, p) - 1; in initGrid() 64 maxN = 3*pow(2, p) - 1; in initGrid() 66 M = (maxN-1)/2; // Midpoint in initGrid() 69 x.assign(maxN, 0.0); in initGrid() 70 w.assign(maxN, 0.0); in initGrid() 102 x[maxN - 1 - n] = x[n]; in initGrid() 178 Tm = w[M2]*f(x[M2], params, M2) + w[maxN - M2 - 1]*f(x[maxN - M2 - 1], params, maxN - M2 - 1); in integrate() 185 while(m < maxN && !converged) { in integrate() 226 assert(end >= 0 && end < maxN); in sumTerms() [all …]
|
/dports/www/hs-postgrest/postgrest-8.0.0/_cabal_deps/http2-3.0.2/Network/HPACK/Table/ |
H A D | Dynamic.hs | 55 maxN <- readIORef maxNumOfEntries 57 x <- adj maxN (didx - off) 111 adj maxN x 113 | otherwise = let ret = (x + maxN) `mod` maxN 220 maxN = maxNumbers maxsiz function 221 end = maxN - 1 230 end = maxN - 1 311 if maxN == 0 314 off' <- adj maxN (off - 1) 345 i <- adj maxN (off + n + 1) [all …]
|
/dports/lang/purescript/purescript-0.14.5/_cabal_deps/http2-3.0.2/Network/HPACK/Table/ |
H A D | Dynamic.hs | 55 maxN <- readIORef maxNumOfEntries 57 x <- adj maxN (didx - off) 111 adj maxN x 113 | otherwise = let ret = (x + maxN) `mod` maxN 220 maxN = maxNumbers maxsiz function 221 end = maxN - 1 230 end = maxN - 1 311 if maxN == 0 314 off' <- adj maxN (off - 1) 345 i <- adj maxN (off + n + 1) [all …]
|
/dports/finance/hs-hledger-web/hledger-web-1.19/_cabal_deps/http2-2.0.5/Network/HPACK/Table/ |
H A D | Dynamic.hs | 57 maxN <- readIORef maxNumOfEntries 59 x <- adj maxN (didx - off) 114 adj maxN x 116 | otherwise = let !ret = (x + maxN) `mod` maxN 129 maxN <- readIORef maxNumOfEntries 224 !maxN = maxNumbers maxsiz 225 !end = maxN - 1 235 !end = maxN - 1 323 !off' <- adj maxN (off - 1) 354 !i <- adj maxN (off + n + 1) [all …]
|
/dports/devel/hs-hoogle/hoogle-5.0.18.2/_cabal_deps/http2-2.0.4/Network/HPACK/Table/ |
H A D | Dynamic.hs | 57 maxN <- readIORef maxNumOfEntries 59 x <- adj maxN (didx - off) 114 adj maxN x 116 | otherwise = let !ret = (x + maxN) `mod` maxN 129 maxN <- readIORef maxNumOfEntries 224 !maxN = maxNumbers maxsiz 225 !end = maxN - 1 235 !end = maxN - 1 323 !off' <- adj maxN (off - 1) 354 !i <- adj maxN (off + n + 1) [all …]
|
/dports/www/hs-yesod-bin/yesod-bin-1.6.1/_cabal_deps/http2-2.0.6/Network/HPACK/Table/ |
H A D | Dynamic.hs | 57 maxN <- readIORef maxNumOfEntries 59 x <- adj maxN (didx - off) 114 adj maxN x 116 | otherwise = let !ret = (x + maxN) `mod` maxN 129 maxN <- readIORef maxNumOfEntries 224 !maxN = maxNumbers maxsiz 225 !end = maxN - 1 235 !end = maxN - 1 323 !off' <- adj maxN (off - 1) 354 !i <- adj maxN (off + n + 1) [all …]
|
/dports/www/hs-wai-app-static/wai-app-static-3.1.7.2/_cabal_deps/http2-2.0.6/Network/HPACK/Table/ |
H A D | Dynamic.hs | 57 maxN <- readIORef maxNumOfEntries 59 x <- adj maxN (didx - off) 114 adj maxN x 116 | otherwise = let !ret = (x + maxN) `mod` maxN 129 maxN <- readIORef maxNumOfEntries 224 !maxN = maxNumbers maxsiz 225 !end = maxN - 1 235 !end = maxN - 1 323 !off' <- adj maxN (off - 1) 354 !i <- adj maxN (off + n + 1) [all …]
|
/dports/devel/hs-git-annex/git-annex-8.20210903/_cabal_deps/http2-2.0.4/Network/HPACK/Table/ |
H A D | Dynamic.hs | 57 maxN <- readIORef maxNumOfEntries 59 x <- adj maxN (didx - off) 114 adj maxN x 116 | otherwise = let !ret = (x + maxN) `mod` maxN 129 maxN <- readIORef maxNumOfEntries 224 !maxN = maxNumbers maxsiz 225 !end = maxN - 1 235 !end = maxN - 1 323 !off' <- adj maxN (off - 1) 354 !i <- adj maxN (off + n + 1) [all …]
|
/dports/devel/vcglib/vcglib-2020.09/wrap/gl/ |
H A D | gl_field.h | 77 const ScalarType maxN, in GLDrawSingleFaceField() argument 81 assert(maxN>=minN); in GLDrawSingleFaceField() 87 if (maxN<=0) in GLDrawSingleFaceField() 101 if (Norm0>maxN)Norm0=maxN; in GLDrawSingleFaceField() 102 if (Norm1>maxN)Norm1=maxN; in GLDrawSingleFaceField() 110 Col0=vcg::Color4b::ColorRamp(minN,maxN,Norm0); in GLDrawSingleFaceField() 111 Col1=vcg::Color4b::ColorRamp(minN,maxN,Norm1); in GLDrawSingleFaceField() 112 W0=(Norm0/(maxN-minN))*IntervW+MinW; in GLDrawSingleFaceField() 113 W1=(Norm1/(maxN-minN))*IntervW+MinW; in GLDrawSingleFaceField() 117 ScalarType MaxAbs=std::max(fabs(minN),fabs(maxN)); in GLDrawSingleFaceField() [all …]
|
/dports/graphics/geomview/geomview-1.9.5/src/lib/gprim/bbox/ |
H A D | bboxbound.c | 51 HPointN *maxN; in BBoxBound() local 56 maxN = HPtNTransform(TN, bbox->max, NULL); in BBoxBound() 58 HPtNDehomogenize(maxN, maxN); in BBoxBound() 62 if (minN->v[i] > maxN->v[i]) { in BBoxBound() 63 tmp = maxN->v[i]; maxN->v[i] = minN->v[i]; minN->v[i] = tmp; in BBoxBound() 69 CR_NMIN, minN, CR_NMAX, maxN, CR_END); in BBoxBound() 71 HPtNDelete(maxN); in BBoxBound()
|
/dports/devel/blitz/blitz-1.0.2/manual/stencils/ |
H A D | dump-stencil.cpp | 16 const int maxN = 5; in dumpStencil() local 18 Array<double,2> A(Range(-maxN,maxN),Range(-maxN,maxN)), in dumpStencil() 19 B(Range(-maxN,maxN), Range(-maxN, maxN)); in dumpStencil()
|
/dports/science/libecpint/libecpint-1.0.7/doc/sphinx/source/api/ |
H A D | program_listing_file__Users_robertshaw_devfiles_libecpint_src_lib_gaussquad.cpp.rst | 51 maxN = other.maxN; 70 maxN = pow(2, p) - 1; 75 maxN = 3*pow(2, p) - 1; 77 M = (maxN-1)/2; // Midpoint 80 x.assign(maxN, 0.0); 81 w.assign(maxN, 0.0); 93 // and c_(maxN + 1 - i) = -c_i 95 // and w_(maxN + 1 - i) = w_i 113 x[maxN - 1 - n] = x[n]; 189 … Tm = w[M2]*f(x[M2], params, M2) + w[maxN - M2 - 1]*f(x[maxN - M2 - 1], params, maxN - M2 - 1); [all …]
|
H A D | program_listing_file__Users_robertshaw_devfiles_libecpint_new_src_lib_gaussquad.cpp.rst | 50 maxN = other.maxN; 71 maxN = pow(2, p) - 1; 76 maxN = 3*pow(2, p) - 1; 78 M = (maxN-1)/2; // Midpoint 80 end = maxN - 1; 83 x.assign(maxN, 0.0); 84 w.assign(maxN, 0.0); 98 // and w_(maxN + 1 - i) = w_i 116 x[maxN - 1 - n] = x[n]; 189 … Tm = w[M2]*f(x[M2], params, M2) + w[maxN - M2 - 1]*f(x[maxN - M2 - 1], params, maxN - M2 - 1); [all …]
|
/dports/biology/canu/canu-2.2/src/utility/src/tests/ |
H A D | bitsTest.C | 152 uint32 maxN = 10000000; in testUnary() local 160 for (uint32 ii=0; ii<maxN; ii++) { in testUnary() 173 for (uint32 ii=0; ii<maxN; ii++) { in testUnary() 184 for (uint32 ii=0; ii<maxN; ii++) in testUnary() 202 uint32 maxN = 10000000; in testBinary() local 211 for (uint32 ii=0; ii<maxN; ii++) { in testBinary() 225 for (uint32 ii=0; ii<maxN; ii++) { in testBinary() 236 for (uint32 ii=0; ii<maxN; ii++) { in testBinary() 261 uint32 maxN = 100000000; in testPrefixFree() local 276 for (uint32 ii=0; ii<maxN; ii++) { in testPrefixFree() [all …]
|
/dports/net-p2p/go-ethereum/go-ethereum-1.10.14/vendor/github.com/holiman/bloomfilter/v2/ |
H A D | new.go | 28 func OptimalK(m, maxN uint64) uint64 { 29 return uint64(math.Ceil(float64(m) * math.Ln2 / float64(maxN))) 35 func OptimalM(maxN uint64, p float64) uint64 { 36 return uint64(math.Ceil(-float64(maxN) * math.Log(p) / (math.Ln2 * math.Ln2))) 63 func NewOptimal(maxN uint64, p float64) (*Filter, error) { 64 m := OptimalM(maxN, p) 65 k := OptimalK(m, maxN)
|
/dports/biology/freebayes/freebayes-1.3.5/python/ |
H A D | logsumexp.py | 8 maxN = n 12 if n > maxN: 13 maxN = n 18 if maxAbs > maxN: 21 c = maxN
|
/dports/devel/blitz/blitz-1.0.2/doc/stencils/ |
H A D | dump-stencil.cpp | 15 const int maxN = 5; in dumpStencil() local 17 Array<double,2> A(Range(-maxN,maxN),Range(-maxN,maxN)), in dumpStencil() 18 B(Range(-maxN,maxN), Range(-maxN, maxN)); in dumpStencil()
|
/dports/audio/wolf-shaper-lv2/wolf-shaper-0.1.8-33-ge84de58/plugins/wolf-shaper/Libs/DSPFilters/include/DspFilters/ |
H A D | Legendre.h | 81 template <int maxN> 87 m_maxN = maxN; in PolynomialFinder() 99 assert (n <= maxN); in solve() 104 double m_ws [2 * maxN + 1]; 105 double m_as [ maxN + 1]; 106 double m_ps [2 * maxN + 1]; 107 double m_ss [2 * maxN + 1]; 108 double m_vs [2 * maxN + 4]; 109 double m_aas [ maxN + 1]; 110 double m_bbs [ maxN + 1];
|
/dports/math/g2o/g2o-20201223_git/g2o/core/ |
H A D | matrix_structure.cpp | 46 n(0), m(0), Ap(0), Aii(0), maxN(0), maxNz(0) in MatrixStructure() 58 maxN = n = n_; in alloc() 60 Ap = new int[maxN + 1]; in alloc() 70 if (maxN < n) { in alloc() 71 maxN = 2 * n; in alloc() 73 Ap = new int[maxN + 1]; in alloc() 82 maxN = 0; in free()
|
/dports/graphics/geomview/geomview-1.9.5/src/lib/gprim/skel/ |
H A D | skelbound.c | 84 HPointN *maxN; in NSkelBound() local 90 maxN = HPtNCopy(minN, NULL); in NSkelBound() 95 HPtNMinMax(minN, maxN, clean); in NSkelBound() 98 CR_NMIN, minN, CR_NMAX, maxN, CR_END); in NSkelBound() 101 HPtNDelete(maxN); in NSkelBound() 178 HPointN *maxN; in SkelBound() local 190 maxN = HPtNCopy(minN, NULL); in SkelBound() 198 HPtNMinMax(minN, maxN, ptN); in SkelBound() 201 CR_NMIN, minN, CR_NMAX, maxN, CR_END); in SkelBound() 205 HPtNDelete(maxN); in SkelBound()
|
/dports/math/gmp-ecm/ecm-7.0.4/ |
H A D | bestd.c | 120 unsigned long i, d1 = 0, d2 = 0, dF = 0, phid, k, maxN; in bestD() local 139 maxN = (po2) ? Npo2 : N; in bestD() 142 for (i = 0; i < maxN; i++) in bestD() 163 maxN = i; in bestD() 166 for (i = 0; i < maxN; i++) in bestD() 222 if (i == maxN) in bestD() 241 if (maxN == 0) in bestD()
|
/dports/graphics/geomview/geomview-1.9.5/src/lib/gprim/ndmesh/ |
H A D | ndmeshbound.c | 73 HPointN *maxN; in NDMeshBound() local 79 maxN = HPtNCopy(minN, NULL); in NDMeshBound() 83 HPtNMinMax(minN, maxN, ptN); in NDMeshBound() 86 CR_NMIN, minN, CR_NMAX, maxN, CR_END); in NDMeshBound() 90 HPtNDelete(maxN); in NDMeshBound()
|
/dports/graphics/geomview/geomview-1.9.5/src/lib/gprim/npolylist/ |
H A D | nplbound.c | 84 HPointN *maxN; in NPolyListBound() local 90 maxN = HPtNCopy(minN, NULL); in NPolyListBound() 96 HPtNMinMax(minN, maxN, clean); in NPolyListBound() 99 CR_NMIN, minN, CR_NMAX, maxN, CR_END); in NPolyListBound() 102 HPtNDelete(maxN); in NPolyListBound()
|