Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

arraybuf: new constructor #236

Merged
merged 2 commits into from
Oct 7, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
39 changes: 29 additions & 10 deletions stew/arraybuf.nim
Original file line number Diff line number Diff line change
Expand Up @@ -48,19 +48,22 @@ template len*(b: ArrayBuf): int =
int(b.n)

template setLen*(b: var ArrayBuf, newLenParam: int) =
newLenParam.evalOnceAs(newLen)
let nl = typeof(b.n)(newLen)
for i in newLen ..< b.len():
reset(b.buf[i]) # reset cleared items when shrinking
b.n = nl
block:
newLenParam.evalOnceAs(newLen)
let nl = typeof(b.n)(newLen)
for i in newLen ..< b.len():
reset(b.buf[i]) # reset cleared items when shrinking
b.n = nl

template data*(bParam: ArrayBuf): openArray =
bParam.evalOnceAs(b)
b.buf.toOpenArray(0, b.len() - 1)
block:
bParam.evalOnceAs(b)
b.buf.toOpenArray(0, b.len() - 1)

template data*(bParam: var ArrayBuf): var openArray =
bParam.evalOnceAs(b)
b.buf.toOpenArray(0, b.len() - 1)
block:
bParam.evalOnceAs(b)
b.buf.toOpenArray(0, b.len() - 1)

iterator items*[N, T](b: ArrayBuf[N, T]): lent T =
for i in 0 ..< b.len:
Expand Down Expand Up @@ -92,6 +95,22 @@ template `==`*(a, b: ArrayBuf): bool =
template `<`*(a, b: ArrayBuf): bool =
a.data() < b.data()

template initCopyFrom*[N, T](
_: type ArrayBuf[N, T], data: openArray[T]
): ArrayBuf[N, T] =
var v: ArrayBuf[N, T]
v.n = typeof(v.n)(v.buf.copyFrom(data))
v

template initCopyFrom*[N, T](
_: type ArrayBuf[N, T], data: array[N, T]
): ArrayBuf[N, T] =
# Shortcut version that avoids zeroMem on matching lengths
ArrayBuf[N, T](
buf: data,
n: N
)

template add*[N, T](b: var ArrayBuf[N, T], v: T) =
## Adds items up to capacity then drops the rest
# TODO `b` is evaluated multiple times but since it's a `var` this should
Expand All @@ -112,4 +131,4 @@ template pop*[N, T](b: var ArrayBuf[N, T]): T =
# _hopefully_ be fine..
assert b.n > 0, "pop from empty ArrayBuf"
b.n -= 1
move(b.buf[b.n])
move(b.buf[b.n])
13 changes: 13 additions & 0 deletions tests/test_arraybuf.nim
Original file line number Diff line number Diff line change
Expand Up @@ -56,3 +56,16 @@ suite "ArrayBuf":
v.len == 1
v.setLen(2)
doAssert v.data() == [byte 1, 0]

test "construction":
let
a0 = ArrayBuf[4, byte].initCopyFrom([])
a2 = ArrayBuf[2, byte].initCopyFrom([byte 2, 3, 4, 5])
a3 = ArrayBuf[5, byte].initCopyFrom([byte 2, 3, 4])
a5 = ArrayBuf[5, byte].initCopyFrom([byte 2, 3])

check:
a0.len == 0
a2.data() == [byte 2, 3]
a3.data() == [byte 2, 3, 4]
a5.data() == [byte 2, 3]