Algo.dijkstra.dijkstra.Points definitions
DefinitionAlgo_dijkstra_dijkstra_PointsDefinitions and required structural lemmas from Algo.dijkstra.dijkstra.Points. Source declarations are retained by compiler-reported ranges; imports are redirected to the corresponding definition bundles. This bundle contains no theorem stubs.
Algo2Lean provenance and reproduction. These definitions target Algo2Lean v0.1.4, using the compiler source at public commit 0f79d5e4242e6477531c9ee4410409f5b1c92f76, and Lean 4.33.1. The versioned compiler location is Algo2Lean v0.1.4. Compile all supplied .algo files and imports to reproduce the raw generated definitions. Release publication and exact website parity require their separately recorded checks; this metadata alone does not assert them. Prove2Me imports and declaration packaging are mechanically adapted, with original hashes, compiler-reported source ranges, and adaptations recorded in transplant provenance. Exact reproduction does not prove the compiler correct.
import Definitions.Def_Algo_dijkstra_dijkstra_Generated set_option autoImplicit true set_option backward.isDefEq.respectTransparency false set_option backward.defeqAttrib.useBackward true -- Generated by Algo2Lean 0.1.4 https://github.com/lunjiah/algo2lean namespace Algo.«dijkstra».«dijkstra» open _root_.Algo2LeanGenerated Algo2LeanGenerated -- Named locations are independent of the compiled module body. variable (dependencies : Dependencies) local notation "Frame" => Frame dependencies local notation "Stack" => Stack dependencies local notation "Configuration" => Configuration dependencies local notation "Transcript" => Transcript dependencies local notation "Step" => Step dependencies local notation "is__a2l_import_1_PriorityQueue" => is__a2l_import_1_PriorityQueue dependencies -- Before source line 14, column 5; location only, not reachability. def scan_edges.At.scan : Configuration → Prop | .active _ (.fn_scan_edges 4 _) _ => True | _ => False -- Before source line 21, column 17; location only, not reachability. def scan_edges.At.improve : Configuration → Prop | .active _ (.fn_scan_edges 13 _) _ => True | _ => False def scan_edges.Local.queue : Configuration → Option Ref__a2l_import_1_PriorityQueue | .active _ (.fn_scan_edges pc s) _ => if pc = 4 ∨ pc = 13 then some s.v0 else none | _ => none def scan_edges.Local.distance : Configuration → Option SeqRef | .active _ (.fn_scan_edges pc s) _ => if pc = 4 ∨ pc = 13 then some s.v1 else none | _ => none def scan_edges.Element.distance (state : Configuration) (index : Int) : Option Int := (_root_.Algo.«dijkstra».«dijkstra».scan_edges.Local.distance dependencies state).map (fun ref => state.heap.read ref index) def scan_edges.Local.settled : Configuration → Option SeqRef | .active _ (.fn_scan_edges pc s) _ => if pc = 4 ∨ pc = 13 then some s.v2 else none | _ => none def scan_edges.Element.settled (state : Configuration) (index : Int) : Option Int := (_root_.Algo.«dijkstra».«dijkstra».scan_edges.Local.settled dependencies state).map (fun ref => state.heap.read ref index) def scan_edges.Local.vertex : Configuration → Option Int | .active _ (.fn_scan_edges pc s) _ => if pc = 4 ∨ pc = 13 then some s.v3 else none | _ => none def scan_edges.Local.edge : Configuration → Option (Option Ref__a2l_import_0_Edge) | .active _ (.fn_scan_edges pc s) _ => if pc = 4 ∨ pc = 13 then some s.v4 else none | _ => none def scan_edges.Local.target : Configuration → Option Int | .active _ (.fn_scan_edges pc s) _ => if pc = 13 then some s.v5 else none | _ => none def scan_edges.Local.candidate : Configuration → Option Int | .active _ (.fn_scan_edges pc s) _ => if pc = 13 then some s.v6 else none | _ => none -- Before source line 36, column 5; location only, not reachability. def dijkstra.At.extract : Configuration → Prop | .active _ (.fn_dijkstra 7 _) _ => True | _ => False def dijkstra.Local.graph : Configuration → Option Ref__a2l_import_0_Graph | .active _ (.fn_dijkstra pc s) _ => if pc = 7 then some s.v0 else none | _ => none def dijkstra.Local.source : Configuration → Option Int | .active _ (.fn_dijkstra pc s) _ => if pc = 7 then some s.v1 else none | _ => none def dijkstra.Local.queue : Configuration → Option Ref__a2l_import_1_PriorityQueue | .active _ (.fn_dijkstra pc s) _ => if pc = 7 then some s.v2 else none | _ => none def dijkstra.Local.distance : Configuration → Option SeqRef | .active _ (.fn_dijkstra pc s) _ => if pc = 7 then some s.v3 else none | _ => none def dijkstra.Element.distance (state : Configuration) (index : Int) : Option Int := (_root_.Algo.«dijkstra».«dijkstra».dijkstra.Local.distance dependencies state).map (fun ref => state.heap.read ref index) def dijkstra.Local.settled : Configuration → Option SeqRef | .active _ (.fn_dijkstra pc s) _ => if pc = 7 then some s.v4 else none | _ => none def dijkstra.Element.settled (state : Configuration) (index : Int) : Option Int := (_root_.Algo.«dijkstra».«dijkstra».dijkstra.Local.settled dependencies state).map (fun ref => state.heap.read ref index) end Algo.«dijkstra».«dijkstra»