Home
last modified time | relevance | path

Searched refs:min_choice (Results 1 – 5 of 5) sorted by relevance

/dports/math/gambit/gambit-16.0.1/src/python/gambit/games/
H A Dpublic.py34 def __init__(self, N, min_choice, max_choice, step_choice, omega, alpha, tax=0): argument
36 min_choice, max_choice, step_choice)
54 def __init__(self, N, min_choice, max_choice, step_choice, omega, m, c, tax=0): argument
56 min_choice, max_choice, step_choice)
H A Dcontest.py34 def __init__(self, N, min_choice, max_choice, step_choice, argument
37 min_choice, max_choice, step_choice)
65 def __init__(self, min_choice, max_choice, step_choice, prize, omega, r=1.0, argument
69 min_choice, max_choice, step_choice)
H A Dmeanstat.py117 def __init__(self, N, min_choice, max_choice, step_choice=1, argument
120 self.choices = xrange(min_choice, max_choice+1, step_choice)
/dports/cad/yosys/yosys-yosys-0.12/passes/opt/
H A Dpmux2shiftx.cc606 int min_choice = 1 << 30; in execute() local
623 min_choice = std::min(min_choice, new_c.as_int()); in execute()
630 int range_density = 100*GetSize(choices) / (max_choice-min_choice+1); in execute()
634 log(" min choice: %d\n", min_choice); in execute()
645 min_choice = 0; in execute()
648 log(" new min choice: %d\n", min_choice); in execute()
653 …bool full_case = (min_choice == 0) && (max_choice == (1 << GetSize(sig))-1) && (full_pmux || max_c… in execute()
660 offset = Const(min_choice, GetSize(sig)); in execute()
663 min_choice -= offset.as_int(); in execute()
/dports/lang/rust/rustc-1.58.1-src/compiler/rustc_borrowck/src/region_infer/
H A Dmod.rs142 pub(crate) min_choice: ty::RegionVid, field
755 let mut min_choice = choice_regions[0]; in apply_member_constraint() localVariable
757 debug!(?min_choice, ?other_option,); in apply_member_constraint()
758 match min(min_choice, other_option) { in apply_member_constraint()
759 Some(m) => min_choice = m, in apply_member_constraint()
761 debug!(?min_choice, ?other_option, "incomparable; no min choice",); in apply_member_constraint()
767 let min_choice_scc = self.constraint_sccs.scc(min_choice); in apply_member_constraint()
768 debug!(?min_choice, ?min_choice_scc); in apply_member_constraint()
772 min_choice, in apply_member_constraint()
1869 sub: constraint.min_choice, in find_constraint_paths_between_regions()