reimplement search-range functionality to scan range from the string from left to right

This commit is contained in:
2025-08-30 23:31:55 +01:00
parent de46376e4e
commit 2b3f0405c6
4 changed files with 627 additions and 114 deletions

View File

@@ -11,8 +11,8 @@ struct
val buffer = LineGap.goToStart buffer
val initialMsg = [SEARCH (buffer, searchString)]
val buffer = LineGap.goToIdx (low + 777, buffer)
val searchList = SearchList.buildRange (buffer, searchString, low - 777)
val buffer = LineGap.goToIdx (low - 777, buffer)
val searchList = SearchList.buildRange (buffer, searchString, low + 777)
val buffer = LineGap.goToIdx (low, buffer)
in
@@ -27,9 +27,9 @@ struct
val buffer = LineGap.goToStart buffer
val initialMsg = [SEARCH (buffer, searchString)]
val buffer = LineGap.goToIdx (cursorIdx + 777, buffer)
val buffer = LineGap.goToIdx (cursorIdx - 777, buffer)
val searchList =
SearchList.buildRange (buffer, searchString, cursorIdx - 777)
SearchList.buildRange (buffer, searchString, cursorIdx + 777)
in
Finish.buildTextAndClear
(app, buffer, cursorIdx, searchList, initialMsg, time)
@@ -109,9 +109,9 @@ struct
val searchString = #searchString app
val initialMsg = [SEARCH (buffer, searchString)]
val buffer = LineGap.goToIdx (cursorIdx + 777, buffer)
val buffer = LineGap.goToIdx (cursorIdx - 777, buffer)
val searchList =
SearchList.buildRange (buffer, searchString, cursorIdx - 777)
SearchList.buildRange (buffer, searchString, cursorIdx + 777)
(* If we have deleted from the buffer so that cursorIdx
* is no longer a valid idx,
@@ -296,9 +296,9 @@ struct
val buffer = LineGap.goToStart buffer
val initialMsg = [SEARCH (buffer, #searchString app)]
val buffer = LineGap.goToIdx (cursorIdx + 777, buffer)
val buffer = LineGap.goToIdx (cursorIdx - 777, buffer)
val searchList =
SearchList.buildRange (buffer, searchString, cursorIdx - 777)
SearchList.buildRange (buffer, searchString, cursorIdx + 777)
val cursorIdx = 0
val startLine = 0
@@ -330,8 +330,8 @@ struct
val buffer = LineGap.goToStart buffer
val initialMsg = [SEARCH (buffer, searchString)]
val buffer = LineGap.goToIdx (low + 777, buffer)
val searchList = SearchList.buildRange (buffer, searchString, low - 777)
val buffer = LineGap.goToIdx (low - 777, buffer)
val searchList = SearchList.buildRange (buffer, searchString, low + 777)
val buffer = LineGap.goToIdx (low, buffer)
in
@@ -377,9 +377,9 @@ struct
val buffer = LineGap.goToStart buffer
val initialMsg = [SEARCH (buffer, searchString)]
val buffer = LineGap.goToIdx (low + 777, buffer)
val buffer = LineGap.goToIdx (low - 777, buffer)
val searchList =
SearchList.buildRange (buffer, searchString, low - 777)
SearchList.buildRange (buffer, searchString, low + 777)
val buffer = LineGap.goToIdx (low, buffer)
in
@@ -405,9 +405,9 @@ struct
val buffer = LineGap.goToStart buffer
val initialMsg = [SEARCH (buffer, searchString)]
val buffer = LineGap.goToIdx (low + 777, buffer)
val buffer = LineGap.goToIdx (low - 777, buffer)
val searchList =
SearchList.buildRange (buffer, searchString, low - 777)
SearchList.buildRange (buffer, searchString, low + 777)
val buffer = LineGap.goToIdx (low, buffer)
in
@@ -429,8 +429,8 @@ struct
val buffer = LineGap.goToStart buffer
val initialMsg = [SEARCH (buffer, searchString)]
val buffer = LineGap.goToIdx (low + 777, buffer)
val searchList = SearchList.buildRange (buffer, searchString, low - 777)
val buffer = LineGap.goToIdx (low - 777, buffer)
val searchList = SearchList.buildRange (buffer, searchString, low + 777)
val buffer = LineGap.goToIdx (origLow, buffer)
in
@@ -524,9 +524,9 @@ struct
val buffer = LineGap.goToStart buffer
val initialMsg = [SEARCH (buffer, searchString)]
val buffer = LineGap.goToIdx (low + 777, buffer)
val buffer = LineGap.goToIdx (low - 777, buffer)
val searchList =
SearchList.buildRange (buffer, searchString, low - 777)
SearchList.buildRange (buffer, searchString, low + 777)
val buffer = LineGap.goToIdx (low, buffer)
in

View File

@@ -8,7 +8,7 @@ struct
if pos = String.size hd then
case tl of
hd :: tl => loopSearch (0, hd, absIdx, tl, acc, searchPos, searchString)
| [] => acc
| [] => PersistentVector.toVector acc
else
let
val bufferChr = String.sub (hd, pos)
@@ -26,28 +26,83 @@ struct
else
loopSearch
(pos + 1, hd, absIdx + 1, tl, acc, searchPos + 1, searchString)
else if searchPos = 0 then
loopSearch (pos + 1, hd, absIdx + 1, tl, acc, 0, searchString)
else
loopSearch (pos, hd, absIdx, tl, acc, 0, searchString)
(if searchPos = 0 then
loopSearch (pos + 1, hd, absIdx + 1, tl, acc, 0, searchString)
else
loopSearch (pos, hd, absIdx, tl, acc, 0, searchString))
end
fun search ({rightStrings, leftStrings, ...}: LineGap.t, searchString) =
case rightStrings of
hd :: tl =>
let
val result = loopSearch
(0, hd, 0, tl, PersistentVector.empty, 0, searchString)
in
PersistentVector.toVector result
end
loopSearch (0, hd, 0, tl, PersistentVector.empty, 0, searchString)
| [] => empty
(* Prerequisite: move buffer/LineGap to end *)
(* Prerequisite: move buffer/LineGap to start *)
fun build (buffer, searchString) =
if String.size searchString > 0 then search (buffer, searchString)
else empty
fun loopRange (pos, hd, absIdx, tl, acc, searchPos, searchString, finish) =
if pos = String.size hd then
case tl of
hd :: tl =>
loopRange (0, hd, absIdx, tl, acc, searchPos, searchString, finish)
| [] => PersistentVector.toVector acc
else if absIdx = finish then
PersistentVector.toVector acc
else
let
val bufferChr = String.sub (hd, pos)
val searchChr = String.sub (searchString, searchPos)
in
if bufferChr = searchChr then
if searchPos + 1 = String.size searchString then
(* full match *)
let
val foundIdx = absIdx - String.size searchString + 1
val acc = PersistentVector.append (foundIdx, acc)
in
loopRange
(pos + 1, hd, absIdx + 1, tl, acc, 0, searchString, finish)
end
else
loopRange
( pos + 1
, hd
, absIdx + 1
, tl
, acc
, searchPos + 1
, searchString
, finish
)
else
((if searchPos = 0 then
loopRange
(pos + 1, hd, absIdx + 1, tl, acc, 0, searchString, finish)
else
loopRange (pos, hd, absIdx, tl, acc, 0, searchString, finish)))
end
fun searchRange (buffer: LineGap.t, searchString, finish) =
let
val {rightStrings, idx = absIdx, ...} = buffer
in
case rightStrings of
hd :: tl =>
loopRange
(0, hd, absIdx, tl, PersistentVector.empty, 0, searchString, finish)
| [] => empty
end
fun buildRange (buffer, searchString, finish) =
if String.size searchString > 0 then
searchRange (buffer, searchString, finish)
else
empty
fun loopNextMatch (pos, searchList, count) =
if count = 0 then
Vector.sub (searchList, pos)
@@ -96,87 +151,4 @@ struct
loopPrevMatch (pos, searchList, count)
end
fun rangeSearchStep (pos, hd, absIdx, tl, acc, searchPos, searchString, low) =
if searchPos < 0 then
raise Fail "todo"
else if absIdx < low then
acc
else if pos < 0 then
case tl of
hd :: tl =>
rangeSearchStep
( String.size hd - 1
, hd
, absIdx
, tl
, acc
, searchPos
, searchString
, low
)
| [] => acc
else
let
val bufferChr = String.sub (hd, pos)
val searchChr = String.sub (searchString, searchPos)
in
if bufferChr = searchChr then
rangeSearchStep
(pos - 1, hd, absIdx - 1, tl, acc, searchPos - 1, searchString, low)
else
acc
end
fun loopRange (pos, hd, absIdx, tl, acc, searchString, low) =
if absIdx < low then
Vector.fromList acc
else if pos < 0 then
case tl of
hd :: tl =>
loopRange (String.size hd - 1, hd, absIdx, tl, acc, searchString, low)
| [] => Vector.fromList acc
else
let
val acc = rangeSearchStep
( pos
, hd
, absIdx
, tl
, acc
, String.size searchString - 1
, searchString
, low
)
in
loopRange (pos - 1, hd, absIdx - 1, tl, acc, searchString, low)
end
fun searchRange (buffer: LineGap.t, searchString, low) =
let
val low = Int.max (low, 0)
val {rightStrings, leftStrings, idx = absIdx, ...} = buffer
in
case rightStrings of
hd :: _ =>
let
val pos = String.size hd - 1
val absIdx = absIdx + String.size hd - 1
in
loopRange (pos, hd, absIdx, leftStrings, [], searchString, low)
end
| [] =>
(case leftStrings of
hd :: tl =>
let
val pos = String.size hd - 1
val absIdx = absIdx - 1
in
loopRange (pos, hd, absIdx, tl, [], searchString, low)
end
| [] => empty)
end
fun buildRange (buffer, searchString, low) =
if String.size searchString > 0 then searchRange (buffer, searchString, low)
else empty
end