Taoyouce
/
moonbit-pathfinding
0
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fix CI: restore moon.mod.json for moondoc, drop unused Eq bound, fix proofs path on Linux runners

This commit is contained in:
Suquster 2026-06-10 13:25:59 +00:00
parent af5a8034ad
commit b4a72a714c
4 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
moon.mod
View File

@ -25,4 +25,4 @@ description = "A MoonBit pathfinding and graph algorithms library with executabl
options(
homepage: "https://github.com/Suquster/moonbit-pathfinding#readme",
)
)

2
scripts/proof_evidence.ps1
View File

@ -1,5 +1,5 @@
param(
[string]$PackagePath = "src\proofs",
[string]$PackagePath = "src/proofs",
[string]$OutDir = "docs\verification"
)

2
src/advanced/alt.mbt
View File

@ -159,7 +159,7 @@ fn[N : Eq + Hash, W : @core.Weight + Compare] pick_landmarks(
/// dist_from[l][node] - dist_from[l][target] )`,
/// which is admissible on directed graphs (see
/// docs/zh/algorithms/alt.md).
pub fn[N : Eq + Hash, W : @core.Weight + Compare + Eq] alt_preprocess(
pub fn[N : Eq + Hash, W : @core.Weight + Compare] alt_preprocess(
nodes : Array[N],
successors : (N) -> Array[(N, W)],
num_landmarks : Int,

2
src/advanced/pkg.generated.mbti
View File

@ -6,7 +6,7 @@ import {
}
// Values
pub fn[N : Eq + Hash, W : @core.Weight + Compare + Eq] alt_preprocess(Array[N], (N) -> Array[(N, W)], Int) -> Landmark[N, W]
pub fn[N : Eq + Hash, W : @core.Weight + Compare] alt_preprocess(Array[N], (N) -> Array[(N, W)], Int) -> Landmark[N, W]
pub fn[N : Eq + Hash, W : @core.Weight + Compare + Eq] alt_query(Landmark[N, W], N, N, (N) -> Array[(N, W)]) -> (Array[N], W)?