Term Writing in Prolog.¶
- write_depth/3
- display/2
- display/1
- print/2
- writeq/2
- write_canonical/2
- write_canonical/1
- write/2
- write_term/3
- write_term/2
Define:¶
Functions:¶
1. static Term readFromBuffer(const char *s, Term opts):
1. static bool write_term(int output_stream, Term t, bool b, yap_error_number errp, xarg args USES_REGS):
1. bool Yap_WriteTerm(int output_stream, Term t, Term opts USES_REGS):
1. static Int write_ter/2(USES_REGS1):
1. static Int write_ter/3(USES_REGS1):
1. static Int writ/2(USES_REGS1):
1. static Int writ/1(USES_REGS1):
1. static Int write_canonica/1(USES_REGS1):
1. static Int write_canonical(USES_REGS1):
1. static Int write/1(USES_REGS1):
1. static Int writeq(USES_REGS1):
1. static Int prin/1(USES_REGS1):
1. static Int print(USES_REGS1):
1. static Int displa/1(USES_REGS1):
1. static Int display(USES_REGS1):
1. static Int writel/1(USES_REGS1):
1. static Int writeln(USES_REGS1):
1. static Int p_write_depth(USES_REGS1):
1. static Int dollar_var(USES_REGS1):
1. static Int term_to_string(USES_REGS1):
1. static Int term_to_atom(USES_REGS1):
return:
1. static Int term_to_codes(USES_REGS1): : "term_to_codes(Term, ListOfCodes" )
@class term_to_codes_2
-
A term
-
A list of character codes return:
If Term bound. generate a list of codes with the textual representation of the ternm; else, if List is given, parse the text and unify with Term . else return an error.
1. char * Yap_TermToBuffer(Term t, int flags):
1. void Yap_InitWriteTPreds(void):