/dports/audio/libcddb/libcddb-1.3.2/lib/ |
H A D | ll.c | 57 static elem_t *elem_destroy(elem_t *elem, elem_destroy_cb *cb); 65 elem_t *elem; in elem_construct() 67 elem = (elem_t*)calloc(1, sizeof(elem_t)); in elem_construct() 72 static elem_t *elem_destroy(elem_t *elem, elem_destroy_cb *cb) in elem_destroy() 74 elem_t *next = NULL; in elem_destroy() 109 elem_t *elem; in list_flush() 125 void *element_data(elem_t *elem) in element_data() 139 elem_t *elem = NULL; in list_append() 167 elem_t *elem = NULL; in list_get() 181 elem_t *list_first(list_t *list) in list_first() [all …]
|
/dports/devel/vexcl/vexcl-1.4.3/tests/ |
H A D | multivector_arithmetics.cpp | 23 elem_t v = {{0, 1, 2, 3}}; in BOOST_AUTO_TEST_CASE() 31 check_sample(x, y, z, [](size_t, elem_t a, elem_t b, elem_t c) { in BOOST_AUTO_TEST_CASE() 51 check_sample(x, y, [](size_t, elem_t a, elem_t b) { in BOOST_AUTO_TEST_CASE() 104 elem_t v1 = {{1, 2}}; in BOOST_AUTO_TEST_CASE() 105 elem_t v2 = {{2, 1}}; in BOOST_AUTO_TEST_CASE() 137 elem_t summ = sum(m); in BOOST_AUTO_TEST_CASE() 138 elem_t minm = min(m); in BOOST_AUTO_TEST_CASE() 139 elem_t maxm = max(m); in BOOST_AUTO_TEST_CASE() 191 check_sample(x, y, [&](size_t, elem_t a, elem_t b) { in BOOST_AUTO_TEST_CASE() 199 check_sample(x, y, [&](size_t, elem_t a, elem_t b) { in BOOST_AUTO_TEST_CASE() [all …]
|
H A D | multivector_create.cpp | 21 typedef std::array<double, 3> elem_t; in BOOST_AUTO_TEST_CASE() typedef 34 check_sample(c, m, [](size_t, elem_t a, elem_t b) { BOOST_CHECK(a == b); }); in BOOST_AUTO_TEST_CASE() 43 typedef std::array<double, m> elem_t; in BOOST_AUTO_TEST_CASE() typedef 51 elem_t val = x[i]; in BOOST_AUTO_TEST_CASE()
|
H A D | temporary.cpp | 80 typedef std::array<double, 2> elem_t; in BOOST_AUTO_TEST_CASE() typedef 91 check_sample(y, [&](size_t idx, elem_t v){ in BOOST_AUTO_TEST_CASE() 101 typedef std::array<double, 2> elem_t; in BOOST_AUTO_TEST_CASE() typedef 111 check_sample(y, [&](size_t idx, elem_t v){ in BOOST_AUTO_TEST_CASE() 112 elem_t X = x[idx]; in BOOST_AUTO_TEST_CASE()
|
/dports/devel/valgrind-lts/valgrind-dragonfly-dragonfly/drd/tests/ |
H A D | matinv.c | 28 typedef double elem_t; typedef 34 elem_t* a; 135 static elem_t* multiply_matrices(const elem_t* const a1, in multiply_matrices() 143 elem_t* prod; in multiply_matrices() 174 elem_t* const a = p->a; in gj_threadfunc() 177 elem_t aii; in gj_threadfunc() 267 static elem_t* invert_matrix(const elem_t* const a, const int n) in invert_matrix() 288 elem_t e = 0; in identity_error() 305 static elem_t epsilon() in epsilon() 307 elem_t eps; in epsilon() [all …]
|
H A D | omp_matinv.c | 27 typedef double elem_t; typedef 52 static void delete_matrix(elem_t* const a) in delete_matrix() 94 elem_t* const to, in copy_matrix() 123 static elem_t* multiply_matrices(const elem_t* const a1, in multiply_matrices() 131 elem_t* prod; in multiply_matrices() 229 static elem_t* invert_matrix(const elem_t* const a, const int n) in invert_matrix() 250 elem_t e = 0; in identity_error() 267 static elem_t epsilon() in epsilon() 269 elem_t eps; in epsilon() 292 elem_t *a, *inv, *prod; in main() [all …]
|
/dports/devel/valgrind/valgrind-dragonfly-dragonfly/drd/tests/ |
H A D | matinv.c | 28 typedef double elem_t; typedef 34 elem_t* a; 135 static elem_t* multiply_matrices(const elem_t* const a1, in multiply_matrices() 143 elem_t* prod; in multiply_matrices() 174 elem_t* const a = p->a; in gj_threadfunc() 177 elem_t aii; in gj_threadfunc() 267 static elem_t* invert_matrix(const elem_t* const a, const int n) in invert_matrix() 288 elem_t e = 0; in identity_error() 305 static elem_t epsilon() in epsilon() 307 elem_t eps; in epsilon() [all …]
|
H A D | omp_matinv.c | 27 typedef double elem_t; typedef 52 static void delete_matrix(elem_t* const a) in delete_matrix() 94 elem_t* const to, in copy_matrix() 123 static elem_t* multiply_matrices(const elem_t* const a1, in multiply_matrices() 131 elem_t* prod; in multiply_matrices() 229 static elem_t* invert_matrix(const elem_t* const a, const int n) in invert_matrix() 250 elem_t e = 0; in identity_error() 267 static elem_t epsilon() in epsilon() 269 elem_t eps; in epsilon() 292 elem_t *a, *inv, *prod; in main() [all …]
|
/dports/math/py-graphillion/Graphillion-1.3/src/graphillion/ |
H A D | setset.cc | 72 this->s_ = set<elem_t>(); in next() 102 this->s_ = set<elem_t>(); in next() 104 vector<elem_t> stack; in next() 129 this->s_ = set<elem_t>(); in next() 131 set<elem_t> s; in next() 153 const vector<elem_t>& in_v = in_i != m.end() ? in_i->second : vector<elem_t>(); in setset() 154 const vector<elem_t>& ex_v = ex_i != m.end() ? ex_i->second : vector<elem_t>(); in setset() 317 set<elem_t> s; in insert() 337 set<elem_t> s; in erase() 404 set<elem_t> s; in supersets() [all …]
|
H A D | setset.h | 63 std::set<elem_t> s_; 141 void insert(elem_t e); 143 size_t erase(const std::set<elem_t>& s); 144 void erase(elem_t e); 147 void flip(elem_t e); 161 setset supersets(elem_t e) const; 164 setset non_supersets(elem_t e) const; 184 static elem_t elem_limit(); 185 static elem_t max_elem(); 186 static elem_t num_elems(); [all …]
|
H A D | zdd.h | 40 elem_t elem_limit(); 41 elem_t max_elem(); 42 void new_elems(elem_t max_elem); 43 elem_t num_elems(); 44 void num_elems(elem_t num_elems); 46 zdd_t single(elem_t e); 60 inline elem_t elem(zdd_t f) { in elem() 75 bool choose(zdd_t f, std::vector<elem_t>* stack); 76 zdd_t choose_random(zdd_t f, std::vector<elem_t>* stack); 78 std::set<elem_t>* s); [all …]
|
H A D | zdd.cc | 67 elem_t elem_limit() { in elem_limit() 71 elem_t max_elem() { in max_elem() 88 elem_t num_elems() { in num_elems() 99 zdd_t single(elem_t e) { in single() 238 elem_t v = elem(f); in non_supersets() 319 for (elem_t j = 1; j < static_cast<elem_t>(x.size()); j++) { in choose_best() 401 elem_t v; in load() 436 elem_t v; in load() 456 vector<elem_t> stack; in _enum() 468 vector<elem_t> stack; in _enum() [all …]
|
/dports/science/siconos/siconos-4.4.0/externals/numeric_bindings/libs/numeric/bindings/atlas/ |
H A D | init.cc | 20 typedef real_t elem_t; typedef 22 typedef std::complex<real_t> elem_t; typedef 30 elem_t, 56 init_v (v, const_val<elem_t> (2)); in main() 61 init_v (v, times_plus<elem_t> (10)); in main() 79 elem_t s (10); in main() 81 elem_t s (10, -1); in main() 90 elem_t c (-2); in main() 92 elem_t c (2, -2); in main() 96 init_m (m, const_val<elem_t> (c)); in main() [all …]
|
/dports/biology/vsearch/vsearch-2.17.1/src/ |
H A D | minheap.cc | 77 elem_smaller(elem_t * a, elem_t * b) in elem_smaller() 102 auto * x = (elem_t*) a; in minheap_compare() 103 auto * y = (elem_t*) b; in minheap_compare() 136 m->array = (elem_t *) xmalloc(size * sizeof(elem_t)); in minheap_init() 190 minheap_add(minheap_t * m, elem_t * n) in minheap_add() 228 elem_t 232 static elem_t zero = {0,0,0}; in minheap_pop() 236 elem_t top = m->array[0]; in minheap_pop() 267 elem_t 271 static elem_t zero = {0,0,0}; in minheap_poplast() [all …]
|
H A D | minheap.h | 66 } elem_t; typedef 73 elem_t * array; 86 elem_t minheap_poplast(minheap_t * m); 90 void minheap_add(minheap_t * m, elem_t * n); 91 elem_t minheap_pop(minheap_t * m);
|
/dports/math/py-z3-solver/z3-z3-4.8.10/src/util/ |
H A D | ref_pair_vector.h | 35 typedef std::pair<T*,T*> elem_t; typedef 42 void dec_range_ref(elem_t const * begin, elem_t const * end) { in dec_range_ref() 72 void resize(unsigned sz, elem_t d) { in resize() 104 m_nodes.push_back(elem_t(a, b)); in push_back() 132 typedef elem_t const* iterator; 137 elem_t operator[](unsigned idx) const { 171 typedef std::pair<T*,T*> elem_t; typedef 203 elem_t & m_ref; 232 elem_t get() const { in get() 236 elem_t operator->() const { [all …]
|
/dports/math/z3/z3-z3-4.8.13/src/util/ |
H A D | ref_pair_vector.h | 35 typedef std::pair<T*,T*> elem_t; typedef 42 void dec_range_ref(elem_t const * begin, elem_t const * end) { in dec_range_ref() 72 void resize(unsigned sz, elem_t d) { in resize() 104 m_nodes.push_back(elem_t(a, b)); in push_back() 132 typedef elem_t const* iterator; 137 elem_t operator[](unsigned idx) const { 171 typedef std::pair<T*,T*> elem_t; typedef 203 elem_t & m_ref; 232 elem_t get() const { in get() 236 elem_t operator->() const { [all …]
|
/dports/audio/libcddb/libcddb-1.3.2/include/cddb/ |
H A D | ll.h | 36 typedef struct elem_s elem_t; typedef 89 void *element_data(elem_t *elem); 103 elem_t *list_append(list_t *list, void *data); 121 elem_t *list_get(list_t *list, int idx); 129 elem_t *list_first(list_t *list); 138 elem_t *list_next(list_t *list);
|
/dports/games/openage/openage-0.3.0-1262-ga554ab49/libopenage/coord/ |
H A D | tile.cpp | 22 return phys2{phys3::elem_t::from_int(this->ne), phys3::elem_t::from_int(this->se)}; in to_phys2() 38 phys3::elem_t::from_int(this->ne), in to_phys3() 39 phys3::elem_t::from_int(this->se), in to_phys3() 40 phys3::elem_t::from_int(this->up) in to_phys3() 62 static_cast<chunk::elem_t>(util::div(this->ne, tiles_per_chunk)), in to_chunk() 63 static_cast<chunk::elem_t>(util::div(this->se, tiles_per_chunk)) in to_chunk()
|
/dports/net/mpich/mpich-3.4.3/modules/ucx/test/gtest/ucs/ |
H A D | test_datatype.cc | 29 } elem_t; typedef 35 elem_t elem0, elem1; in UCS_TEST_F() 36 elem_t *iter, *tmp; in UCS_TEST_F() 43 std::vector<elem_t*> vec; in UCS_TEST_F() 64 elem_t *iter; in UCS_TEST_F() 96 elem_t *elem; in UCS_TEST_F() 171 elem_t *elem; in UCS_TEST_F() 244 elem_t *elem; in UCS_TEST_F() 259 elem_t *elem; in UCS_TEST_F() 282 elem_t e1, *elem; in UCS_TEST_F() [all …]
|
/dports/math/cocoalib/CoCoALib-0.99712/include/CoCoA/ |
H A D | VectorOps.H | 163 template <class elem_t> 167 HasDifferentOwner(const elem_t& x): myValue(x) {}; in HasDifferentOwner() 169 bool operator() (const elem_t& x) const { return owner(x) != owner(myValue); } in operator() 171 const elem_t& myValue; 177 typedef typename container::value_type elem_t; in HasUniqueOwner() typedef 180 find_if(++v.begin(), v.end(), HasDifferentOwner<elem_t>(v.front())); in HasUniqueOwner()
|
/dports/math/giacxcas/CoCoALib-0.99700/include/CoCoA/ |
H A D | VectorOps.H | 163 template <class elem_t> 167 HasDifferentOwner(const elem_t& x): myValue(x) {}; in HasDifferentOwner() 169 bool operator() (const elem_t& x) const { return owner(x) != owner(myValue); } in operator() 171 const elem_t& myValue; 177 typedef typename container::value_type elem_t; in HasUniqueOwner() typedef 180 find_if(++v.begin(), v.end(), HasDifferentOwner<elem_t>(v.front())); in HasUniqueOwner()
|
/dports/devel/re2c/re2c-2.2/src/util/ |
H A D | lookup.h | 25 struct elem_t struct 30 elem_t(uint32_t n, const data_t &d) in elem_t() argument 34 std::vector<elem_t> elems; 92 elems.push_back(elem_t(head(hash), data)); in push() 102 const elem_t &e = elems[i]; in find()
|
/dports/biology/ugene/ugene-40.1/src/libs_3rdparty/samtools/src/samtools/ |
H A D | bam_rmdupse.c | 13 } elem_t, *elem_p; typedef 15 KLIST_INIT(q, elem_t, __free_elem) 51 static inline elem_t *push_queue(queue_t *queue, const bam1_t *b, int endpos, int score) in push_queue() 53 elem_t *p = kl_pushp(q, queue); in push_queue() 74 elem_t *q; in dump_alignment() 131 elem_t *p = kh_val(h, k); in bam_rmdupse_core()
|
/dports/biology/stringtie/stringtie-2.1.1/samtools-0.1.18/ |
H A D | bam_rmdupse.c | 13 } elem_t, *elem_p; typedef 15 KLIST_INIT(q, elem_t, __free_elem) 51 static inline elem_t *push_queue(queue_t *queue, const bam1_t *b, int endpos, int score) in push_queue() 53 elem_t *p = kl_pushp(q, queue); in push_queue() 74 elem_t *q; in dump_alignment() 131 elem_t *p = kh_val(h, k); in bam_rmdupse_core()
|