Lean.Meta.Tactic.LinearArith.Solver

source

structure Lean.Meta.Linear.Var :

Type

id : Nat

Instances For

source

instance Lean.Meta.Linear.instInhabitedVar :

Inhabited Lean.Meta.Linear.Var

Equations

Lean.Meta.Linear.instInhabitedVar = { default := { id := default } }

source

instance Lean.Meta.Linear.instOrdVar :

Ord Lean.Meta.Linear.Var

Equations

Lean.Meta.Linear.instOrdVar = { compare := Lean.Meta.Linear.ordVar✝ }

source

instance Lean.Meta.Linear.instDecidableEqVar :

DecidableEq Lean.Meta.Linear.Var

Equations

Lean.Meta.Linear.instDecidableEqVar = Lean.Meta.Linear.decEqVar✝

source

instance Lean.Meta.Linear.instReprVar :

Repr Lean.Meta.Linear.Var

Equations

Lean.Meta.Linear.instReprVar = { reprPrec := Lean.Meta.Linear.reprVar✝ }

source

instance Lean.Meta.Linear.instLTVar :

LT Lean.Meta.Linear.Var

Equations

Lean.Meta.Linear.instLTVar = { lt := fun (a b : Lean.Meta.Linear.Var) => a.id < b.id }

source

instance Lean.Meta.Linear.instDecidableLtVar (a : Lean.Meta.Linear.Var) (b : Lean.Meta.Linear.Var) :

Decidable (a < b)

Equations

Lean.Meta.Linear.instDecidableLtVar a b = inferInstanceAs (Decidable (a.id < b.id))

source

structure Lean.Meta.Linear.Assignment :

Type

val : Array Lean.Rat

Instances For

source

instance Lean.Meta.Linear.instInhabitedAssignment :

Inhabited Lean.Meta.Linear.Assignment

Equations

Lean.Meta.Linear.instInhabitedAssignment = { default := { val := default } }

source

@[reducible, inline]

abbrev Lean.Meta.Linear.Assignment.size (a : Lean.Meta.Linear.Assignment) :

Nat

Equations

a.size = a.val.size

Instances For

source

@[reducible, inline]

abbrev Lean.Meta.Linear.Assignment.get? (a : Lean.Meta.Linear.Assignment) (x : Lean.Meta.Linear.Var) :

Option Lean.Rat

Equations

a.get? x = if h : x.id < a.size then some (a.val.get ⟨x.id, h⟩) else none

Instances For

source

@[reducible, inline]

abbrev Lean.Meta.Linear.Assignment.push (a : Lean.Meta.Linear.Assignment) (v : Lean.Rat) :

Lean.Meta.Linear.Assignment

Equations

a.push v = { val := a.val.push v }

Instances For

source

@[reducible, inline]

abbrev Lean.Meta.Linear.Assignment.take (a : Lean.Meta.Linear.Assignment) (newSize : Nat) :

Lean.Meta.Linear.Assignment

Equations

a.take newSize = { val := a.val.take newSize }

Instances For

source

structure Lean.Meta.Linear.Poly :

Type

val : Array (Int × Lean.Meta.Linear.Var)

Instances For

source

instance Lean.Meta.Linear.instInhabitedPoly :

Inhabited Lean.Meta.Linear.Poly

Equations

Lean.Meta.Linear.instInhabitedPoly = { default := { val := default } }

source

instance Lean.Meta.Linear.instReprPoly :

Repr Lean.Meta.Linear.Poly

Equations

Lean.Meta.Linear.instReprPoly = { reprPrec := Lean.Meta.Linear.reprPoly✝ }

source

instance Lean.Meta.Linear.instDecidableEqPoly :

DecidableEq Lean.Meta.Linear.Poly

Equations

Lean.Meta.Linear.instDecidableEqPoly = Lean.Meta.Linear.decEqPoly✝

source

@[reducible, inline]

abbrev Lean.Meta.Linear.Poly.size (e : Lean.Meta.Linear.Poly) :

Nat

Equations

e.size = e.val.size

Instances For

source

@[reducible, inline]

abbrev Lean.Meta.Linear.Poly.getMaxVarCoeff (e : Lean.Meta.Linear.Poly) :

Int

Equations

e.getMaxVarCoeff = e.val.back!.fst

Instances For

source

@[reducible, inline]

abbrev Lean.Meta.Linear.Poly.getMaxVar (e : Lean.Meta.Linear.Poly) :

Lean.Meta.Linear.Var

Equations

e.getMaxVar = e.val.back!.snd

Instances For

source

@[reducible, inline]

abbrev Lean.Meta.Linear.Poly.get (e : Lean.Meta.Linear.Poly) (i : Fin e.size) :

Int × Lean.Meta.Linear.Var

Equations

e.get i = e.val.get i

Instances For

source

def Lean.Meta.Linear.Poly.scale (d : Int) (e : Lean.Meta.Linear.Poly) :

Lean.Meta.Linear.Poly

Equations

Lean.Meta.Linear.Poly.scale d e = { val := Array.map (fun (x : Int × Lean.Meta.Linear.Var) => match x with | (c, x) => (c * d, x)) e.val }

Instances For

source

def Lean.Meta.Linear.Poly.add (e₁ : Lean.Meta.Linear.Poly) (e₂ : Lean.Meta.Linear.Poly) :

Lean.Meta.Linear.Poly

Equations

e₁.add e₂ = Lean.Meta.Linear.Poly.add.go e₁ e₂ 0 0 #[]

Instances For

source

@[irreducible]

def Lean.Meta.Linear.Poly.add.go (e₁ : Lean.Meta.Linear.Poly) (e₂ : Lean.Meta.Linear.Poly) (i₁ : Nat) (i₂ : Nat) (r : Array (Int × Lean.Meta.Linear.Var)) :

Lean.Meta.Linear.Poly

Equations

One or more equations did not get rendered due to their size.

Instances For

source

def Lean.Meta.Linear.Poly.combine (d₁ : Int) (e₁ : Lean.Meta.Linear.Poly) (d₂ : Int) (e₂ : Lean.Meta.Linear.Poly) :

Lean.Meta.Linear.Poly

Equations

Lean.Meta.Linear.Poly.combine d₁ e₁ d₂ e₂ = Lean.Meta.Linear.Poly.combine.go d₁ e₁ d₂ e₂ 0 0 #[]

Instances For

source

@[irreducible]

def Lean.Meta.Linear.Poly.combine.go (d₁ : Int) (e₁ : Lean.Meta.Linear.Poly) (d₂ : Int) (e₂ : Lean.Meta.Linear.Poly) (i₁ : Nat) (i₂ : Nat) (r : Array (Int × Lean.Meta.Linear.Var)) :

Lean.Meta.Linear.Poly

Equations

One or more equations did not get rendered due to their size.

Instances For

source

def Lean.Meta.Linear.Poly.eval? (e : Lean.Meta.Linear.Poly) (a : Lean.Meta.Linear.Assignment) :

Option Lean.Rat

Equations

One or more equations did not get rendered due to their size.

Instances For

source

structure Lean.Meta.Linear.AssumptionId :

Type

id : Nat

Instances For

source

instance Lean.Meta.Linear.instInhabitedAssumptionId :

Inhabited Lean.Meta.Linear.AssumptionId

Equations

Lean.Meta.Linear.instInhabitedAssumptionId = { default := { id := default } }

source

instance Lean.Meta.Linear.instDecidableEqAssumptionId :

DecidableEq Lean.Meta.Linear.AssumptionId

Equations

Lean.Meta.Linear.instDecidableEqAssumptionId = Lean.Meta.Linear.decEqAssumptionId✝

source

instance Lean.Meta.Linear.instReprAssumptionId :

Repr Lean.Meta.Linear.AssumptionId

Equations

Lean.Meta.Linear.instReprAssumptionId = { reprPrec := Lean.Meta.Linear.reprAssumptionId✝ }

source

inductive Lean.Meta.Linear.Justification :

Type

combine: Int → Lean.Meta.Linear.Justification → Int → Lean.Meta.Linear.Justification → Lean.Meta.Linear.Justification
assumption: Lean.Meta.Linear.AssumptionId → Lean.Meta.Linear.Justification

Instances For

source

instance Lean.Meta.Linear.instInhabitedJustification :

Inhabited Lean.Meta.Linear.Justification

Equations

Lean.Meta.Linear.instInhabitedJustification = { default := Lean.Meta.Linear.Justification.assumption default }

source

instance Lean.Meta.Linear.instDecidableEqJustification :

DecidableEq Lean.Meta.Linear.Justification

Equations

Lean.Meta.Linear.instDecidableEqJustification = Lean.Meta.Linear.decEqJustification✝

source

instance Lean.Meta.Linear.instBEqJustification :

BEq Lean.Meta.Linear.Justification

Equations

Lean.Meta.Linear.instBEqJustification = { beq := Lean.Meta.Linear.beqJustification✝ }

source

instance Lean.Meta.Linear.instReprJustification :

Repr Lean.Meta.Linear.Justification

Equations

Lean.Meta.Linear.instReprJustification = { reprPrec := Lean.Meta.Linear.reprJustification✝ }

source

inductive Lean.Meta.Linear.CnstrKind :

Type

Instances For

source

instance Lean.Meta.Linear.instInhabitedCnstrKind :

Inhabited Lean.Meta.Linear.CnstrKind

Equations

Lean.Meta.Linear.instInhabitedCnstrKind = { default := Lean.Meta.Linear.CnstrKind.eq }

source

instance Lean.Meta.Linear.instDecidableEqCnstrKind :

DecidableEq Lean.Meta.Linear.CnstrKind

Equations

Lean.Meta.Linear.instDecidableEqCnstrKind x y = if h : x.toCtorIdx = y.toCtorIdx then isTrue ⋯ else isFalse ⋯

source

instance Lean.Meta.Linear.instBEqCnstrKind :

BEq Lean.Meta.Linear.CnstrKind

Equations

Lean.Meta.Linear.instBEqCnstrKind = { beq := Lean.Meta.Linear.beqCnstrKind✝ }

source

instance Lean.Meta.Linear.instReprCnstrKind :

Repr Lean.Meta.Linear.CnstrKind

Equations

Lean.Meta.Linear.instReprCnstrKind = { reprPrec := Lean.Meta.Linear.reprCnstrKind✝ }

source

structure Lean.Meta.Linear.Cnstr :

Type

Instances For

source

instance Lean.Meta.Linear.instInhabitedCnstr :

Inhabited Lean.Meta.Linear.Cnstr

Equations

Lean.Meta.Linear.instInhabitedCnstr = { default := { kind := default, lhs := default, rhs := default, jst := default } }

source

instance Lean.Meta.Linear.instDecidableEqCnstr :

DecidableEq Lean.Meta.Linear.Cnstr

Equations

Lean.Meta.Linear.instDecidableEqCnstr = Lean.Meta.Linear.decEqCnstr✝

source

instance Lean.Meta.Linear.instBEqCnstr :

BEq Lean.Meta.Linear.Cnstr

Equations

Lean.Meta.Linear.instBEqCnstr = { beq := Lean.Meta.Linear.beqCnstr✝ }

source

instance Lean.Meta.Linear.instReprCnstr :

Repr Lean.Meta.Linear.Cnstr

Equations

Lean.Meta.Linear.instReprCnstr = { reprPrec := Lean.Meta.Linear.reprCnstr✝ }

source

@[reducible, inline]

abbrev Lean.Meta.Linear.Cnstr.isStrict (c : Lean.Meta.Linear.Cnstr) :

Bool

Equations

c.isStrict = match c.kind with | Lean.Meta.Linear.CnstrKind.lt => true | x => false

Instances For

source

def Lean.Meta.Linear.Cnstr.getBound (c : Lean.Meta.Linear.Cnstr) (a : Lean.Meta.Linear.Assignment) :

Lean.Rat

Equations

One or more equations did not get rendered due to their size.

Instances For

source

def Lean.Meta.Linear.Cnstr.isUnsat (c : Lean.Meta.Linear.Cnstr) (a : Lean.Meta.Linear.Assignment) :

Bool

Equations

One or more equations did not get rendered due to their size.

Instances For

source

def Lean.Meta.Linear.getBestBound? (cs : Array Lean.Meta.Linear.Cnstr) (a : Lean.Meta.Linear.Assignment) (isLower : Bool) (isInt : Bool) :

Option (Lean.Rat × Lean.Meta.Linear.Cnstr)

Equations

One or more equations did not get rendered due to their size.

Instances For

source

inductive Lean.Meta.Linear.Result :

Type

unsat: Lean.Meta.Linear.Justification → Lean.Meta.Linear.Result
unsupported: Lean.Meta.Linear.Result
timeout: Lean.Meta.Linear.Result
sat: Lean.Meta.Linear.Assignment → Lean.Meta.Linear.Result

Instances For

source

structure Lean.Meta.Linear.Context :

Type

int : Array Bool

Instances For

source

structure Lean.Meta.Linear.State :

Type

lowers : Array (Array Lean.Meta.Linear.Cnstr)
uppers : Array (Array Lean.Meta.Linear.Cnstr)
int : Array Bool
assignment : Lean.Meta.Linear.Assignment

Instances For

source

instance Lean.Meta.Linear.instInhabitedState :

Inhabited Lean.Meta.Linear.State

Equations

Lean.Meta.Linear.instInhabitedState = { default := { lowers := default, uppers := default, int := default, assignment := default } }

source

@[reducible, inline]

abbrev Lean.Meta.Linear.State.getNumVars (s : Lean.Meta.Linear.State) :

Nat

Equations

s.getNumVars = s.lowers.size

Instances For

source

@[reducible, inline]

abbrev Lean.Meta.Linear.State.currVar (s : Lean.Meta.Linear.State) :

Nat

Equations

s.currVar = s.assignment.size

Instances For

source

@[reducible, inline]

abbrev Lean.Meta.Linear.State.getBestLowerBound? (s : Lean.Meta.Linear.State) :

Option (Lean.Rat × Lean.Meta.Linear.Cnstr)

Equations

s.getBestLowerBound? = Lean.Meta.Linear.getBestBound? s.lowers[s.currVar]! s.assignment true s.int[s.currVar]!

Instances For

source

@[reducible, inline]

abbrev Lean.Meta.Linear.State.getBestUpperBound? (s : Lean.Meta.Linear.State) :

Option (Lean.Rat × Lean.Meta.Linear.Cnstr)

Equations

s.getBestUpperBound? = Lean.Meta.Linear.getBestBound? s.uppers[s.currVar]! s.assignment false s.int[s.currVar]!

Instances For

source

@[reducible, inline]

abbrev Lean.Meta.Linear.State.assignCurr (s : Lean.Meta.Linear.State) (v : Lean.Rat) :

Lean.Meta.Linear.State

Equations

s.assignCurr v = { lowers := s.lowers, uppers := s.uppers, int := s.int, assignment := s.assignment.push v }

Instances For

source

def Lean.Meta.Linear.pickAssignment? (lower : Lean.Rat) (lowerIsStrict : Bool) (upper : Lean.Rat) (upperIsStrict : Bool) :

Option Lean.Rat

Equations

One or more equations did not get rendered due to their size.

Instances For

source

def Lean.Meta.Linear.resolve (s : Lean.Meta.Linear.State) (cl : Lean.Meta.Linear.Cnstr) (cu : Lean.Meta.Linear.Cnstr) :

Lean.Meta.Linear.Result ⊕ Lean.Meta.Linear.State

Equations

One or more equations did not get rendered due to their size.

Instances For

source

def Lean.Meta.Linear.solve (n : Nat) (s : Lean.Meta.Linear.State) :

Lean.Meta.Linear.Result

Equations

One or more equations did not get rendered due to their size.
Lean.Meta.Linear.solve 0 s = Lean.Meta.Linear.Result.timeout

Instances For