| /dports/lang/cython/Cython-0.29.24/tests/run/ |
| H A D | cpp_stl_cpp11.pyx | 82 set[int] int_set
88 assert int_set.erase(int_set.const_begin(), int_set.const_end()) == int_set.end()
114 int_set.insert(1)
116 int_set.erase(int_set.begin(), int_set.end())
118 int_set.insert(1)
121 int_set.insert(1)
123 assert int_set.erase(iterator) == int_set.end()
133 int_set.rehash(20)
134 int_set.reserve(20)
136 int_set.bucket_size(0)
[all …]
|
| /dports/lang/cython-devel/cython-2b1e743/tests/run/ |
| H A D | cpp_stl_cpp11.pyx | 82 set[int] int_set
88 assert int_set.erase(int_set.const_begin(), int_set.const_end()) == int_set.end()
114 int_set.insert(1)
116 …int_set.erase(unordered_set[int].const_iterator(int_set.begin()), unordered_set[int].const_iterato…
118 int_set.insert(1)
121 int_set.insert(1)
123 assert int_set.erase(iterator) == int_set.end()
133 int_set.rehash(20)
134 int_set.reserve(20)
136 int_set.bucket_size(0)
[all …]
|
| /dports/games/cataclysm-dda-tiles/Cataclysm-DDA-0.F/tests/ |
| H A D | flat_set_test.cpp | 101 using int_set = cata::flat_set<int>; typedef
103 CHECK( int_set{} == int_set{} );
104 CHECK( int_set{ 0 } == int_set{ 0 } );
106 CHECK( int_set{} != int_set{ 0 } );
107 CHECK( int_set{ 0 } != int_set{ 1 } );
108 CHECK( int_set{} < int_set{ 0 } );
109 CHECK( int_set{ 0 } < int_set{ 1 } );
110 CHECK( int_set{ 6, 0 } < int_set{ 1 } );
|
| /dports/games/cataclysm-dda/Cataclysm-DDA-0.F/tests/ |
| H A D | flat_set_test.cpp | 101 using int_set = cata::flat_set<int>; typedef
103 CHECK( int_set{} == int_set{} );
104 CHECK( int_set{ 0 } == int_set{ 0 } );
106 CHECK( int_set{} != int_set{ 0 } );
107 CHECK( int_set{ 0 } != int_set{ 1 } );
108 CHECK( int_set{} < int_set{ 0 } );
109 CHECK( int_set{ 0 } < int_set{ 1 } );
110 CHECK( int_set{ 6, 0 } < int_set{ 1 } );
|
| /dports/devel/boost-docs/boost_1_72_0/libs/container/test/ |
| H A D | flat_set_test.cpp | 162 std::set<int> int_set; in flat_tree_ordered_insertion_test() local
167 flat_set<int> fset(ordered_unique_range, int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
172 fset.insert(ordered_unique_range, int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
176 fset.insert(ordered_unique_range, int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
178 int_set2.insert(int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
262 int_set.clear(); in flat_tree_ordered_insertion_test()
273 fset.insert(ordered_unique_range, int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
274 int_set4.insert(int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
303 auto fset = flat_set(int_set.begin(), int_set.end()); in constructor_template_auto_deduction_test()
312 auto fset = flat_set(int_set.begin(), int_set.end(), comp_int_t()); in constructor_template_auto_deduction_test()
[all …]
|
| H A D | set_test.cpp | 215 std::set<int> int_set; in constructor_template_auto_deduction_test() local
217 int_set.insert(static_cast<int>(i)); in constructor_template_auto_deduction_test()
229 auto fset = set(int_set.begin(), int_set.end()); in constructor_template_auto_deduction_test()
230 if (!CheckEqualContainers(int_set, fset)) in constructor_template_auto_deduction_test()
238 auto fset = set(int_set.begin(), int_set.end(), comp_int_t()); in constructor_template_auto_deduction_test()
247 auto fset = set(int_set.begin(), int_set.end(), comp_int_t(), alloc_int_t()); in constructor_template_auto_deduction_test()
256 auto fset = set(int_set.begin(), int_set.end(), alloc_int_t()); in constructor_template_auto_deduction_test()
268 auto fset = set(ordered_unique_range, int_set.begin(), int_set.end()); in constructor_template_auto_deduction_test()
277 auto fset = set(ordered_unique_range, int_set.begin(), int_set.end(), comp_int_t()); in constructor_template_auto_deduction_test()
286 …auto fset = set(ordered_unique_range, int_set.begin(), int_set.end(), comp_int_t(), alloc_int_t()); in constructor_template_auto_deduction_test()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/container/test/ |
| H A D | flat_set_test.cpp | 162 std::set<int> int_set; in flat_tree_ordered_insertion_test() local
167 flat_set<int> fset(ordered_unique_range, int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
172 fset.insert(ordered_unique_range, int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
176 fset.insert(ordered_unique_range, int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
178 int_set2.insert(int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
262 int_set.clear(); in flat_tree_ordered_insertion_test()
273 fset.insert(ordered_unique_range, int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
274 int_set4.insert(int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
303 auto fset = flat_set(int_set.begin(), int_set.end()); in constructor_template_auto_deduction_test()
312 auto fset = flat_set(int_set.begin(), int_set.end(), comp_int_t()); in constructor_template_auto_deduction_test()
[all …]
|
| H A D | set_test.cpp | 215 std::set<int> int_set; in constructor_template_auto_deduction_test() local
217 int_set.insert(static_cast<int>(i)); in constructor_template_auto_deduction_test()
229 auto fset = set(int_set.begin(), int_set.end()); in constructor_template_auto_deduction_test()
230 if (!CheckEqualContainers(int_set, fset)) in constructor_template_auto_deduction_test()
238 auto fset = set(int_set.begin(), int_set.end(), comp_int_t()); in constructor_template_auto_deduction_test()
247 auto fset = set(int_set.begin(), int_set.end(), comp_int_t(), alloc_int_t()); in constructor_template_auto_deduction_test()
256 auto fset = set(int_set.begin(), int_set.end(), alloc_int_t()); in constructor_template_auto_deduction_test()
268 auto fset = set(ordered_unique_range, int_set.begin(), int_set.end()); in constructor_template_auto_deduction_test()
277 auto fset = set(ordered_unique_range, int_set.begin(), int_set.end(), comp_int_t()); in constructor_template_auto_deduction_test()
286 …auto fset = set(ordered_unique_range, int_set.begin(), int_set.end(), comp_int_t(), alloc_int_t()); in constructor_template_auto_deduction_test()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/libs/container/test/ |
| H A D | flat_set_test.cpp | 162 std::set<int> int_set; in flat_tree_ordered_insertion_test() local
167 flat_set<int> fset(ordered_unique_range, int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
172 fset.insert(ordered_unique_range, int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
176 fset.insert(ordered_unique_range, int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
178 int_set2.insert(int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
262 int_set.clear(); in flat_tree_ordered_insertion_test()
273 fset.insert(ordered_unique_range, int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
274 int_set4.insert(int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
303 auto fset = flat_set(int_set.begin(), int_set.end()); in constructor_template_auto_deduction_test()
312 auto fset = flat_set(int_set.begin(), int_set.end(), comp_int_t()); in constructor_template_auto_deduction_test()
[all …]
|
| H A D | set_test.cpp | 215 std::set<int> int_set; in constructor_template_auto_deduction_test() local
217 int_set.insert(static_cast<int>(i)); in constructor_template_auto_deduction_test()
229 auto fset = set(int_set.begin(), int_set.end()); in constructor_template_auto_deduction_test()
230 if (!CheckEqualContainers(int_set, fset)) in constructor_template_auto_deduction_test()
238 auto fset = set(int_set.begin(), int_set.end(), comp_int_t()); in constructor_template_auto_deduction_test()
247 auto fset = set(int_set.begin(), int_set.end(), comp_int_t(), alloc_int_t()); in constructor_template_auto_deduction_test()
256 auto fset = set(int_set.begin(), int_set.end(), alloc_int_t()); in constructor_template_auto_deduction_test()
268 auto fset = set(ordered_unique_range, int_set.begin(), int_set.end()); in constructor_template_auto_deduction_test()
277 auto fset = set(ordered_unique_range, int_set.begin(), int_set.end(), comp_int_t()); in constructor_template_auto_deduction_test()
286 …auto fset = set(ordered_unique_range, int_set.begin(), int_set.end(), comp_int_t(), alloc_int_t()); in constructor_template_auto_deduction_test()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/libs/container/test/ |
| H A D | flat_set_test.cpp | 160 std::set<int> int_set; in flat_tree_ordered_insertion_test() local
165 flat_set<int> fset(ordered_unique_range, int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
170 fset.insert(ordered_unique_range, int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
174 fset.insert(ordered_unique_range, int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
176 int_set2.insert(int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
260 int_set.clear(); in flat_tree_ordered_insertion_test()
271 fset.insert(ordered_unique_range, int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
272 int_set4.insert(int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
301 auto fset = flat_set(int_set.begin(), int_set.end()); in constructor_template_auto_deduction_test()
310 auto fset = flat_set(int_set.begin(), int_set.end(), comp_int_t()); in constructor_template_auto_deduction_test()
[all …]
|
| H A D | set_test.cpp | 228 std::set<int> int_set; in constructor_template_auto_deduction_test() local
230 int_set.insert(static_cast<int>(i)); in constructor_template_auto_deduction_test()
242 auto fset = set(int_set.begin(), int_set.end()); in constructor_template_auto_deduction_test()
243 if (!CheckEqualContainers(int_set, fset)) in constructor_template_auto_deduction_test()
251 auto fset = set(int_set.begin(), int_set.end(), comp_int_t()); in constructor_template_auto_deduction_test()
260 auto fset = set(int_set.begin(), int_set.end(), comp_int_t(), alloc_int_t()); in constructor_template_auto_deduction_test()
269 auto fset = set(int_set.begin(), int_set.end(), alloc_int_t()); in constructor_template_auto_deduction_test()
281 auto fset = set(ordered_unique_range, int_set.begin(), int_set.end()); in constructor_template_auto_deduction_test()
290 auto fset = set(ordered_unique_range, int_set.begin(), int_set.end(), comp_int_t()); in constructor_template_auto_deduction_test()
299 …auto fset = set(ordered_unique_range, int_set.begin(), int_set.end(), comp_int_t(), alloc_int_t()); in constructor_template_auto_deduction_test()
[all …]
|
| /dports/math/py-z3-solver/z3-z3-4.8.10/src/test/ |
| H A D | hashtable.cpp | 28 typedef int_hashtable<int_hash_proc, default_eq<int> > int_set; typedef
32 inline bool contains(int_set & h, int i) { in contains()
41 int_set h1; in tst1()
69 int_set h1; in tst2()
93 int_set::iterator it = h1.begin(); in tst2()
94 int_set::iterator end = h1.end(); in tst2()
107 int_set h1; in tst3()
112 int_set h2(h1); in tst3()
|
| /dports/math/z3/z3-z3-4.8.13/src/test/ |
| H A D | hashtable.cpp | 28 typedef int_hashtable<int_hash_proc, default_eq<int> > int_set; typedef
32 inline bool contains(int_set & h, int i) { in contains()
41 int_set h1; in tst1()
69 int_set h1; in tst2()
93 int_set::iterator it = h1.begin(); in tst2()
94 int_set::iterator end = h1.end(); in tst2()
107 int_set h1; in tst3()
112 int_set h2(h1); in tst3()
|
| /dports/emulators/qemu42/qemu-4.2.1/hw/arm/ |
| H A D | pxa2xx_pic.c | 90 int int_set = (irq >= 32); in pxa2xx_pic_set_irq() local
94 s->int_pending[int_set] |= 1 << irq; in pxa2xx_pic_set_irq()
96 s->int_pending[int_set] &= ~(1 << irq); in pxa2xx_pic_set_irq()
102 int i, int_set, irq; in pxa2xx_pic_highest() local
114 int_set = (irq >= 32); in pxa2xx_pic_highest()
116 if (mask[int_set] & bit & s->is_fiq[int_set]) { in pxa2xx_pic_highest()
122 if (mask[int_set] & bit & ~s->is_fiq[int_set]) { in pxa2xx_pic_highest()
|
| /dports/emulators/qemu/qemu-6.2.0/hw/arm/ |
| H A D | pxa2xx_pic.c | 92 int int_set = (irq >= 32); in pxa2xx_pic_set_irq() local
96 s->int_pending[int_set] |= 1 << irq; in pxa2xx_pic_set_irq()
98 s->int_pending[int_set] &= ~(1 << irq); in pxa2xx_pic_set_irq()
104 int i, int_set, irq; in pxa2xx_pic_highest() local
116 int_set = (irq >= 32); in pxa2xx_pic_highest()
118 if (mask[int_set] & bit & s->is_fiq[int_set]) { in pxa2xx_pic_highest()
124 if (mask[int_set] & bit & ~s->is_fiq[int_set]) { in pxa2xx_pic_highest()
|
| /dports/emulators/qemu60/qemu-6.0.0/hw/arm/ |
| H A D | pxa2xx_pic.c | 92 int int_set = (irq >= 32); in pxa2xx_pic_set_irq() local
96 s->int_pending[int_set] |= 1 << irq; in pxa2xx_pic_set_irq()
98 s->int_pending[int_set] &= ~(1 << irq); in pxa2xx_pic_set_irq()
104 int i, int_set, irq; in pxa2xx_pic_highest() local
116 int_set = (irq >= 32); in pxa2xx_pic_highest()
118 if (mask[int_set] & bit & s->is_fiq[int_set]) { in pxa2xx_pic_highest()
124 if (mask[int_set] & bit & ~s->is_fiq[int_set]) { in pxa2xx_pic_highest()
|
| /dports/emulators/qemu-powernv/qemu-powernv-3.0.50/hw/arm/ |
| H A D | pxa2xx_pic.c | 90 int int_set = (irq >= 32); in pxa2xx_pic_set_irq() local
94 s->int_pending[int_set] |= 1 << irq; in pxa2xx_pic_set_irq()
96 s->int_pending[int_set] &= ~(1 << irq); in pxa2xx_pic_set_irq()
102 int i, int_set, irq; in pxa2xx_pic_highest() local
114 int_set = (irq >= 32); in pxa2xx_pic_highest()
116 if (mask[int_set] & bit & s->is_fiq[int_set]) { in pxa2xx_pic_highest()
122 if (mask[int_set] & bit & ~s->is_fiq[int_set]) { in pxa2xx_pic_highest()
|
| /dports/emulators/qemu5/qemu-5.2.0/hw/arm/ |
| H A D | pxa2xx_pic.c | 92 int int_set = (irq >= 32); in pxa2xx_pic_set_irq() local
96 s->int_pending[int_set] |= 1 << irq; in pxa2xx_pic_set_irq()
98 s->int_pending[int_set] &= ~(1 << irq); in pxa2xx_pic_set_irq()
104 int i, int_set, irq; in pxa2xx_pic_highest() local
116 int_set = (irq >= 32); in pxa2xx_pic_highest()
118 if (mask[int_set] & bit & s->is_fiq[int_set]) { in pxa2xx_pic_highest()
124 if (mask[int_set] & bit & ~s->is_fiq[int_set]) { in pxa2xx_pic_highest()
|
| /dports/emulators/qemu-utils/qemu-4.2.1/hw/arm/ |
| H A D | pxa2xx_pic.c | 90 int int_set = (irq >= 32); in pxa2xx_pic_set_irq() local
94 s->int_pending[int_set] |= 1 << irq; in pxa2xx_pic_set_irq()
96 s->int_pending[int_set] &= ~(1 << irq); in pxa2xx_pic_set_irq()
102 int i, int_set, irq; in pxa2xx_pic_highest() local
114 int_set = (irq >= 32); in pxa2xx_pic_highest()
116 if (mask[int_set] & bit & s->is_fiq[int_set]) { in pxa2xx_pic_highest()
122 if (mask[int_set] & bit & ~s->is_fiq[int_set]) { in pxa2xx_pic_highest()
|
| /dports/emulators/qemu-cheri/qemu-0a323821042c36e21ea80e58b9545dfc3b0cb8ef/hw/arm/ |
| H A D | pxa2xx_pic.c | 90 int int_set = (irq >= 32); in pxa2xx_pic_set_irq() local
94 s->int_pending[int_set] |= 1 << irq; in pxa2xx_pic_set_irq()
96 s->int_pending[int_set] &= ~(1 << irq); in pxa2xx_pic_set_irq()
102 int i, int_set, irq; in pxa2xx_pic_highest() local
114 int_set = (irq >= 32); in pxa2xx_pic_highest()
116 if (mask[int_set] & bit & s->is_fiq[int_set]) { in pxa2xx_pic_highest()
122 if (mask[int_set] & bit & ~s->is_fiq[int_set]) { in pxa2xx_pic_highest()
|
| /dports/emulators/qemu-guest-agent/qemu-5.0.1/hw/arm/ |
| H A D | pxa2xx_pic.c | 90 int int_set = (irq >= 32); in pxa2xx_pic_set_irq() local
94 s->int_pending[int_set] |= 1 << irq; in pxa2xx_pic_set_irq()
96 s->int_pending[int_set] &= ~(1 << irq); in pxa2xx_pic_set_irq()
102 int i, int_set, irq; in pxa2xx_pic_highest() local
114 int_set = (irq >= 32); in pxa2xx_pic_highest()
116 if (mask[int_set] & bit & s->is_fiq[int_set]) { in pxa2xx_pic_highest()
122 if (mask[int_set] & bit & ~s->is_fiq[int_set]) { in pxa2xx_pic_highest()
|
| /dports/emulators/qemu-devel/qemu-de8ed1055c2ce18c95f597eb10df360dcb534f99/hw/arm/ |
| H A D | pxa2xx_pic.c | 92 int int_set = (irq >= 32); in pxa2xx_pic_set_irq() local
96 s->int_pending[int_set] |= 1 << irq; in pxa2xx_pic_set_irq()
98 s->int_pending[int_set] &= ~(1 << irq); in pxa2xx_pic_set_irq()
104 int i, int_set, irq; in pxa2xx_pic_highest() local
116 int_set = (irq >= 32); in pxa2xx_pic_highest()
118 if (mask[int_set] & bit & s->is_fiq[int_set]) { in pxa2xx_pic_highest()
124 if (mask[int_set] & bit & ~s->is_fiq[int_set]) { in pxa2xx_pic_highest()
|
| /dports/devel/boost-docs/boost_1_72_0/libs/phoenix/test/container/ |
| H A D | container_tests12b.cpp | 13 typedef std::unordered_set<int> int_set; in build_unordered_set() typedef
16 int_set result; in build_unordered_set()
26 typedef std::unordered_set<int> int_set; in build_unordered_multiset() typedef
28 int_set const data = build_unordered_set(); in build_unordered_multiset()
|
| /dports/devel/hyperscan/boost_1_75_0/libs/phoenix/test/container/ |
| H A D | container_tests12b.cpp | 13 typedef std::unordered_set<int> int_set; in build_unordered_set() typedef
16 int_set result; in build_unordered_set()
26 typedef std::unordered_set<int> int_set; in build_unordered_multiset() typedef
28 int_set const data = build_unordered_set(); in build_unordered_multiset()
|