2020-02-03 07:00:36 +03:00
|
|
|
// Copyright (c) 2019-2020 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-06-22 21:20:28 +03:00
|
|
|
module builtin
|
|
|
|
|
2019-09-15 15:36:05 +03:00
|
|
|
pub fn utf8_char_len(b byte) int {
|
2019-12-19 23:52:45 +03:00
|
|
|
return ((0xe5000000>>((b>>3) & 0x1e)) & 3) + 1
|
2019-06-22 21:20:28 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
// Convert utf32 to utf8
|
|
|
|
// utf32 == Codepoint
|
2019-06-27 14:14:59 +03:00
|
|
|
pub fn utf32_to_str(code u32) string {
|
2019-12-19 23:52:45 +03:00
|
|
|
mut buffer := malloc(5)
|
2020-07-22 20:28:53 +03:00
|
|
|
return utf32_to_str_no_malloc(code, buffer)
|
2019-06-22 21:20:28 +03:00
|
|
|
}
|
|
|
|
|
2019-06-27 14:14:59 +03:00
|
|
|
pub fn utf32_to_str_no_malloc(code u32, buf voidptr) string {
|
2019-12-19 23:52:45 +03:00
|
|
|
icode := int(code) // Prevents doing casts everywhere
|
2020-07-22 20:28:53 +03:00
|
|
|
unsafe {
|
|
|
|
mut buffer := byteptr(buf)
|
2020-10-14 22:51:16 +03:00
|
|
|
if icode <= 127 { /* 0x7F */
|
2020-07-22 20:28:53 +03:00
|
|
|
buffer[0] = byte(icode)
|
|
|
|
return tos(buffer, 1)
|
|
|
|
}
|
2020-10-14 22:51:16 +03:00
|
|
|
if icode <= 2047 { /* 0x7FF */
|
|
|
|
buffer[0] = 192 | byte(icode>>6) /* 0xC0 - 110xxxxx */
|
|
|
|
buffer[1] = 128 | byte(icode & 63) /* 0x80 - 0x3F - 10xxxxxx */
|
2020-07-22 20:28:53 +03:00
|
|
|
return tos(buffer, 2)
|
|
|
|
}
|
2020-10-14 22:51:16 +03:00
|
|
|
if icode <= 65535 { /* 0xFFFF */
|
|
|
|
buffer[0] = 224 | byte(icode>>12)/* 0xE0 - 1110xxxx */
|
|
|
|
buffer[1] = 128 | (byte(icode>>6) & 63) /* 0x80 - 0x3F - 10xxxxxx */
|
|
|
|
buffer[2] = 128 | byte(icode & 63) /* 0x80 - 0x3F - 10xxxxxx */
|
2020-07-22 20:28:53 +03:00
|
|
|
return tos(buffer, 3)
|
|
|
|
}
|
|
|
|
if icode <= 1114111/* 0x10FFFF */ {
|
2020-10-14 22:51:16 +03:00
|
|
|
buffer[0] = 240 | byte(icode>>18) /* 0xF0 - 11110xxx */
|
|
|
|
buffer[1] = 128 | (byte(icode>>12) & 63) /* 0x80 - 0x3F - 10xxxxxx */
|
|
|
|
buffer[2] = 128 | (byte(icode>>6) & 63) /* 0x80 - 0x3F - 10xxxxxx */
|
|
|
|
buffer[3] = 128 | byte(icode & 63) /* 0x80 - 0x3F - 10xxxxxx */
|
2020-07-22 20:28:53 +03:00
|
|
|
return tos(buffer, 4)
|
|
|
|
}
|
2019-06-27 03:33:49 +03:00
|
|
|
}
|
2019-06-22 21:20:28 +03:00
|
|
|
return ''
|
|
|
|
}
|
|
|
|
|
|
|
|
// Convert utf8 to utf32
|
2019-06-27 14:14:59 +03:00
|
|
|
pub fn (_rune string) utf32_code() int {
|
2019-06-22 21:20:28 +03:00
|
|
|
if _rune.len == 0 {
|
|
|
|
return 0
|
|
|
|
}
|
|
|
|
// save ASC symbol as is
|
|
|
|
if _rune.len == 1 {
|
|
|
|
return int(_rune[0])
|
|
|
|
}
|
2019-06-27 03:33:49 +03:00
|
|
|
mut b := byte(int(_rune[0]))
|
2019-06-22 21:20:28 +03:00
|
|
|
// TODO should be
|
|
|
|
// res := int( rune[0] << rune.len)
|
2019-12-19 23:52:45 +03:00
|
|
|
b = b<<_rune.len
|
2019-06-27 03:33:49 +03:00
|
|
|
mut res := int(b)
|
2019-06-22 21:20:28 +03:00
|
|
|
mut shift := 6 - _rune.len
|
|
|
|
for i := 1; i < _rune.len; i++ {
|
|
|
|
c := int(_rune[i])
|
2019-12-19 23:52:45 +03:00
|
|
|
res = res<<shift
|
2019-11-13 21:14:37 +03:00
|
|
|
res |= c & 63 // 0x3f
|
2019-06-22 21:20:28 +03:00
|
|
|
shift = 6
|
|
|
|
}
|
|
|
|
return res
|
|
|
|
}
|
|
|
|
|
2019-07-24 13:16:45 +03:00
|
|
|
const (
|
2020-05-22 18:36:09 +03:00
|
|
|
cp_utf8 = 65001
|
2019-12-19 23:52:45 +03:00
|
|
|
)
|
2019-07-24 13:16:45 +03:00
|
|
|
|
|
|
|
pub fn (_str string) to_wide() &u16 {
|
2019-11-16 02:30:50 +03:00
|
|
|
$if windows {
|
2020-09-18 13:40:47 +03:00
|
|
|
num_chars := (C.MultiByteToWideChar(cp_utf8, 0, charptr(_str.str), _str.len, 0, 0))
|
2019-11-16 02:30:50 +03:00
|
|
|
mut wstr := &u16(malloc((num_chars + 1) * 2)) // sizeof(wchar_t)
|
2020-04-27 08:13:36 +03:00
|
|
|
if wstr != 0 {
|
2020-09-18 13:40:47 +03:00
|
|
|
C.MultiByteToWideChar(cp_utf8, 0, charptr(_str.str), _str.len, wstr, num_chars)
|
2020-07-03 19:10:10 +03:00
|
|
|
unsafe {
|
|
|
|
C.memset(&byte(wstr) + num_chars * 2, 0, 2)
|
|
|
|
}
|
2019-11-16 02:30:50 +03:00
|
|
|
}
|
|
|
|
return wstr
|
|
|
|
} $else {
|
|
|
|
return 0
|
|
|
|
}
|
2019-07-24 13:16:45 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
pub fn string_from_wide(_wstr &u16) string {
|
2019-12-19 23:52:45 +03:00
|
|
|
$if windows {
|
|
|
|
wstr_len := C.wcslen(_wstr)
|
|
|
|
return string_from_wide2(_wstr, wstr_len)
|
|
|
|
} $else {
|
|
|
|
return ''
|
|
|
|
}
|
2019-07-24 13:16:45 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
pub fn string_from_wide2(_wstr &u16, len int) string {
|
2019-12-19 23:52:45 +03:00
|
|
|
$if windows {
|
2020-05-22 18:36:09 +03:00
|
|
|
num_chars := C.WideCharToMultiByte(cp_utf8, 0, _wstr, len, 0, 0, 0, 0)
|
2019-12-19 23:52:45 +03:00
|
|
|
mut str_to := malloc(num_chars + 1)
|
2020-04-27 08:13:36 +03:00
|
|
|
if str_to != 0 {
|
2020-09-18 13:40:47 +03:00
|
|
|
C.WideCharToMultiByte(cp_utf8, 0, _wstr, len, charptr(str_to), num_chars, 0, 0)
|
2020-07-03 19:10:10 +03:00
|
|
|
unsafe {
|
|
|
|
C.memset(str_to + num_chars, 0, 1)
|
|
|
|
}
|
2019-12-19 23:52:45 +03:00
|
|
|
}
|
|
|
|
return tos2(str_to)
|
|
|
|
} $else {
|
|
|
|
return ''
|
|
|
|
}
|
2019-07-24 13:16:45 +03:00
|
|
|
}
|
2019-09-15 04:41:24 +03:00
|
|
|
|
|
|
|
// Calculate length to read from the first byte
|
|
|
|
fn utf8_len(c byte) int {
|
2019-12-19 23:52:45 +03:00
|
|
|
mut b := 0
|
|
|
|
mut x := c
|
2020-03-27 16:57:19 +03:00
|
|
|
if (x & 240) != 0 {
|
2019-12-19 23:52:45 +03:00
|
|
|
// 0xF0
|
|
|
|
x >>= 4
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
b += 4
|
|
|
|
}
|
2020-03-27 16:57:19 +03:00
|
|
|
if (x & 12) != 0 {
|
2019-12-19 23:52:45 +03:00
|
|
|
// 0x0C
|
|
|
|
x >>= 2
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
b += 2
|
|
|
|
}
|
2020-03-27 16:57:19 +03:00
|
|
|
if (x & 2) == 0 {
|
2019-12-19 23:52:45 +03:00
|
|
|
// 0x02
|
|
|
|
b++
|
|
|
|
}
|
|
|
|
return b
|
2019-09-15 04:41:24 +03:00
|
|
|
}
|
|
|
|
|
2020-05-04 14:21:11 +03:00
|
|
|
// Calculate string length for in number of codepoints
|
2020-05-02 01:43:59 +03:00
|
|
|
fn utf8_str_len(s string) int {
|
|
|
|
mut l := 0
|
|
|
|
for i := 0; i < s.len; i++ {
|
|
|
|
l++
|
2020-07-22 20:28:53 +03:00
|
|
|
c := unsafe {s.str[i]}
|
2020-05-02 01:43:59 +03:00
|
|
|
if (c & (1 << 7)) != 0 {
|
|
|
|
for t := byte(1 << 6); (c & t) != 0; t >>= 1 {
|
|
|
|
i++
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return l
|
|
|
|
}
|
|
|
|
|
2020-05-04 14:21:11 +03:00
|
|
|
// Calculate string length for formatting, i.e. number of "characters"
|
|
|
|
fn utf8_str_visible_length(s string) int {
|
|
|
|
mut l := 0
|
|
|
|
mut ul := 1
|
|
|
|
for i := 0; i < s.len; i+=ul {
|
|
|
|
ul = 1
|
2020-07-22 20:28:53 +03:00
|
|
|
c := unsafe {s.str[i]}
|
2020-05-04 14:21:11 +03:00
|
|
|
if (c & (1 << 7)) != 0 {
|
|
|
|
for t := byte(1 << 6); (c & t) != 0; t >>= 1 {
|
|
|
|
ul++
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if i + ul > s.len { // incomplete UTF-8 sequence
|
|
|
|
return l
|
|
|
|
}
|
|
|
|
l++
|
|
|
|
// recognize combining characters
|
|
|
|
if c == 0xcc || c == 0xcd {
|
2020-07-22 20:28:53 +03:00
|
|
|
r := (u16(c) << 8) | unsafe {s.str[i+1]}
|
2020-05-04 14:21:11 +03:00
|
|
|
if r >= 0xcc80 && r < 0xcdb0 { // diacritical marks
|
|
|
|
l--
|
|
|
|
}
|
|
|
|
} else if c == 0xe1 || c == 0xe2 || c == 0xef {
|
2020-07-22 20:28:53 +03:00
|
|
|
r := (u32(c) << 16) | unsafe {(u32(s.str[i+1]) << 8) | s.str[i+2]}
|
2020-10-14 22:51:16 +03:00
|
|
|
// diacritical marks extended 0xe1aab0 - 0xe1ac80
|
|
|
|
// diacritical marks supplement 0xe1b780 - 0xe1b880
|
|
|
|
// diacritical marks for symbols 0xe28390 - 0xe28480
|
|
|
|
// half marks 0xefb8a0 - 0xefb8b0
|
|
|
|
if (r >= 0xe1aab0 && r < 0xe1ac80)
|
|
|
|
|| (r >= 0xe1b780 && r < 0xe1b880)
|
|
|
|
|| (r >= 0xe28390 && r < 0xe28480)
|
|
|
|
|| (r >= 0xefb8a0 && r < 0xefb8b0) {
|
2020-05-04 14:21:11 +03:00
|
|
|
l--
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return l
|
|
|
|
}
|
|
|
|
|
2019-09-15 04:41:24 +03:00
|
|
|
// Reads an utf8 character from standard input
|
|
|
|
pub fn utf8_getchar() int {
|
2019-12-19 23:52:45 +03:00
|
|
|
c := C.getchar()
|
2020-06-01 22:15:59 +03:00
|
|
|
len := utf8_len(byte(~c))
|
2019-12-19 23:52:45 +03:00
|
|
|
if c < 0 {
|
|
|
|
return 0
|
|
|
|
}
|
|
|
|
else if len == 0 {
|
|
|
|
return c
|
|
|
|
}
|
|
|
|
else if len == 1 {
|
|
|
|
return -1
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
mut uc := c & ((1<<(7 - len)) - 1)
|
|
|
|
for i := 0; i + 1 < len; i++ {
|
|
|
|
c2 := C.getchar()
|
|
|
|
if c2 != -1 && (c2>>6) == 2 {
|
|
|
|
uc <<= 6
|
|
|
|
uc |= (c2 & 63)
|
|
|
|
}
|
|
|
|
else if c2 == -1 {
|
|
|
|
return 0
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
return -1
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return uc
|
|
|
|
}
|
2019-09-15 04:41:24 +03:00
|
|
|
}
|