v/vlib/strings/builder.v

164 lines
4.1 KiB
V
Raw Normal View History

// Copyright (c) 2019-2021 Alexander Medvednikov. All rights reserved.
2019-06-23 04:21:30 +02:00
// Use of this source code is governed by an MIT license
// that can be found in the LICENSE file.
2019-09-14 22:48:30 +02:00
module strings
2019-06-22 20:20:28 +02:00
// strings.Builder is used to efficiently append many strings to a large
2020-12-21 21:00:32 +01:00
// dynamically growing buffer, then use the resulting large string. Using
// a string builder is much better for performance/memory usage than doing
// constantly string concatenation.
2021-05-31 13:21:06 +02:00
pub type Builder = []byte
2019-06-22 20:20:28 +02:00
2020-12-21 21:00:32 +01:00
// new_builder returns a new string builder, with an initial capacity of `initial_size`
pub fn new_builder(initial_size int) Builder {
2021-05-31 13:21:06 +02:00
return Builder([]byte{cap: initial_size})
}
// write_ptr writes `len` bytes provided byteptr to the accumulated buffer
[unsafe]
pub fn (mut b Builder) write_ptr(ptr &byte, len int) {
if len == 0 {
return
}
2021-05-31 13:21:06 +02:00
unsafe { b.push_many(ptr, len) }
2019-12-11 17:20:46 +01:00
}
// write_rune appends a single rune to the accumulated buffer
[manualfree]
pub fn (mut b Builder) write_rune(r rune) {
mut buffer := [5]byte{}
res := unsafe { utf32_to_str_no_malloc(u32(r), &buffer[0]) }
if res.len == 0 {
return
}
unsafe { b.push_many(res.str, res.len) }
}
// write_runes appends all the given runes to the accumulated buffer
pub fn (mut b Builder) write_runes(runes []rune) {
mut buffer := [5]byte{}
for r in runes {
res := unsafe { utf32_to_str_no_malloc(u32(r), &buffer[0]) }
if res.len == 0 {
continue
}
unsafe { b.push_many(res.str, res.len) }
}
}
2020-12-21 21:00:32 +01:00
// write_b appends a single `data` byte to the accumulated buffer
2020-05-17 13:51:18 +02:00
pub fn (mut b Builder) write_b(data byte) {
2021-05-31 13:21:06 +02:00
b << data
2019-12-06 21:02:09 +01:00
}
// write implements the Writer interface
pub fn (mut b Builder) write(data []byte) ?int {
if data.len == 0 {
return 0
}
2021-05-31 13:21:06 +02:00
b << data
return data.len
}
2021-05-31 13:21:06 +02:00
[inline]
pub fn (b &Builder) byte_at(n int) byte {
return unsafe { (&[]byte(b))[n] }
}
2020-12-21 21:00:32 +01:00
// write appends the string `s` to the buffer
[inline]
pub fn (mut b Builder) write_string(s string) {
if s.len == 0 {
2019-12-24 18:54:43 +01:00
return
}
2021-05-31 13:21:06 +02:00
unsafe { b.push_many(s.str, s.len) }
2019-12-19 22:29:37 +01:00
// for c in s {
// b.buf << c
// }
// b.buf << []byte(s) // TODO
2019-06-22 20:20:28 +02:00
}
2020-12-21 21:00:32 +01:00
// go_back discards the last `n` bytes from the buffer
2020-05-17 13:51:18 +02:00
pub fn (mut b Builder) go_back(n int) {
2021-05-31 13:21:06 +02:00
b.trim(b.len - n)
}
2020-03-10 23:21:26 +01:00
2020-12-21 21:00:32 +01:00
// cut_last cuts the last `n` bytes from the buffer and returns them
2020-06-17 00:59:33 +02:00
pub fn (mut b Builder) cut_last(n int) string {
2021-05-31 13:21:06 +02:00
cut_pos := b.len - n
x := unsafe { (&[]byte(b))[cut_pos..] }
res := x.bytestr()
b.trim(cut_pos)
return res
2020-06-17 00:59:33 +02:00
}
2021-05-07 18:41:27 +02:00
// cut_to cuts the string after `pos` and returns it.
// if `pos` is superior to builder length, returns an empty string
// and cancel further operations
2020-06-17 00:59:33 +02:00
pub fn (mut b Builder) cut_to(pos int) string {
2021-05-07 18:41:27 +02:00
if pos > b.len {
return ''
}
2021-05-31 13:21:06 +02:00
return b.cut_last(b.len - pos)
2020-06-17 00:59:33 +02:00
}
2021-05-07 18:41:27 +02:00
2020-12-21 21:00:32 +01:00
// go_back_to resets the buffer to the given position `pos`
// NB: pos should be < than the existing buffer length.
2020-05-17 13:51:18 +02:00
pub fn (mut b Builder) go_back_to(pos int) {
2021-05-31 13:21:06 +02:00
b.trim(pos)
2020-04-28 13:15:37 +02:00
}
2020-12-21 21:00:32 +01:00
// writeln appends the string `s`, and then a newline character.
[inline]
2020-05-17 13:51:18 +02:00
pub fn (mut b Builder) writeln(s string) {
2019-12-19 22:29:37 +01:00
// for c in s {
// b.buf << c
// }
if s.len > 0 {
unsafe { b.push_many(s.str, s.len) }
}
2019-12-19 22:29:37 +01:00
// b.buf << []byte(s) // TODO
2021-05-31 13:21:06 +02:00
b << byte(`\n`)
2019-06-22 20:20:28 +02:00
}
2020-03-21 07:01:06 +01:00
// last_n(5) returns 'world'
// buf == 'hello world'
2020-03-21 07:04:53 +01:00
pub fn (b &Builder) last_n(n int) string {
2020-03-21 07:01:06 +01:00
if n > b.len {
return ''
}
2021-05-31 13:21:06 +02:00
x := unsafe { (&[]byte(b))[b.len - n..] }
return x.bytestr()
2020-03-21 07:01:06 +01:00
}
// after(6) returns 'world'
// buf == 'hello world'
2020-03-21 07:04:53 +01:00
pub fn (b &Builder) after(n int) string {
2020-03-21 07:01:06 +01:00
if n >= b.len {
return ''
}
2021-05-31 13:21:06 +02:00
x := unsafe { (&[]byte(b))[n..] }
return x.bytestr()
2020-03-21 07:01:06 +01:00
}
// str returns a copy of all of the accumulated buffer content.
// NB: after a call to b.str(), the builder b should not be
// used again, you need to call b.free() first, or just leave
// it to be freed by -autofree when it goes out of scope.
// The returned string *owns* its own separate copy of the
// accumulated data that was in the string builder, before the
// .str() call.
2020-05-17 13:51:18 +02:00
pub fn (mut b Builder) str() string {
2021-05-31 13:21:06 +02:00
b << byte(0)
bcopy := unsafe { &byte(memdup(b.data, b.len)) }
s := unsafe { bcopy.vstring_with_len(b.len - 1) }
b.trim(0)
return s
2019-06-22 20:20:28 +02:00
}
// free is for manually freeing the contents of the buffer
[unsafe]
2020-05-17 13:51:18 +02:00
pub fn (mut b Builder) free() {
2021-05-31 13:21:06 +02:00
unsafe { free(b.data) }
2019-06-24 22:34:21 +02:00
}