/dports/math/minizinc/libminizinc-2.5.5/share/minizinc/std/ |
H A D | fzn_subcircuit.mzn | 11 var l..u+1: firstin = min([ u+1 + bool2int(ins[i])*(i-u-1) | i in S]), 13 var bool: empty = (firstin > u), 26 % The firstin node is numbered 1. 27 order[firstin] = 1 /\ 29 % The lastin node is greater than firstin. 30 lastin > firstin /\ 32 % The lastin node points at firstin. 33 x[lastin] = firstin /\ 36 ins[lastin] /\ ins[firstin] /\ 38 % The successor of each node except where it is firstin is [all …]
|
/dports/math/minizinc/libminizinc-2.5.5/tests/spec/unit/regression/ |
H A D | linear_bool_elem_bug.mzn | 6 firstin: 1 10 firstin: 1 14 firstin: 2 18 firstin: 1 22 firstin: 2 26 firstin: 3 37 var 1..n+1: firstin; 38 constraint firstin == min([ n+1 + bool2int(ins[i])*(i-n-1) | i in 1..n]);
|
/dports/math/minizinc/libminizinc-2.5.5/share/minizinc/linear/ |
H A D | fzn_subcircuit.mzn | 18 var bool: empty = (firstin == u+1), 33 % i==firstin <-> ins[i] 37 % The firstin node is numbered 1. 38 order[firstin] = 1 /\ 40 % The lastin node is greater than firstin. 41 lastin > firstin /\ 43 % The lastin node points at firstin. 44 x[lastin] = firstin /\ 47 ins[lastin] /\ ins[firstin] /\ 49 % The successor of each node except where it is firstin is [all …]
|
H A D | subcircuit_wDummy.mzn | 50 %% var bool: empty = (firstin == u+1), no, break 2-cycles with dummy
|
/dports/math/chuffed/chuffed-e04bedd/chuffed/flatzinc/mznlib/ |
H A D | fzn_subcircuit.mzn | 27 var l..u+1: firstin = min([ u+1 + bool2int(ins[i])*(i-u-1) | i in S]), 29 var bool: empty = (firstin > u), 42 % The firstin node is numbered 1. 43 order[firstin] = 1 /\ 45 % The lastin node is greater than firstin. 46 lastin > firstin /\ 48 % The lastin node points at firstin. 49 x[lastin] = firstin /\ 52 ins[lastin] /\ ins[firstin] /\ 54 % The successor of each node except where it is firstin is [all …]
|
/dports/devel/patch/patch-2.7.6/src/ |
H A D | merge.c | 210 lin firstin; in merge_hunk() local 288 firstin = in; in merge_hunk() 353 where += in - firstin; in merge_hunk() 370 where += (in - firstin); in merge_hunk() 425 firstin < in && firstnew < new in merge_hunk() 427 firstin++, firstnew++, lastwhere++) in merge_hunk() 438 firstin -= common_prefix; in merge_hunk() 458 firstin < in && firstnew < new in merge_hunk() 469 out_offset += lines - (in - firstin); in merge_hunk() 473 if (firstin < in) in merge_hunk() [all …]
|
/dports/cad/opencascade/opencascade-7.6.0/src/IFSelect/ |
H A D | IFSelect_SelectSuite.cxx | 65 Standard_Boolean firstin = (HasInput() || HasAlternate()); in RootResult() local 66 if (firstin) iter = InputResult(G); in RootResult() 73 if (firstin) anitem->Alternate()->SetList (iter.Content()); in RootResult() 74 firstin = Standard_True; // ensuite c est systematique in RootResult()
|
/dports/math/ogdf/OGDF/src/ogdf/upward/ |
H A D | DominanceLayout.cpp | 73 firstin.init(UPR, nullptr); in layout() 80 firstin[s] = lastin[s] = nullptr; in layout() 81 firstin[t] = lastin[t] =t->firstAdj()->theEdge(); in layout() 93 firstin[v] = adj->theEdge(); in layout() 113 if (firstin[tgt] == e && lastout[src] == e) in layout() 209 if (adj->theEdge() == firstin[w]) in labelY() 240 …if ( (yPreCoord[v] > yPreCoord[u]) || (firstout[v] == lastout[v] && firstin[u] == lastin[u] && m_L… in compact() 255 …if ( (xPreCoord[v] > xPreCoord[u]) || (firstout[v] == lastout[v] && firstin[u] == lastin[u] && m_L… in compact()
|
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/muq2/modules/Optimization/src/ |
H A D | Optimization.cpp | 129 …r(std::shared_ptr<CostFunction> cost, unsigned int const firstin) : cost(cost), firstin(firstin) {} in CostHelper() argument 140 for( unsigned int i=firstin; i<firstin+cost->numInputs-1; ++i ) { in SetInputs()
|
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/muq2/MUQ/Optimization/ |
H A D | Optimization.h | 111 CostHelper(std::shared_ptr<CostFunction> cost, unsigned int const firstin); 125 const unsigned int firstin; member
|
/dports/math/oink/oink-c1259fe/src/ |
H A D | game.hpp | 332 inline int firstin(const int vertex) const in firstin() function in pg::Game 354 return inedges() + firstin(vertex); in ins()
|
H A D | solver.hpp | 65 inline const int* ins(const int vertex) { return game->inedges() + game->firstin(vertex); } in ins()
|
H A D | oink.cpp | 217 auto ptr = game->inedges() + game->firstin(cur); in solveTrivialCycles()
|
/dports/math/ogdf/OGDF/include/ogdf/upward/ |
H A D | DominanceLayout.h | 79 NodeArray<edge> firstin; variable
|
/dports/graphics/graphviz/graphviz-2.44.1/tclpkg/gv/ |
H A D | gv.i | 179 extern Agedge_t *firstin(Agraph_t *g); 183 extern Agedge_t *firstin(Agnode_t *n);
|
H A D | gv.cpp | 608 Agedge_t *firstin(Agraph_t *g) in firstin() function 636 Agedge_t *firstin(Agnode_t *n) in firstin() function
|
/dports/x11-toolkits/p5-Prima/Prima-1.63/Prima/Drawable/ |
H A D | Path.pm | 913 my ($firstout, $firstin, $firstsign); 981 @$firstin = ( $xo + $dx1, $yo + $dy1); 1017 ( $firstin, $firstout ) = ( $firstout, $firstin ) 1019 push @$in, [ line => $firstin ];
|
/dports/chinese/dictd-database/dict-zh-1.6/ |
H A D | netterm.index | 2068 firstin J+X Q
|
/dports/textproc/p5-Unicode-Tussle/Unicode-Tussle-1.111/data/ |
H A D | words.utf8 | 139914 firstin › first in, first out ← first
|