185 lines
5.7 KiB
Prolog
185 lines
5.7 KiB
Prolog
:- module(charsio, [char_type/2,
|
|
chars_utf8bytes/2,
|
|
get_single_char/1,
|
|
read_term_from_chars/2,
|
|
write_term_to_chars/3]).
|
|
|
|
:- use_module(library(dcgs)).
|
|
:- use_module(library(iso_ext)).
|
|
:- use_module(library(error)).
|
|
:- use_module(library(lists)).
|
|
|
|
fabricate_var_name(VarType, VarName, N) :-
|
|
char_code('A', AC),
|
|
LN is N mod 26 + AC,
|
|
char_code(LC, LN),
|
|
NN is N // 26,
|
|
( NN =:= 0 ->
|
|
( VarType == fabricated ->
|
|
atom_chars(VarName, ['_', LC])
|
|
; VarType == numbervars ->
|
|
atom_chars(VarName, [LC])
|
|
)
|
|
; number_chars(NN, NNChars),
|
|
( VarType == fabricated ->
|
|
atom_chars(VarName, ['_', LC | NNChars])
|
|
; VarType == numbervars ->
|
|
atom_chars(VarName, [LC | NNChars])
|
|
)
|
|
).
|
|
|
|
var_list_contains_name([VarName = _ | VarList], VarName0) :-
|
|
( VarName == VarName0 -> true
|
|
; var_list_contains_name(VarList, VarName0)
|
|
).
|
|
|
|
var_list_contains_variable([_ = Var | VarList], Var0) :-
|
|
( Var == Var0 -> true
|
|
; var_list_contains_variable(VarList, Var0)
|
|
).
|
|
|
|
make_new_var_name(VarType, V, VarName, N, N1, VarList) :-
|
|
fabricate_var_name(VarType, VarName0, N),
|
|
( var_list_contains_name(VarList, VarName0) ->
|
|
N0 is N + 1,
|
|
make_new_var_name(VarType, V, VarName, N0, N1, VarList)
|
|
; VarName = VarName0,
|
|
N1 is N + 1
|
|
).
|
|
|
|
extend_var_list(Vars, VarList, NewVarList, VarType) :-
|
|
extend_var_list_(Vars, 0, VarList, NewVarList0, VarType),
|
|
append(VarList, NewVarList0, NewVarList).
|
|
|
|
extend_var_list_([], _, VarList, [], _).
|
|
extend_var_list_([V|Vs], N, VarList, NewVarList, VarType) :-
|
|
( var_list_contains_variable(VarList, V) ->
|
|
extend_var_list_(Vs, N, VarList, NewVarList, VarType)
|
|
; make_new_var_name(VarType, V, VarName, N, N1, VarList),
|
|
NewVarList = [VarName = V | NewVarList0],
|
|
extend_var_list_(Vs, N1, VarList, NewVarList0, VarType)
|
|
).
|
|
|
|
|
|
char_type(Char, Type) :-
|
|
( var(Char) -> instantiation_error(char_type/2)
|
|
; atom_length(Char, 1) ->
|
|
( ground(Type) ->
|
|
( ctype(Type) ->
|
|
'$char_type'(Char, Type)
|
|
; domain_error(char_type, Type, char_type/2)
|
|
)
|
|
; ctype(Type),
|
|
'$char_type'(Char, Type)
|
|
)
|
|
; type_error(in_character, Char, char_type/2)
|
|
).
|
|
|
|
|
|
ctype(alnum).
|
|
ctype(alpha).
|
|
ctype(alphabetic).
|
|
ctype(ascii).
|
|
ctype(ascii_graphic).
|
|
ctype(ascii_punctuation).
|
|
ctype(binary_digit).
|
|
ctype(control).
|
|
ctype(decimal_digit).
|
|
ctype(exponent).
|
|
ctype(graphic).
|
|
ctype(hexadecimal_digit).
|
|
ctype(layout).
|
|
ctype(lower).
|
|
ctype(meta).
|
|
ctype(numeric).
|
|
ctype(octal_digit).
|
|
ctype(prolog).
|
|
ctype(sign).
|
|
ctype(solo).
|
|
ctype(symbolic_control).
|
|
ctype(symbolic_hexadecimal).
|
|
ctype(upper).
|
|
ctype(whitespace).
|
|
|
|
|
|
get_single_char(C) :-
|
|
( var(C) -> '$get_single_char'(C)
|
|
; atom_length(C, 1) -> '$get_single_char'(C)
|
|
; type_error(in_character, C, get_single_char/1)
|
|
).
|
|
|
|
|
|
read_term_from_chars(Chars, Term) :-
|
|
( var(Chars) ->
|
|
instantiation_error(read_term_from_chars/2)
|
|
; nonvar(Term) ->
|
|
throw(error(uninstantiation_error(Term), read_term_from_chars/2))
|
|
; '$skip_max_list'(_, -1, Chars, Chars0),
|
|
Chars0 == [],
|
|
partial_string(Chars) ->
|
|
true
|
|
;
|
|
type_error(complete_string, Chars, read_term_from_chars/2)
|
|
),
|
|
'$read_term_from_chars'(Chars, Term).
|
|
|
|
|
|
write_term_to_chars(_, Options, _) :-
|
|
var(Options), instantiation_error(write_term_to_chars/3).
|
|
write_term_to_chars(Term, Options, Chars) :-
|
|
builtins:parse_write_options(Options,
|
|
[IgnoreOps, MaxDepth, NumberVars, Quoted, VNNames],
|
|
write_term_to_chars/3),
|
|
( nonvar(Chars) ->
|
|
throw(error(uninstantiation_error(Chars), write_term_to_chars/3))
|
|
;
|
|
true
|
|
),
|
|
term_variables(Term, Vars),
|
|
extend_var_list(Vars, VNNames, NewVarNames, numbervars),
|
|
'$write_term_to_chars'(Chars, Term, IgnoreOps, NumberVars, Quoted, NewVarNames, MaxDepth).
|
|
|
|
% Encodes Ch character to list of Bytes.
|
|
char_utf8bytes(Ch, Bytes) :-
|
|
char_code(Ch, Code),
|
|
phrase(code_to_utf8(Code), Bytes).
|
|
|
|
code_to_utf8(Code) --> {Code @< 0x80}, [Code], !.
|
|
code_to_utf8(Code) --> {Code @< 0x800}, encode(Code, 0xC0, 2), !.
|
|
code_to_utf8(Code) --> {Code @< 0x10000}, encode(Code, 0xE0, 3), !.
|
|
code_to_utf8(Code) --> {Code @< 0x110000}, encode(Code, 0xF0, 4), !.
|
|
|
|
encode(_, _, 0) --> !.
|
|
encode(Code, Prefix, Nb) -->
|
|
{ Nb1 is Nb - 1, Byte is Prefix \/ ((Code >> (6 * Nb1)) /\ 0x3F) },
|
|
[Byte], encode(Code, 0x80, Nb1).
|
|
|
|
% Maps characters and UTF-8 bytes.
|
|
% If Cs is a variable, parses Bs as a list of UTF-8 bytes.
|
|
% Otherwise, transform the list of characters Cs to UTF-8 bytes.
|
|
chars_utf8bytes(Cs, Bs) :-
|
|
var(Cs), must_be(list, Bs) ->
|
|
once(phrase(decode_utf8(Cs), Bs))
|
|
; (must_be(list, Cs),
|
|
maplist(must_be(atom), Cs),
|
|
maplist(char_utf8bytes, Cs, Bss),
|
|
append(Bss, Bs)).
|
|
|
|
decode_utf8([]) --> [].
|
|
decode_utf8(Chars) --> leading(Nb, Code), continuation(Code, Chars, Nb).
|
|
|
|
leading(1, Byte) --> [Byte], {Byte /\ 0x80 =:= 0}.
|
|
leading(2, Code) --> [Byte], {Byte /\ 0xE0 =:= 0xC0, Code is Byte - 0xC0}.
|
|
leading(3, Code) --> [Byte], {Byte /\ 0xF0 =:= 0xE0, Code is Byte - 0xE0}.
|
|
leading(4, Code) --> [Byte], {Byte /\ 0xF8 =:= 0xF0, Code is Byte - 0xF0}.
|
|
leading(1, 0xFFFD) --> [_]. % invalid first byte
|
|
|
|
continuation(Code, [H|T], 1) --> {char_code(H, Code)}, decode_utf8(T).
|
|
continuation(Code, Chars, Nb) --> [Byte],
|
|
{Nb1 is Nb - 1, Byte /\ 0xC0 =:= 0x80, NextCode is (Code << 6) \/ (Byte - 0x80)},
|
|
continuation(NextCode, Chars, Nb1).
|
|
|
|
% invalid continuation byte
|
|
% each remaining continuation byte (if any) will raise 0xFFFD too
|
|
continuation(_, ['\xFFFD\'|T], _) --> [_], decode_utf8(T).
|