humza/sml-projects
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

finish initial implementation for 'PersistentVector.splitRight'

Browse Source
This commit is contained in:
Humza Shahid
2026-01-16 22:16:44 +00:00
parent eb316d7be2
commit ddcb0ea56d
1 changed files with 74 additions and 37 deletions
Download Patch File Download Diff File Expand all files Collapse all files

111
fcore/persistent-vector.sml
View File

@@ -364,46 +364,49 @@ struct
end end
end end
| BRANCH (nodes, sizes) => | BRANCH (nodes, sizes) =>
if splitIdx < Vector.sub (sizes, 0) then if Vector.length nodes = 0 then
(* we want to split first node from rest *)
splitLeft (splitIdx, Vector.sub (nodes, 0))
else if splitIdx > Vector.sub (sizes, Vector.length sizes - 1) then
(* split point is after this subtree,
* so return this subtree unchanged *)
tree tree
else else
(* we want to split from somewhere in middle *) if splitIdx < Vector.sub (sizes, 0) then
let (* we want to split first node from rest *)
val idx = BinSearch.equalOrMore (splitIdx, sizes) splitLeft (splitIdx, Vector.sub (nodes, 0))
val prevSize = else if splitIdx > Vector.sub (sizes, Vector.length sizes - 1) then
if idx = 0 then (* split point is after this subtree,
0 * so return this subtree unchanged *)
tree
else
(* we want to split from somewhere in middle *)
let
val idx = BinSearch.equalOrMore (splitIdx, sizes)
val prevSize =
if idx = 0 then
0
else
Vector.sub (sizes, idx - 1)
val child =
splitLeft (splitIdx - prevSize, Vector.sub (nodes, idx))
val sizes = VectorSlice.slice (sizes, 0, SOME idx)
val nodes = VectorSlice.slice (nodes, 0, SOME idx)
in
if isEmpty child then
let
val sizes = VectorSlice.vector sizes
val nodes = VectorSlice.vector nodes
in
BRANCH (nodes, sizes)
end
else else
Vector.sub (sizes, idx - 1) let
val child = val childSize = VectorSlice.full #[getFinishIdx child + prevSize]
splitLeft (splitIdx - prevSize, Vector.sub (nodes, idx)) val sizes =VectorSlice.concat [sizes, childSize]
val sizes = VectorSlice.slice (sizes, 0, SOME idx) val childNode = VectorSlice.full #[child]
val nodes = VectorSlice.slice (nodes, 0, SOME idx) val nodes = VectorSlice.concat [nodes, childNode]
in in
if isEmpty child then BRANCH (nodes, sizes)
let end
val sizes = VectorSlice.vector sizes end
val nodes = VectorSlice.vector nodes
in
BRANCH (nodes, sizes)
end
else
let
val childSize = VectorSlice.full #[getFinishIdx child + prevSize]
val sizes =VectorSlice.concat [sizes, childSize]
val childNode = VectorSlice.full #[child]
val nodes = VectorSlice.concat [nodes, childNode]
in
BRANCH (nodes, sizes)
end
end
(* When we split in this function, (* When we split in this function,
* we always want to update the sizes vector * we always want to update the sizes vector
@@ -462,6 +465,40 @@ struct
BRANCH (nodes, sizes) BRANCH (nodes, sizes)
end end
end end
| LEAF (items, sizes) =>
if Vector.length items = 0 then
tree
else
if splitIdx > Vector.sub (sizes, Vector.length sizes - 1) then
empty
else if splitIdx < Vector.sub (sizes, 0) then
tree
else
let
val idx = BinSearch.equalOrMore (splitIdx, sizes)
val {start, finish} = Vector.sub (items, idx)
val idx =
if splitIdx >= start then
idx + 1
else
idx
in
if idx >= Vector.length items then
empty
else
let
val len = Vector.length items - idx
val itemsSlice = VectorSlice.slice (items, idx, SOME len)
val items = VectorSlice.map
(fn {start, finish} =>
{start = start - splitIdx, finish = finish - splitIdx}
)
itemsSlice
val sizes = Vector.map #finish items
in
LEAF (items, sizes)
end
end
(* functions only for testing *) (* functions only for testing *)
fun fromListLoop (lst, acc) = fun fromListLoop (lst, acc) =