2020-02-26 13:22:12 +01:00
|
|
|
module strings
|
|
|
|
|
|
|
|
// strings.repeat - fill a string with `n` repetitions of the character `c`
|
|
|
|
pub fn repeat(c byte, n int) string {
|
|
|
|
if n <= 0 {
|
|
|
|
return ''
|
|
|
|
}
|
2020-07-15 21:56:50 +02:00
|
|
|
mut bytes := unsafe {malloc(n + 1)}
|
|
|
|
unsafe {
|
|
|
|
C.memset( bytes, c, n )
|
|
|
|
bytes[n] = `0`
|
|
|
|
}
|
2020-02-26 13:22:12 +01:00
|
|
|
return string( bytes, n )
|
|
|
|
}
|
|
|
|
|
|
|
|
// strings.repeat_string - gives you `n` repetitions of the substring `s`
|
|
|
|
// NB: strings.repeat, that repeats a single byte, is between 2x
|
|
|
|
// and 24x faster than strings.repeat_string called for a 1 char string.
|
|
|
|
pub fn repeat_string(s string, n int) string {
|
|
|
|
if n <= 0 || s.len == 0 {
|
|
|
|
return ''
|
|
|
|
}
|
|
|
|
slen := s.len
|
|
|
|
blen := slen*n
|
2020-07-15 21:56:50 +02:00
|
|
|
mut bytes := unsafe {malloc(blen + 1)}
|
2020-02-26 13:22:12 +01:00
|
|
|
for bi in 0..n {
|
|
|
|
bislen := bi*slen
|
|
|
|
for si in 0..slen {
|
2020-07-15 21:56:50 +02:00
|
|
|
unsafe {
|
|
|
|
bytes[bislen+si] = s[si]
|
|
|
|
}
|
2020-02-26 13:22:12 +01:00
|
|
|
}
|
|
|
|
}
|
2020-07-15 21:56:50 +02:00
|
|
|
unsafe {
|
|
|
|
bytes[blen] = `0`
|
|
|
|
}
|
2020-02-26 13:22:12 +01:00
|
|
|
return string( bytes, blen )
|
|
|
|
}
|