Home
last modified time | relevance | path

Searched refs:num_elems (Results 51 – 75 of 1719) sorted by relevance

12345678910>>...69

/dports/games/cake/cake_src/cake/
H A Doverlay.cpp21 num_elems = 0; in Init()
68 num_elems = 0; in Render()
92 elems[num_elems + 0] = num_verts + 0; in Quad()
93 elems[num_elems + 1] = num_verts + 1; in Quad()
94 elems[num_elems + 2] = num_verts + 2; in Quad()
95 elems[num_elems + 3] = num_verts + 2; in Quad()
96 elems[num_elems + 4] = num_verts + 1; in Quad()
97 elems[num_elems + 5] = num_verts + 3; in Quad()
140 num_elems += 6; in Quad()
212 num_elems -= (6*i); in String()
[all …]
/dports/science/axom/axom-0.6.1/src/axom/sidre/core/
H A DBuffer.cpp42 Buffer* Buffer::describe(TypeID type, IndexType num_elems) in describe() argument
44 if(isAllocated() || num_elems < 0) in describe()
53 dtype.set_number_of_elements(num_elems); in describe()
107 describe(type, num_elems); in allocate()
121 Buffer* Buffer::reallocate(IndexType num_elems) in reallocate() argument
130 if(num_elems < 0) in reallocate()
132 SLIC_CHECK_MSG(num_elems >= 0, in reallocate()
140 dtype.set_number_of_elements(num_elems); in reallocate()
145 if(num_elems == 0 || new_data_ptr != nullptr) in reallocate()
152 SLIC_CHECK_MSG(num_elems == 0 || new_data_ptr != nullptr, in reallocate()
[all …]
/dports/audio/zrythm/zrythm-1.0.0-alpha.26.0.13/ext/zix/zix/
H A Dsorted_array.c33 size_t num_elems;
41 for (size_t i = 0; i < a->num_elems; ++i) {
63 a->num_elems = 0;
80 return a->num_elems;
89 if (a->num_elems == 0) {
93 ++a->num_elems;
105 (a->num_elems - i - 1) * a->elem_size);
122 (a->num_elems - i - 1) * a->elem_size);
123 --a->num_elems;
138 if (index >= a->num_elems) {
[all …]
/dports/math/z3/z3-z3-4.8.13/src/test/
H A Duint_set.cpp61 ENSURE(s.num_elems() == 1); in tst2()
69 ENSURE(s.num_elems() == 0); in tst2()
79 ENSURE(s1.num_elems() == 1); in tst3()
80 ENSURE(s2.num_elems() == 0); in tst3()
83 ENSURE(s2.num_elems() == 1); in tst3()
88 ENSURE(s2.num_elems() == 2); in tst3()
93 ENSURE(s1.num_elems() == 2); in tst3()
94 ENSURE(s2.num_elems() == 2); in tst3()
97 ENSURE(s1.num_elems() == 3); in tst3()
98 ENSURE(s2.num_elems() == 2); in tst3()
[all …]
/dports/math/py-z3-solver/z3-z3-4.8.10/src/test/
H A Duint_set.cpp61 ENSURE(s.num_elems() == 1); in tst2()
69 ENSURE(s.num_elems() == 0); in tst2()
79 ENSURE(s1.num_elems() == 1); in tst3()
80 ENSURE(s2.num_elems() == 0); in tst3()
83 ENSURE(s2.num_elems() == 1); in tst3()
88 ENSURE(s2.num_elems() == 2); in tst3()
93 ENSURE(s1.num_elems() == 2); in tst3()
94 ENSURE(s2.num_elems() == 2); in tst3()
97 ENSURE(s1.num_elems() == 3); in tst3()
98 ENSURE(s2.num_elems() == 2); in tst3()
[all …]
/dports/net/mpich/mpich-3.4.3/modules/libfabric/prov/gni/test/
H A Dfreelist.c98 const int num_elems = 71; in Test() local
99 struct dlist_entry *elems[num_elems]; in Test()
107 num_elems, refill_size, 0, 0, &fl); in Test()
110 for (i = 0; i < num_elems; i++) { in Test()
126 for (i = num_elems-1; i >= 0 ; i--) in Test()
139 const int num_elems = 71; in Test() local
140 struct dlist_entry *elems[num_elems + 1]; in Test()
147 num_elems, refill_size, 0, 0, &fl); in Test()
150 for (i = 0; i < num_elems; i++) { in Test()
157 ret = _gnix_fl_alloc(&elems[num_elems], &fl); in Test()
[all …]
/dports/editors/encryptpad/EncryptPad-0.5.0.1/deps/botan/src/lib/tls/
H A Dtls_reader.h79 Container get_elem(size_t num_elems) in get_elem() argument
81 assert_at_least(num_elems * sizeof(T)); in get_elem()
83 Container result(num_elems); in get_elem()
85 for(size_t i = 0; i != num_elems; ++i) in get_elem()
88 m_offset += num_elems * sizeof(T); in get_elem()
98 const size_t num_elems = in get_range() local
101 return get_elem<T, std::vector<T>>(num_elems); in get_range()
109 const size_t num_elems = in get_range_vector() local
112 return get_elem<T, std::vector<T>>(num_elems); in get_range_vector()
156 if(num_elems < min_elems || num_elems > max_elems) in get_num_elems()
[all …]
/dports/security/botan2/Botan-2.18.2/src/lib/tls/
H A Dtls_reader.h79 Container get_elem(size_t num_elems) in get_elem() argument
81 assert_at_least(num_elems * sizeof(T)); in get_elem()
83 Container result(num_elems); in get_elem()
85 for(size_t i = 0; i != num_elems; ++i) in get_elem()
88 m_offset += num_elems * sizeof(T); in get_elem()
98 const size_t num_elems = in get_range() local
101 return get_elem<T, std::vector<T>>(num_elems); in get_range()
109 const size_t num_elems = in get_range_vector() local
112 return get_elem<T, std::vector<T>>(num_elems); in get_range_vector()
156 if(num_elems < min_elems || num_elems > max_elems) in get_num_elems()
[all …]
/dports/mail/thunderbird/thunderbird-91.8.0/comm/third_party/botan/src/lib/tls/
H A Dtls_reader.h79 Container get_elem(size_t num_elems) in get_elem() argument
81 assert_at_least(num_elems * sizeof(T)); in get_elem()
83 Container result(num_elems); in get_elem()
85 for(size_t i = 0; i != num_elems; ++i) in get_elem()
88 m_offset += num_elems * sizeof(T); in get_elem()
98 const size_t num_elems = in get_range() local
101 return get_elem<T, std::vector<T>>(num_elems); in get_range()
109 const size_t num_elems = in get_range_vector() local
112 return get_elem<T, std::vector<T>>(num_elems); in get_range_vector()
156 if(num_elems < min_elems || num_elems > max_elems) in get_num_elems()
[all …]
/dports/multimedia/lives/lives-3.2.0/libweed/
H A Dweed-utils.h87 weed_error_t weed_set_int_array(weed_plant_t *, const char *key, weed_size_t num_elems, int32_t *);
88 weed_error_t weed_set_double_array(weed_plant_t *, const char *key, weed_size_t num_elems, double *…
90 weed_error_t weed_set_int64_array(weed_plant_t *, const char *key, weed_size_t num_elems, int64_t *…
91 weed_error_t weed_set_string_array(weed_plant_t *, const char *key, weed_size_t num_elems, char **);
232 weed_size_t num_elems = weed_leaf_num_elements(plant, key); in __weed_get_values__() local
234 if (!(*retval = (char *)weed_calloc(num_elems, dsize))) return WEED_ERROR_MEMORY_ALLOCATION; in __weed_get_values__()
235 for (int i = 0; (weed_size_t)i < num_elems; i++) { in __weed_get_values__()
241 if (nvals) *nvals = (int)num_elems; in __weed_get_values__()
271 || !(num_elems = weed_leaf_num_elements(plant, key))) return NULL; in __weed_get_string_array__()
274 for (i = 0; i < num_elems; i++) { in __weed_get_string_array__()
[all …]
/dports/science/axom/axom-0.6.1/src/axom/sidre/interface/c_fortran/
H A DwrapView.h96 SIDRE_IndexType num_elems);
98 void SIDRE_View_reallocate(SIDRE_View* self, SIDRE_IndexType num_elems);
104 SIDRE_IndexType num_elems,
117 void SIDRE_View_apply_nelems(SIDRE_View* self, SIDRE_IndexType num_elems);
120 SIDRE_IndexType num_elems,
124 SIDRE_IndexType num_elems,
130 SIDRE_IndexType num_elems);
134 SIDRE_IndexType num_elems,
139 SIDRE_IndexType num_elems,
166 SIDRE_IndexType num_elems,
/dports/science/hdf/hdf-4.2.15/hdf/src/
H A Ddynarray.c93 new_arr->num_elems=start_size; in DAcreate_array()
147 for(i=0; i<arr->num_elems; i++) in DAdestroy_array()
190 ret_value=arr_ptr->num_elems; in DAsize_array()
228 if(elem>=arr->num_elems) in DAget_elem()
271 if(elem>=arr->num_elems) in DAset_elem()
276 if(arr->num_elems==0) in DAset_elem()
287 HDmemset(&new_arr[arr->num_elems],0,sizeof(VOIDP)*(uintn)(new_size-arr->num_elems)); in DAset_elem()
290 arr->num_elems=new_size; in DAset_elem()
332 if(elem>=arr->num_elems) in DAdel_elem()
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/io/
H A DReadTemplate.cpp73 long num_verts = 0, num_elems = 0, num_sets = 0; in load_file() local
94 result = read_elements(num_elems, start_vertex, start_elem, read_ents); in load_file()
102 result = create_sets(num_sets, start_vertex, num_verts, start_elem, num_elems, read_ents); in load_file()
147 ErrorCode ReadTemplate::read_elements(int num_elems, EntityHandle start_vertex, in read_elements() argument
159 ErrorCode result = readMeshIface->get_element_connect(num_elems, verts_per_elem, ent_type, in read_elements()
163 for (long i = 0; i < num_elems; i++) { in read_elements()
175 for (long i = num_elems*verts_per_elem - 1; i >= 0; i--) { in read_elements()
183 result = readMeshIface->update_adjacencies(start_elem, num_elems, verts_per_elem, conn_array); in read_elements()
188 if (num_elems) in read_elements()
189 read_ents.insert(start_elem, start_elem + num_elems - 1); in read_elements()
/dports/editors/encryptpad/EncryptPad-0.5.0.1/deps/botan/src/lib/utils/locking_allocator/
H A Dlocking_allocator.cpp14 void* mlock_allocator::allocate(size_t num_elems, size_t elem_size) in allocate() argument
19 const size_t n = num_elems * elem_size; in allocate()
20 if(n / elem_size != num_elems) in allocate()
26 bool mlock_allocator::deallocate(void* p, size_t num_elems, size_t elem_size) noexcept in deallocate() argument
31 size_t n = num_elems * elem_size; in deallocate()
37 if(n / elem_size != num_elems) in deallocate()
/dports/security/botan2/Botan-2.18.2/src/lib/utils/locking_allocator/
H A Dlocking_allocator.cpp14 void* mlock_allocator::allocate(size_t num_elems, size_t elem_size) in allocate() argument
19 const size_t n = num_elems * elem_size; in allocate()
20 if(n / elem_size != num_elems) in allocate()
26 bool mlock_allocator::deallocate(void* p, size_t num_elems, size_t elem_size) noexcept in deallocate() argument
31 size_t n = num_elems * elem_size; in deallocate()
37 if(n / elem_size != num_elems) in deallocate()
/dports/mail/thunderbird/thunderbird-91.8.0/comm/third_party/botan/src/lib/utils/locking_allocator/
H A Dlocking_allocator.cpp14 void* mlock_allocator::allocate(size_t num_elems, size_t elem_size) in allocate() argument
19 const size_t n = num_elems * elem_size; in allocate()
20 if(n / elem_size != num_elems) in allocate()
26 bool mlock_allocator::deallocate(void* p, size_t num_elems, size_t elem_size) noexcept in deallocate() argument
31 size_t n = num_elems * elem_size; in deallocate()
37 if(n / elem_size != num_elems) in deallocate()
/dports/graphics/blender/blender-2.91.0/release/scripts/addons/io_scene_gltf2/io/com/
H A Dgltf2_io_constants.py97 def vec_type_from_num(cls, num_elems): argument
98 if not (0 < num_elems < 5):
99 raise ValueError("No vector type with {} elements".format(num_elems))
105 }[num_elems]
108 def mat_type_from_num(cls, num_elems): argument
109 if not (4 <= num_elems <= 16):
110 raise ValueError("No matrix type with {} elements".format(num_elems))
115 }[num_elems]
/dports/biology/sra-tools/sra-tools-2.11.0/tools/sra-sort/
H A Dsorting-row-set.c71 size_t num_elems; member
93 size_t num_elems; member
116 size_t i, to_set = self -> num_elems - self -> cur_elem; in SortingRowSetNextStat()
139 size_t to_copy = self -> num_elems - self -> cur_elem; in SortingRowSetNextPhys()
190 iter -> num_elems = MapFileSelectOldToNewSingle ( iter -> idx, ctx, in SortingRowSetReset()
208 self -> num_elems = iter -> num_elems; in SortingRowSetReset()
209 STATUS ( 3, "selected %,zu ids", self -> num_elems ); in SortingRowSetReset()
251 rs -> num_elems = self -> num_elems; in SortingRowSetIteratorMakeTheRowSet()
293 * num_items = self -> num_elems; in SortingRowSetIteratorGetSourceIds()
352 self -> row_id += self -> num_elems; in SortingRowSetIteratorNext()
[all …]
/dports/math/mfem/mfem-4.3/tests/unit/general/
H A Dtest_umpire_mem.cpp31 constexpr unsigned num_elems = 1024; variable
32 constexpr unsigned num_bytes = num_elems * sizeof(double);
118 Vector host_perm(num_elems); in test_umpire_device_memory()
133 Vector host_temp(num_elems, MemoryType::DEVICE_UMPIRE_2); in test_umpire_device_memory()
147 MFEM_FORALL(i, num_elems, { d_host_temp[i] = dev_val; }); in test_umpire_device_memory()
160 Vector dev_perm(num_elems, MemoryType::HOST, MemoryType::DEVICE_UMPIRE_2); in test_umpire_device_memory()
175 Vector dev_temp(num_elems); in test_umpire_device_memory()
183 MFEM_FORALL(i, num_elems, { d_dev_temp[i] = dev_val; }); in test_umpire_device_memory()
196 Vector pinned_host_perm(num_elems, MemoryType::HOST_PINNED); in test_umpire_device_memory()
212 Vector pinned_host_temp(num_elems, MemoryType::HOST_PINNED, in test_umpire_device_memory()
[all …]
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/testsuite/gfortran.dg/
H A Dc_f_pointer_complex.f0331 long_double_complex_array, num_elems) bind(c) argument
40 integer(c_int), value :: num_elems
44 (/ num_elems /))
46 (/ num_elems /))
48 f03_long_double_complex_array, (/ num_elems /))
50 do i = 1, num_elems
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/testsuite/gfortran.dg/
H A Dc_f_pointer_complex.f0331 long_double_complex_array, num_elems) bind(c) argument
40 integer(c_int), value :: num_elems
44 (/ num_elems /))
46 (/ num_elems /))
48 f03_long_double_complex_array, (/ num_elems /))
50 do i = 1, num_elems
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/testsuite/gfortran.dg/
H A Dc_f_pointer_complex.f0331 long_double_complex_array, num_elems) bind(c) argument
40 integer(c_int), value :: num_elems
44 (/ num_elems /))
46 (/ num_elems /))
48 f03_long_double_complex_array, (/ num_elems /))
50 do i = 1, num_elems
/dports/lang/gcc10/gcc-10.3.0/gcc/testsuite/gfortran.dg/
H A Dc_f_pointer_complex.f0331 long_double_complex_array, num_elems) bind(c) argument
40 integer(c_int), value :: num_elems
44 (/ num_elems /))
46 (/ num_elems /))
48 f03_long_double_complex_array, (/ num_elems /))
50 do i = 1, num_elems
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/testsuite/gfortran.dg/
H A Dc_f_pointer_complex.f0331 long_double_complex_array, num_elems) bind(c) argument
40 integer(c_int), value :: num_elems
44 (/ num_elems /))
46 (/ num_elems /))
48 f03_long_double_complex_array, (/ num_elems /))
50 do i = 1, num_elems
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/testsuite/gfortran.dg/
H A Dc_f_pointer_complex.f0331 long_double_complex_array, num_elems) bind(c) argument
40 integer(c_int), value :: num_elems
44 (/ num_elems /))
46 (/ num_elems /))
48 f03_long_double_complex_array, (/ num_elems /))
50 do i = 1, num_elems

12345678910>>...69