| /dports/lang/gcc9-aux/gcc-9.1.0/gcc/testsuite/g++.dg/debug/dwarf2/ |
| H A D | cdtor-1.C | 5 struct K struct
7 K () { } in K() function
8 ~K () { } in ~K() argument
|
| /dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/testsuite/g++.dg/debug/dwarf2/ |
| H A D | cdtor-1.C | 5 struct K struct
7 K () { } in K() function
8 ~K () { } in ~K() argument
|
| /dports/lang/gcc10/gcc-10.3.0/gcc/testsuite/g++.dg/debug/dwarf2/ |
| H A D | cdtor-1.C | 5 struct K struct
7 K () { } in K() argument
8 ~K () { } in ~K() argument
|
| /dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/testsuite/g++.dg/debug/dwarf2/ |
| H A D | cdtor-1.C | 5 struct K struct
7 K () { } in K() function
8 ~K () { } in ~K() argument
|
| /dports/lang/gcc9-devel/gcc-9-20211007/gcc/testsuite/g++.dg/debug/dwarf2/ |
| H A D | cdtor-1.C | 5 struct K struct
7 K () { } in K() function
8 ~K () { } in ~K() argument
|
| /dports/lang/gcc8/gcc-8.5.0/gcc/testsuite/g++.dg/debug/dwarf2/ |
| H A D | cdtor-1.C | 5 struct K struct
7 K () { } in K() function
8 ~K () { } in ~K() argument
|
| /dports/lang/gcc11/gcc-11.2.0/gcc/testsuite/g++.dg/debug/dwarf2/ |
| H A D | cdtor-1.C | 5 struct K struct
7 K () { } in K() function
8 ~K () { } in ~K() argument
|
| /dports/lang/gcc10-devel/gcc-10-20211008/gcc/testsuite/g++.dg/debug/dwarf2/ |
| H A D | cdtor-1.C | 5 struct K struct
7 K () { } in K() function
8 ~K () { } in ~K() argument
|
| /dports/devel/mingw32-gcc/gcc-4.8.1/gcc/testsuite/g++.dg/debug/dwarf2/ |
| H A D | cdtor-1.C | 5 struct K struct
7 K () { } in K() function
8 ~K () { } in ~K() argument
|
| /dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.platform.ui/bundles/org.eclipse.core.databinding.property/src/org/eclipse/core/databinding/property/map/ |
| H A D | SimpleMapProperty.java | 81 public final void setMap(S source, Map<K, V> map, MapDiff<K, V> diff) { in setMap()
97 protected abstract void doSetMap(S source, Map<K, V> map, MapDiff<K, V> diff); in doSetMap()
100 protected void doSetMap(S source, Map<K, V> map) { in doSetMap()
106 protected void doUpdateMap(S source, MapDiff<K, V> diff) { in doUpdateMap()
131 …public abstract INativePropertyListener<S> adaptListener(ISimplePropertyListener<S, MapDiff<K, V>>… in adaptListener()
|
| /dports/science/libint2/libint-2.7.1/src/bin/libint/ |
| H A D | oper.cc | 33 R12_k_G12_Descr::label_(int K, bool contracted) in label_()
41 R12_k_G12_Descr::symbol_(int K, bool contracted) in symbol_()
63 R12k_R12l_G12_Descr::label_(const IntVec3& K, const IntVec3& L, bool contracted) in label_()
76 R12k_R12l_G12_Descr::symbol_(const IntVec3& K, const IntVec3& L, bool contracted) in symbol_()
91 Ti_G12_Descr::label_(int K, bool contracted) in label_()
99 Ti_G12_Descr::symbol_(int K, bool contracted) in symbol_()
109 G12_Ti_G12_Descr::label_(int K, bool contracted) in label_()
118 G12_Ti_G12_Descr::symbol_(int K, bool contracted) in symbol_()
|
| /dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/geo-booleanop-0.3.0/src/splay/ |
| H A D | node.rs | 10 …pub fn new_boxed(k: K, v: V, l: Option<Box<Node<K, V>>>, r: Option<Box<Node<K, V>>>) -> Box<Node<K… in new_boxed() argument
20 pub fn pop_left(&mut self) -> Option<Box<Node<K, V>>> { in pop_left()
25 pub fn pop_right(&mut self) -> Option<Box<Node<K, V>>> { in pop_right()
|
| /dports/devel/directfb/DirectFB-1.4.17/src/gfx/generic/ |
| H A D | stretch_up_down_table.h | 5 #define FUNC_NAME_(K,P,F) FUNC_NAME(up,K,P,F) argument
16 #define FUNC_NAME_(K,P,F) FUNC_NAME(down,K,P,F) argument
29 #define FUNC_NAME_(K,P,F) FUNC_NAME(up,K,P,F) argument
35 #define FUNC_NAME_(K,P,F) FUNC_NAME(down,K,P,F) argument
45 #define FUNC_NAME_(K,P,F) FUNC_NAME(up,K,P,F) argument
51 #define FUNC_NAME_(K,P,F) FUNC_NAME(down,K,P,F) argument
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/ |
| H A D | Polygon_2_algorithms.h | 345 typename std::iterator_traits<ForwardIterator>::value_type>::Kernel K; in left_vertex_2() typedef
356 typename std::iterator_traits<ForwardIterator>::value_type>::Kernel K; in right_vertex_2() typedef
367 typename std::iterator_traits<ForwardIterator>::value_type>::Kernel K; in top_vertex_2() typedef
378 typename std::iterator_traits<ForwardIterator>::value_type>::Kernel K; in bottom_vertex_2() typedef
389 typename std::iterator_traits<ForwardIterator>::value_type>::Kernel K; in area_2() typedef
401 typename std::iterator_traits<ForwardIterator>::value_type>::Kernel K; in is_convex_2() typedef
413 typename std::iterator_traits<ForwardIterator>::value_type>::Kernel K; in is_simple_2() typedef
425 typename std::iterator_traits<ForwardIterator>::value_type>::Kernel K; in oriented_side_2() typedef
438 typename std::iterator_traits<ForwardIterator>::value_type>::Kernel K; in bounded_side_2() typedef
450 typename std::iterator_traits<ForwardIterator>::value_type>::Kernel K; in orientation_2() typedef
|
| /dports/math/py-libpoly/libpoly-0.1.11/src/number/ |
| H A D | integer.h | 35 int integer_in_ring(const lp_int_ring_t* K, const lp_integer_t* c) { in integer_in_ring()
49 void integer_ring_normalize(const lp_int_ring_t* K, lp_integer_t* c) { in integer_ring_normalize()
90 void integer_construct_from_int(const lp_int_ring_t* K, lp_integer_t* c, long x) { in integer_construct_from_int()
114 void integer_assign_int(const lp_int_ring_t* K, lp_integer_t* c, long from) { in integer_assign_int()
173 int integer_is_zero(const lp_int_ring_t* K, const lp_integer_t* c) { in integer_is_zero()
186 int integer_sgn(const lp_int_ring_t* K, const lp_integer_t* c) { in integer_sgn()
214 int integer_cmp_int(const lp_int_ring_t* K, const lp_integer_t* c, long to) { in integer_cmp_int()
252 void integer_inc(const lp_int_ring_t* K, lp_integer_t* a) { in integer_inc()
263 void integer_dec(const lp_int_ring_t* K, lp_integer_t* a) { in integer_dec()
288 void integer_neg(const lp_int_ring_t* K, lp_integer_t* neg, const lp_integer_t* a) { in integer_neg()
[all …]
|
| /dports/math/libpoly/libpoly-0.1.11/src/number/ |
| H A D | integer.h | 35 int integer_in_ring(const lp_int_ring_t* K, const lp_integer_t* c) { in integer_in_ring()
49 void integer_ring_normalize(const lp_int_ring_t* K, lp_integer_t* c) { in integer_ring_normalize()
90 void integer_construct_from_int(const lp_int_ring_t* K, lp_integer_t* c, long x) { in integer_construct_from_int()
114 void integer_assign_int(const lp_int_ring_t* K, lp_integer_t* c, long from) { in integer_assign_int()
173 int integer_is_zero(const lp_int_ring_t* K, const lp_integer_t* c) { in integer_is_zero()
186 int integer_sgn(const lp_int_ring_t* K, const lp_integer_t* c) { in integer_sgn()
214 int integer_cmp_int(const lp_int_ring_t* K, const lp_integer_t* c, long to) { in integer_cmp_int()
252 void integer_inc(const lp_int_ring_t* K, lp_integer_t* a) { in integer_inc()
263 void integer_dec(const lp_int_ring_t* K, lp_integer_t* a) { in integer_dec()
288 void integer_neg(const lp_int_ring_t* K, lp_integer_t* neg, const lp_integer_t* a) { in integer_neg()
[all …]
|
| /dports/devel/pijul/pijul-1.0.0.a55/cargo-crates/sanakirja-core-1.2.13/src/btree/ |
| H A D | del.rs | 84 P: BTreeMutPage<K, V>, in del()
87 db: &mut Db_<K, V, P>, in del()
88 key: &K, in del()
113 P: BTreeMutPage<K, V>, in del_at_cursor()
116 db: &mut Db_<K, V, P>, in del_at_cursor()
233 K: Storable + ?Sized, in leaf_delete() argument
285 K: Storable + ?Sized, in concat() argument
287 P: BTreeMutPage<K, V>, in concat()
370 K: Storable + ?Sized + PartialEq, in handle_merge() argument
584 P: BTreePage<K, V>, in modify_rc()
[all …]
|
| /dports/net-im/fractal/fractal-4.4.0/vendor/indexmap/src/map/core/ |
| H A D | raw.rs | 24 Q: ?Sized + Equivalent<K>, in find_equivalent()
39 Q: ?Sized + Equivalent<K>, in get_index_of()
52 pub(crate) fn entry(&mut self, hash: HashValue, key: K) -> Entry<K, V> in entry()
75 Q: ?Sized + Equivalent<K>, in shift_remove_full()
84 pub(crate) fn shift_remove_index(&mut self, index: usize) -> Option<(K, V)> { in shift_remove_index()
133 Q: ?Sized + Equivalent<K>, in swap_remove_full()
142 pub(crate) fn swap_remove_index(&mut self, index: usize) -> Option<(K, V)> { in swap_remove_index()
208 pub fn key(&self) -> &K { in key()
222 pub(crate) fn replace_key(self) -> K { in replace_key()
246 pub fn swap_remove_entry(self) -> (K, V) { in swap_remove_entry()
[all …]
|
| /dports/ftp/wput/wput-0.6.2/src/ |
| H A D | queue.c | 49 void printqueue(_queue * K) { in printqueue()
56 _queue * K = queue_entry_point; in queue_add_file() local
68 _queue * K = queue_entry_point; in queue_add_url() local
85 _queue * K = queue_entry_point; in queue_add_entry() local
101 _queue * K = queue_entry_point; in wdel_queue_add_entry() local
127 _queue * K = queue_entry_point; in wdel_queue_add_file() local
148 _queue * K = queue_entry_point; in separate_urls() local
211 _queue * K = queue_entry_point; in process_missing() local
617 void skiplist_free(skipd_list * K) {
649 skipd_list * K = opt.skipdlist; local
[all …]
|
| /dports/audio/spotify-tui/spotify-tui-0.25.0/cargo-crates/indexmap-1.5.0/src/map/core/ |
| H A D | raw.rs | 24 Q: ?Sized + Equivalent<K>, in find_equivalent()
39 Q: ?Sized + Equivalent<K>, in get_index_of()
52 pub(crate) fn entry(&mut self, hash: HashValue, key: K) -> Entry<K, V> in entry()
75 Q: ?Sized + Equivalent<K>, in shift_remove_full()
84 pub(crate) fn shift_remove_index(&mut self, index: usize) -> Option<(K, V)> { in shift_remove_index()
133 Q: ?Sized + Equivalent<K>, in swap_remove_full()
142 pub(crate) fn swap_remove_index(&mut self, index: usize) -> Option<(K, V)> { in swap_remove_index()
208 pub fn key(&self) -> &K { in key()
222 pub(crate) fn replace_key(self) -> K { in replace_key()
246 pub fn swap_remove_entry(self) -> (K, V) { in swap_remove_entry()
[all …]
|
| /dports/textproc/sonic/sonic-1.3.0/cargo-crates/rocksdb-0.14.0/src/ |
| H A D | write_batch.rs | 118 pub fn put<K, V>(&mut self, key: K, value: V) in put()
137 pub fn put_cf<K, V>(&mut self, cf: &ColumnFamily, key: K, value: V) in put_cf()
157 pub fn merge<K, V>(&mut self, key: K, value: V) in merge()
176 pub fn merge_cf<K, V>(&mut self, cf: &ColumnFamily, key: K, value: V) in merge_cf()
197 pub fn delete<K: AsRef<[u8]>>(&mut self, key: K) { in delete()
209 pub fn delete_cf<K: AsRef<[u8]>>(&mut self, cf: &ColumnFamily, key: K) { in delete_cf()
227 pub fn delete_range<K: AsRef<[u8]>>(&mut self, from: K, to: K) { in delete_range()
246 pub fn delete_range_cf<K: AsRef<[u8]>>(&mut self, cf: &ColumnFamily, from: K, to: K) { in delete_range_cf()
|
| /dports/lang/gcc12-devel/gcc-12-20211205/gcc/testsuite/go.test/test/fixedbugs/ |
| H A D | issue37716.go | 12 type K struct { struct
13 a, b int32 // these get merged by the compiler into a single field, something typehash doesn't do
14 c float64
|
| /dports/lang/go-devel/go-becaeea1199b875bc24800fa88f2f4fea119bf78/test/fixedbugs/ |
| H A D | issue37716.go | 12 type K struct { struct
13 a, b int32 // these get merged by the compiler into a single field, something typehash doesn't do
14 c float64
|
| /dports/lang/gcc11-devel/gcc-11-20211009/gcc/testsuite/go.test/test/fixedbugs/ |
| H A D | issue37716.go | 12 type K struct { struct
13 a, b int32 // these get merged by the compiler into a single field, something typehash doesn't do
14 c float64
|
| /dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/testsuite/go.test/test/fixedbugs/ |
| H A D | issue37716.go | 12 type K struct { struct
13 a, b int32 // these get merged by the compiler into a single field, something typehash doesn't do
14 c float64
|