From c8e49aead839916e04c1246f9a89b8c7bbec51fe Mon Sep 17 00:00:00 2001 From: Andrew Noyes Date: Wed, 18 Nov 2026 10:58:22 -0500 Subject: [PATCH] Clarify selector anchor boundary cases --- Statement.lean | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Statement.lean b/Statement.lean index 73db7b7..943a512 100644 --- a/Statement.lean +++ b/Statement.lean @@ -85,7 +85,7 @@ structure Selector where below `selector.key` (none for the empty key, all of them for `⊤`), minus one, shifted by `selector.offset`. Offset `0` names the last stored key strictly below `selector.key`, which is index `-1` when there is none; offset `1` names -the first stored key at or above it; offset `-1` names the key before that. -/ +the first stored key at or above it, or index `List.length db.keys` when there is none. -/ def Selector.anchor (db : DB) (s : Selector) : Int := (db.keys.countP (fun (k : Key) => decide ((↑k : WithTop Key) < s.key)) : Int) + s.offset - 1