Home
last modified time | relevance | path

Searched refs:num_sets (Results 1 – 25 of 915) sorted by relevance

12345678910>>...37

/dports/math/spot/spot-2.10.2/tests/python/
H A Dsatmin.py24 assert aut.num_sets() == 1
30 assert min1.num_sets() == 2
33 assert min1.num_sets() == 2
36 assert min1.num_sets() == 2
39 assert min1.num_sets() == 2
42 assert min1.num_sets() == 2
45 assert min1.num_sets() == 2
48 assert min1.num_sets() == 2
51 assert min1.num_sets() == 2
54 assert min1.num_sets() == 2
[all …]
/dports/math/py-spot/spot-2.10.2/tests/python/
H A Dsatmin.py24 assert aut.num_sets() == 1
30 assert min1.num_sets() == 2
33 assert min1.num_sets() == 2
36 assert min1.num_sets() == 2
39 assert min1.num_sets() == 2
42 assert min1.num_sets() == 2
45 assert min1.num_sets() == 2
48 assert min1.num_sets() == 2
51 assert min1.num_sets() == 2
54 assert min1.num_sets() == 2
[all …]
/dports/math/py-or-tools/or-tools-9.2/examples/contrib/
H A Dset_partition.py58 for i in range(num_sets):
59 for j in range(num_sets):
70 def main(n=16, num_sets=2): argument
79 print("num_sets:", num_sets)
91 for i in range(num_sets):
104 for i in range(num_sets):
123 if num_sets == 2:
136 for i in range(num_sets):
145 for i in range(num_sets):
166 num_sets = 2 variable
[all …]
H A Dset_partition.cs29 for (int i = 0; i < num_sets; i++) in partition_sets()
31 for (int j = 0; j < num_sets; j++) in partition_sets()
73 private static void Solve(int n = 16, int num_sets = 2) in Solve() argument
78 Console.WriteLine("num_sets: {0}", num_sets); in Solve()
94 partition_sets(solver, a, num_sets, n); in Solve()
115 if (num_sets == 2) in Solve()
129 int[,] a_val = new int[num_sets, n]; in Solve()
172 int num_sets = 2; in Main()
181 num_sets = Convert.ToInt32(args[1]); in Main()
184 if (n % num_sets == 0) in Main()
[all …]
H A Dset_covering_skiena.py52 num_sets = 7
68 x = [solver.IntVar(0, 1, 'x[%i]' % i) for i in range(num_sets)]
71 z = solver.IntVar(0, num_sets * 2, 'z')
74 tot_elements = solver.IntVar(0, num_sets * num_elements)
83 s = solver.Sum([belongs[i][j] * x[i] for i in range(num_sets)])
88 x[i] * belongs[i][j] for i in range(num_sets) for j in range(num_elements)
106 print('x:', [x[i].Value() for i in range(num_sets)])
/dports/math/spot/spot-2.10.2/spot/twaalgos/
H A Dparity.cc42 x = num_sets - x - 1; in change_set()
146 ++num_sets; in change_parity_here()
170 unsigned num_sets = aut->num_sets(); in cleanup_parity_here() local
171 if (num_sets == 0) in cleanup_parity_here()
328 unsigned num_sets = aut->num_sets(); in colorize_parity_here() local
358 num_sets += incr; in colorize_parity_here()
364 empty = num_sets++; in colorize_parity_here()
400 unsigned num_sets = aut->num_sets(); in reduce_parity_here() local
527 int min1 = num_sets; in reduce_parity_here()
544 int min2 = num_sets; in reduce_parity_here()
[all …]
/dports/math/py-spot/spot-2.10.2/spot/twaalgos/
H A Dparity.cc42 x = num_sets - x - 1; in change_set()
146 ++num_sets; in change_parity_here()
170 unsigned num_sets = aut->num_sets(); in cleanup_parity_here() local
171 if (num_sets == 0) in cleanup_parity_here()
328 unsigned num_sets = aut->num_sets(); in colorize_parity_here() local
358 num_sets += incr; in colorize_parity_here()
364 empty = num_sets++; in colorize_parity_here()
400 unsigned num_sets = aut->num_sets(); in reduce_parity_here() local
527 int min1 = num_sets; in reduce_parity_here()
544 int min2 = num_sets; in reduce_parity_here()
[all …]
/dports/games/poker-eval/poker-eval-138.0/tests/
H A Denumtest2.c37 int num_sets = NPLAYERS; in main() local
46 DECK_ENUMERATE_PERMUTATIONS_D(StdDeck, set_var, num_sets, set_sizes, in main()
51 DECK_ENUMERATE_COMBINATIONS_D(StdDeck, set_var, num_sets, set_sizes, in main()
60 DECK_ENUMERATE_PERMUTATIONS_D(StdDeck, set_var, num_sets, set_sizes, in main()
65 DECK_ENUMERATE_COMBINATIONS_D(StdDeck, set_var, num_sets, set_sizes, in main()
74 DECK_ENUMERATE_PERMUTATIONS_D(StdDeck, set_var, num_sets, set_sizes, in main()
79 DECK_ENUMERATE_COMBINATIONS_D(StdDeck, set_var, num_sets, set_sizes, in main()
88 DECK_ENUMERATE_PERMUTATIONS_D(StdDeck, set_var, num_sets, set_sizes, in main()
93 DECK_ENUMERATE_COMBINATIONS_D(StdDeck, set_var, num_sets, set_sizes, in main()
102 DECK_ENUMERATE_PERMUTATIONS_D(StdDeck, set_var, num_sets, set_sizes, in main()
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/pecos/src/
H A DHierarchSparseGridDriver.cpp102 num_sets = sm_mi_l.size(); in grid_size()
192 size_t set, num_sets; in update_smolyak_multi_index() local
217 size_t set, num_sets; in assign_collocation_key() local
224 key_l.resize(num_sets); in assign_collocation_key()
339 num_sets = key_l.size(); in assign_collocation_indices()
1206 incr_l[0] = (lev == trial_lev) ? num_sets - 1 : num_sets; in partition_increment_key()
1226 ref_l[1] = (lev == trial_lev) ? num_sets - 1 : num_sets; in partition_reference_key()
1275 incr_l[0] = num_sets; in partition_increment_key()
1277 incr_l[0] = (lev == active_trial_lev) ? num_sets - 1 : num_sets; in partition_increment_key()
1304 ref_l[1] = num_sets; in partition_reference_key()
[all …]
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/test/h5file/
H A Ddump_sets.c15 long num_sets,
51 long num_sets, first, num_data; in dump_sets() local
55 meta = mhdf_openSetMeta( file, &num_sets, &first, &status ); CHECK; in dump_sets()
56 end_indices = malloc( num_sets * sizeof(long) ); in dump_sets()
58 printf("\nSet IDs: %ld - %ld\n", first, first+num_sets - 1); in dump_sets()
61 flags = malloc( num_sets * sizeof(int) ); in dump_sets()
68 dump_set_contents( first, num_sets, flags, end_indices, data ); in dump_sets()
87 dump_set_contents( first, num_sets, NULL, end_indices, data ); in dump_sets()
105 dump_set_contents( first, num_sets, NULL, end_indices, data ); in dump_sets()
113 long num_sets, in dump_set_contents() argument
[all …]
/dports/math/spot/spot-2.10.2/tests/core/
H A Dparity.cc123 for (auto num_sets: { 1, 2, 5, 6 }) in generate_aut()
130 spot::mrandom_shuffle(cont_sets[num_sets].begin(), in generate_aut()
131 cont_sets[num_sets].end()); in generate_aut()
133 SET_TR(t, cont_sets[num_sets][j]); in generate_aut()
136 for (auto num_sets: {2, 3}) in generate_aut()
138 if ((num_sets - 1) * 2 + even < 6) in generate_aut()
164 for (auto num_sets: { 0, 1, 2, 5, 6 }) in generate_acc()
166 num_sets), max, odd, num_sets); in generate_acc()
220 if (aut->num_sets() <= 1 || num_sets <= 1 in is_right_parity()
229 if (aut->num_sets() == 0 || num_sets == 0 in is_right_parity()
[all …]
/dports/math/py-spot/spot-2.10.2/tests/core/
H A Dparity.cc123 for (auto num_sets: { 1, 2, 5, 6 }) in generate_aut()
130 spot::mrandom_shuffle(cont_sets[num_sets].begin(), in generate_aut()
131 cont_sets[num_sets].end()); in generate_aut()
133 SET_TR(t, cont_sets[num_sets][j]); in generate_aut()
136 for (auto num_sets: {2, 3}) in generate_aut()
138 if ((num_sets - 1) * 2 + even < 6) in generate_aut()
164 for (auto num_sets: { 0, 1, 2, 5, 6 }) in generate_acc()
166 num_sets), max, odd, num_sets); in generate_acc()
220 if (aut->num_sets() <= 1 || num_sets <= 1 in is_right_parity()
229 if (aut->num_sets() == 0 || num_sets == 0 in is_right_parity()
[all …]
/dports/security/silktools/silk-3.19.1/src/rwset/
H A Drwset.c61 static int num_sets = 0; variable
165 for (i = 0; i < num_sets; ++i) { in appTeardown()
256 if (0 == num_sets) { in appSetup()
260 assert(SET_FILE_TYPES > num_sets); in appSetup()
270 for (i = 0; i < num_sets; ++i) { in appSetup()
324 for (i = 0; i < num_sets; ++i) { in appOptionsHandler()
340 assert(SET_FILE_TYPES > num_sets); in appOptionsHandler()
355 ++num_sets; in appOptionsHandler()
382 for (i = 0; i < num_sets; ++i) { in rwsetProcessFile()
401 for (i = 0; i < num_sets; ++i) { in rwsetProcessFile()
[all …]
/dports/emulators/yuzu/yuzu-0b47f7a46/src/video_core/renderer_vulkan/
H A Dvk_descriptor_pool.cpp42 static constexpr u32 num_sets = 0x20000; in AllocateNewPool() local
44 {VK_DESCRIPTOR_TYPE_UNIFORM_BUFFER, num_sets * 90}, in AllocateNewPool()
45 {VK_DESCRIPTOR_TYPE_STORAGE_BUFFER, num_sets * 60}, in AllocateNewPool()
46 {VK_DESCRIPTOR_TYPE_UNIFORM_TEXEL_BUFFER, num_sets * 64}, in AllocateNewPool()
47 {VK_DESCRIPTOR_TYPE_COMBINED_IMAGE_SAMPLER, num_sets * 64}, in AllocateNewPool()
48 {VK_DESCRIPTOR_TYPE_STORAGE_TEXEL_BUFFER, num_sets * 64}, in AllocateNewPool()
49 {VK_DESCRIPTOR_TYPE_STORAGE_IMAGE, num_sets * 40}, in AllocateNewPool()
56 .maxSets = num_sets, in AllocateNewPool()
/dports/graphics/p5-GD-Graph/GDGraph-1.54/Graph/
H A DData.pm116 if ($nd > $self->num_sets)
119 for ($self->num_sets .. $nd - 1)
189 unless defined $nd && $nd >= 1 && $nd <= $self->num_sets;
209 unless defined $nd && $nd >= 1 && $nd <= $self->num_sets;
269 unless defined $nd && $nd >= 1 && $nd <= $self->num_sets;
286 for (my $ds = 1; $ds <= $self->num_sets; $ds++)
353 sub num_sets subroutine
441 for my $ds (1 .. $self->num_sets)
488 for (my $ds = $self->num_sets; $ds > 1; $ds--)
530 . $self->num_sets)
[all …]
/dports/misc/py-mxnet/incubator-mxnet-1.9.0/src/executor/
H A Dsimple_partition_pass.h158 int num_sets = 0; in GetCompatibleSubsets() local
207 set_mapping.emplace_back(num_sets); in GetCompatibleSubsets()
211 1, std::make_pair(num_sets, in GetCompatibleSubsets()
212 num_sets))); in GetCompatibleSubsets()
214 my_set = num_sets++; in GetCompatibleSubsets()
226 set_mapping.emplace_back(num_sets); in GetCompatibleSubsets()
230 1, std::make_pair(num_sets, in GetCompatibleSubsets()
231 num_sets))); in GetCompatibleSubsets()
233 set_assignment[i] = num_sets++; in GetCompatibleSubsets()
242 std::vector<int> set_reorder(num_sets, 0); in GetCompatibleSubsets()
/dports/misc/mxnet/incubator-mxnet-1.9.0/src/executor/
H A Dsimple_partition_pass.h158 int num_sets = 0; in GetCompatibleSubsets() local
207 set_mapping.emplace_back(num_sets); in GetCompatibleSubsets()
211 1, std::make_pair(num_sets, in GetCompatibleSubsets()
212 num_sets))); in GetCompatibleSubsets()
214 my_set = num_sets++; in GetCompatibleSubsets()
226 set_mapping.emplace_back(num_sets); in GetCompatibleSubsets()
230 1, std::make_pair(num_sets, in GetCompatibleSubsets()
231 num_sets))); in GetCompatibleSubsets()
233 set_assignment[i] = num_sets++; in GetCompatibleSubsets()
242 std::vector<int> set_reorder(num_sets, 0); in GetCompatibleSubsets()
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/itaps/irel/
H A DAssocPair.cpp266 std::vector<iBase_EntitySetHandle> sets2(num_sets); in get_relation()
267 CHK_ERRORR( get_relation(iface_no, sets, num_sets, &sets2[0]) ); in get_relation()
269 for(int i=0; i<num_sets; i++) in get_relation()
305 int num_sets) in rmv_relation() argument
315 std::vector<iBase_EntityHandle> other_entities(num_sets); in rmv_relation()
321 std::vector<iBase_EntitySetHandle> other_sets(num_sets); in rmv_relation()
328 return relSides[iface_no]->rmv_relation_side(sets, num_sets); in rmv_relation()
338 int num_sets, int *tag_values) in get_gids() argument
340 return relSides[iface_no]->get_gids(sets, num_sets, tag_values); in get_gids()
350 int num_sets, int *tag_values) in get_dims() argument
[all …]
H A DAssocPairSide.hpp38 virtual int get_relation_side(iBase_EntitySetHandle *sets, int num_sets,
43 virtual int set_relation_side(iBase_EntitySetHandle *sets, int num_sets,
48 virtual int rmv_relation_side(iBase_EntitySetHandle *sets, int num_sets) = 0;
55 virtual int get_gids(iBase_EntitySetHandle *sets, int num_sets,
60 virtual int get_dims(iBase_EntitySetHandle *sets, int num_sets,
H A DFBGeomAssocPairSide.hpp40 virtual int get_relation_side(iBase_EntitySetHandle *sets, int num_sets,
45 virtual int set_relation_side(iBase_EntitySetHandle *sets, int num_sets,
49 virtual int rmv_relation_side(iBase_EntitySetHandle *sets, int num_sets);
56 virtual int get_gids(iBase_EntitySetHandle *sets, int num_sets, int *values);
60 virtual int get_dims(iBase_EntitySetHandle *sets, int num_sets, int *values);
H A DGeomAssocPairSide.hpp40 virtual int get_relation_side(iBase_EntitySetHandle *sets, int num_sets,
45 virtual int set_relation_side(iBase_EntitySetHandle *sets, int num_sets,
49 virtual int rmv_relation_side(iBase_EntitySetHandle *sets, int num_sets);
56 virtual int get_gids(iBase_EntitySetHandle *sets, int num_sets, int *values);
60 virtual int get_dims(iBase_EntitySetHandle *sets, int num_sets, int *values);
H A DMeshAssocPairSide.hpp40 virtual int get_relation_side(iBase_EntitySetHandle *sets, int num_sets,
45 virtual int set_relation_side(iBase_EntitySetHandle *sets, int num_sets,
49 virtual int rmv_relation_side(iBase_EntitySetHandle *sets, int num_sets);
56 virtual int get_gids(iBase_EntitySetHandle *sets, int num_sets, int *values);
60 virtual int get_dims(iBase_EntitySetHandle *sets, int num_sets, int *values);
H A DMeshAssocPairSide.cpp185 int num_sets, void *values) in get_relation_side() argument
192 for (int i = 0; i < num_sets; i++) { in get_relation_side()
215 int num_sets, const void *values) in set_relation_side() argument
221 for (int i = 0; i < num_sets; i++) { in set_relation_side()
240 int num_sets) in rmv_relation_side() argument
244 for (int i = 0; i < num_sets; i++) { in rmv_relation_side()
275 int MeshAssocPairSide::get_gids(iBase_EntitySetHandle *sets, int num_sets, in get_gids() argument
283 for (int i = 0; i < num_sets; i++) { in get_gids()
306 int MeshAssocPairSide::get_dims(iBase_EntitySetHandle *sets, int num_sets, in get_dims() argument
314 for (int i = 0; i < num_sets; i++) { in get_dims()
/dports/sysutils/u-boot-utilite/u-boot-2015.07/arch/arm/cpu/armv7/
H A Dcache_v7.c49 static void v7_inval_dcache_level_setway(u32 level, u32 num_sets, in v7_inval_dcache_level_setway() argument
62 for (set = num_sets - 1; set >= 0; set--) { in v7_inval_dcache_level_setway()
74 static void v7_clean_inval_dcache_level_setway(u32 level, u32 num_sets, in v7_clean_inval_dcache_level_setway() argument
87 for (set = num_sets - 1; set >= 0; set--) { in v7_clean_inval_dcache_level_setway()
105 u32 num_sets, num_ways, log2_line_len, log2_num_ways; in v7_maint_dcache_level_setway() local
119 num_sets = ((ccsidr & CCSIDR_NUM_SETS_MASK) >> in v7_maint_dcache_level_setway()
129 v7_inval_dcache_level_setway(level, num_sets, num_ways, in v7_maint_dcache_level_setway()
132 v7_clean_inval_dcache_level_setway(level, num_sets, num_ways, in v7_maint_dcache_level_setway()
/dports/math/libmesh/libmesh-1.6.2/contrib/exodusii/Lib/src/
H A Dexinq.c289 size_t num_sets; in ex_get_concat_set_len() local
306 if (!(ids = malloc(num_sets*sizeof(int)))) { in ex_get_concat_set_len()
350 for(i=0;i<num_sets;i++) in ex_get_concat_set_len()
353 for (i=0; i<num_sets; i++) { in ex_get_concat_set_len()
442 size_t num_sets, idum; in ex_inquire() local
641 if (!(ids = malloc(num_sets*sizeof(int)))) in ex_inquire()
662 for (i=0; i<num_sets; i++) { in ex_inquire()
730 if (!(ids = malloc(num_sets*sizeof(int)))) { in ex_inquire()
775 for(i=0;i<num_sets;i++) in ex_inquire()
780 for (i=0; i<num_sets; i++) { in ex_inquire()
[all …]

12345678910>>...37