/dports/math/py-Pyomo/Pyomo-6.1.2/pyomo/network/ |
H A D | util.py | 14 def create_var(comp, name, block, index_set=None): argument 15 if index_set is None: 17 index_set = comp.index_set() 19 index_set = UnindexedComponent_set 21 new_var = Var(index_set) 41 def tighten_var_domain(comp, new_var, index_set=None): argument 42 if index_set is None: 44 index_set = comp.index_set() 46 index_set = UnindexedComponent_set 49 for i in index_set: [all …]
|
/dports/math/py-Pyomo/Pyomo-6.1.2/pyomo/util/tests/ |
H A D | test_slices.py | 246 index_set = m.b0.index_set() 252 index_set = m.b1.index_set() 260 index_set = m.b2.index_set() 273 index_set = m.b0.index_set() 282 index_set = m.b1.index_set() 296 index_set = m.b2.index_set() 316 index_set = m.b0d2.index_set() 330 index_set = m.b0d2.index_set() 341 index_set = m.b1d2.index_set() 351 index_set = m.b2d2.index_set() [all …]
|
/dports/math/libmesh/libmesh-1.6.2/tests/numerics/ |
H A D | composite_function_test.C | 130 std::vector<unsigned int> index_set(1,0); in testTimeDependence() 140 index_set[0] = 1; in testTimeDependence() 141 composite.attach_subfunction(xyt, index_set); in testTimeDependence() 145 index_set[0] = 2; in testTimeDependence() 160 index_set[0] = 0; in testTimeDependence() 161 composite.attach_subfunction(xyt, index_set); in testTimeDependence() 165 index_set[0] = 1; in testTimeDependence() 170 index_set[0] = 2; in testTimeDependence() 187 index_set[0] = 0; in testTimeDependence() 192 index_set[0] = 1; in testTimeDependence() [all …]
|
/dports/audio/sayonara/sayonara-player-5bbf1399332d5d59362ad03bf625f9132be72206/test/Util/ |
H A D | SetTest.cpp | 22 Util::Set<int> index_set; 25 index_set << i; 29 QList<int> set_list = index_set.toList(); 31 QVERIFY(index_set.count() == indexes.count()); 40 QList<int> set_list = index_set.toList(); 44 for(auto it=index_set.begin(); it != index_set.end(); it++) 61 Util::Set<int> index_set; 64 index_set << i; 67 QVERIFY(index_set.count() == indexes.count() - 2);
|
/dports/math/jacop/jacop-4.8.0/src/test/fz/above10min/jp-encoding/dznFolder/ |
H A D | jp-encoding.mzn | 185 constraint forall (i in index_set(stream)) ( 189 constraint forall (i in index_set(stream)) ( 198 constraint forall (i in index_set(stream)) ( 208 constraint forall (i in index_set(stream)) ( 216 constraint forall (i in index_set(stream)) ( 220 constraint forall (i in index_set(stream)) ( 226 constraint forall (i in index_set(stream)) ( 237 constraint forall (i in index_set(stream)) ( 245 constraint forall (i in index_set(stream)) ( 254 constraint forall (i in index_set(stream)) ( [all …]
|
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/include/deal.II/base/ |
H A D | index_set.h | 1045 : index_set(other.index_set) in IntervalAccessor() 1066 return index_set != nullptr && range_idx < index_set->n_intervals(); in is_valid() 1075 return {index_set, range_idx, index_set->ranges[range_idx].begin}; in begin() 1107 index_set = other.index_set; 1120 Assert(index_set == other.index_set, 1132 Assert(index_set == other.index_set, 1243 Assert(accessor.index_set == other.accessor.index_set, 1323 Assert(index_set == other.index_set, 1392 Assert(index_set == other.index_set, 1405 Assert(index_set == other.index_set, [all …]
|
/dports/math/minizinc/libminizinc-2.5.5/share/minizinc/std/ |
H A D | fzn_dreachable_enum.mzn | 6 array[index_set(ns)] of var 0..card(index_set(ns))-1: dist; /* distance from root */ 7 array[index_set(ns)] of var index_set(ns): parent; /* parent */ 12 forall(n in index_set(ns)) % nonselected nodes have parent 0 14 forall(n in index_set(ns)) % nonselected nodes have distance 0 16 forall(n in index_set(ns)) % each in node except root must have a parent 18 forall(n in index_set(ns)) % each in node with a parent must be in and also its parent 20 forall(n in index_set(ns)) % each except with a parent is one more than its parent 22 forall(n in index_set(ns)) % each node with a parent must have that edge in 23 … (parent[n] != n -> exists(e in index_set(from) where to[e] = n)(es[e] /\ from[e] = parent[n])) /\
|
H A D | fzn_transitive_closure.mzn | 7 array[index_set(ns)] of var 0..card(index_set(ns))-1: dist; /* distance from root */ 8 array[index_set(ns)] of var index_set(ns): parent; /* parent */ 13 forall(n in index_set(ns)) % nonselected nodes have parent 0 15 forall(n in index_set(ns)) % nonselected nodes have distance 0 17 forall(n in index_set(ns)) % each in node except root must have a parent 19 forall(n in index_set(ns)) % each in node with a parent must be in and also its parent 21 forall(n in index_set(ns)) % each except with a parent is one more than its parent 23 forall(n in index_set(ns)) % each node with a parent must have that edge in 24 … (parent[n] != n -> exists(e in index_set(from) where to[e] = n)(es[e] /\ from[e] = parent[n])) /\
|
H A D | geost.mzn | 39 forall(i in index_set(shape))( 88 forall(i in index_set(shape))( 101 index_set(l) = 1..k /\ index_set(u) = 1..k, 161 index_set(l) = 1..k /\ index_set(u) = 1..k, 185 index_set( x1 ) = index_set( w1 ) /\ 186 index_set( x1 ) = index_set( x2 ) /\ 187 index_set( x1 ) = index_set( w2 ), 202 index_set( x1 ) = index_set( w1 ) /\ 203 index_set( x1 ) = index_set( x2 ) /\ 204 index_set( x1 ) = index_set( w2 ), [all …]
|
H A D | neural_net.mzn | 29 assert(index_set(inputs) == index_set(input_ids), 31 assert(index_set(outputs) == index_set(output_ids), 33 let { set of int: node = index_set(bias) } in 34 let { set of int: edge = index_set(edge_weight) } in 35 assert(index_set(edge_parent) == edge, 37 assert(index_set(first_edge) == node, 39 forall(i in index_set(input_ids)) 43 forall(i in index_set(output_ids)) 47 forall(i in index_set(first_edge)) 51 forall(i in index_set(edge_parent)) [all …]
|
H A D | fzn_dtree_enum.mzn | 6 set of int: EDGE = index_set(es); 7 array[index_set(ns)] of var 0..length(ns)-1: dist; /* distance from root */ 8 array[index_set(ns)] of var index_set(ns): parent; /* parent */ 13 forall(n in index_set(ns)) % nonselected nodes have parent 0 15 forall(n in index_set(ns)) % nonselected nodes have distance 0 17 forall(n in index_set(ns)) % each in node except root must have a parent 19 forall(n in index_set(ns)) % each in node with a parent must be in and also its parent 21 forall(n in index_set(ns)) % each except with a parent is one more than its parent 23 forall(n in index_set(ns)) % each node with a parent must have that edge in 27 … sum(e in EDGE)(es[e]) = sum(n in index_set(ns))(ns[n]) - 1 /\ % redundant relationship of trees
|
H A D | bounded_path.mzn | 18 assert(index_set(to) = 1..E,"bounded_dpath: index set of to must be 1..\(E)") /\ 19 assert(index_set(ns) = 1..N,"bounded_dpath: index set of ns must be 1..\(N)") /\ 20 assert(index_set(es) = 1..E,"bounded_dpath: index set of es must be 1..\(E)") /\ 21 assert(index_set(w) = 1..E,"bounded_dpath: index set of w must be 1..\(E)") /\ 38 …assert(index_set(from) = index_set(to),"bounded_dpath: index set of from and to must be identical"… 39 …assert(index_set(from) = index_set(es),"bounded_dpath: index set of from and es must be identical"… 40 assert(index_set(w) = index_set(es),"bounded_dpath: index set of w and es must be identical") /\ 66 assert(index_set(w) = 1..E,"bounded_path: index set of w must be 1..\(E)") /\ 84 …assert(index_set(from) = index_set(to),"bounded_path: index set of from and to must be identical")… 85 …assert(index_set(from) = index_set(es),"bounded_path: index set of from and es must be identical")… [all …]
|
H A D | connected.mzn | 16 …assert(index_set(from) = index_set(to),"dconnected: index set of from and to must be identical") /\ 17 …assert(index_set(from) = index_set(es),"dconnected: index set of from and es must be identical") /\ 18 …assert(dom_array(from) subset index_set(ns),"dconnected: nodes in from must be in index set of ns"… 19 …assert(dom_array(from) subset index_set(ns),"dconnected: nodes in to must be in index set of ns") … 34 … assert(index_set(from) = index_set(to),"connected: index set of from and to must be identical") /\ 35 … assert(index_set(from) = index_set(es),"connected: index set of from and es must be identical") /\ 36 …assert(dom_array(from) subset index_set(ns),"connected: nodes in from must be in index set of ns")… 37 …assert(dom_array(from) subset index_set(ns),"connected: nodes in to must be in index set of ns") /\
|
H A D | fzn_dpath_enum.mzn | 6 let { set of int: EDGE = index_set(es); 7 array[index_set(ns)] of var 0..length(ns)-1: dist; /* distance from root */ 12 forall(n in index_set(ns)) % nonselected nodes have distance 0 14 forall(n in index_set(ns)) % 1 incoming edge 16 forall(n in index_set(ns)) % 1 outgoing edge 18 forall(n in index_set(ns)) % 1 incoming edge 20 forall(n in index_set(ns)) % 1 outgoing edge 23 % forall(n in index_set(ns)) % 1 incoming edge 25 % forall(n in index_set(ns)) % 1 outgoing edge 29 sum(n in index_set(ns))(ns[n]) = sum(e in EDGE)(es[e]) + 1 /\
|
H A D | reachable.mzn | 23 assert(index_set(from) = 1..E,"dreachable: index set of from must be 1..\(E)") /\ 24 assert(index_set(to) = 1..E,"dreachable: index set of to must be 1..\(E)") /\ 25 assert(index_set(ns) = 1..N,"dreachable: index set of ns must be 1..\(N)") /\ 26 assert(index_set(es) = 1..E,"dreachable: index set of es must be 1..\(E)") /\ 40 …assert(index_set(from) = index_set(to),"dreachable: index set of from and to must be identical") /\ 41 …assert(index_set(from) = index_set(es),"dreachable: index set of from and es must be identical") /\ 62 assert(index_set(to) = 1..E,"reachable: index set of to must be 1..\(E)") /\ 63 assert(index_set(ns) = 1..N,"reachable: index set of ns must be 1..\(N)") /\ 64 assert(index_set(es) = 1..E,"reachable: index set of es must be 1..\(E)") /\ 78 … assert(index_set(from) = index_set(to),"reachable: index set of from and to must be identical") /\ [all …]
|
H A D | tree.mzn | 23 assert(index_set(from) = 1..E,"dtree: index set of from must be 1..\(E)") /\ 24 assert(index_set(to) = 1..E,"dtree: index set of to must be 1..\(E)") /\ 25 assert(index_set(ns) = 1..N,"dtree: index set of ns must be 1..\(N)") /\ 26 assert(index_set(es) = 1..E,"dtree: index set of es must be 1..\(E)") /\ 40 …assert(index_set(from) = index_set(to),"dreachable: index set of from and to must be identical") /\ 41 …assert(index_set(from) = index_set(es),"dreachable: index set of from and es must be identical") /\ 62 assert(index_set(to) = 1..E,"tree: index set of to must be 1..\(E)") /\ 63 assert(index_set(ns) = 1..N,"tree: index set of ns must be 1..\(N)") /\ 64 assert(index_set(es) = 1..E,"tree: index set of es must be 1..\(E)") /\ 78 …assert(index_set(from) = index_set(to),"dreachable: index set of from and to must be identical") /\ [all …]
|
H A D | fzn_int_set_channel.mzn | 3 forall(i in index_set(x)) (x[i] in index_set(y)) /\ 4 forall(j in index_set(y)) (y[j] subset index_set(x)) /\ 5 forall(i in index_set(x), j in index_set(y)) (x[i] = j <-> i in y[j]);
|
H A D | fzn_inverse_set.mzn | 3 forall(i in index_set(f)) ( 4 f[i] subset index_set(invf) 6 forall(j in index_set(invf)) ( 7 invf[j] subset index_set(f) 9 forall(i in index_set(f), j in index_set(invf)) (
|
H A D | fzn_inverse_set_reif.mzn | 5 forall(i in index_set(f)) ( 6 f[i] subset index_set(invf) 8 forall(j in index_set(invf)) ( 9 invf[j] subset index_set(f) 11 forall(i in index_set(f), j in index_set(invf)) (
|
H A D | fzn_int_set_channel_reif.mzn | 5 forall(i in index_set(x)) (x[i] in index_set(y)) /\ 6 forall(j in index_set(y)) (y[j] subset index_set(x)) /\ 7 forall(i in index_set(x), j in index_set(y)) (x[i] = j <-> i in y[j])
|
H A D | path.mzn | 24 assert(index_set(from) = 1..E,"dpath: index set of from must be 1..\(E)") /\ 25 assert(index_set(to) = 1..E,"dpath: index set of to must be 1..\(E)") /\ 26 assert(index_set(ns) = 1..N,"dpath: index set of ns must be 1..\(N)") /\ 27 assert(index_set(es) = 1..E,"dpath: index set of es must be 1..\(E)") /\ 42 assert(index_set(from) = index_set(to),"dpath: index set of from and to must be identical") /\ 43 assert(index_set(from) = index_set(es),"dpath: index set of from and es must be identical") /\ 65 assert(index_set(to) = 1..E,"path: index set of to must be 1..\(E)") /\ 66 assert(index_set(ns) = 1..N,"path: index set of ns must be 1..\(N)") /\ 67 assert(index_set(es) = 1..E,"path: index set of es must be 1..\(E)") /\ 82 assert(index_set(from) = index_set(to),"path: index set of from and to must be identical") /\ [all …]
|
H A D | redefinitions-2.0.mzn | 8 forall (i in index_set(as)) (as[i] -> b) /\ 9 forall (i in index_set(bs)) (bs[i] \/ b); 12 let { int: l = min(index_set(x)), 13 int: u = max(index_set(x)), 22 let { int: l = min(index_set(x)), 23 int: u = max(index_set(x)), 32 let { int: l = min(index_set(x)), 33 int: u = max(index_set(x)), 42 let { int: l = min(index_set(x)), 43 int: u = max(index_set(x)),
|
/dports/math/jacop/jacop-4.8.0/src/main/minizinc/org/jacop/minizinc/ |
H A D | redefinitions.mzn | 37 int: ni_min = min(index_set(as)), 38 int: ni_max = max(index_set(as))+1, 46 int: ni_min = min(index_set(as)), 47 int: ni_max = max(index_set(as))+1, 55 int: ni_min = min(index_set(as)), 56 int: ni_max = max(index_set(as))+1, 64 int: ni_min = min(index_set(as)), 65 int: ni_max = max(index_set(as))+1, 73 int: ni_min = min(index_set(as)), 74 int: ni_max = max(index_set(as))+1, [all …]
|
/dports/math/gecode/gecode-0916a1a/gecode/flatzinc/mznlib/ |
H A D | fzn_disjunctive_strict.mzn | 5 assert(index_set(s) == index_set(d), 7 forall (i in index_set(d)) (d[i] >= 0) /\ 8 if forall (i in index_set(d)) (is_fixed(d[i])) then 9 fzn_cumulative(s,d,array1d(index_set(d),[1 | i in index_set(d)]),1) 11 forall (i,j in index_set(d) where i<j) (
|
/dports/math/minizinc/libminizinc-2.5.5/share/minizinc/linear/ |
H A D | domain_encodings.mzn | 9 x in index_set(x_eq_d) 15 % my_trace( "eq_enc: \(x), index_set(pp)=" ++ show(index_set( x_eq_d )) ++ "\n" ) /\ 27 x in index_set(x_eq_d) /\ 28 y in index_set(y_eq_e) /\ 29 index_set(x_eq_d) == index_set_1of2(xy_eq_de) /\ 30 index_set(y_eq_e) == index_set_2of2(xy_eq_de) /\ 41 forall(i in index_set(x))( 82 array[int, int] of var int: pp = array2d(index_set(pX), index_set(pY), 83 [eq_new_var(x,i,y,j) | i in index_set(pX), j in index_set(pY)]); 99 array2d(index_set(x),lb_array(x)..ub_array(x), [all …]
|