/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-index-mtree/src/main/java/de/lmu/ifi/dbs/elki/index/tree/metrical/mtreevariants/mktrees/ |
H A D | MkTreeHeader.java | 47 private int k_max; field in MkTreeHeader 64 public MkTreeHeader(int pageSize, int dirCapacity, int leafCapacity, int k_max) { in MkTreeHeader() argument 66 this.k_max = k_max; in MkTreeHeader() 79 this.k_max = file.readInt(); in readHeader() 92 file.writeInt(this.k_max); in writeHeader() 101 return k_max; in getK_max()
|
/dports/games/angband/Angband-4.2.2/src/tests/object/ |
H A D | alloc.c | 26 z_info->k_max = 5; in setup_tests() 36 k_info = mem_zalloc(sizeof(*k_info) * z_info->k_max); in setup_tests() 62 st->expected = mem_alloc(z_info->k_max * sizeof(*st->expected)); in setup_tests() 158 for (i = 0; i < z_info->k_max; ++i) { in compute_obj_num_expected() 184 for (j = 0; j < z_info->k_max; ++j) { in compute_obj_num_expected() 193 for (j = 0; j < z_info->k_max; ++j) { in compute_obj_num_expected() 203 for (i = 0; i < z_info->k_max; ++i) { in compute_obj_num_expected() 243 for (i = 0; i < z_info->k_max; ++i) { in test_get_obj_num_basic() 251 for (j = 0; j < z_info->k_max; ++j) { in test_get_obj_num_basic() 268 require(k < z_info->k_max); in test_get_obj_num_basic() [all …]
|
/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-index-rtree/src/main/java/de/lmu/ifi/dbs/elki/index/tree/spatial/rstarvariants/rdknn/ |
H A D | RdKNNTreeHeader.java | 44 int k_max; field in RdKNNTreeHeader 63 …ader(int pageSize, int dirCapacity, int leafCapacity, int dirMinimum, int leafMinimum, int k_max) { in RdKNNTreeHeader() argument 65 this.k_max = k_max; in RdKNNTreeHeader() 77 this.k_max = file.readInt(); in readHeader() 88 file.writeInt(this.k_max); in writeHeader()
|
H A D | RdkNNSettings.java | 37 int k_max; field in RdkNNSettings 50 public RdkNNSettings(int k_max, SpatialPrimitiveDistanceFunction<NumberVector> distanceFunction) { in RdkNNSettings() argument 52 this.k_max = k_max; in RdkNNSettings()
|
H A D | RdKNNTree.java | 125 KNNHeap knns_o = DBIDUtil.newHeap(settings.k_max); in preInsert() 141 List<? extends KNNList> knnLists = knnQuery.getKNNForBulkDBIDs(ids, settings.k_max); in postDelete() 162 List<? extends KNNList> knnLists = knnQuery.getKNNForBulkDBIDs(ids, settings.k_max); in bulkLoad() 171 if(k > settings.k_max) { in reverseKNNQuery() 172 …IllegalArgumentException("Parameter k is not supported, k > k_max: " + k + " > " + settings.k_max); in reverseKNNQuery() 179 if(k == settings.k_max) { in reverseKNNQuery() 206 if(k > settings.k_max) { in bulkReverseKNNQueryForID() 218 if(k == settings.k_max) { in bulkReverseKNNQueryForID() 358 if(knns_q.size() >= settings.k_max) { in preInsert() 367 … KNNList knns_without_q = knnQuery.getKNNForObject(relation.get(p.getDBID()), settings.k_max); in preInsert() [all …]
|
/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-index-mtree/src/main/java/de/lmu/ifi/dbs/elki/index/tree/metrical/mtreevariants/mktrees/mkcop/ |
H A D | MkCoPTreeNode.java | 70 protected ApproximationLine conservativeKnnDistanceApproximation(int k_max) { in conservativeKnnDistanceApproximation() argument 72 int k_0 = k_max; in conservativeKnnDistanceApproximation() 86 double entry_y_kmax = approx.getValueAt(k_max); in conservativeKnnDistanceApproximation() 97 double m = (y_kmax - y_1) / (FastMath.log(k_max) - FastMath.log(k_0)); in conservativeKnnDistanceApproximation() 111 protected ApproximationLine progressiveKnnDistanceApproximation(int k_max) { in progressiveKnnDistanceApproximation() argument 131 y_kmax = Math.min(approx.getValueAt(k_max), y_kmax); in progressiveKnnDistanceApproximation() 135 double m = (y_kmax - y_1) / (FastMath.log(k_max) - FastMath.log(k_0)); in progressiveKnnDistanceApproximation() 155 int k_max = ((MkCoPTree<O>) mTree).getKmax(); in integrityCheckParameters() local 156 ApproximationLine approx = conservativeKnnDistanceApproximation(k_max); in integrityCheckParameters()
|
/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-index-mtree/src/main/java/de/lmu/ifi/dbs/elki/index/tree/metrical/mtreevariants/mktrees/mktab/ |
H A D | MkTabDirectoryEntry.java | 97 int k_max = knnDistances.length; in writeExternal() local 98 out.writeInt(k_max); in writeExternal() 99 for(int i = 0; i < k_max; i++) { in writeExternal() 116 int k_max = in.readInt(); in readExternal() local 117 knnDistances = new double[k_max]; in readExternal() 118 for(int i = 0; i < k_max; i++) { in readExternal()
|
H A D | MkTabLeafEntry.java | 99 int k_max = knnDistances.length; in writeExternal() local 100 out.writeInt(k_max); in writeExternal() 101 for(int i = 0; i < k_max; i++) { in writeExternal() 118 int k_max = in.readInt(); in readExternal() local 119 knnDistances = new double[k_max]; in readExternal() 120 for(int i = 0; i < k_max; i++) { in readExternal()
|
/dports/math/singular/Singular-Release-4-2-1/IntegerProgramming/ |
H A D | LLL.cc | 123 for(short i=k+1;i<=k_max;i++) in SWAPI() 168 for(short i=k+1;i<=k_max;i++) in SWAPK() 177 for(short i=k+1;i<=k_max;i++) in SWAPK() 194 for(short j=k+1;j<=k_max-1;j++) in SWAPK() 198 for(short j=k+1;j<=k_max;j++) in SWAPK() 280 short k_max=0; in relations() local 321 if(k>k_max) in relations() 324 k_max=k; in relations() 487 short k_max=0; in integral_LLL() local 506 if(k>k_max) in integral_LLL() [all …]
|
/dports/games/zangband/zangband/src/ |
H A D | obj_kind.c | 54 for (i = 1; i < z_info->k_max; i++) in k_info_reset() 71 while (k_info_size <= z_info->k_max) in k_info_add() 88 z_info->k_max++; in k_info_add() 91 COPY(&k_info[z_info->k_max - 1], k_info_entry, object_kind); in k_info_add() 94 return (&k_info[z_info->k_max - 1]); in k_info_add() 129 for (i = 1; i < z_info->k_max; i++) in init_object_alloc() 168 for (i = 1; i < z_info->k_max; i++) in init_object_alloc()
|
/dports/games/xray_re-tools/xray_re-tools-52721d2/sources/xray_re/ |
H A D | xr_color.h | 50 const T k_max = T(255); in get() local 51 rgba32 rgba = uint32_t(a*k_max) << 24; in get() 52 rgba |= uint32_t(b*k_max) << 16; in get() 53 rgba |= uint32_t(g*k_max) << 8; in get() 54 rgba |= uint32_t(r*k_max); in get()
|
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/pecos/src/ |
H A D | OrthogonalPolynomial.cpp | 49 unsigned short i_max, j_max, k_max; // define loop limits in descending order in precompute_triple_products() local 51 k_max = *cit; ++cit; j_max = *cit; ++cit; i_max = *cit; in precompute_triple_products() 55 if (i_max > i_ref || j_max > j_ref || k_max > k_ref) compute = true; in precompute_triple_products() 62 size_t i, j, k, l, max_quad_order = (i_max + j_max + k_max)/2 + 1;// rounds up in precompute_triple_products() 81 for (k=0; k<=j && k<=k_max; ++k) { in precompute_triple_products()
|
/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-clustering/src/main/java/de/lmu/ifi/dbs/elki/algorithm/clustering/kmeans/ |
H A D | XMeans.java | 111 private int k, k_min, k_max; field in XMeans 140 …public XMeans(NumberVectorDistanceFunction<? super V> distanceFunction, int k_min, int k_max, int … in XMeans() argument 143 this.k_max = k_max; in XMeans() 162 …ress prog = LOG.isVerbose() ? new MutableProgress("X-means number of clusters", k_max, LOG) : null; in run() 175 while(clusters.size() <= k_max) { in run() 185 if(k >= k_max) { in run() 335 protected int k_min, k_max; field in XMeans.Parameterizer 353 k_max = kMaxP.intValue(); in makeOptions() 356 if(k_min > k_max) { in makeOptions() 391 …return new XMeans<V, M>(distanceFunction, k_min, k_max, maxiter, innerKMeans, initializer, informa… in makeInstance()
|
/dports/graphics/enblend/enblend-enfuse-4.2/src/ |
H A D | opencl_anneal.h | 171 … void run(int local_k, std::vector<double>* state_probabilities, int k_max, float* e, float* pi) in run() argument 177 run0(local_k, state_probabilities, k_max, e, pi); in run() 206 void setup(size_t size, size_t k_max, float*& e, float*& pi) in setup() argument 209 const size_t local_k = k_max; in setup() 212 e_buffer_ = cl::Buffer(f_.context(), CL_MEM_ALLOC_HOST_PTR, k_max * sizeof(float)); in setup() 213 pi_buffer_ = cl::Buffer(f_.context(), CL_MEM_ALLOC_HOST_PTR, k_max * sizeof(float)); in setup() 220 state_probabilities_kernel_.setArg(5U, cl::Local(k_max * sizeof(float))); in setup() 307 … void run0(int local_k, std::vector<double>* state_probabilities, int k_max, float* e, float* pi) in run0() argument 325 cl::NDRange(work_group_size(k_max)), // global size in run0() 326 … cl::NDRange(work_group_size(k_max)), //cl::NullRange, // local size in run0()
|
/dports/math/blis/blis-0.8.1/frame/3/ |
H A D | bli_l3_sup_packm_b.c | 221 dim_t* restrict k_max, \ 234 *k_max = k; \ 263 *k_max = k; \ 334 dim_t k_max; \ 360 &k_max, &n_max, \ 413 k_max, \
|
H A D | bli_l3_sup_packm_a.c | 222 dim_t* restrict k_max, \ 235 *k_max = k; \ 264 *k_max = k; \ 335 dim_t k_max; \ 360 &m_max, &k_max, \ 414 k_max, \
|
/dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/exts/dbcsr/src/mm/ |
H A D | dbcsr_acc_operations.F | 51 a_data, b_data, c_data, m_max, n_max, k_max, def_mnk, & 59 INTEGER(KIND=C_INT), INTENT(IN), VALUE :: m_max, n_max, k_max, def_mnk 86 … a_data, b_data, c_data, m_max, n_max, k_max, def_mnk, stream, success) argument 93 INTEGER, INTENT(IN) :: m_max, n_max, k_max local 108 MARK_USED(k_max) 131 k_max .LE. max_kernel_dim) THEN 141 INT(k_max, KIND=C_INT), &
|
/dports/math/dbcsr/dbcsr-2.1.0/src/mm/ |
H A D | dbcsr_acc_operations.F | 42 n_max, k_max, max_kernel_dim, def_mnk, & 51 INTEGER(KIND=C_INT), INTENT(IN), VALUE :: m_max, n_max, k_max 81 a_data, b_data, c_data, m_max, n_max, k_max, def_mnk, & argument 89 INTEGER, INTENT(IN) :: m_max, n_max, k_max local 104 MARK_USED(k_max) 137 INT(k_max, KIND=C_INT), &
|
/dports/games/simutrans/simutrans-121.0/dataobj/ |
H A D | koord.h | 73 inline void clip_max( koord k_max ) in clip_max() argument 75 if (x > k_max.x) { in clip_max() 76 x = k_max.x; in clip_max() 78 if (y > k_max.y) { in clip_max() 79 y = k_max.y; in clip_max()
|
/dports/games/angband/Angband-4.2.2/src/ |
H A D | obj-make.c | 77 int k_max = z_info->k_max; in alloc_init_objects() local 87 obj_alloc[lev * (k_max + 1)] = 0; in alloc_init_objects() 88 obj_alloc_great[lev * (k_max + 1)] = 0; in alloc_init_objects() 92 for (item = 0; item < k_max; item++) { in alloc_init_objects() 105 obj_alloc[(lev * (k_max + 1)) + item + 1] = in alloc_init_objects() 106 obj_alloc[(lev * (k_max + 1)) + item] + rarity; in alloc_init_objects() 112 obj_alloc_great[(lev * (k_max + 1)) + item + 1] = in alloc_init_objects() 1104 for (item = 0; item < z_info->k_max; item++) { in get_obj_num_by_kind() 1141 level * (z_info->k_max + 1); in get_obj_num() 1144 if (! objects[z_info->k_max]) { in get_obj_num() [all …]
|
/dports/math/libflame/libflame-5.2.0/src/lapack/dec/hevd/lv/flamec/old/ |
H A D | FLA_Hevd_lv_unb_var4.c | 20 dim_t k_max = 30; in FLA_Hevd_lv_unb_var4() local 44 FLA_Obj_create( dt_real, mn_A-1, k_max, 0, 0, &C ); in FLA_Hevd_lv_unb_var4() 45 FLA_Obj_create( dt_real, mn_A-1, k_max, 0, 0, &S ); in FLA_Hevd_lv_unb_var4()
|
/dports/science/quantum-espresso/q-e-qe-6.7.0/NEB/src/ |
H A D | path_read_namelists_module.f90 | 63 k_max = 0.1_DP 114 CALL mp_bcast( k_max, ionode_id, world_comm ) 164 IF ( k_max < 0.0_DP ) CALL errore( sub_name, 'k_max out of range', 1 ) 166 IF ( k_max < k_min ) CALL errore( sub_name, 'k_max < k_min', 1 )
|
/dports/databases/couchdb3/apache-couchdb-3.2.1/src/proper/src/ |
H A D | proper_sa.erl | 90 k_max = 0 :: k(), 113 #sa_data{k_max = Steps, 177 k_max = K_Max, 225 k_max = Data#sa_data.k_max - Data#sa_data.k_current,
|
/dports/cad/calculix-ccx/CalculiX/ccx_2.18/src/ |
H A D | treatmasterface.f | 34 & nnodelem,nodem(*),modf,nelemm,k_max,nipold 78 k_max=1 85 k_max=nvertex 94 do k=1,k_max
|
/dports/devel/boost-docs/boost_1_72_0/boost/math/interpolators/detail/ |
H A D | cubic_b_spline_detail.hpp | 277 …size_t k_max = (size_t) (max)((min)(static_cast<long>(m_beta.size() - 1), boost::math::ltrunc(floo… in operator ()() local 278 for (size_t k = k_min; k <= k_max; ++k) in operator ()() 298 …size_t k_max = (size_t) (min)(static_cast<long>(m_beta.size() - 1), boost::math::ltrunc(floor(t + … in prime() local 300 for (size_t k = k_min; k <= k_max; ++k) in prime() 319 …size_t k_max = (size_t) (min)(static_cast<long>(m_beta.size() - 1), boost::math::ltrunc(floor(t + … in double_prime() local 321 for (size_t k = k_min; k <= k_max; ++k) in double_prime()
|