Home
last modified time | relevance | path

Searched refs:key_t (Results 1 – 25 of 4396) sorted by relevance

12345678910>>...176

/dports/graphics/colmap/colmap-3.6/src/util/
H A Dcache.h57 bool Exists(const key_t& key) const;
60 const value_t& Get(const key_t& key);
127 LRUCache<key_t, value_t>::LRUCache( in LRUCache()
146 bool LRUCache<key_t, value_t>::Exists(const key_t& key) const { in Exists()
151 const value_t& LRUCache<key_t, value_t>::Get(const key_t& key) { in Get()
156 value_t& LRUCache<key_t, value_t>::GetMutable(const key_t& key) { in GetMutable()
168 void LRUCache<key_t, value_t>::Set(const key_t& key, value_t&& value) { in Set()
182 void LRUCache<key_t, value_t>::Pop() { in Pop()
218 void MemoryConstrainedLRUCache<key_t, value_t>::Set(const key_t& key, in Set()
252 const key_t& key) { in UpdateNumBytes()
[all …]
/dports/www/trafficserver/trafficserver-9.1.1/include/tscore/
H A DMT_hashtable.h39 key_t key;
108 bucket_id(key_t key) in bucket_id()
211 IMTHashTable<key_t, data_t>::insert_entry(key_t key, data_t data) in insert_entry()
246 IMTHashTable<key_t, data_t>::remove_entry(key_t key) in remove_entry()
272 IMTHashTable<key_t, data_t>::lookup_entry(key_t key) in lookup_entry()
300 IMTHashTable<key_t, data_t>::next_entry(HashTableIteratorState<key_t, data_t> *s) in next_entry() argument
313 IMTHashTable<key_t, data_t>::cur_entry(HashTableIteratorState<key_t, data_t> *s) in cur_entry() argument
358 lock_for_key(key_t key) in lock_for_key()
369 part_num(key_t key) in part_num()
380 remove_entry(key_t key) in remove_entry()
[all …]
/dports/databases/iowow/iowow-1.4.13/src/utils/
H A Dkbtree.h184 memcpy(__KB_KEY(key_t, z), __KB_KEY(key_t, y) + b->t, sizeof(key_t) * (b->t - 1)); \
189 memmove(__KB_KEY(key_t, x) + i + 1, __KB_KEY(key_t, x) + i, sizeof(key_t) * (x->n - i)); \
246 memmove(__KB_KEY(key_t, x) + i, __KB_KEY(key_t, x) + i + 1, (x->n - i - 1) * sizeof(key_t)); \
264 memmove(__KB_KEY(key_t, y) + y->n, __KB_KEY(key_t, z), z->n * sizeof(key_t)); \
267 memmove(__KB_KEY(key_t, x) + i, __KB_KEY(key_t, x) + i + 1, (x->n - i - 1) * sizeof(key_t)); \
277 memmove(__KB_KEY(key_t, xp) + 1, __KB_KEY(key_t, xp), xp->n * sizeof(key_t)); \
285 __KB_KEY(key_t, x)[i] = __KB_KEY(key_t, y)[0]; \
288 memmove(__KB_KEY(key_t, y), __KB_KEY(key_t, y) + 1, y->n * sizeof(key_t)); \
292 memmove(__KB_KEY(key_t, y) + y->n, __KB_KEY(key_t, xp), xp->n * sizeof(key_t)); \
295 memmove(__KB_KEY(key_t, x) + i - 1, __KB_KEY(key_t, x) + i, (x->n - i) * sizeof(key_t)); \
[all …]
/dports/biology/bwa/bwa-0.7.17/
H A Dkbtree.h183 memcpy(__KB_KEY(key_t, z), __KB_KEY(key_t, y) + b->t, sizeof(key_t) * (b->t - 1)); \
188 memmove(__KB_KEY(key_t, x) + i + 1, __KB_KEY(key_t, x) + i, sizeof(key_t) * (x->n - i)); \
245 memmove(__KB_KEY(key_t, x) + i, __KB_KEY(key_t, x) + i + 1, (x->n - i - 1) * sizeof(key_t)); \
263 memmove(__KB_KEY(key_t, y) + y->n, __KB_KEY(key_t, z), z->n * sizeof(key_t)); \
266 memmove(__KB_KEY(key_t, x) + i, __KB_KEY(key_t, x) + i + 1, (x->n - i - 1) * sizeof(key_t)); \
276 memmove(__KB_KEY(key_t, xp) + 1, __KB_KEY(key_t, xp), xp->n * sizeof(key_t)); \
284 __KB_KEY(key_t, x)[i] = __KB_KEY(key_t, y)[0]; \
287 memmove(__KB_KEY(key_t, y), __KB_KEY(key_t, y) + 1, y->n * sizeof(key_t)); \
291 memmove(__KB_KEY(key_t, y) + y->n, __KB_KEY(key_t, xp), xp->n * sizeof(key_t)); \
294 memmove(__KB_KEY(key_t, x) + i - 1, __KB_KEY(key_t, x) + i, (x->n - i) * sizeof(key_t)); \
[all …]
/dports/www/h2o-devel/h2o-dcc7134/deps/klib/
H A Dkbtree.h179 memcpy(__KB_KEY(key_t, z), __KB_KEY(key_t, y) + b->t, sizeof(key_t) * (b->t - 1)); \
184 memmove(__KB_KEY(key_t, x) + i + 1, __KB_KEY(key_t, x) + i, sizeof(key_t) * (x->n - i)); \
241 memmove(__KB_KEY(key_t, x) + i, __KB_KEY(key_t, x) + i + 1, (x->n - i - 1) * sizeof(key_t)); \
259 memmove(__KB_KEY(key_t, y) + y->n, __KB_KEY(key_t, z), z->n * sizeof(key_t)); \
262 memmove(__KB_KEY(key_t, x) + i, __KB_KEY(key_t, x) + i + 1, (x->n - i - 1) * sizeof(key_t)); \
272 memmove(__KB_KEY(key_t, xp) + 1, __KB_KEY(key_t, xp), xp->n * sizeof(key_t)); \
280 __KB_KEY(key_t, x)[i] = __KB_KEY(key_t, y)[0]; \
283 memmove(__KB_KEY(key_t, y), __KB_KEY(key_t, y) + 1, y->n * sizeof(key_t)); \
287 memmove(__KB_KEY(key_t, y) + y->n, __KB_KEY(key_t, xp), xp->n * sizeof(key_t)); \
290 memmove(__KB_KEY(key_t, x) + i - 1, __KB_KEY(key_t, x) + i, (x->n - i) * sizeof(key_t)); \
[all …]
/dports/editors/neovim/neovim-0.6.1/src/nvim/lib/
H A Dkbtree.h155 …static inline void kb_interval_##name(kbtree_##name##_t *b, key_t k, key_t **lower, key_t **upper)…
169 memcpy(__KB_KEY(key_t, z), &__KB_KEY(key_t, y)[T], sizeof(key_t) * (T - 1)); \
177 __KB_KEY(key_t, x)[i] = __KB_KEY(key_t, y)[T - 1]; \
187 memmove(&__KB_KEY(key_t, x)[i + 2], &__KB_KEY(key_t, \
243 memmove(&__KB_KEY(key_t, x)[i], &__KB_KEY(key_t, \
263 … memmove(&__KB_KEY(key_t, y)[y->n], __KB_KEY(key_t, z), (unsigned int)z->n * sizeof(key_t)); \
268 memmove(&__KB_KEY(key_t, x)[i], &__KB_KEY(key_t, \
282 … memmove(&__KB_KEY(key_t, xp)[1], __KB_KEY(key_t, xp), (unsigned int)xp->n * sizeof(key_t)); \
292 __KB_KEY(key_t, x)[i] = __KB_KEY(key_t, y)[0]; \
295 memmove(__KB_KEY(key_t, y), &__KB_KEY(key_t, y)[1], (unsigned int)y->n * sizeof(key_t)); \
[all …]
/dports/math/libnormaliz/normaliz-3.9.0/source/libnormaliz/
H A Dcollection.h45 vector<key_t> GenKeys;
48 key_t my_place;
51 list<key_t> Daughters;
62 bool contains(const key_t key, bool& interior);
81 vector<pair<vector<key_t>, Integer> > KeysAndMult;
88 void refine(const key_t key);
89 …void add_minicone(const int level, const key_t mother, const vector<key_t>& GKeys, const Integer& …
93 void insert_vectors(const list<pair< key_t, pair<key_t,key_t> > >& NewRays);
94 void locate(const key_t key, list<pair< key_t, pair< key_t, key_t> > >& places);
95 …void locate(const Matrix<Integer>& NewGens, list<pair< key_t, pair<key_t,key_t> > >& NewRays, bool…
[all …]
H A Dautomorph.h73 map<dynamic_bitset, key_t> IncidenceMap;
75 vector<vector<key_t> > GenPerms;
76 vector<vector<key_t> > LinFormPerms;
79 vector<vector<key_t> > VerticesPerms; // ditto
82 vector<vector<key_t> > GenOrbits;
83 vector<vector<key_t> > LinFormOrbits;
89 vector<key_t> CanLabellingGens;
307 vector<vector<key_t> > convert_to_orbits(const vector<key_t>& raw_orbits);
309 vector<vector<key_t> > cycle_decomposition(vector<key_t> perm, bool with_fixed_points = false);
319 vector<vector<key_t> > orbits(const vector<vector<key_t> >& Perms, size_t N);
[all …]
H A Dcollection.cpp60 vector<key_t> GKeys; in initialize_minicones()
101 vector<key_t> opposite_facets; in refine()
229 void ConeCollection<Integer>::insert_vectors(const list<pair< key_t, pair<key_t,key_t> > >& NewRays… in insert_vectors() argument
262 void ConeCollection<Integer>::locate(const key_t key, list<pair< key_t, pair< key_t, key_t> > >& pl… in locate() argument
288 …tion<Integer>::locate(const Matrix<Integer>& NewGens, list<pair< key_t, pair<key_t,key_t> > >& New… in locate() argument
301 key_t key; in locate()
309 list<pair< key_t, pair<key_t,key_t> > > places; in locate()
323 list< pair<key_t, pair<key_t,key_t> > > NewRays; in insert_all_gens()
338 list< pair<key_t, pair<key_t,key_t> > > NewRays; in add_extra_generators()
351 list< pair<vector<Integer>, pair<key_t,key_t> > > AllHilbs; in make_unimodular()
[all …]
/dports/science/votca/votca-2021.2-18560-gfbe18d971/tools/include/votca/tools/
H A Dobjectfactory.h43 template <typename key_t, typename T, typename... args_t>
59 void Register(const key_t &key, creator_t creator);
62 void Register(const key_t &key);
68 bool IsRegistered(const key_t &id_) const;
70 std::vector<key_t> getKeys() const { in getKeys()
71 std::vector<key_t> key; in getKeys()
80 std::map<key_t, creator_t> objects_;
89 inline void ObjectFactory<key_t, T, args_t...>::Register(const key_t &key, in Register()
97 inline void ObjectFactory<key_t, T, args_t...>::Register(const key_t &key) { in Register()
103 const key_t &key, args_t &&...arguments) { in Create()
[all …]
/dports/science/votca/votca-2021.2-18560-gfbe18d971/tools/tools-9c102e0/include/votca/tools/
H A Dobjectfactory.h43 template <typename key_t, typename T, typename... args_t>
59 void Register(const key_t &key, creator_t creator);
62 void Register(const key_t &key);
68 bool IsRegistered(const key_t &id_) const;
70 std::vector<key_t> getKeys() const { in getKeys()
71 std::vector<key_t> key; in getKeys()
80 std::map<key_t, creator_t> objects_;
89 inline void ObjectFactory<key_t, T, args_t...>::Register(const key_t &key, in Register()
97 inline void ObjectFactory<key_t, T, args_t...>::Register(const key_t &key) { in Register()
103 const key_t &key, args_t &&...arguments) { in Create()
[all …]
/dports/audio/epos-devel/epos-2.5.37/src/
H A Dhashtmpl.h36 #define key_t hash_key_t macro
41 #define unconst(x) ((key_t *)(x))
47 #define keydodup(x) (key_t_is_string ? (key_t*)strdup((char *)(x)) : new key_t(*x))
60 key_t *key;
249 hash_table<key_t, data_t>::fn(const key_t *key) in fn()
316 hash_table<key_t, data_t>::remove(const key_t *key) //returns the data (NULL if absent) in remove()
364 hash_table<key_t, data_t>::fortree(hsearchtree<key_t, data_t> *tree, in fortree() argument
395 hash_table<key_t, data_t>::dissolvetree(hsearchtree<key_t, data_t> *tree) in dissolvetree() argument
413 key_t *
433 hash_table<key_t, data_t>::translate(const key_t *key) in translate()
[all …]
H A Dhash.h33 #define key_t hash_key_t macro
36 template <class key_t, class data_t>
45 template <class key_t, class data_t>
49 inline int fn(const key_t *key);
58 hsearchtree<key_t, data_t> **ht;
75 forall((void(*)(key_t*, data_t*, void *))usefn, (void *)parm); in forall()
77 data_t* translate(const key_t *key); //Will NOT strdup the result
78 key_t* get_random();
85 void fortree(hsearchtree<key_t, data_t> *tree,
86 void usefn(key_t *key, data_t *value, void *parm), void *parm);
[all …]
/dports/astro/qmapshack/qmapshack-V_1.16.1/src/qmapshack/gis/
H A DCGisWorkspace.h216 const IGisItem::key_t key;
318 void delItemByKey(const IGisItem::key_t& key);
326 void editItemByKey(const IGisItem::key_t& key);
344 void projWptByKey(const IGisItem::key_t& key);
350 void moveWptByKey(const IGisItem::key_t& key);
385 void cutTrkByKey(const IGisItem::key_t& key);
389 void editTrkByKey(const IGisItem::key_t& key);
408 …void combineTrkByKey(const QList<IGisItem::key_t>& keys, const QList<IGisItem::key_t>& keysPreSel);
416 void editRteByKey(const IGisItem::key_t& key);
420 void calcRteByKey(const IGisItem::key_t& key);
[all …]
/dports/lang/gcc12-devel/gcc-12-20211205/libphobos/libdruntime/core/sys/posix/sys/
H A Dipc.d63 key_t __key; in version()
80 enum key_t IPC_PRIVATE = 0; in version()
102 key_t key; in version()
113 key_t key; in version()
120 enum key_t IPC_PRIVATE = 0; in version()
138 key_t key; in version()
163 key_t key; in version()
188 key_t key; in version()
211 key_t key; in version()
224 key_t key; in version()
[all …]
/dports/lang/gcc11/gcc-11.2.0/libphobos/libdruntime/core/sys/posix/sys/
H A Dipc.d63 key_t __key; in version()
80 enum key_t IPC_PRIVATE = 0; in version()
102 key_t key; in version()
113 key_t key; in version()
120 enum key_t IPC_PRIVATE = 0; in version()
138 key_t key; in version()
163 key_t key; in version()
188 key_t key; in version()
211 key_t key; in version()
224 key_t key; in version()
[all …]
/dports/lang/gcc10/gcc-10.3.0/libphobos/libdruntime/core/sys/posix/sys/
H A Dipc.d62 key_t __key; in version()
79 enum key_t IPC_PRIVATE = 0; in version()
85 key_t ftok(in char*, int); in version()
101 key_t key; in version()
112 key_t key; in version()
137 key_t key; in version()
162 key_t key; in version()
187 key_t key; in version()
210 key_t key; in version()
223 key_t key; in version()
[all …]
/dports/lang/gcc11-devel/gcc-11-20211009/libphobos/libdruntime/core/sys/posix/sys/
H A Dipc.d63 key_t __key; in version()
80 enum key_t IPC_PRIVATE = 0; in version()
102 key_t key; in version()
113 key_t key; in version()
120 enum key_t IPC_PRIVATE = 0; in version()
138 key_t key; in version()
163 key_t key; in version()
188 key_t key; in version()
211 key_t key; in version()
224 key_t key; in version()
[all …]
/dports/devel/avr-gcc/gcc-10.2.0/libphobos/libdruntime/core/sys/posix/sys/
H A Dipc.d62 key_t __key; in version()
79 enum key_t IPC_PRIVATE = 0; in version()
85 key_t ftok(in char*, int); in version()
101 key_t key; in version()
112 key_t key; in version()
137 key_t key; in version()
162 key_t key; in version()
187 key_t key; in version()
210 key_t key; in version()
223 key_t key; in version()
[all …]
/dports/lang/gcc10-devel/gcc-10-20211008/libphobos/libdruntime/core/sys/posix/sys/
H A Dipc.d62 key_t __key; in version()
79 enum key_t IPC_PRIVATE = 0; in version()
85 key_t ftok(in char*, int); in version()
101 key_t key; in version()
112 key_t key; in version()
137 key_t key; in version()
162 key_t key; in version()
187 key_t key; in version()
210 key_t key; in version()
223 key_t key; in version()
[all …]
/dports/misc/cxx_atomics_pic/gcc-11.2.0/libphobos/libdruntime/core/sys/posix/sys/
H A Dipc.d63 key_t __key; in version()
80 enum key_t IPC_PRIVATE = 0; in version()
102 key_t key; in version()
113 key_t key; in version()
120 enum key_t IPC_PRIVATE = 0; in version()
138 key_t key; in version()
163 key_t key; in version()
188 key_t key; in version()
211 key_t key; in version()
224 key_t key; in version()
[all …]
/dports/lang/gcc9-devel/gcc-9-20211007/libphobos/libdruntime/core/sys/posix/sys/
H A Dipc.d62 key_t __key; in version()
79 enum key_t IPC_PRIVATE = 0; in version()
85 key_t ftok(in char*, int); in version()
101 key_t key; in version()
112 key_t key; in version()
125 key_t ftok(in char*, int); in version()
137 key_t key; in version()
162 key_t key; in version()
185 key_t key; in version()
198 key_t key; in version()
[all …]
/dports/lang/gcc9/gcc-9.4.0/libphobos/libdruntime/core/sys/posix/sys/
H A Dipc.d62 key_t __key; in version()
79 enum key_t IPC_PRIVATE = 0; in version()
85 key_t ftok(in char*, int); in version()
101 key_t key; in version()
112 key_t key; in version()
125 key_t ftok(in char*, int); in version()
137 key_t key; in version()
162 key_t key; in version()
185 key_t key; in version()
198 key_t key; in version()
[all …]
/dports/lang/gcc9-aux/gcc-9.1.0/libphobos/libdruntime/core/sys/posix/sys/
H A Dipc.d62 key_t __key; in version()
79 enum key_t IPC_PRIVATE = 0; in version()
85 key_t ftok(in char*, int); in version()
101 key_t key; in version()
112 key_t key; in version()
125 key_t ftok(in char*, int); in version()
137 key_t key; in version()
162 key_t key; in version()
185 key_t key; in version()
198 key_t key; in version()
[all …]
/dports/devel/py-preshed/preshed-3.0.5/preshed/
H A Dbloom.pyx29 def __init__(self, key_t size=(2 ** 10), key_t hash_funcs=23, uint32_t seed=0):
39 def add(self, key_t item):
79 bloom.bitfield = <key_t*>mem.alloc(bloom.length // sizeof(key_t), sizeof(key_t))
87 length = math.ceil(length / sizeof(key_t)) * sizeof(key_t)
90 bloom.bitfield = <key_t*>mem.alloc(length // sizeof(key_t), sizeof(key_t))
107 cdef key_t hv
108 cdef key_t[2] keys
113 bloom.bitfield[hv // sizeof(key_t)] |= one << (hv % sizeof(key_t))
117 cdef key_t hv
118 cdef key_t[2] keys
[all …]

12345678910>>...176