Home
last modified time | relevance | path

Searched refs:p_key (Results 26 – 50 of 620) sorted by relevance

12345678910>>...25

/dports/devel/godot-tools/godot-3.2.3-stable/core/
H A Doa_hash_map.h69 uint32_t hash = Hasher::hash(p_key); in _hash()
92 uint32_t hash = _hash(p_key); in _lookup_pos()
121 TKey key = p_key; in _insert_with_hash()
213 uint32_t hash = _hash(p_key); in insert()
215 _insert_with_hash(hash, p_key, p_value); in insert()
220 bool exists = _lookup_pos(p_key, pos); in set()
225 insert(p_key, p_data); in set()
237 bool exists = _lookup_pos(p_key, pos); in lookup()
249 return _lookup_pos(p_key, _pos); in has()
252 void remove(const TKey &p_key) { in remove() argument
[all …]
H A Dmap.h241 if (less(p_key, node->_key)) in _find()
261 if (less(p_key, node->_key)) in _find_closest()
272 if (less(p_key, prev->_key)) in _find_closest()
337 if (less(p_key, node->_key)) in _insert()
351 new_node->_key = p_key; in _insert()
533 Element *res = _find(p_key); in find()
557 return find(p_key) != NULL; in has()
577 bool erase(const K &p_key) { in erase() argument
582 Element *e = find(p_key); in erase()
605 Element *e = find(p_key);
[all …]
H A Dordered_hash_map.h194 ConstElement find(const K &p_key) const { in find() argument
202 Element find(const K &p_key) { in find() argument
229 bool erase(const K &p_key) { in erase() argument
233 map.erase(p_key); in erase()
239 inline bool has(const K &p_key) const { in has() argument
240 return map.has(p_key); in has()
243 const V &operator[](const K &p_key) const {
244 ConstElement e = find(p_key);
249 V &operator[](const K &p_key) {
250 Element e = find(p_key);
[all …]
/dports/devel/p5-Cache-Cache/Cache-Cache-1.08/lib/Cache/
H A DBaseCache.pm71 Assert_Defined( $p_key );
78 $object->set_key( $p_key );
192 my ( $self, $p_key ) = @_;
194 Assert_Defined( $p_key );
204 $self->remove( $p_key );
232 my ( $self, $p_key ) = @_;
234 Assert_Defined( $p_key );
262 my ( $self, $p_key ) = @_;
264 Assert_Defined( $p_key );
274 Assert_Defined( $p_key );
[all …]
H A DFileBackend.pm49 my ( $self, $p_namespace, $p_key ) = @_;
52 Assert_Defined( $p_key );
104 my ( $self, $p_namespace, $p_key ) = @_;
107 Assert_Defined( $p_key );
123 my ( $self, $p_namespace, $p_key ) = @_;
126 Assert_Defined( $p_key );
137 Assert_Defined( $p_key );
197 my ( $p_key ) = @_;
199 Assert_Defined( $p_key );
201 return sha1_hex( $p_key );
[all …]
/dports/devel/splint/splint-3.1.2/src/Headers/
H A DvalueMatrix.h33 extern void valueMatrix_insert (valueMatrix p_h, /*@dependent@*/ cstring p_key,
36 # define valueMatrix_insert(p_h,p_key,p_value) \ argument
37 (genericTable_insert ((valueMatrxi) (p_h), p_key, (void *) (p_value)))
39 …@*/ /*@exposed@*/ stateCombinationTable valueMatrix_lookup (valueMatrix p_h, cstring p_key) /*@*/ ;
40 # define valueMatrix_lookup(p_h,p_key) \ argument
41 ((stateCombinationTable) genericTable_lookup ((genericTable) (p_h), p_key))
49 extern void valueMatrix_remove (valueMatrix p_h, cstring p_key) /*@modifies p_h@*/ ;
50 # define valueMatrix_remove(p_h,p_key) (genericTable_remove ((genericTable) (p_h), p_key)) argument
H A DvalueTable.h30 /*@only@*/ cstring p_key,
35 valueTable_lookup (valueTable p_h, cstring p_key) /*@*/ ;
36 # define valueTable_lookup(p_h,p_key) \ argument
37 ((stateValue) genericTable_lookup ((genericTable) (p_h), p_key))
40 extern bool valueTable_contains (valueTable p_h, cstring p_key) /*@*/ ;
41 # define valueTable_contains(p_h,p_key) \ argument
42 (stateValue_isDefined (valueTable_lookup (p_h, p_key)))
52 extern void valueTable_update (valueTable p_h, cstring p_key, /*@owned@*/ stateValue p_newval) /*@m…
/dports/devel/godot2/godot-2.1.6-stable/modules/gridmap/
H A Dgrid_map.h61 _FORCE_INLINE_ bool operator<(const IndexKey &p_key) const {
63 return key < p_key.key;
130 _FORCE_INLINE_ bool operator<(const OctantKey &p_key) const {
132 return key < p_key.key;
199 return Vector3(p_key.x, p_key.y, p_key.z) * cell_size * octant_size; in _octant_get_offset()
202 void _octant_enter_world(const OctantKey &p_key);
203 void _octant_enter_tree(const OctantKey &p_key);
204 void _octant_exit_world(const OctantKey &p_key);
205 void _octant_update(const OctantKey &p_key);
206 void _octant_transform(const OctantKey &p_key);
[all …]
/dports/devel/godot2-tools/godot-2.1.6-stable/modules/gridmap/
H A Dgrid_map.h61 _FORCE_INLINE_ bool operator<(const IndexKey &p_key) const {
63 return key < p_key.key;
130 _FORCE_INLINE_ bool operator<(const OctantKey &p_key) const {
132 return key < p_key.key;
199 return Vector3(p_key.x, p_key.y, p_key.z) * cell_size * octant_size; in _octant_get_offset()
202 void _octant_enter_world(const OctantKey &p_key);
203 void _octant_enter_tree(const OctantKey &p_key);
204 void _octant_exit_world(const OctantKey &p_key);
205 void _octant_update(const OctantKey &p_key);
206 void _octant_transform(const OctantKey &p_key);
[all …]
/dports/devel/godot/godot-3.2.3-stable/modules/gridmap/
H A Dgrid_map.h60 _FORCE_INLINE_ bool operator<(const IndexKey &p_key) const {
62 return key < p_key.key;
131 _FORCE_INLINE_ bool operator<(const OctantKey &p_key) const {
133 return key < p_key.key;
175 _FORCE_INLINE_ Vector3 _octant_get_offset(const OctantKey &p_key) const { in _octant_get_offset() argument
177 return Vector3(p_key.x, p_key.y, p_key.z) * cell_size * octant_size; in _octant_get_offset()
181 void _octant_enter_world(const OctantKey &p_key);
182 void _octant_exit_world(const OctantKey &p_key);
183 bool _octant_update(const OctantKey &p_key);
184 void _octant_clean_up(const OctantKey &p_key);
[all …]
/dports/devel/godot-tools/godot-3.2.3-stable/modules/gridmap/
H A Dgrid_map.h60 _FORCE_INLINE_ bool operator<(const IndexKey &p_key) const {
62 return key < p_key.key;
131 _FORCE_INLINE_ bool operator<(const OctantKey &p_key) const {
133 return key < p_key.key;
175 _FORCE_INLINE_ Vector3 _octant_get_offset(const OctantKey &p_key) const { in _octant_get_offset() argument
177 return Vector3(p_key.x, p_key.y, p_key.z) * cell_size * octant_size; in _octant_get_offset()
181 void _octant_enter_world(const OctantKey &p_key);
182 void _octant_exit_world(const OctantKey &p_key);
183 bool _octant_update(const OctantKey &p_key);
184 void _octant_clean_up(const OctantKey &p_key);
[all …]
/dports/multimedia/vlc/vlc-3.0.16/src/misc/
H A Dupdate_crypto.c117 if( p_key->version != 4 ) in parse_public_key_packet()
124 if( p_key->algo == GCRY_PK_DSA ) { in parse_public_key_packet()
125 READ_MPI(p_key->sig.dsa.p, 3072); in parse_public_key_packet()
126 READ_MPI(p_key->sig.dsa.q, 256); in parse_public_key_packet()
127 READ_MPI(p_key->sig.dsa.g, 3072); in parse_public_key_packet()
128 READ_MPI(p_key->sig.dsa.y, 3072); in parse_public_key_packet()
130 READ_MPI(p_key->sig.rsa.n, 4096); in parse_public_key_packet()
131 READ_MPI(p_key->sig.rsa.e, 4096); in parse_public_key_packet()
620 p_key->psz_username = NULL; in parse_public_key()
714 if( p_key->sig.version == 4 ) in parse_public_key()
[all …]
/dports/devel/godot2/godot-2.1.6-stable/core/
H A Ddictionary.h51 Variant &operator[](const Variant &p_key);
52 const Variant &operator[](const Variant &p_key) const;
54 const Variant *getptr(const Variant &p_key) const;
55 Variant *getptr(const Variant &p_key);
57 Variant get_valid(const Variant &p_key) const;
68 bool has(const Variant &p_key) const;
71 void erase(const Variant &p_key);
78 const Variant *next(const Variant *p_key = NULL) const;
H A Dmap.h243 if (less(p_key, node->_key)) in _find()
263 if (less(p_key, node->_key)) in _find_closest()
274 if (less(p_key, prev->_key)) { in _find_closest()
295 if (less(p_key, node->_key)) in _insert()
310 new_node->_key = p_key; in _insert()
546 Element *res = _find(p_key); in find()
582 bool erase(const K &p_key) { in erase() argument
586 Element *e = find(p_key); in erase()
597 return find(p_key) != NULL; in has()
612 Element *e = find(p_key);
[all …]
H A Dvmap.h46 _FORCE_INLINE_ _Pair(const T &p_key, const V &p_value) { in _Pair()
48 key = p_key; in _Pair()
111 int insert(const T &p_key, const V &p_val) { in insert() argument
114 int pos = _find(p_key, exact); in insert()
119 _data.insert(pos, _Pair(p_key, p_val)); in insert()
180 inline const V &operator[](const T &p_key) const {
182 int pos = _find_exact(p_key);
189 inline V &operator[](const T &p_key) {
191 int pos = _find_exact(p_key);
194 pos = insert(p_key, val);
/dports/devel/godot2-tools/godot-2.1.6-stable/core/
H A Ddictionary.h51 Variant &operator[](const Variant &p_key);
52 const Variant &operator[](const Variant &p_key) const;
54 const Variant *getptr(const Variant &p_key) const;
55 Variant *getptr(const Variant &p_key);
57 Variant get_valid(const Variant &p_key) const;
68 bool has(const Variant &p_key) const;
71 void erase(const Variant &p_key);
78 const Variant *next(const Variant *p_key = NULL) const;
H A Dmap.h243 if (less(p_key, node->_key)) in _find()
263 if (less(p_key, node->_key)) in _find_closest()
274 if (less(p_key, prev->_key)) { in _find_closest()
295 if (less(p_key, node->_key)) in _insert()
310 new_node->_key = p_key; in _insert()
546 Element *res = _find(p_key); in find()
582 bool erase(const K &p_key) { in erase() argument
586 Element *e = find(p_key); in erase()
597 return find(p_key) != NULL; in has()
612 Element *e = find(p_key);
[all …]
H A Dvmap.h46 _FORCE_INLINE_ _Pair(const T &p_key, const V &p_value) { in _Pair()
48 key = p_key; in _Pair()
111 int insert(const T &p_key, const V &p_val) { in insert() argument
114 int pos = _find(p_key, exact); in insert()
119 _data.insert(pos, _Pair(p_key, p_val)); in insert()
180 inline const V &operator[](const T &p_key) const {
182 int pos = _find_exact(p_key);
189 inline V &operator[](const T &p_key) {
191 int pos = _find_exact(p_key);
194 pos = insert(p_key, val);
/dports/devel/godot/godot-3.2.3-stable/core/
H A Dmap.h241 if (less(p_key, node->_key)) in _find()
261 if (less(p_key, node->_key)) in _find_closest()
272 if (less(p_key, prev->_key)) in _find_closest()
337 if (less(p_key, node->_key)) in _insert()
351 new_node->_key = p_key; in _insert()
533 Element *res = _find(p_key); in find()
557 return find(p_key) != NULL; in has()
577 bool erase(const K &p_key) { in erase() argument
582 Element *e = find(p_key); in erase()
605 Element *e = find(p_key);
[all …]
H A Dordered_hash_map.h194 ConstElement find(const K &p_key) const { in find() argument
202 Element find(const K &p_key) { in find() argument
229 bool erase(const K &p_key) { in erase() argument
233 map.erase(p_key); in erase()
239 inline bool has(const K &p_key) const { in has() argument
240 return map.has(p_key); in has()
243 const V &operator[](const K &p_key) const {
244 ConstElement e = find(p_key);
249 V &operator[](const K &p_key) {
250 Element e = find(p_key);
[all …]
/dports/www/cpr/cpr-1.7.0/include/cpr/
H A Dcurl_container.h15 Parameter(const std::string& p_key, const std::string& p_value) : key{p_key}, value{p_value} {} in Parameter()
16 Parameter(std::string&& p_key, std::string&& p_value) in Parameter()
17 : key{std::move(p_key)}, value{std::move(p_value)} {} in Parameter()
24 Pair(const std::string& p_key, const std::string& p_value) : key(p_key), value(p_value) {} in Pair()
25 Pair(std::string&& p_key, std::string&& p_value) in Pair()
26 : key(std::move(p_key)), value(std::move(p_value)) {} in Pair()
/dports/devel/godot/godot-3.2.3-stable/modules/gdnative/include/gdnative/
H A Ddictionary.h74 godot_bool GDAPI godot_dictionary_has(const godot_dictionary *p_self, const godot_variant *p_key);
78 void GDAPI godot_dictionary_erase(godot_dictionary *p_self, const godot_variant *p_key);
86 godot_variant GDAPI godot_dictionary_get(const godot_dictionary *p_self, const godot_variant *p_key…
87 void GDAPI godot_dictionary_set(godot_dictionary *p_self, const godot_variant *p_key, const godot_v…
89 …riant GDAPI *godot_dictionary_operator_index(godot_dictionary *p_self, const godot_variant *p_key);
91 …*godot_dictionary_operator_index_const(const godot_dictionary *p_self, const godot_variant *p_key);
93 …t_variant GDAPI *godot_dictionary_next(const godot_dictionary *p_self, const godot_variant *p_key);
101 …ool GDAPI godot_dictionary_erase_with_return(godot_dictionary *p_self, const godot_variant *p_key);
103 …ary_get_with_default(const godot_dictionary *p_self, const godot_variant *p_key, const godot_varia…
/dports/devel/godot-tools/godot-3.2.3-stable/modules/gdnative/include/gdnative/
H A Ddictionary.h74 godot_bool GDAPI godot_dictionary_has(const godot_dictionary *p_self, const godot_variant *p_key);
78 void GDAPI godot_dictionary_erase(godot_dictionary *p_self, const godot_variant *p_key);
86 godot_variant GDAPI godot_dictionary_get(const godot_dictionary *p_self, const godot_variant *p_key…
87 void GDAPI godot_dictionary_set(godot_dictionary *p_self, const godot_variant *p_key, const godot_v…
89 …riant GDAPI *godot_dictionary_operator_index(godot_dictionary *p_self, const godot_variant *p_key);
91 …*godot_dictionary_operator_index_const(const godot_dictionary *p_self, const godot_variant *p_key);
93 …t_variant GDAPI *godot_dictionary_next(const godot_dictionary *p_self, const godot_variant *p_key);
101 …ool GDAPI godot_dictionary_erase_with_return(godot_dictionary *p_self, const godot_variant *p_key);
103 …ary_get_with_default(const godot_dictionary *p_self, const godot_variant *p_key, const godot_varia…
/dports/multimedia/libdvdcss/libdvdcss-1.4.3/src/
H A Dcss.c217 memcpy( dvdcss->css.p_title_key, p_title->p_key, sizeof(p_title->p_key) ); in dvdcss_title()
435 uint8_t p_key[DVD_KEY_SIZE]; in dvdcss_titlekey() local
501 if( !( p_key[0] | p_key[1] | p_key[2] | p_key[3] | p_key[4] ) ) in dvdcss_titlekey()
562 i_t2 = p_key[1] ^ p_sec[0x55]; in dvdcss_unscramble()
563 i_t3 = (p_key[2] | (p_key[3] << 8) | in dvdcss_unscramble()
1001 i_lfsr1_lo = p_key[0] | 0x100; in DecryptKey()
1002 i_lfsr1_hi = p_key[1]; in DecryptKey()
1004 i_lfsr0 = ( ( p_key[4] << 17 ) in DecryptKey()
1005 | ( p_key[3] << 9 ) in DecryptKey()
1479 p_key[0] ^= p_sector_seed[0]; in RecoverTitleKey()
[all …]
/dports/devel/fbthrift/fbthrift-2021.12.27.00/thrift/compiler/test/fixtures/basic-stack-arguments/gen-cpp2/
H A DDbMixedStackArguments.cpp31 getDataByKey0(*ret, std::move(p_key)); in semifuture_getDataByKey0()
38 …return apache::thrift::detail::si::future(semifuture_getDataByKey0(std::move(p_key)), getInternalK… in future_getDataByKey0()
57 auto fut = future_getDataByKey0(std::move(p_key)); in async_tm_getDataByKey0()
63 auto fut = semifuture_getDataByKey0(std::move(p_key)); in async_tm_getDataByKey0()
70 getDataByKey0(_return, std::move(p_key)); in async_tm_getDataByKey0()
92 getDataByKey1(ret, p_key); in semifuture_getDataByKey1()
96 …Future<::std::string> DbMixedStackArgumentsSvIf::future_getDataByKey1(const ::std::string& p_key) { in future_getDataByKey1() argument
99 …return apache::thrift::detail::si::future(semifuture_getDataByKey1(p_key), getInternalKeepAlive()); in future_getDataByKey1()
118 auto fut = future_getDataByKey1(p_key); in async_tm_getDataByKey1()
124 auto fut = semifuture_getDataByKey1(p_key); in async_tm_getDataByKey1()
[all …]

12345678910>>...25