/dports/math/gap/gap-4.11.0/pkg/ferret-1.0.2/YAPB++/tests/ |
H A D | build_rbase.cc | 9 p.addConstraint(new SetStab(s, &p.p_stack)); in main() 10 p.p_stack.sanity_check(); in main() 12 p.p_stack.sanity_check(); in main() 13 vec1<vec1<int> > part = p.p_stack.dumpCurrentPartition(); in main() 16 assert(part == p.p_stack.dumpCurrentPartition()); in main()
|
H A D | solve_cycle_problem_undirected.cc | 14 …v.push_back(new EdgeColouredGraph<UncolouredEdge, GraphDirected_no>(s, GraphConfig(), &p.p_stack)); in main()
|
H A D | test_backtrack_partition.cc | 7 p.p_stack.sanity_check(); in main() 8 p.p_stack.split(1,5); in main() 9 p.p_stack.sanity_check(); in main() 12 assert(state1 == p.p_stack.dumpCurrentPartition()); in main() 13 p.p_stack.sanity_check(); in main() 14 p.p_stack.split(1,2); in main() 15 p.p_stack.sanity_check(); in main() 16 p.p_stack.split(2,7); in main() 17 assert(p.p_stack.cellCount() == 4); in main() 21 p.p_stack.sanity_check(); in main() [all …]
|
H A D | test_simple_problem.cc | 10 p.addConstraint(new SetStab(s, &p.p_stack)); in main() 11 p.p_stack.sanity_check(); in main() 13 p.p_stack.sanity_check(); in main() 14 assert(p.p_stack.cellCount() == 2); in main() 15 assert(p.p_stack.cellSize(2) == 4); in main()
|
H A D | test_branch_stack.cc | 7 p.p_stack.sanity_check(); in main() 8 p.p_stack.split(1,2); in main() 9 p.p_stack.sanity_check(); in main() 10 assert(p.p_stack.fixed_cells().size() == 1); in main() 11 assert(p.p_stack.fixed_cells()[1] == 1); in main() 12 assert(*(p.p_stack.cellStartPtr(1)) == 1); in main()
|
H A D | test_graph_init.cc | 15 …Constraint(new EdgeColouredGraph<UncolouredEdge, GraphDirected_yes>(s, GraphConfig(), &p.p_stack)); in main() 16 p.p_stack.sanity_check(); in main() 18 p.p_stack.sanity_check(); in main() 19 assert(p.p_stack.cellCount() == 10); in main() 21 p.p_stack.sanity_check(); in main() 22 assert(p.p_stack.cellCount() == 10); in main()
|
H A D | solve_cycle_problem.cc | 14 ….push_back(new EdgeColouredGraph<UncolouredEdge, GraphDirected_yes>(s, GraphConfig(), &p.p_stack)); in main()
|
H A D | solve_simple_problem.cc | 14 v.push_back(new SetStab(s, &p.p_stack)); in main()
|
H A D | test_branch_stack_2.cc | 7 p.p_stack.sanity_check(); in main() 8 p.p_stack.split(1,10); in main() 9 p.p_stack.sanity_check(); in main() 10 p.p_stack.split(1,5); in main() 11 p.p_stack.sanity_check(); in main() 12 p.p_stack.split(2,15); in main() 13 p.p_stack.sanity_check(); in main()
|
H A D | solve_fix_graph_problem.cc | 13 ….push_back(new EdgeColouredGraph<UncolouredEdge, GraphDirected_yes>(s, GraphConfig(), &p.p_stack)); in main()
|
H A D | test_empty_stack.cc | 7 p.p_stack.sanity_check(); in main()
|
/dports/math/gap/gap-4.11.0/pkg/ferret-1.0.2/YAPB++/simple_graph/ |
H A D | symmetry_detect.cc | 17 cons.push_back(new SetStab(part, &p.p_stack)); in SolveGraph() 20 … cons.push_back(new EdgeColouredGraph<UncolouredEdge, GraphDirected_yes>(g.edges, gc, &p.p_stack)); in SolveGraph() 22 … cons.push_back(new EdgeColouredGraph<UncolouredEdge, GraphDirected_no>(g.edges, gc, &p.p_stack)); in SolveGraph()
|
/dports/math/gap/gap-4.11.0/pkg/ferret-1.0.2/YAPB++/source/ |
H A D | problem.hpp | 17 PartitionStack p_stack; member 22 p_stack(n, &con_queue, &full_search_memory_backtracker) in Problem()
|
H A D | constraint_store.ipp | 22 p->p_stack.addTrigger(con, j);
|
/dports/math/gap/gap-4.11.0/pkg/ferret-1.0.2/YAPB++/source/search/ |
H A D | search.hpp | 15 info_out(2, "Current partition: " << p->p_stack.dumpCurrentPartition()); in doSearchBranch() 24 int cell_start = p->p_stack.cellStartPos(branchcell); in doSearchBranch() 29 int first_val_pos = p->p_stack.invval(first_val); in doSearchBranch() 30 p->p_stack.swapPositions(first_val_pos, cell_start); in doSearchBranch() 35 vec1<int> cell = p->p_stack.cellAsVec(branchcell); in doSearchBranch() 54 int i_pos = p->p_stack.invval(cell[i]); in doSearchBranch() 57 p->p_stack.swapPositions(cell_start, i_pos); in doSearchBranch() 66 SplitState branch_split = p->p_stack.split(branchcell, cell_start + 1); in doSearchBranch() 70 debug_out(3, "search", "Perm State " << p->p_stack.printCurrentPartition()); in doSearchBranch() 124 p->p_stack.setAbstractQueue(&tfq); in doSearch() [all …]
|
H A D | search_common.hpp | 17 D_ASSERT(p->p_stack.cellCount() == p->p_stack.domainSize()); in handlePossibleSolution() 18 Permutation perm = getRawPermutation(p->p_stack.domainSize()); in handlePossibleSolution() 22 perm.raw(rbase->initial_permstack->val(i)) = p->p_stack.val(i); in handlePossibleSolution()
|
/dports/math/gap/gap-4.11.0/pkg/ferret-1.0.2/YAPB++/source/rbase/ |
H A D | build_rbase.hpp | 239 branch_cell = choose_branch_cell(&p->p_stack, in buildRBase() 244 …PartitionStack::cellit min_pos = choose_value(p->p_stack.cellStartPtr(branch_cell), p->p_stack.cel… in buildRBase() 246 … p->p_stack.swapPositions(p->p_stack.cellStartPos(branch_cell), min_pos - p->p_stack.valStart()+1); in buildRBase() 248 int cell_start = p->p_stack.cellStartPos(branch_cell); in buildRBase() 249 …)+1 << " : " << p->p_stack.val(cell_start) << ", location " << cell_start << ", in cell " << bran… in buildRBase() 250 …Stats::container().rBase_fixed_points.push_back(std::make_pair(branch_cell, p->p_stack.cellSize(br… in buildRBase() 251 …info_out(1, "RBase Cell starts: " << p->p_stack.cellStarts() << ", lengths: " << p->p_stack.cellSi… in buildRBase() 252 revrbase.addBranch(branch_cell, p->p_stack.val(cell_start)); in buildRBase() 253 p->p_stack.split(branch_cell, cell_start + 1); in buildRBase() 258 D_ASSERT(p->p_stack.cellCount() == p->p_stack.domainSize()); in buildRBase() [all …]
|
/dports/math/gap/gap-4.11.0/pkg/ferret-1.0.2/src/ |
H A D | cppmapper.cc | 109 …vec.push_back(buildConstraint(con, &p.p_stack, &p.full_search_memory_backtracker, &p.rbase_generat… in readNestedConstraints_inner()
|
/dports/games/xvier/xvier-1.0/ |
H A D | vier.c | 188 int p_stack[MAXRC]; local 214 p_stack[p_s_p++] = pos = i; 230 frei[p_stack[0]] += columns; 232 frei[p_stack[0]] -= columns; 236 frei[p_stack[i]] += columns; 239 frei[p_stack[i]] -= columns; 254 int p_stack[MAXRC]; local 280 p_stack[p_s_p++] = pos = i; 296 frei[p_stack[0]] += columns; 298 frei[p_stack[0]] -= columns; [all …]
|
/dports/devel/gindent/indent-2.2.12/src/ |
H A D | indent.h | 366 codes_ty * p_stack; member
|
H A D | output.c | 611 parser_state_tos->p_stack[tos] == stmt && in pad_output() 615 if (parser_state_tos->p_stack[tos] == ifstmt || in pad_output() 616 parser_state_tos->p_stack[tos] == forstmt || in pad_output() 617 parser_state_tos->p_stack[tos] == whilestmt) in pad_output() 621 } else if (parser_state_tos->p_stack[tos] == ifstmt || in pad_output() 622 parser_state_tos->p_stack[tos] == forstmt || in pad_output() 623 parser_state_tos->p_stack[tos] == whilestmt) in pad_output()
|
/dports/games/scummvm/scummvm-2.5.1/engines/ultima/nuvie/script/ |
H A D | script.cpp | 4392 …Std::stack<U6Link *> **p_stack = (Std::stack<U6Link *> **)lua_newuserdata(L, sizeof(Std::stack<U6L… in nscript_init_u6link_iter() local 4393 *p_stack = new Std::stack<U6Link *>(); in nscript_init_u6link_iter() 4394 (*p_stack)->push(link); in nscript_init_u6link_iter()
|
/dports/math/z3/z3-z3-4.8.13/src/math/polynomial/ |
H A D | upolynomial.cpp | 2096 SASSERT(sz <= p_stack.size()); in pop_top_frame() 2098 m().del(p_stack.back()); in pop_top_frame() 2099 p_stack.pop_back(); in pop_top_frame() 2124 p_stack.push_back(numeral()); in push_child_frames() 2125 m().set(p_stack.back(), p_aux[i]); in push_child_frames() 2129 translate(sz, p_stack.data() + p_stack.size() - sz, p_aux); in push_child_frames() 2132 p_stack.push_back(numeral()); in push_child_frames() 2133 swap(p_stack.back(), p_aux[i]); in push_child_frames() 2212 scoped_numeral_vector p_stack(m()); in drs_isolate_0_1_roots() local 2228 SASSERT(sz <= p_stack.size()); in drs_isolate_0_1_roots() [all …]
|
H A D | upolynomial.h | 558 void pop_top_frame(numeral_vector & p_stack, svector<drs_frame> & frame_stack); 559 …void push_child_frames(unsigned sz, numeral const * p, numeral_vector & p_stack, svector<drs_frame…
|
/dports/lang/python39/Python-3.9.9/Parser/ |
H A D | parser.c | 91 s_reset(&ps->p_stack); in PyParser_New() 192 node *n = ps->p_stack.s_top->s_parent; 250 const dfa *d = ps->p_stack.s_top->s_dfa; in PyParser_AddToken() 254 d->d_name, ps->p_stack.s_top->s_state)); in PyParser_AddToken() 273 if ((err = push(&ps->p_stack, nt, d1, in PyParser_AddToken() 284 if ((err = shift(&ps->p_stack, type, str, in PyParser_AddToken() 307 s_pop(&ps->p_stack); in PyParser_AddToken() 308 if (s_empty(&ps->p_stack)) { in PyParser_AddToken() 312 d = ps->p_stack.s_top->s_dfa; in PyParser_AddToken() 327 s_pop(&ps->p_stack); in PyParser_AddToken() [all …]
|