2021-01-18 15:20:06 +03:00
|
|
|
// Copyright (c) 2019-2021 Alexander Medvednikov. All rights reserved.
|
2019-06-23 05:21:30 +03:00
|
|
|
// Use of this source code is governed by an MIT license
|
|
|
|
// that can be found in the LICENSE file.
|
2019-09-14 23:48:30 +03:00
|
|
|
module strings
|
2019-06-22 21:20:28 +03:00
|
|
|
|
2021-10-04 18:28:30 +03:00
|
|
|
/*
|
2019-10-24 12:47:21 +03:00
|
|
|
pub struct Builder {
|
2019-10-05 11:07:10 +03:00
|
|
|
mut:
|
2021-01-12 06:38:43 +03:00
|
|
|
buf []byte
|
2019-12-16 18:54:44 +03:00
|
|
|
pub mut:
|
2020-12-21 23:00:32 +03:00
|
|
|
len int
|
2019-12-11 17:32:54 +03:00
|
|
|
initial_size int = 1
|
2021-10-04 18:28:30 +03:00
|
|
|
}*/
|
|
|
|
|
|
|
|
pub type Builder = []byte
|
2019-06-22 21:20:28 +03:00
|
|
|
|
2019-07-03 23:11:27 +03:00
|
|
|
pub fn new_builder(initial_size int) Builder {
|
2021-10-04 18:28:30 +03:00
|
|
|
return []byte{cap: initial_size}
|
2019-06-22 21:20:28 +03:00
|
|
|
}
|
|
|
|
|
2020-05-17 14:51:18 +03:00
|
|
|
pub fn (mut b Builder) write_b(data byte) {
|
2021-10-04 18:28:30 +03:00
|
|
|
b << data
|
2019-12-06 23:02:09 +03:00
|
|
|
}
|
|
|
|
|
2021-08-31 17:10:19 +03:00
|
|
|
pub fn (mut b Builder) write(data []byte) ?int {
|
|
|
|
if data.len == 0 {
|
|
|
|
return 0
|
|
|
|
}
|
2021-10-04 18:28:30 +03:00
|
|
|
b << data
|
2021-08-31 17:10:19 +03:00
|
|
|
return data.len
|
2019-06-22 21:20:28 +03:00
|
|
|
}
|
|
|
|
|
2021-08-31 17:10:19 +03:00
|
|
|
pub fn (b &Builder) byte_at(n int) byte {
|
2021-10-04 18:28:30 +03:00
|
|
|
unsafe {
|
|
|
|
return b[n]
|
|
|
|
}
|
2019-06-22 21:20:28 +03:00
|
|
|
}
|
|
|
|
|
2021-08-31 17:10:19 +03:00
|
|
|
pub fn (mut b Builder) write_string(s string) {
|
|
|
|
if s.len == 0 {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
|
|
|
for c in s {
|
2021-10-04 18:28:30 +03:00
|
|
|
b << c
|
2021-08-31 17:10:19 +03:00
|
|
|
}
|
2019-06-22 21:20:28 +03:00
|
|
|
}
|
|
|
|
|
2021-08-31 17:10:19 +03:00
|
|
|
pub fn (mut b Builder) writeln(s string) {
|
|
|
|
if s.len > 0 {
|
|
|
|
b.write_string(s)
|
|
|
|
}
|
|
|
|
|
2021-10-04 18:28:30 +03:00
|
|
|
b << 10
|
2019-06-22 21:20:28 +03:00
|
|
|
}
|
|
|
|
|
2021-08-31 17:10:19 +03:00
|
|
|
pub fn (mut b Builder) str() string {
|
|
|
|
s := ''
|
|
|
|
|
2021-10-04 18:28:30 +03:00
|
|
|
#for (const c of b.val.arr.arr)
|
2021-08-31 17:10:19 +03:00
|
|
|
#s.str += String.fromCharCode(+c)
|
2021-10-04 18:28:30 +03:00
|
|
|
b.trim(0)
|
2021-08-31 17:10:19 +03:00
|
|
|
return s
|
2019-06-24 23:34:21 +03:00
|
|
|
}
|
2021-10-04 18:28:30 +03:00
|
|
|
|
|
|
|
pub fn (mut b Builder) cut_last(n int) string {
|
|
|
|
cut_pos := b.len - n
|
|
|
|
x := b[cut_pos..]
|
|
|
|
res := x.bytestr()
|
|
|
|
b.trim(cut_pos)
|
|
|
|
return res
|
|
|
|
}
|
|
|
|
|
|
|
|
pub fn (mut b Builder) go_back_to(pos int) {
|
|
|
|
b.trim(pos)
|
|
|
|
}
|
|
|
|
|
|
|
|
// go_back discards the last `n` bytes from the buffer
|
|
|
|
pub fn (mut b Builder) go_back(n int) {
|
|
|
|
b.trim(b.len - n)
|
|
|
|
}
|
|
|
|
|
|
|
|
// 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
|
|
|
|
pub fn (mut b Builder) cut_to(pos int) string {
|
|
|
|
if pos > b.len {
|
|
|
|
return ''
|
|
|
|
}
|
|
|
|
return b.cut_last(b.len - pos)
|
|
|
|
}
|
2021-10-06 10:43:49 +03:00
|
|
|
|
|
|
|
pub fn (mut b Builder) write_runes(runes []rune) {
|
|
|
|
for r in runes {
|
|
|
|
res := string(r)
|
|
|
|
#res.str = String.fromCharCode(r.val)
|
|
|
|
b << res.bytes()
|
|
|
|
}
|
|
|
|
}
|
2021-10-07 15:55:47 +03:00
|
|
|
|
|
|
|
// after(6) returns 'world'
|
|
|
|
// buf == 'hello world'
|
|
|
|
pub fn (mut b Builder) after(n int) string {
|
|
|
|
if n >= b.len {
|
|
|
|
return ''
|
|
|
|
}
|
|
|
|
|
|
|
|
x := b.slice(n, b.len)
|
|
|
|
return x.bytestr()
|
|
|
|
}
|
|
|
|
|
|
|
|
// last_n(5) returns 'world'
|
|
|
|
// buf == 'hello world'
|
|
|
|
pub fn (b &Builder) last_n(n int) string {
|
|
|
|
if n >= b.len {
|
|
|
|
return ''
|
|
|
|
}
|
|
|
|
|
|
|
|
x := b.slice(b.len - n, b.len)
|
|
|
|
return x.bytestr()
|
|
|
|
}
|