2025-07-20 09:12:23 +01:00
|
|
|
structure ViWORDDfa =
|
|
|
|
|
struct
|
2025-07-20 09:39:17 +01:00
|
|
|
val startState: Word8.word = 0w0
|
|
|
|
|
val startNonBlankState: Word8.word = 0w1
|
|
|
|
|
val startSpaceState: Word8.word = 0w2
|
2025-07-20 13:09:21 +01:00
|
|
|
val nonBlankAfterSpaceState: Word8.word = 0w3
|
|
|
|
|
val spaceAfterNonBlankState = 0w4
|
2025-07-20 09:12:23 +01:00
|
|
|
|
|
|
|
|
fun makeStart i =
|
2025-07-20 09:39:17 +01:00
|
|
|
let val chr = Char.chr i
|
|
|
|
|
in if Char.isSpace chr then startSpaceState else startNonBlankState
|
2025-07-20 09:12:23 +01:00
|
|
|
end
|
|
|
|
|
|
|
|
|
|
fun makeStartNonBlankState i =
|
2025-07-20 09:39:17 +01:00
|
|
|
let val chr = Char.chr i
|
2025-07-20 13:09:21 +01:00
|
|
|
in if Char.isSpace chr then spaceAfterNonBlankState else startNonBlankState
|
2025-07-20 09:12:23 +01:00
|
|
|
end
|
|
|
|
|
|
|
|
|
|
fun makeStartSpace i =
|
2025-07-20 09:39:17 +01:00
|
|
|
let val chr = Char.chr i
|
|
|
|
|
in if Char.isSpace chr then startSpaceState else nonBlankAfterSpaceState
|
2025-07-20 09:12:23 +01:00
|
|
|
end
|
|
|
|
|
|
2025-07-20 13:09:21 +01:00
|
|
|
fun makeNonBlankAfterSpace i =
|
|
|
|
|
let
|
|
|
|
|
val chr = Char.chr i
|
|
|
|
|
in
|
|
|
|
|
if Char.isSpace chr then spaceAfterNonBlankState
|
|
|
|
|
else nonBlankAfterSpaceState
|
|
|
|
|
end
|
|
|
|
|
|
2025-07-20 09:12:23 +01:00
|
|
|
val startTable = Vector.tabulate (255, makeStart)
|
|
|
|
|
val startNonBlankTable = Vector.tabulate (255, makeStartNonBlankState)
|
|
|
|
|
val startSpaceTable = Vector.tabulate (255, makeStartSpace)
|
2025-07-20 13:09:21 +01:00
|
|
|
val nonBlankAfterSpaceTable = Vector.tabulate (255, makeNonBlankAfterSpace)
|
|
|
|
|
val spaceAfterNonBlankTable = nonBlankAfterSpaceTable
|
2025-07-20 09:12:23 +01:00
|
|
|
|
2025-07-20 13:09:21 +01:00
|
|
|
val tables =
|
|
|
|
|
#[ startTable
|
|
|
|
|
, startNonBlankTable
|
|
|
|
|
, startSpaceTable
|
|
|
|
|
, nonBlankAfterSpaceTable
|
|
|
|
|
, spaceAfterNonBlankTable
|
|
|
|
|
]
|
2025-07-20 09:12:23 +01:00
|
|
|
|
|
|
|
|
fun next (currentState, currentChar) =
|
|
|
|
|
let
|
|
|
|
|
val currentState = Word8.toInt currentState
|
|
|
|
|
val currentTable = Vector.sub (tables, currentState)
|
|
|
|
|
val charIdx = Char.ord currentChar
|
|
|
|
|
in
|
|
|
|
|
Vector.sub (currentTable, charIdx)
|
|
|
|
|
end
|
|
|
|
|
|
2025-07-20 09:56:32 +01:00
|
|
|
structure StartOfNextWORD =
|
|
|
|
|
MakeNextDfaLoop
|
2025-07-20 09:39:17 +01:00
|
|
|
(struct
|
|
|
|
|
val startState = startState
|
2025-07-20 09:12:23 +01:00
|
|
|
|
2025-08-03 16:34:31 +01:00
|
|
|
structure Folder =
|
|
|
|
|
MakeCharFolderNext
|
|
|
|
|
(struct
|
|
|
|
|
val startState = startState
|
|
|
|
|
val tables = tables
|
|
|
|
|
|
|
|
|
|
fun finish x = x
|
|
|
|
|
fun isFinal currentState =
|
|
|
|
|
currentState = nonBlankAfterSpaceState
|
|
|
|
|
end)
|
|
|
|
|
|
|
|
|
|
val fStart = Folder.foldNext
|
2025-07-20 09:56:32 +01:00
|
|
|
end)
|
|
|
|
|
|
|
|
|
|
structure EndOfPrevWORD =
|
|
|
|
|
MakePrevDfaLoop
|
|
|
|
|
(struct
|
|
|
|
|
val startState = startState
|
2025-07-20 09:12:23 +01:00
|
|
|
|
2025-08-03 16:34:31 +01:00
|
|
|
structure Folder =
|
|
|
|
|
MakeCharFolderNext
|
|
|
|
|
(struct
|
|
|
|
|
val startState = startState
|
|
|
|
|
val tables = tables
|
|
|
|
|
|
|
|
|
|
fun finish x = x
|
|
|
|
|
fun isFinal currentState =
|
|
|
|
|
currentState = nonBlankAfterSpaceState
|
|
|
|
|
end)
|
|
|
|
|
|
|
|
|
|
val fStart = Folder.foldNext
|
2025-07-20 09:39:17 +01:00
|
|
|
end)
|
|
|
|
|
|
2025-07-21 09:40:32 +01:00
|
|
|
fun startOfCurrentWORD (idx, absIdx, str, tl, currentState, counter) =
|
|
|
|
|
if idx < 0 then
|
|
|
|
|
case tl of
|
|
|
|
|
str :: tl =>
|
|
|
|
|
startOfCurrentWORD
|
|
|
|
|
(String.size str - 1, absIdx, str, tl, currentState, counter)
|
|
|
|
|
| [] => 0
|
|
|
|
|
else
|
|
|
|
|
let
|
|
|
|
|
val chr = String.sub (str, idx)
|
|
|
|
|
val newState = next (currentState, chr)
|
|
|
|
|
in
|
|
|
|
|
if newState = spaceAfterNonBlankState then
|
|
|
|
|
if counter - 1 = 0 then
|
|
|
|
|
absIdx + 1
|
|
|
|
|
else
|
|
|
|
|
startOfCurrentWORD
|
|
|
|
|
(idx - 1, absIdx - 1, str, tl, startState, counter - 1)
|
|
|
|
|
else
|
|
|
|
|
startOfCurrentWORD (idx - 1, absIdx - 1, str, tl, newState, counter)
|
|
|
|
|
end
|
|
|
|
|
|
|
|
|
|
fun endOfCurrentWORD (idx, absIdx, str, tl, currentState, counter) =
|
|
|
|
|
if idx = String.size str then
|
|
|
|
|
case tl of
|
|
|
|
|
str :: tl =>
|
|
|
|
|
endOfCurrentWORD (0, absIdx, str, tl, currentState, counter)
|
|
|
|
|
| [] => Int.max (0, absIdx - 2)
|
|
|
|
|
else
|
|
|
|
|
let
|
|
|
|
|
val chr = String.sub (str, idx)
|
|
|
|
|
val newState = next (currentState, chr)
|
|
|
|
|
in
|
|
|
|
|
if newState = spaceAfterNonBlankState then
|
|
|
|
|
if counter - 1 = 0 then
|
|
|
|
|
Int.max (0, absIdx - 1)
|
|
|
|
|
else
|
|
|
|
|
endOfCurrentWORD
|
|
|
|
|
(idx + 1, absIdx + 1, str, tl, startState, counter - 1)
|
|
|
|
|
else
|
|
|
|
|
endOfCurrentWORD (idx + 1, absIdx + 1, str, tl, newState, counter)
|
|
|
|
|
end
|
|
|
|
|
|
2025-07-20 13:39:48 +01:00
|
|
|
structure StartOfCurrentWORD =
|
|
|
|
|
MakePrevDfaLoopMinus1
|
2025-07-21 09:40:32 +01:00
|
|
|
(struct val startState = startState val fStart = startOfCurrentWORD end)
|
2025-07-20 13:28:40 +01:00
|
|
|
|
2025-07-20 14:00:59 +01:00
|
|
|
structure EndOfCurrentWORD =
|
|
|
|
|
MakeNextDfaLoopPlus1
|
2025-07-21 09:40:32 +01:00
|
|
|
(struct val startState = startState val fStart = endOfCurrentWORD end)
|
2025-07-20 14:00:59 +01:00
|
|
|
|
2025-07-21 09:40:32 +01:00
|
|
|
structure StartOfNextWORDStrict =
|
|
|
|
|
MakePrevDfaLoop
|
|
|
|
|
(struct val startState = startState val fStart = startOfCurrentWORD end)
|
|
|
|
|
|
|
|
|
|
structure EndOfCurrentWORDStrict =
|
|
|
|
|
MakeNextDfaLoop
|
|
|
|
|
(struct val startState = startState val fStart = endOfCurrentWORD end)
|
2025-07-20 14:00:59 +01:00
|
|
|
|
|
|
|
|
(* W *)
|
2025-07-20 13:39:48 +01:00
|
|
|
val startOfNextWORD = StartOfNextWORD.next
|
2025-07-20 14:00:59 +01:00
|
|
|
(* gE *)
|
2025-07-20 13:39:48 +01:00
|
|
|
val endOfPrevWORD = EndOfPrevWORD.prev
|
2025-07-20 14:00:59 +01:00
|
|
|
(* B *)
|
2025-07-20 13:39:48 +01:00
|
|
|
val startOfCurrentWORD = StartOfCurrentWORD.prev
|
2025-07-20 14:00:59 +01:00
|
|
|
(* E *)
|
|
|
|
|
val endOfCurrentWORD = EndOfCurrentWORD.next
|
2025-07-21 09:40:32 +01:00
|
|
|
|
|
|
|
|
(* functions to strictly get the start and end of the current word.
|
|
|
|
|
* Problem: We want to support Vi motions like viW (selects a single word),
|
|
|
|
|
* as well as ciW (change one WORD) and diW (delete one WORD).
|
|
|
|
|
*
|
|
|
|
|
* The 'startOfCurrentWORD' and 'endOfCurrentWORD' functions do this
|
|
|
|
|
* (representing the vi 'B' and 'E' commands respectively),
|
|
|
|
|
* except that 'B' goes to the previous WORD if the cursor is on the first
|
|
|
|
|
* character of the current WORD, and 'E' goes to the next WORD if the cursor
|
|
|
|
|
* is on the last character of the current WORD.
|
|
|
|
|
*
|
|
|
|
|
* What is meant by "strict" is that these below functions always stay
|
|
|
|
|
* within the current WORD, not making the two exceptions mentioned above.
|
|
|
|
|
*)
|
|
|
|
|
val startOfCurrentWORDStrict = StartOfNextWORDStrict.prev
|
|
|
|
|
val endOfCurrentWORDStrict = EndOfCurrentWORDStrict.next
|
2025-07-20 09:12:23 +01:00
|
|
|
end
|