Difference between revisions of "Language Reference/Built-in entities/Predicates"
(toTerm to argument version) |
(pointerTo is built-in) |
||
(64 intermediate revisions by 3 users not shown) | |||
Line 2: | Line 2: | ||
{|{{prettytable}} | {|{{prettytable}} | ||
|- | |||
|[[Language_Reference/Terms#and_.28.2C.29|and/2]] <br> [[Language_Reference/Terms#and_.28.2C.29|,/2]] | |||
|Term "and" | |||
|- | |- | ||
|[[#assert|assert/1]] | |[[#assert|assert/1]] | ||
Line 15: | Line 18: | ||
|Test whether the specified variable is bound to a value. | |Test whether the specified variable is bound to a value. | ||
|- | |- | ||
|[[# | |[[#class_name|class_name/0->]] | ||
|This compile time predicate returns the string ''ClassName'' that represents the name of the current interface or class. | |This compile time predicate returns the string ''ClassName'' that represents the name of the current interface or class. | ||
|- | |- | ||
|[[#compare|compare/2->]] | |[[#compare|compare/2->]] | ||
|Returns the result of the variables' comparison. | |Returns the result of the variables' comparison. | ||
|- | |||
|[[#constant_name|constant_name/0->]] | |||
|This compile time predicate returns the string ''ConstantName'' that represents the name of the current constant. Typically used in execepion definitions. | |||
|- | |- | ||
|[[#convert|convert/2->]] | |[[#convert|convert/2->]] | ||
Line 29: | Line 35: | ||
|[[#errorExit|errorExit/1]] <vp>erroneous</vp> | |[[#errorExit|errorExit/1]] <vp>erroneous</vp> | ||
|Performs a run-time error with the specified return code ''ErrorNumber'' and sets the internal error information. | |Performs a run-time error with the specified return code ''ErrorNumber'' and sets the internal error information. | ||
|- | |||
|[[#fact_address|fact_address/1->]] | |||
|Returns the address of a fact variable. | |||
|- | |- | ||
|[[#fail|fail/0]] <vp>failure</vp> | |[[#fail|fail/0]] <vp>failure</vp> | ||
Line 36: | Line 45: | ||
|Check whether a variable is free. | |Check whether a variable is free. | ||
|- | |- | ||
|[[# | |[[#fromEllipsis|fromEllipsis/1->]] | ||
| | |Creates the list of terms of the universal type <vp>any</vp> from the ''EllipsisBlock''. | ||
|- | |||
|[[#hasDomain|hasDomain/2]] <br> [[#hasDomain|hasDomain/2->]] | |||
|Declares/restricts the type of a variable or value. | |||
|- | |||
|[[Language_Reference/Terms#in|in/2]] <vp>determ</vp> <br> [[Language_Reference/Terms#in|in/2]] <vp>nondeterm</vp> | |||
|Infix operator "in" (in-test and in-iterator). | |||
|- | |- | ||
|[[#isErroneous|isErroneous/1]] <vp>determ</vp> | |[[#isErroneous|isErroneous/1]] <vp>determ</vp> | ||
Line 50: | Line 65: | ||
|[[#not|not/1]] <vp>determ</vp> | |[[#not|not/1]] <vp>determ</vp> | ||
|Negate the result (success/fail) of subgoal. | |Negate the result (success/fail) of subgoal. | ||
|- | |||
|[[Language_Reference/Terms#otherwise|otherwise/2]] | |||
|Infix expression operator providing a value when a determ expression fails | |||
|- | |||
|[[Language_Reference/Terms#or_.28.3B.29|or/2]] <br> [[Language_Reference/Terms#and_.28.3B.29|;/2]] | |||
|Nondeterministic term "or" | |||
|- | |||
|[[Language_Reference/Terms#orelse|orelse]] | |||
|Deterministic term "or" | |||
|- | |- | ||
|[[#predicate_fullname|predicate_fullname/1->]] | |[[#predicate_fullname|predicate_fullname/1->]] | ||
|This compile time predicate returns the string ''PredicateFullName'' that represent the name of the predicate in which clause body '''predicate_name | |This compile time predicate returns the string ''PredicateFullName'' that represent the name of the predicate in which clause body <vp>predicate_name</vp> is called. The returned predicate name is qualified with a scope name. | ||
|- | |||
|[[#predicate_name|predicate_name/1->]] | |||
|This compile time predicate returns the string ''PredicateName'' that represent the name of the predicate in which clause body <vp>predicate_name</vp> is called. The returned predicate name is not qualified with a scope name. | |||
|- | |- | ||
|[[# | |[[#programPoint|programPoint/0->]] | ||
|This compile time predicate returns the | |This compile time predicate returns the <vp>programPoint</vp> corresponding to the place where it is called. | ||
|- | |- | ||
|[[#retract|retract/1]] <vp>nondeterm</vp> | |[[#retract|retract/1]] <vp>nondeterm</vp> | ||
Line 85: | Line 112: | ||
|- | |- | ||
|[[#succeed|succeed/0]] | |[[#succeed|succeed/0]] | ||
|The predicate | |The predicate <vp>succeed/0</vp> will always succeed. | ||
|- | |||
|[[#toAny|toAny/1->]] | |||
|Converts the specified ''Term'' to the value of the universal term type <vp>any</vp>. | |||
|- | |- | ||
|[[#toBinary|toBinary/1->]] | |[[#toBinary|toBinary/1->]] | ||
Line 91: | Line 121: | ||
|- | |- | ||
|[[#toBoolean|toBoolean/1->]] | |[[#toBoolean|toBoolean/1->]] | ||
|The purpose of this meta-predicate is to convert the deterministic call (to a predicate or fact) to the procedure that returns the value of '' | |The purpose of this meta-predicate is to convert the deterministic call (to a predicate or fact) to the procedure that returns the value of <vp>boolean</vp> domain. | ||
|- | |||
|[[#toEllipsis|toEllipsis/1->]] | |||
|Creates the ''EllipsisBlock'' from the list of <vp>any</vp> type values. | |||
|- | |- | ||
|[[#toString|toString/1->]] | |[[#toString|toString/1->]] | ||
|Converts the specified ''Term'' to the string representation. | |Converts the specified ''Term'' to the string representation. | ||
|- | |- | ||
|[[#toTerm|toTerm/1->]] <br> [[#toTerm|toTerm/2->]] | |[[#toTerm|toTerm/1->]] <br> [[#toTerm|toTerm/2->]] | ||
|Converts the string/binary representation of the specified term ''SrcTerm'' into representation corresponding to the domain of ''PrologTerm'' variable of the return value. | |Converts the string/binary representation of the specified term ''SrcTerm'' into representation corresponding to the domain of ''PrologTerm'' variable of the return value. | ||
|- | |- | ||
Line 104: | Line 137: | ||
|[[#tryConvert|tryConvert/2->]] <vp>determ</vp> | |[[#tryConvert|tryConvert/2->]] <vp>determ</vp> | ||
|Checks whether the input term ''InputTerm'' can be strictly converted into the specified domain ''returnDomain'' and returns the converted term ''ReturnTerm''. | |Checks whether the input term ''InputTerm'' can be strictly converted into the specified domain ''returnDomain'' and returns the converted term ''ReturnTerm''. | ||
|- | |||
|[[#typeDescriptorOf|typeDescriptorOf/1->]] | |||
|Returns the <vp>typeDescriptor</vp> of a value. | |||
|- | |||
|[[#typeLibraryOf|typeLibraryOf/1->]] | |||
|Returns the <vp>typeLibrary</vp> of a value. | |||
|- | |- | ||
|[[#uncheckedConvert|uncheckedConvert/2->]] | |[[#uncheckedConvert|uncheckedConvert/2->]] | ||
Line 116: | Line 155: | ||
|- | |- | ||
| finally/2 | | finally/2 | ||
| Use <vp>try | | Use [[Language_Reference/Terms#try-finally| <vp>try-finally</vp>]] constuction instead. | ||
|- | |- | ||
| findall/3 | | findall/3 | ||
| Use list comprehension <vp>[ ... || ... ]</vp> instead | | Use list comprehension [[Language_Reference/Terms#List_Comprehension| <vp>[ ... || ... ]</vp>]] instead | ||
|- | |- | ||
| trap/3 <vp>determ</vp> | | trap/3 <vp>determ</vp> | ||
| Use <vp>try | | Use [[Language_Reference/Terms#try-catch| <vp>try-catch</vp>]] constuction instead. | ||
|} | |} | ||
==== and ==== | |||
See [[Language_Reference/Terms#and_.28.2C.29|and (,)]]. | |||
==== assert ==== | ==== assert ==== | ||
Line 131: | Line 174: | ||
Insert the specified fact at the end of the matched internal facts database | Insert the specified fact at the end of the matched internal facts database | ||
<vp>assert(Fact)</vp> inserts <vp>Fact</vp> in the matched internal facts database after any other stored facts for the corresponding database predicate. <vp>Fact</vp> must be a term belonging to the domain of an internal facts database. <vp>assert/1</vp> applied to a single fact changes the existing instance of a fact to the specified one. <vp>assert/1</vp> has the same effect as [[#assertz|assertz/1]]. See also [[#asserta|asserta/1]] | <vp>assert(Fact)</vp> inserts <vp>Fact</vp> in the matched internal facts database after any other stored facts for the corresponding database predicate. <vp>Fact</vp> must be a term belonging to the domain of an internal facts database. <vp>assert/1</vp> applied to a single fact changes the existing instance of a fact to the specified one. <vp>assert/1</vp> has the same effect as [[#assertz|assertz/1]]. See also [[#asserta|asserta/1]]. | ||
Notice that the combination of [[#retract|retract/1]] and <vp>assert/1</vp> like the following can lead to endless loop: | Notice that the combination of [[#retract|retract/1]] and <vp>assert/1</vp> like the following can lead to endless loop: | ||
Line 141: | Line 184: | ||
fail.</vip> | fail.</vip> | ||
The problem is that the retract in first line will eventually retract the fact asserted in the last line, because that fact is inserted | The problem is that the retract in first line will eventually retract the fact asserted in the last line, because that fact is inserted ''last'' in the fact chain. | ||
Exceptions: | |||
* Attempt to assert a second instance to a fact declared as determ. | |||
==== asserta ==== | ==== asserta ==== | ||
Line 152: | Line 195: | ||
Insert a fact at the beginning of the matched internal facts database. | Insert a fact at the beginning of the matched internal facts database. | ||
The <vp>asserta(Fact)</vp> predicate inserts a <vp>Fact</vp> in the matched internal facts database before any other stored facts for the corresponding predicate. The <vp>Fact</vp> must be a term belonging to the domain of an internal facts database. The <vp>asserta/1</vp> applied to a single fact changes the existing instance of a fact to the specified one. See also [[#assert|assert/1]] and [[#assertz|assertz/1]]. | The <vp>asserta(Fact)</vp> predicate inserts a <vp>Fact</vp> in the matched internal facts database before any other stored facts for the corresponding predicate. The <vp>Fact</vp> must be a term belonging to the domain of an internal facts database. The <vp>asserta/1</vp> applied to a single fact changes the existing instance of a fact to the specified one. See also [[#assert|assert/1]] and [[#assertz|assertz/1]]. | ||
Exceptions: | |||
* Attempt to a fact declared as determ, but the fact instance already exists. | |||
==== assertz ==== | ==== assertz ==== | ||
Line 172: | Line 213: | ||
Test whether the specified variable is bound to a value. | Test whether the specified variable is bound to a value. | ||
The <vp>bound(Variable)</vp> succeeds if <vp>Variable</vp> is bound and fails if it is free. The <vp>bound</vp> predicate is used to control flow patterns and to check the binding of reference variables. The <vp>bound</vp> predicate treats the specified <vp>Variable</vp> as bound if any of it's part is instantiated. | The <vp>bound(Variable)</vp> succeeds if <vp>Variable</vp> is bound and fails if it is free. The <vp>bound</vp> predicate is used to control flow patterns and to check the binding of reference variables. The <vp>bound</vp> predicate treats the specified <vp>Variable</vp> as bound if any of it's part is instantiated. | ||
Line 179: | Line 218: | ||
See also [[#free|free/1]]. | See also [[#free|free/1]]. | ||
==== | ==== class_name ==== | ||
<vip>class_Name : () -> string ClassName.</vip> | <vip>class_Name : () -> string ClassName.</vip> | ||
Line 189: | Line 228: | ||
<vip>compare : (A Left, A Right) -> compareResult CompareResult.</vip> | <vip>compare : (A Left, A Right) -> compareResult CompareResult.</vip> | ||
Comparison of two terms of the same domain. | Comparison of two terms of the same domain, resturns the value of [[#compareResult|compareResult]] domain. | ||
<vp>CompareResult</vp> = compare("<vp>bar</vp>", "<vp>foo</vp>") | |||
==== constant_name ==== | |||
<vip>constant_name : () -> string ConstantName.</vip> | |||
<vp> | This compile time predicate returns the string <vp>ConstantName</vp> that represents the name of the current constant. It is typically used in exception definitions. | ||
==== convert ==== | ==== convert ==== | ||
Line 204: | Line 243: | ||
Checked term conversion. | Checked term conversion. | ||
Call-template for this function is: | Call-template for this function is: | ||
Line 211: | Line 248: | ||
<vp>ReturnTerm</vp> = convert(returnDomain, <vp>InputTerm</vp>) | <vp>ReturnTerm</vp> = convert(returnDomain, <vp>InputTerm</vp>) | ||
''' | * <vpbnf>returnDomain</vpbnf>: Specifies a domain to which function <vp>convert/2-></vp> converts <vp>InputTerm</vp>. Here ''returnDomain'' must be a name of built-in Visual Prolog domain, an interface domain, a name of such user defined domain that is synonym to one of built-in Visual Prolog domains, a numeric domain, binary and pointer domains. The domain name ''returnDomain'' must be specified at compile-time, i.e. it cannot come from a variable. | ||
* <vpbnf><InputTerm></vpbnf>: Specifies the value that must be converted. <vp>InputTerm</vp> may be any Prolog term or an expression. If <vp>InputTerm</vp> is an expression, then it will be evaluated before the conversion. | |||
<vpbnf>< | * <vpbnf><ReturnTerm></vpbnf>: Returned parameter <vp>ReturnTerm</vp> will be of ''returnDomain'' type. | ||
The <vp>convert</vp> predicate performs a clean and genuine conversion of the given <vp>InputTerm</vp>, returning a new term <vp>ReturnTerm</vp> of the specified new domain ''returnDomain''. If <vp>convert</vp> cannot perform the required conversion, it rises errors. The similar functionality is provided by the [[#tryConvert|tryConvert/2->]] predicate, but <vp>tryConvert-></vp> fails and does not produce any runtime errors if it cannot perform the conversion. | The <vp>convert</vp> predicate performs a clean and genuine conversion of the given <vp>InputTerm</vp>, returning a new term <vp>ReturnTerm</vp> of the specified new domain ''returnDomain''. If <vp>convert</vp> cannot perform the required conversion, it rises errors. The similar functionality is provided by the [[#tryConvert|tryConvert/2->]] predicate, but <vp>tryConvert-></vp> fails and does not produce any runtime errors if it cannot perform the conversion. | ||
===== Allowed conversions ===== | |||
*Between numerical domains. | * Between numerical domains. | ||
*Between interface types. | * Between interface types. | ||
*Between [[#string|string]] and [[#symbol|symbol]] domains. | * Between [[#string|string]] and [[#symbol|symbol]] domains. | ||
*From [[#binary|binary]] to [[#pointer|pointer]]. | * From [[#binary|binary]] to [[#pointer|pointer]]. | ||
*For synonyms of mentioned domains. | * For synonyms of mentioned domains. | ||
*Between [http://wiki.visual-prolog.com/index.php?title=How_To_Remove_Reference_Domains_from_a_Project reference] domains and corresponding non-reference domains. | * Between [http://wiki.visual-prolog.com/index.php?title=How_To_Remove_Reference_Domains_from_a_Project reference] domains and corresponding non-reference domains. | ||
The contrast to these is [[#uncheckedConvert|uncheckedConvert/2->]] predicate, which performs an unchecked conversion between terms from any domains, which have the same bit-size. | The contrast to these is [[#uncheckedConvert|uncheckedConvert/2->]] predicate, which performs an unchecked conversion between terms from any domains, which have the same bit-size. | ||
Line 236: | Line 269: | ||
The <vp>convert/2-></vp> (or [[#tryConvert|tryConvert/2->]]) predicate accomplishes a checked explicit conversion, when the source and target domains are statically known during the compilation. The result of an explicit conversion can be one of the following: | The <vp>convert/2-></vp> (or [[#tryConvert|tryConvert/2->]]) predicate accomplishes a checked explicit conversion, when the source and target domains are statically known during the compilation. The result of an explicit conversion can be one of the following: | ||
*'''ok''' the successful conversion to the target domain; | * '''ok''' the successful conversion to the target domain; | ||
*'''run-time-check''' the conversion to the target domain with generation of run-time checking for compatibility; | * '''run-time-check''' the conversion to the target domain with generation of run-time checking for compatibility; | ||
*'''error''' the conversion is impossible, error output. | * '''error''' the conversion is impossible, error output. | ||
===== Rules of Checked Explicit Conversions ===== | |||
*Synonyms of domains are converted using the same rules that are applied to the domains themselves. | * Synonyms of domains are converted using the same rules that are applied to the domains themselves. | ||
*Numerical domains can be converted to the numerical domains only. | * Numerical domains can be converted to the numerical domains only. | ||
*Integral constants are the representatives of the anonymous integral domain: <vp>[const .. const]</vp>. | * Integral constants are the representatives of the anonymous integral domain: <vp>[const .. const]</vp>. | ||
*Real constants are the representatives of the anonymous real domain: <vp>digits</vp> <vp>dig [const .. const]</vp>, where <vp>dig</vp> is the number of the digits in mantissa without insignificant zeroes. | * Real constants are the representatives of the anonymous real domain: <vp>digits</vp> <vp>dig [const .. const]</vp>, where <vp>dig</vp> is the number of the digits in mantissa without insignificant zeroes. | ||
*A value of the symbol domain can be converted to the string domain and vice versa. | * A value of the symbol domain can be converted to the string domain and vice versa. | ||
*A value of binary domain can be converted to the pointer domain. | * A value of binary domain can be converted to the pointer domain. | ||
*The domains that are implicitly introduced for interfaces can be converted only to the interface domains according to the rules specified below. | * The domains that are implicitly introduced for interfaces can be converted only to the interface domains according to the rules specified below. | ||
*All other domains cannot be converted. | * All other domains cannot be converted. | ||
===== Conversions of Numerical Domains ===== | |||
*The range is considered first during such conversion. If the ranges of source and target do not intersect, then an error is produced. If the ranges of source and target only partially intersect, then run-time checking is generated. Also, if one of domains is real and another is an integral one, then the integer range is converted to the real range before the comparison. | * The range is considered first during such conversion. If the ranges of source and target do not intersect, then an error is produced. If the ranges of source and target only partially intersect, then run-time checking is generated. Also, if one of domains is real and another is an integral one, then the integer range is converted to the real range before the comparison. | ||
*When input term in real and output is integer, then <vp>convert/2-></vp> and [[#tryConvert|tryConvert/2->]] predicates truncate the input value to the nearest integer value, which is nearer to zero. | * When input term in real and output is integer, then <vp>convert/2-></vp> and [[#tryConvert|tryConvert/2->]] predicates truncate the input value to the nearest integer value, which is nearer to zero. | ||
===== Conversions of Interface Types ===== | |||
Predicate <vp>convert/2-></vp> allow to convert any object to any interface type. The actual correctness of such conversion is checked at runtime. When object is created, its type is internally stored, therefore when the object is passed as argument it still remember about its original type. This original type is used for checking allowed conversions. The example: | Predicate <vp>convert/2-></vp> allow to convert any object to any interface type. The actual correctness of such conversion is checked at runtime. When object is created, its type is internally stored, therefore when the object is passed as argument it still remember about its original type. This original type is used for checking allowed conversions. The example: | ||
Line 266: | Line 299: | ||
If object is created by class, which implements <vp>x</vp> interface, and then object is passed as parameter of type <vp>a</vp> to some predicate, then it is allowed to convert the object to <vp>b</vp> type. | If object is created by class, which implements <vp>x</vp> interface, and then object is passed as parameter of type <vp>a</vp> to some predicate, then it is allowed to convert the object to <vp>b</vp> type. | ||
Exceptions: | |||
*Check range error. | * Check range error. | ||
*Unsupported interface type. | * Unsupported interface type. | ||
==== digitsOf ==== | ==== digitsOf ==== | ||
Line 276: | Line 309: | ||
Returns precision of the specified floating-point domain. | Returns precision of the specified floating-point domain. | ||
Call-template for this function is: | Call-template for this function is: | ||
Line 291: | Line 322: | ||
<vip>errorExit : (unsigned ErrorNumber) erroneous.</vip> | <vip>errorExit : (unsigned ErrorNumber) erroneous.</vip> | ||
Performs a run-time error with the specified return code <vp>ErrorNumber</vp>, which can be used in the [[# | Performs a run-time error with the specified return code <vp>ErrorNumber</vp>, which can be used in the [[#try-catch-finally|try-catch-finally]]. | ||
==== fact_address ==== | |||
<vip>fact_address : (FactType FactVariable) -> pointerTo{FactType} PointerToFactVariable.</vip> | |||
The <vp>fact_address</vp> predicate returns the address (as a <vp>pointerTo{FactType}</vp>) of a fact variable <vp>FactVariable</vp> of type <vp>FactType</vp>. | |||
<vp>FactVariable</vp> '''''must''''' be a fact variable. | |||
==== fail ==== | ==== fail ==== | ||
Line 297: | Line 336: | ||
<vip>fail : () failure.</vip> | <vip>fail : () failure.</vip> | ||
The <vp>fail</vp> predicate forces failure and, hence, always causes backtracking. A clause that fails (with <vp>fail</vp> or for some other reason) cannot bind output arguments. | |||
The <vp>fail</vp> predicate forces failure | |||
==== free ==== | ==== free ==== | ||
Line 308: | Line 343: | ||
Check whether a variable is free. | Check whether a variable is free. | ||
Call-template for this predicate is: | Call-template for this predicate is: | ||
Line 318: | Line 351: | ||
See also [[#bound|bound/1]]. | See also [[#bound|bound/1]]. | ||
==== fromEllipsis ==== | |||
<vip>fromEllipsis : (...) -> any* AnyTermList.</vip> | |||
This predicate creates the list of terms of the universal type <vp>any</vp> from the ''EllipsisBlock'' '''...''' (i.e. from the special varying parameters block). | |||
Call-template for this function is: | |||
<vip>AnyTermList = fromEllipsis(EllipsisBlock )</vip> | |||
See also [[#toEllipsis|toEllipsis/1->]]. | |||
==== hasDomain ==== | ==== hasDomain ==== | ||
<vip>hasDomain : (<type> Type, | <vp>hasDomain</vp> is not really a predicate, but more a type declaration/restriction. It has two forms a non-function for declaring/restricting the type of a variable and a function form for declaring/restricting the type of a value. | ||
The non-function form is called with a type as first parmeter and a variable as second parameter. | |||
<vip>hasDomain : (<type> Type, Type Variable).</vip> | |||
The only effect of the call is that the <vp>Variable</vp> will be restricted to the type <vp>Type</vp>. | |||
The variable can be free, bound or of some mixed flow and the binding of the variable will not change in any way. | |||
The function form is called with a type as first argument and a value as second argument, and it returns the same value. | |||
<vip>hasDomain( | <vip>hasDomain : (<type> Type, Type Value) -> Type Value.</vip> | ||
The | The only effect of the call is to ensure that the <vp>Value</vp> will be restricted to the type <vp>Type</vp>. | ||
==== lowerBound ==== | ==== lowerBound ==== | ||
Line 338: | Line 387: | ||
Returns the lower bound of the specified <vp>NumericDomain</vp>. | Returns the lower bound of the specified <vp>NumericDomain</vp>. | ||
Call-template for this function is: | Call-template for this function is: | ||
Line 347: | Line 394: | ||
The <vp>lowerBound</vp> is a compiling-time predicate. The <vp>lowerBound</vp> returns the lower bound value <vp>LowerBoundValue</vp> of the specified numeric domain ''domainName''. The return value <vp>LowerBoundValue</vp> belongs to the same domain ''domainName''. The ''domainName'' parameter should be the name of any numerical domain; this domain name should be explicitly specified at compile-time (that is, ''domainName'' cannot come from a variable). See also [[#upperBound|upperBound/1->]]. | The <vp>lowerBound</vp> is a compiling-time predicate. The <vp>lowerBound</vp> returns the lower bound value <vp>LowerBoundValue</vp> of the specified numeric domain ''domainName''. The return value <vp>LowerBoundValue</vp> belongs to the same domain ''domainName''. The ''domainName'' parameter should be the name of any numerical domain; this domain name should be explicitly specified at compile-time (that is, ''domainName'' cannot come from a variable). See also [[#upperBound|upperBound/1->]]. | ||
'' | It will give a compile time error if the specified domain ''domainName'' is not numeric domain. | ||
==== in ==== | |||
See [[Language_Reference/Terms#in|in/2]]. | |||
==== isErroneous ==== | ==== isErroneous ==== | ||
Line 356: | Line 405: | ||
The predicate succeeds if the specified fact variable is <vp>erroneous</vp>. | The predicate succeeds if the specified fact variable is <vp>erroneous</vp>. | ||
Call-template for this predicate is: | Call-template for this predicate is: | ||
Line 364: | Line 411: | ||
The predicate succeeds if the specified fact variable <vp>factVariableName</vp> has the <vp>erroneous</vp> value, otherwise it fails. | The predicate succeeds if the specified fact variable <vp>factVariableName</vp> has the <vp>erroneous</vp> value, otherwise it fails. | ||
See also [[#notErroneous|notErroneous]]. | |||
==== maxDigits ==== | ==== maxDigits ==== | ||
Line 369: | Line 418: | ||
<vip>maxDigits : (<real-domain> RealDomain) -> unsigned MaxDigits</vip> | <vip>maxDigits : (<real-domain> RealDomain) -> unsigned MaxDigits</vip> | ||
Retrieves the value of digits (precision) of the basic domain corresponding to the specified floating-point domain | Retrieves the value of digits (precision) of the basic domain corresponding to the specified floating-point domain <vp>RealDomain</vp>. | ||
Call-template for this function is: | Call-template for this function is: | ||
Line 381: | Line 428: | ||
==== not ==== | ==== not ==== | ||
See [[Language_Reference/Terms#not|not]]. | |||
==== notErroneous ==== | |||
The <vp>notErroneous/1-></vp> predicate will succeed with the value of a fact if the fact is not erroneous. The main purpose of the predicate is to get an atomic view of the fact in a multi-threaded application. | |||
{{Example| | |||
<vip> | |||
facts | |||
theFact : integer := erroneous. | |||
clauses | |||
ppp() :- | |||
if F = notErroneous(theFact) then | |||
% theFact was not erroneous, its value was F | |||
end if. | |||
</vip> | |||
The related code using <vp>isErroneous/1</vp> is not threadsafe: | |||
<vip> | |||
clauses | |||
ppp() :- | |||
if not(isErroneous(theFact)) then | |||
% theFact was not erroneous, but it can be in the next line | |||
F = theFact | |||
end if. | |||
</vip> | |||
}} | |||
See also [[#isErroneous|isErroneous]]. | |||
==== otherwise ==== | |||
See {{Lang2|Terms|otherwise|otherwise}}. | |||
==== or ==== | |||
See [[Language_Reference/Terms#or_.28.3B.29|or (;)]]. | |||
==== orelse ==== | |||
See [[Language_Reference/Terms#orelse|orelse]]. | |||
==== predicate_fullname ==== | ==== predicate_fullname ==== | ||
Line 399: | Line 475: | ||
This predicate returns the name <vp>PredicateFullName</vp> of the predicate in which it is invoked. The returned predicate name is qualified with a scope name. | This predicate returns the name <vp>PredicateFullName</vp> of the predicate in which it is invoked. The returned predicate name is qualified with a scope name. | ||
<vp>predicate_fullname</vp> can only be used inside a clause. Use of <vp>predicate_fullname</vp> in other places causes a compile time error. See also [[#predicate_name|predicate_name]]. | |||
<vp>predicate_fullname</vp> can be used | |||
==== predicate_name ==== | ==== predicate_name ==== | ||
Line 409: | Line 483: | ||
This predicate returns the name <vp>PredicateName</vp> of the predicate in which it is invoked. | This predicate returns the name <vp>PredicateName</vp> of the predicate in which it is invoked. | ||
<vp>predicate_name</vp> can only be used inside a clause. Use of <vp>predicate_name</vp> in other places causes a compile time error. See also [[#predicate_fullname|predicate_fullname]] | |||
==== programPoint ==== | |||
<vip>programPoint : () -> core::programPoint ProgramPoint.</vip> | |||
This predicate returns the name <vp>programPoint</vp> corresponding to the place where it is invoked. | |||
==== retract ==== | ==== retract ==== | ||
Line 418: | Line 496: | ||
Successively removes the first matching fact from the facts database. Fails when no more facts match. | Successively removes the first matching fact from the facts database. Fails when no more facts match. | ||
Call-template for this predicate is: | Call-template for this predicate is: | ||
Line 438: | Line 514: | ||
See also [[#retractall|retractall/1]] and [[#retractFactDb|retractFactDb]]. | See also [[#retractall|retractall/1]] and [[#retractFactDb|retractFactDb]]. | ||
The <vp>retract/1</vp> predicate cannot be applied to single facts or fact variables. | The <vp>retract/1</vp> predicate cannot be applied to single facts or fact variables. | ||
Line 450: | Line 524: | ||
Remove all matching facts from the facts database. | Remove all matching facts from the facts database. | ||
Call-template for this predicate is: | Call-template for this predicate is: | ||
Line 459: | Line 531: | ||
Here <vp>FactTemplate</vp> should be a fact term. | Here <vp>FactTemplate</vp> should be a fact term. | ||
The <vp>retractall/1</vp> retracts all | The <vp>retractall/1</vp> retracts all facts which match the given ''FactTemplate''. It always succeeds, even if no facts were retracted. | ||
Attempting to retract a <vp>single</vp> fact will cause a compile time error. | |||
It is not possible to obtain any output values from <vp>retractall/1</vp>. For this reason, the variables in the call must be bound or be single underscores (anonymous). Notice that <vp>FactTemplate</vp> can have any level of instantiation, but free variables must be single underscores ("unconditionally anonymous"). In difference to [[#retract|retract/1]] "conditionally" anonymous variables with names starting from the underscore (like <vp>_AnyValue</vp>) cannot be used in <vp>retractall/1</vp>. | It is not possible to obtain any output values from <vp>retractall/1</vp>. For this reason, the variables in the call must be bound or be a single underscores (anonymous). Notice that <vp>FactTemplate</vp> can have any level of instantiation, but free variables must be single underscores ("unconditionally anonymous"). In difference to [[#retract|retract/1]] "conditionally" anonymous variables with names starting from the underscore (like <vp>_AnyValue</vp>) cannot be used in <vp>retractall/1</vp>. | ||
See also [[#retract|retract/1]] and [[#retractFactDb|retractFactDb/1]]. | See also [[#retract|retract/1]] and [[#retractFactDb|retractFactDb/1]]. | ||
Line 472: | Line 544: | ||
Remove all facts from the named internal facts database <vp>FactDB</vp>. | Remove all facts from the named internal facts database <vp>FactDB</vp>. | ||
Call-template for this predicate is: | Call-template for this predicate is: | ||
Line 485: | Line 555: | ||
See also [[#retractall|retractall/1]] and [[#retract|retract/1]]. | See also [[#retractall|retractall/1]] and [[#retract|retract/1]]. | ||
==== | ==== retractAll/2 ==== | ||
Obsolete predicate! Use [[#retractFactDb|retractFactDb/1]] instead. | Obsolete predicate! Use [[#retractFactDb|retractFactDb/1]] instead. | ||
Line 494: | Line 564: | ||
Retrieves the number of bits occupied in memory by an entity of the specified domain <vp>DomainName</vp>. | Retrieves the number of bits occupied in memory by an entity of the specified domain <vp>DomainName</vp>. | ||
Call-template for this function is: | Call-template for this function is: | ||
Line 511: | Line 579: | ||
==== sizeOf ==== | ==== sizeOf ==== | ||
<vip>sizeOf : ( | <vip>sizeOf : (Type Term) -> integer ByteSize.</vip> | ||
Retrieves the number of bytes occupied in memory by the specified term <vp>Term</vp>. | Retrieves the number of bytes occupied in memory by the specified term <vp>Term</vp>. | ||
Call-template for this function is: | Call-template for this function is: | ||
Line 521: | Line 587: | ||
<vip>ByteSize = sizeOf(Term)</vip> | <vip>ByteSize = sizeOf(Term)</vip> | ||
The <vp>sizeOf/1-></vp> function receives a term as input parameter and returns | The <vp>sizeOf/1-></vp> function receives a term as input parameter and returns value <vp>ByteSize</vp> that specifies the number of bytes occupied in memory by this term <vp>Term</vp>. | ||
==== sizeOfDomain ==== | ==== sizeOfDomain ==== | ||
<vip>sizeOfDomain : (<domain> Domain) -> | <vip>sizeOfDomain : (<domain> Domain) -> integer ByteSize.</vip> | ||
Retrieves the number of bytes occupied in memory by the entity of the specified domain <vp>DomainName</vp>. | Retrieves the number of bytes occupied in memory by the entity of the specified domain <vp>DomainName</vp>. | ||
Call-template for this function is: | Call-template for this function is: | ||
Line 535: | Line 599: | ||
<vip>ByteSize = sizeOfDomain(DomainName)</vip> | <vip>ByteSize = sizeOfDomain(DomainName)</vip> | ||
This compiling-time predicate receives the domain <vp>DomainName</vp> as input parameter and return the size of memory that is occupied by the entity of the given domain. The result is measured in bytes. The returned value <vp>ByteSize</vp> belongs to the | This compiling-time predicate receives the domain <vp>DomainName</vp> as input parameter and return the size of memory that is occupied by the entity of the given domain. The result is measured in bytes. The returned value <vp>ByteSize</vp> belongs to the integer domain. Compare with [[#sizeBitsOf|sizeBitsOf/1->]], which returns size of a domain measured in bits. | ||
==== sourcefile_lineno ==== | ==== sourcefile_lineno ==== | ||
Line 542: | Line 606: | ||
Returns the current line number in the source file processed by the compiler. | Returns the current line number in the source file processed by the compiler. | ||
==== sourcefile_name ==== | ==== sourcefile_name ==== | ||
Line 552: | Line 612: | ||
Returns the name of the source file processed by the compiler. | Returns the name of the source file processed by the compiler. | ||
==== sourcefile_timestamp ==== | ==== sourcefile_timestamp ==== | ||
Line 561: | Line 617: | ||
<vip>sourcefile_timestamp : () -> string TimeStamp..</vip> | <vip>sourcefile_timestamp : () -> string TimeStamp..</vip> | ||
Returns | Returns a string that represents the date and time of the currently compiled source file in format <b>YYYY-MM-DD HH:mm:ss</b>. Where: | ||
* <b>YYYY</b> - Year. | |||
* <b>MM</b> - Month. | |||
* <b>DD</b> - Day. | |||
* <b>HH</b> - Hour. | |||
* <b>mm</b> - Minute. | |||
* <b>ss</b> - Second. | |||
==== succeed ==== | |||
< | <vip>succeed : ().</vip> | ||
<vp> | The predicate <vp>succeed/0</vp> will always succeed. | ||
==== toAny ==== | |||
< | <vip>toAny : (Term) -> any UniversalTypeValue.</vip> | ||
<vp> | Converts the specified <vp>Term</vp> to the value of universal term type <vp>any</vp>. | ||
Call-template for this function is: | |||
<vip>UniversalTypeValue = toAny(Term)</vip> | |||
<vip> | |||
A term of the <vp>any</vp> domain can be converted back to its original type using the <vp>toTerm</vp> predicates (see {{lang2|Built-in entities/Predicates|toTerm|toTerm}}). | |||
==== toBinary ==== | ==== toBinary ==== | ||
Line 594: | Line 649: | ||
Converts the specified <vp>Term</vp> to [[#binary|binary]] representation. | Converts the specified <vp>Term</vp> to [[#binary|binary]] representation. | ||
Call-template for this function is: | Call-template for this function is: | ||
Line 605: | Line 658: | ||
==== toBoolean ==== | ==== toBoolean ==== | ||
<vip>toBoolean : (< | <vip>toBoolean : (<deterministic_expression> SubGoal) -> boolean Succeed.</vip> | ||
The purpose of this meta-predicate is to convert | The purpose of this meta-predicate is to convert an expression to the value of boolean domain. | ||
Call-template for this meta-predicate is: | |||
<vip>True_or_False = toBoolean(deterministic_expression)</vip> | |||
this is equivalent to | |||
<vip>True_or_False = | <vip>True_or_False = if deterministic_expression then true else false end if</vip> | ||
The <vp>toBoolean/1-></vp> meta-predicate returns [[#boolean|boolean]] value. The result is <vp>true</vp> if ''deterministic_call'' succeeds. The result is <vp>false</vp> if ''deterministic_call'' fails. | The <vp>toBoolean/1-></vp> meta-predicate returns [[#boolean|boolean]] value. The result is <vp>true</vp> if ''deterministic_call'' succeeds. The result is <vp>false</vp> if ''deterministic_call'' fails. | ||
==== toEllipsis ==== | |||
<vip>toEllipsis : (any* AnyTermList) -> ....</vip> | |||
This predicate creates ''EllipsisBlock'' '''...''' (i.e. the special varying parameters block) from the list of terms of the universal type <vp>any</vp>. Such ''EllipsisBlock'' can be later passed to a predicate which expects the varying number of arguments (i.e. is declared with the ellipsis (''...'')), like <vp>write/...</vp>, at the position of the ellipsis (''...''). | |||
Call-template for this function is: | |||
<vip>EllipsisBlock = toEllipsis(<any_term_list>), write(EllipsisBlock)</vip> | |||
See also [[#fromEllipsis|fromEllipsis/1->]]. | |||
==== toString ==== | ==== toString ==== | ||
Line 622: | Line 689: | ||
Converts the specified <vp>Term</vp> to string representation. | Converts the specified <vp>Term</vp> to string representation. | ||
Call-template for this function is: | Call-template for this function is: | ||
Line 635: | Line 700: | ||
<vip>toTerm : (string Serialized) -> Term. | <vip>toTerm : (string Serialized) -> Term. | ||
toTerm : (binary Serialized) -> Term. | toTerm : (binary Serialized) -> Term. | ||
toTerm : (any Serialized) -> Term. | |||
toTerm : (<domain> Type, string Serialized) -> Term. | toTerm : (<domain> Type, string Serialized) -> Term. | ||
toTerm : (<domain> Type, binary Serialized) -> Term.</vip> | toTerm : (<domain> Type, binary Serialized) -> Term. | ||
toTerm : (<domain> Type, any Serialized) -> Term.</vip> | |||
Converts the string/binary representation of the specified term <vp>Serialized</vp> into representation corresponding to the domain of <vp>Term</vp> variable of the return value. The domain can be stated explicitly or it can be left to the compiler to determine a suitable domain. | Converts the string/binary/any representation of the specified term <vp>Serialized</vp> into representation corresponding to the domain of <vp>Term</vp> variable of the return value. The domain can be stated explicitly or it can be left to the compiler to determine a suitable domain. | ||
Call-template for this function is: | Call-template for this function is: | ||
Line 647: | Line 712: | ||
Term = toTerm(domainName, Serialized) % with explicit domain, domainName</vip> | Term = toTerm(domainName, Serialized) % with explicit domain, domainName</vip> | ||
If the domain is not specified the compiler must be able to determine the domain for the returned value <vp>Term</vp> at compile-time. Notice that binary version of <vp>toTerm</vp> predicate performs almost byte to byte conversion and only checking general compatibility of <vp>Serialized</vp> data with the domain required to the return value <vp>Term</vp>. The programmer is wholly responsible for providing binary data of <vp>Serialized</vp> that can be correctly converted to the term of the desired domain. The <vp>toTerm</vp> predicates are counterparts to predicates [[#toBinary|toBinary/1->]] and [[#toString|toString/1->]]. When a ''Term'' (of some domain ''domainName'') is converted into a binary or string representation <vp>Serialized</vp> (by [[#toBinary|toBinary/1->]] or [[#toString|toString/1->]] correspondingly), it can safely be stored in a file or sent over a network to another program. Later the corresponding <vp>toTerm/1</vp>-> function can convert the obtained string/binary value <vp>Serialized</vp> back to a Visual Prolog term <vp>Term</vp>. For correctness of the reverse conversion the domain of the clause variable <vp>Term</vp> should be adequate to the initial domain ''domainName''. | If the domain is not specified the compiler must be able to determine the domain for the returned value <vp>Term</vp> at compile-time. Notice that binary version of <vp>toTerm</vp> predicate performs almost byte to byte conversion and only checking general compatibility of <vp>Serialized</vp> data with the domain required to the return value <vp>Term</vp>. The programmer is wholly responsible for providing binary data of <vp>Serialized</vp> that can be correctly converted to the term of the desired domain. The <vp>toTerm</vp> predicates are counterparts to predicates [[#toBinary|toBinary/1->]] and [[#toString|toString/1->]]. When a ''Term'' (of some domain ''domainName'') is converted into a binary or string representation <vp>Serialized</vp> (by [[#toBinary|toBinary/1->]] or [[#toString|toString/1->]] or [[#toAny|toAny/1->]] correspondingly), it can safely be stored in a file or sent over a network to another program. Later the corresponding <vp>toTerm/1</vp>-> function can convert the obtained string/binary value <vp>Serialized</vp> back to a Visual Prolog term <vp>Term</vp>. For correctness of the reverse conversion the domain of the clause variable <vp>Term</vp> should be adequate to the initial domain ''domainName''. | ||
See also [[#tryToTerm|tryToTerm]]. | See also [[#tryToTerm|tryToTerm]]. | ||
It gives a compile time error if the compiler cannot determine the return domain. | |||
Exceptions | |||
Run time errors are generated when the <vp>toTerm</vp> predicate cannot convert the string or binary into a term of the specified domain. | * Run time errors are generated when the <vp>toTerm</vp> predicate cannot convert the string or binary into a term of the specified domain. | ||
==== tryToTerm ==== | ==== tryToTerm ==== | ||
<vip>tryToTerm : (string Serialized)-> Term | <vip>tryToTerm : (string Serialized) -> Term. | ||
tryToTerm : (binary Serialized)-> Term | tryToTerm : (binary Serialized) -> Term. | ||
tryToTerm : (any Serialized) -> Term. | |||
tryToTerm : (<domain> Type, string Serialized) -> Term. | |||
tryToTerm : (<domain> Type, binary Serialized) -> Term. | |||
tryToTerm : (<domain> Type, any Serialized) -> Term.</vip> | |||
Converts the string/binary representation <vp>Serialized</vp> into a term <vp>Term</vp> like [[#toTerm|toTerm]]. The only difference between the predicates is that <vp>tryToTerm</vp> fails if it cannot convert the string or binary into a term of the specified domain whereas toTerm raises an exception. | Converts the string/binary/any representation <vp>Serialized</vp> into a term <vp>Term</vp> like [[#toTerm|toTerm]]. The only difference between the predicates is that <vp>tryToTerm</vp> fails if it cannot convert the string or binary or any into a term of the specified domain whereas toTerm raises an exception. | ||
See also [[#toTerm|toTerm]]. | See also [[#toTerm|toTerm]]. | ||
Line 668: | Line 738: | ||
==== tryConvert ==== | ==== tryConvert ==== | ||
<vip>tryConvert : (<type> Type, Value) | <vip>tryConvert : (<type> Type, Value) -> <type> Converted determ.</vip> | ||
Checks whether the input term <vp>Value</vp> can be strictly converted into the specified domain <vp>Type</vp> and returns the converted term <vp>Converted</vp>. | |||
Call-template for this function is: | Call-template for this function is: | ||
Line 678: | Line 746: | ||
<vip>ReturnTerm = tryConvert(returnDomain, InputTerm)</vip> | <vip>ReturnTerm = tryConvert(returnDomain, InputTerm)</vip> | ||
Arguments: | |||
<vpbnf><ReturnTerm></vpbnf>: Returned term <vp>ReturnTerm</vp> will be of ''returnDomain'' domain. | * <vp>returnDomain</vp>: Specifies a domain to which <vp>tryConvert/2-></vp> predicate tries to convert the specified <vp>InputTerm</vp>. Here ''returnDomain'' can be any domain accessible in the current scope. The domain name ''returnDomain'' must be specified at compile-time, i.e. it cannot come from a variable. | ||
* <vpbnf><InputTerm></vpbnf>: Specifies the term that must be converted. <vp>InputTerm</vp> may be any Prolog term or an expression. If <vp>InputTerm</vp> is an expression, then it will be evaluated before conversion. | |||
* <vpbnf><ReturnTerm></vpbnf>: Returned term <vp>ReturnTerm</vp> will be of ''returnDomain'' domain. | |||
The conversion rules are the same as of the embedded predicate [[#convert|convert/2->]], but <vp>tryConvert/2-></vp> fails when [[#convert|convert/2->]] generates conversion errors. | The conversion rules are the same as of the embedded predicate [[#convert|convert/2->]], but <vp>tryConvert/2-></vp> fails when [[#convert|convert/2->]] generates conversion errors. | ||
Line 696: | Line 759: | ||
See also [[#uncheckedConvert|uncheckedConvert/2->]]. | See also [[#uncheckedConvert|uncheckedConvert/2->]]. | ||
==== typeDescriptorOf ==== | |||
<vip>typeDescriptorOf : (<type> Type) -> typeDescriptor TypeDescriptor. | |||
typeDescriptorOf : (Type Value) -> typeDescriptor TypeDescriptor.</vip> | |||
Reflection predicate that returns the <vp>typeDescriptor</vp> of a type or a value. | |||
A <vp>typeDescriptor</vp> is the reflection descriptor of an uninstantiated type/domain. | |||
==== typeLibraryOf ==== | |||
<vip>typeLibraryOf : (<type> Type) -> typeLibrary TypeLibrary. | |||
typeLibraryOf : (Type Value) -> typeLibrary TypeLibrary.</vip> | |||
Reflection predicate that returns the <vp>typeLibrary</vp> of a type or a value. | |||
A <vp>typeLibrary</vp> is the reflection descriptor of an instantiated type/domain. | |||
==== uncheckedConvert ==== | ==== uncheckedConvert ==== | ||
Line 702: | Line 783: | ||
Unchecked conversion of a value to another type. | Unchecked conversion of a value to another type. | ||
Call-template for this function is: | Call-template for this function is: | ||
Line 709: | Line 788: | ||
<vip>ReturnTerm = uncheckedConvert(returnDomain, InputTerm)</vip> | <vip>ReturnTerm = uncheckedConvert(returnDomain, InputTerm)</vip> | ||
Arguments: | |||
* <vp>returnDomain</vp>: Specifies a domain to which <vp>uncheckedConvert</vp> predicate unsafely converts the specified <vp>InputTerm</vp>. Here ''returnDomain'' can be any domain accessible in the current scope, the <vp>ReturnTerm</vp> should has the same bit-size as the <vp>InputTerm</vp>. The domain name ''returnDomain'' must be specified at compile-time, i.e. it cannot come from a variable. | |||
* <vpbnf><InputTerm></vpbnf>: Specifies the value that must be converted. <vp>InputTerm</vp> may be any Prolog term or an expression. If ''InputTerm'' is an expression, then it will be evaluated before conversion. | |||
* <vpbnf><ReturnTerm></vpbnf>: Returned parameter <vp>ReturnTerm</vp> will be of ''returnDomain'' type. | |||
<vp>uncheckedConvert</vp> evaluates <vp>InputTerm</vp>, change the type to ''returnDomain'' without any modification of the memory pattern and unifies with <vp>ReturnTerm</vp>. The <vp>uncheckedConvert</vp> predicate performs no runtime checks. It makes only compile time checking of bit-size equality of the converted domains. So almost any term may be quite recklessly converted to any other term. So quite disastrous results may occur if you try to use variables incorrectly converted by <vp>uncheckedConvert</vp>. Be extremely careful implementing <vp>uncheckedConvert</vp>; we strongly recommend you always, when it is possible, using of [[#convert|convert/2->]] and [[#tryConvert|tryConvert/2->]]. But notice that, when an object is returned by COM system it is necessary to convert it by <vp>uncheckedConvert</vp>, as Prolog program does not have information about its actual type. | |||
==== upperBound ==== | ==== upperBound ==== | ||
<vip>upperBound : (<numeric-domain> NumericDomain) -> < | <vip>upperBound : (<numeric-domain> NumericDomain) -> <numeric-domain> UpperBound.</vip> | ||
Returns the upper bound value of the specified numeric domain. | Returns the upper bound value of the specified numeric domain. | ||
Call-template for this function is: | Call-template for this function is: | ||
Line 739: | Line 810: | ||
See also [[#lowerBound|lowerBound/1->]]. | See also [[#lowerBound|lowerBound/1->]]. | ||
Will cause a compile time error if the specified domain ''domainName'' is not numeric domain. | |||
<noinclude>{{LanguageReferenceSubarticle|Built-in entities/Predicates}}</noinclude> | |||
compile time error if the specified domain ''domainName'' is not numeric domain. | |||
<noinclude> |
Latest revision as of 11:55, 31 May 2022
and/2 ,/2 |
Term "and" |
assert/1 | Insert the specified fact at the end of the matched internal facts database. |
asserta/1 | Insert a fact at the beginning of the matched internal facts database. |
assertz/1 | Insert a fact at the end of the matched internal facts database. |
bound/1 determ | Test whether the specified variable is bound to a value. |
class_name/0-> | This compile time predicate returns the string ClassName that represents the name of the current interface or class. |
compare/2-> | Returns the result of the variables' comparison. |
constant_name/0-> | This compile time predicate returns the string ConstantName that represents the name of the current constant. Typically used in execepion definitions. |
convert/2-> | Checked term conversion. |
digitsOf/1-> | Returns precision of the specified floating-point domain. |
errorExit/1 erroneous | Performs a run-time error with the specified return code ErrorNumber and sets the internal error information. |
fact_address/1-> | Returns the address of a fact variable. |
fail/0 failure | Invoke backtracking. |
free/1 determ | Check whether a variable is free. |
fromEllipsis/1-> | Creates the list of terms of the universal type any from the EllipsisBlock. |
hasDomain/2 hasDomain/2-> |
Declares/restricts the type of a variable or value. |
in/2 determ in/2 nondeterm |
Infix operator "in" (in-test and in-iterator). |
isErroneous/1 determ | Returns the lower bound value of the specified numeric domain. |
lowerBound/1-> | Returns the lower bound value of the specified numeric domain. |
maxDigits/1-> | Retrieves the value of digits (precision) of the basic domain corresponding to the specified floating-point domain domainName. |
not/1 determ | Negate the result (success/fail) of subgoal. |
otherwise/2 | Infix expression operator providing a value when a determ expression fails |
or/2 ;/2 |
Nondeterministic term "or" |
orelse | Deterministic term "or" |
predicate_fullname/1-> | This compile time predicate returns the string PredicateFullName that represent the name of the predicate in which clause body predicate_name is called. The returned predicate name is qualified with a scope name. |
predicate_name/1-> | This compile time predicate returns the string PredicateName that represent the name of the predicate in which clause body predicate_name is called. The returned predicate name is not qualified with a scope name. |
programPoint/0-> | This compile time predicate returns the programPoint corresponding to the place where it is called. |
retract/1 nondeterm | Remove a matched fact from the matched internal facts database. |
retractall/1 | Remove all matching facts from the matched internal facts database. |
retractFactDb/1 | Remove all facts from the specified named internal facts database. |
sizeBitsOf/1-> | Retrieves the number of bits occupied in memory by an entity of the specified domain DomainName. |
sizeOf/1-> | Retrieves the number of bytes occupied in memory by the specified term. |
sizeOfDomain/1-> | Retrieves the number of bytes occupied in memory by the entity of the specified domain DomainName. |
sourcefile_lineno/0-> | Returns the current line number in the source file processed by the compiler . |
sourcefile_name/0-> | Returns the name of the source file processed by the compiler. |
sourcefile_timestamp/0-> | Returns the string representing the date and time of the source file processed by the compiler. |
succeed/0 | The predicate succeed/0 will always succeed. |
toAny/1-> | Converts the specified Term to the value of the universal term type any. |
toBinary/1-> | Converts the specified Term to the binary representation. |
toBoolean/1-> | The purpose of this meta-predicate is to convert the deterministic call (to a predicate or fact) to the procedure that returns the value of boolean domain. |
toEllipsis/1-> | Creates the EllipsisBlock from the list of any type values. |
toString/1-> | Converts the specified Term to the string representation. |
toTerm/1-> toTerm/2-> |
Converts the string/binary representation of the specified term SrcTerm into representation corresponding to the domain of PrologTerm variable of the return value. |
tryToTerm/1-> determ tryToTerm/2-> determ |
Converts the string/binary representation of the specified term SrcTerm into representation corresponding to the domain of PrologTerm variable of the return value. |
tryConvert/2-> determ | Checks whether the input term InputTerm can be strictly converted into the specified domain returnDomain and returns the converted term ReturnTerm. |
typeDescriptorOf/1-> | Returns the typeDescriptor of a value. |
typeLibraryOf/1-> | Returns the typeLibrary of a value. |
uncheckedConvert/2-> | Unchecked conversion of domains. |
upperBound/1-> | Returns the upper bound value of the specified numeric domain. |
The following predicates are deprecated:
finally/2 | Use try-finally constuction instead. |
findall/3 | Use list comprehension [ ... || ... ] instead |
trap/3 determ | Use try-catch constuction instead. |
and
See and (,).
assert
assert : (<fact-term> FactTerm).
Insert the specified fact at the end of the matched internal facts database
assert(Fact) inserts Fact in the matched internal facts database after any other stored facts for the corresponding database predicate. Fact must be a term belonging to the domain of an internal facts database. assert/1 applied to a single fact changes the existing instance of a fact to the specified one. assert/1 has the same effect as assertz/1. See also asserta/1.
Notice that the combination of retract/1 and assert/1 like the following can lead to endless loop:
loop() :- retract(fct(X)), ... % creating Y from X assert(fct(Y)), fail.
The problem is that the retract in first line will eventually retract the fact asserted in the last line, because that fact is inserted last in the fact chain.
Exceptions:
- Attempt to assert a second instance to a fact declared as determ.
asserta
asserta : (<fact-term> FactTerm).
Insert a fact at the beginning of the matched internal facts database.
The asserta(Fact) predicate inserts a Fact in the matched internal facts database before any other stored facts for the corresponding predicate. The Fact must be a term belonging to the domain of an internal facts database. The asserta/1 applied to a single fact changes the existing instance of a fact to the specified one. See also assert/1 and assertz/1.
Exceptions:
- Attempt to a fact declared as determ, but the fact instance already exists.
assertz
assertz : (<fact-term> FactTerm).
assertz does exactly the same as the assert/1 predicate.
bound
bound : (<variable> Variable) determ.
Test whether the specified variable is bound to a value.
The bound(Variable) succeeds if Variable is bound and fails if it is free. The bound predicate is used to control flow patterns and to check the binding of reference variables. The bound predicate treats the specified Variable as bound if any of it's part is instantiated.
See also free/1.
class_name
class_Name : () -> string ClassName.
This compile time predicate returns the string ClassName that represents the name of the current interface or class.
compare
compare : (A Left, A Right) -> compareResult CompareResult.
Comparison of two terms of the same domain, resturns the value of compareResult domain.
CompareResult = compare("bar", "foo")
constant_name
constant_name : () -> string ConstantName.
This compile time predicate returns the string ConstantName that represents the name of the current constant. It is typically used in exception definitions.
convert
convert : (<type> Type, Term) -> <type> Converted.
Checked term conversion.
Call-template for this function is:
ReturnTerm = convert(returnDomain, InputTerm)
- returnDomain: Specifies a domain to which function convert/2-> converts InputTerm. Here returnDomain must be a name of built-in Visual Prolog domain, an interface domain, a name of such user defined domain that is synonym to one of built-in Visual Prolog domains, a numeric domain, binary and pointer domains. The domain name returnDomain must be specified at compile-time, i.e. it cannot come from a variable.
- InputTerm: Specifies the value that must be converted. InputTerm may be any Prolog term or an expression. If InputTerm is an expression, then it will be evaluated before the conversion.
- ReturnTerm: Returned parameter ReturnTerm will be of returnDomain type.
The convert predicate performs a clean and genuine conversion of the given InputTerm, returning a new term ReturnTerm of the specified new domain returnDomain. If convert cannot perform the required conversion, it rises errors. The similar functionality is provided by the tryConvert/2-> predicate, but tryConvert-> fails and does not produce any runtime errors if it cannot perform the conversion.
Allowed conversions
- Between numerical domains.
- Between interface types.
- Between string and symbol domains.
- From binary to pointer.
- For synonyms of mentioned domains.
- Between reference domains and corresponding non-reference domains.
The contrast to these is uncheckedConvert/2-> predicate, which performs an unchecked conversion between terms from any domains, which have the same bit-size.
The convert/2-> (or tryConvert/2->) predicate accomplishes a checked explicit conversion, when the source and target domains are statically known during the compilation. The result of an explicit conversion can be one of the following:
- ok the successful conversion to the target domain;
- run-time-check the conversion to the target domain with generation of run-time checking for compatibility;
- error the conversion is impossible, error output.
Rules of Checked Explicit Conversions
- Synonyms of domains are converted using the same rules that are applied to the domains themselves.
- Numerical domains can be converted to the numerical domains only.
- Integral constants are the representatives of the anonymous integral domain: [const .. const].
- Real constants are the representatives of the anonymous real domain: digits dig [const .. const], where dig is the number of the digits in mantissa without insignificant zeroes.
- A value of the symbol domain can be converted to the string domain and vice versa.
- A value of binary domain can be converted to the pointer domain.
- The domains that are implicitly introduced for interfaces can be converted only to the interface domains according to the rules specified below.
- All other domains cannot be converted.
Conversions of Numerical Domains
- The range is considered first during such conversion. If the ranges of source and target do not intersect, then an error is produced. If the ranges of source and target only partially intersect, then run-time checking is generated. Also, if one of domains is real and another is an integral one, then the integer range is converted to the real range before the comparison.
- When input term in real and output is integer, then convert/2-> and tryConvert/2-> predicates truncate the input value to the nearest integer value, which is nearer to zero.
Conversions of Interface Types
Predicate convert/2-> allow to convert any object to any interface type. The actual correctness of such conversion is checked at runtime. When object is created, its type is internally stored, therefore when the object is passed as argument it still remember about its original type. This original type is used for checking allowed conversions. The example:
interface x supports a, b end interface x
If object is created by class, which implements x interface, and then object is passed as parameter of type a to some predicate, then it is allowed to convert the object to b type.
Exceptions:
- Check range error.
- Unsupported interface type.
digitsOf
digitsOf : (<real-domain> Domain) -> unsigned.
Returns precision of the specified floating-point domain.
Call-template for this function is:
Precision = digitsof(domainName)
The input parameter domainName of this compiling-time predicate is a floating-point domain, it should be explicitly specified at compile-time (that is, domainName cannot come from a variable). The predicate returns the number Precision that was determined by the digits attribute in the domain declaration.
The compiler guarantees that values of the domain domainName will have at least Precision number of significant decimal digits.
errorExit
errorExit : (unsigned ErrorNumber) erroneous.
Performs a run-time error with the specified return code ErrorNumber, which can be used in the try-catch-finally.
fact_address
fact_address : (FactType FactVariable) -> pointerTo{FactType} PointerToFactVariable.
The fact_address predicate returns the address (as a pointerTo{FactType}) of a fact variable FactVariable of type FactType.
FactVariable must be a fact variable.
fail
fail : () failure.
The fail predicate forces failure and, hence, always causes backtracking. A clause that fails (with fail or for some other reason) cannot bind output arguments.
free
free : (<variableName> Variable) determ.
Check whether a variable is free.
Call-template for this predicate is:
free(Variable)
The free predicate succeeds if the specified Variable is free and fails if Variable is bound. The free predicate treats the specified Variable as bound if any of it's part are instantiated.
See also bound/1.
fromEllipsis
fromEllipsis : (...) -> any* AnyTermList.
This predicate creates the list of terms of the universal type any from the EllipsisBlock ... (i.e. from the special varying parameters block).
Call-template for this function is:
AnyTermList = fromEllipsis(EllipsisBlock )
See also toEllipsis/1->.
hasDomain
hasDomain is not really a predicate, but more a type declaration/restriction. It has two forms a non-function for declaring/restricting the type of a variable and a function form for declaring/restricting the type of a value.
The non-function form is called with a type as first parmeter and a variable as second parameter.
hasDomain : (<type> Type, Type Variable).
The only effect of the call is that the Variable will be restricted to the type Type.
The variable can be free, bound or of some mixed flow and the binding of the variable will not change in any way.
The function form is called with a type as first argument and a value as second argument, and it returns the same value.
hasDomain : (<type> Type, Type Value) -> Type Value.
The only effect of the call is to ensure that the Value will be restricted to the type Type.
lowerBound
lowerBound : (<numeric-domain> NumericDomain) -> <numeric-domain> LowerBound.
Returns the lower bound of the specified NumericDomain.
Call-template for this function is:
LowerBoundValue = lowerBound(domainName)
The lowerBound is a compiling-time predicate. The lowerBound returns the lower bound value LowerBoundValue of the specified numeric domain domainName. The return value LowerBoundValue belongs to the same domain domainName. The domainName parameter should be the name of any numerical domain; this domain name should be explicitly specified at compile-time (that is, domainName cannot come from a variable). See also upperBound/1->.
It will give a compile time error if the specified domain domainName is not numeric domain.
in
See in/2.
isErroneous
isErroneous : (<fact-variable> FactVariable) determ.
The predicate succeeds if the specified fact variable is erroneous.
Call-template for this predicate is:
isErroneous(factVariableName)
The predicate succeeds if the specified fact variable factVariableName has the erroneous value, otherwise it fails.
See also notErroneous.
maxDigits
maxDigits : (<real-domain> RealDomain) -> unsigned MaxDigits
Retrieves the value of digits (precision) of the basic domain corresponding to the specified floating-point domain RealDomain.
Call-template for this function is:
MaxDigitsNumber = maxdigits(domainName)
The return maximal number of digits MaxDigitsNumber for the domainName parameter, which should be the name of a real domain.
not
See not.
notErroneous
The notErroneous/1-> predicate will succeed with the value of a fact if the fact is not erroneous. The main purpose of the predicate is to get an atomic view of the fact in a multi-threaded application.
facts theFact : integer := erroneous. clauses ppp() :- if F = notErroneous(theFact) then % theFact was not erroneous, its value was F end if.
The related code using isErroneous/1 is not threadsafe:
clauses ppp() :- if not(isErroneous(theFact)) then % theFact was not erroneous, but it can be in the next line F = theFact end if.
See also isErroneous.
otherwise
See otherwise.
or
See or (;).
orelse
See orelse.
predicate_fullname
predicate_fullname : () -> string PredicateFullName.
This predicate returns the name PredicateFullName of the predicate in which it is invoked. The returned predicate name is qualified with a scope name.
predicate_fullname can only be used inside a clause. Use of predicate_fullname in other places causes a compile time error. See also predicate_name.
predicate_name
predicate_name : () -> string PredicateName.
This predicate returns the name PredicateName of the predicate in which it is invoked.
predicate_name can only be used inside a clause. Use of predicate_name in other places causes a compile time error. See also predicate_fullname
programPoint
programPoint : () -> core::programPoint ProgramPoint.
This predicate returns the name programPoint corresponding to the place where it is invoked.
retract
retract : (<fact-term> FactTerm) nondeterm anyflow.
Successively removes the first matching fact from the facts database. Fails when no more facts match.
Call-template for this predicate is:
retract(FactTemplate)
Here FactTemplate should be a fact term. The retract/1 predicate deletes the first fact that matches the FactTemplate in the appropriated facts database. During backtracking, the rest of the matching facts will be deleted.
Notice that FactTemplate can have any level of instantiation. The FactTemplate is matched with the facts in the facts database, which means that any free variables will be bound in the call to retract/1.
The FactTemplate can contain any anonymous variables. That is, variables with names consisting from the single underscore _ or a variable with a name starting with an underscore _AnyValue if the variable occurs only once in the clause. For example.
retract(person("Hans", _Age)),
will retract the first matched person fact that has "Hans" as the first argument and anything as the second argument.
When retracting a fact, which is declared to be determ, the call to retract/1 will be deterministic.
See also retractall/1 and retractFactDb.
The retract/1 predicate cannot be applied to single facts or fact variables.
Be careful calling retract/1 with free FactTemplate variable if any single fact is declared in the project current scope. If you retract a single fact, then the run-time error is generated. The retract/1 predicate fails when there are no more matches.
retractall
retractall : (<fact-term> FactTerm) .
Remove all matching facts from the facts database.
Call-template for this predicate is:
retractall(FactTemplate)
Here FactTemplate should be a fact term.
The retractall/1 retracts all facts which match the given FactTemplate. It always succeeds, even if no facts were retracted.
Attempting to retract a single fact will cause a compile time error.
It is not possible to obtain any output values from retractall/1. For this reason, the variables in the call must be bound or be a single underscores (anonymous). Notice that FactTemplate can have any level of instantiation, but free variables must be single underscores ("unconditionally anonymous"). In difference to retract/1 "conditionally" anonymous variables with names starting from the underscore (like _AnyValue) cannot be used in retractall/1.
See also retract/1 and retractFactDb/1.
retractFactDb
retractFactDb : (factDB FactDB).
Remove all facts from the named internal facts database FactDB.
Call-template for this predicate is:
retractFactDb(FactDB)
The retractFactDb/1 removes all facts from the named facts database FactDB.
Notice, it is impossible to retract single facts and fact variables, so the predicate leaves such ones as they are.
See also retractall/1 and retract/1.
retractAll/2
Obsolete predicate! Use retractFactDb/1 instead.
sizeBitsOf
sizeBitsOf : (<domain> DomainName) -> unsigned BitSize.
Retrieves the number of bits occupied in memory by an entity of the specified domain DomainName.
Call-template for this function is:
BitSize = sizeBitsOf(DomainName)
This compiling-time predicate receives the domain DomainName as input parameter and return the size of memory that is occupied by the entity of the given domain. The result is measured in bits. For the integer domains sizeBitsOf/1-> predicate returns the value that was defined for the size-field in a domain's declaration.
The following is always true for the integral domains:
sizeOfDomain(domain)*8 - 7 <= sizeBitsOf(domain) <= sizeOfDomain(domain)*8
See also sizeOfDomain/1->.
sizeOf
sizeOf : (Type Term) -> integer ByteSize.
Retrieves the number of bytes occupied in memory by the specified term Term.
Call-template for this function is:
ByteSize = sizeOf(Term)
The sizeOf/1-> function receives a term as input parameter and returns value ByteSize that specifies the number of bytes occupied in memory by this term Term.
sizeOfDomain
sizeOfDomain : (<domain> Domain) -> integer ByteSize.
Retrieves the number of bytes occupied in memory by the entity of the specified domain DomainName.
Call-template for this function is:
ByteSize = sizeOfDomain(DomainName)
This compiling-time predicate receives the domain DomainName as input parameter and return the size of memory that is occupied by the entity of the given domain. The result is measured in bytes. The returned value ByteSize belongs to the integer domain. Compare with sizeBitsOf/1->, which returns size of a domain measured in bits.
sourcefile_lineno
sourcefile_lineno : () -> unsigned LineNumber.
Returns the current line number in the source file processed by the compiler.
sourcefile_name
sourcefile_name : () -> string FileName.
Returns the name of the source file processed by the compiler.
sourcefile_timestamp
sourcefile_timestamp : () -> string TimeStamp..
Returns a string that represents the date and time of the currently compiled source file in format YYYY-MM-DD HH:mm:ss. Where:
- YYYY - Year.
- MM - Month.
- DD - Day.
- HH - Hour.
- mm - Minute.
- ss - Second.
succeed
succeed : ().
The predicate succeed/0 will always succeed.
toAny
toAny : (Term) -> any UniversalTypeValue.
Converts the specified Term to the value of universal term type any.
Call-template for this function is:
UniversalTypeValue = toAny(Term)
A term of the any domain can be converted back to its original type using the toTerm predicates (see toTerm).
toBinary
toBinary : (Term) -> binary Serialized.
Converts the specified Term to binary representation.
Call-template for this function is:
Serialized = toBinary(Term)
When a Term (of some domain domainName) is converted into a binary, it can safely be stored in a file or sent over a network to another program. Later the obtained binary value Serialized can be converted back to a Visual Prolog term, using toTerm/1-> function (the domain for the reversed term should be adequate to domainName) for the reverse conversion.
toBoolean
toBoolean : (<deterministic_expression> SubGoal) -> boolean Succeed.
The purpose of this meta-predicate is to convert an expression to the value of boolean domain.
Call-template for this meta-predicate is:
True_or_False = toBoolean(deterministic_expression)
this is equivalent to
True_or_False = if deterministic_expression then true else false end if
The toBoolean/1-> meta-predicate returns boolean value. The result is true if deterministic_call succeeds. The result is false if deterministic_call fails.
toEllipsis
toEllipsis : (any* AnyTermList) -> ....
This predicate creates EllipsisBlock ... (i.e. the special varying parameters block) from the list of terms of the universal type any. Such EllipsisBlock can be later passed to a predicate which expects the varying number of arguments (i.e. is declared with the ellipsis (...)), like write/..., at the position of the ellipsis (...).
Call-template for this function is:
EllipsisBlock = toEllipsis(<any_term_list>), write(EllipsisBlock)
See also fromEllipsis/1->.
toString
toString : (Term) -> string Serialized.
Converts the specified Term to string representation.
Call-template for this function is:
Serialized = toString(Term)
When a Term (of some domain domainName) is converted into a string, it can safely be stored in a file or sent over a network to another program. Later the obtained string value can be converted back to a Visual Prolog term, using toTerm/1-> function (the domain of the return value should be adequate to domainName) for the reverse conversion.
toTerm
toTerm : (string Serialized) -> Term. toTerm : (binary Serialized) -> Term. toTerm : (any Serialized) -> Term. toTerm : (<domain> Type, string Serialized) -> Term. toTerm : (<domain> Type, binary Serialized) -> Term. toTerm : (<domain> Type, any Serialized) -> Term.
Converts the string/binary/any representation of the specified term Serialized into representation corresponding to the domain of Term variable of the return value. The domain can be stated explicitly or it can be left to the compiler to determine a suitable domain.
Call-template for this function is:
Term = toTerm(Serialized) % with implicit domain Term = toTerm(domainName, Serialized) % with explicit domain, domainName
If the domain is not specified the compiler must be able to determine the domain for the returned value Term at compile-time. Notice that binary version of toTerm predicate performs almost byte to byte conversion and only checking general compatibility of Serialized data with the domain required to the return value Term. The programmer is wholly responsible for providing binary data of Serialized that can be correctly converted to the term of the desired domain. The toTerm predicates are counterparts to predicates toBinary/1-> and toString/1->. When a Term (of some domain domainName) is converted into a binary or string representation Serialized (by toBinary/1-> or toString/1-> or toAny/1-> correspondingly), it can safely be stored in a file or sent over a network to another program. Later the corresponding toTerm/1-> function can convert the obtained string/binary value Serialized back to a Visual Prolog term Term. For correctness of the reverse conversion the domain of the clause variable Term should be adequate to the initial domain domainName.
See also tryToTerm.
It gives a compile time error if the compiler cannot determine the return domain.
Exceptions
- Run time errors are generated when the toTerm predicate cannot convert the string or binary into a term of the specified domain.
tryToTerm
tryToTerm : (string Serialized) -> Term. tryToTerm : (binary Serialized) -> Term. tryToTerm : (any Serialized) -> Term. tryToTerm : (<domain> Type, string Serialized) -> Term. tryToTerm : (<domain> Type, binary Serialized) -> Term. tryToTerm : (<domain> Type, any Serialized) -> Term.
Converts the string/binary/any representation Serialized into a term Term like toTerm. The only difference between the predicates is that tryToTerm fails if it cannot convert the string or binary or any into a term of the specified domain whereas toTerm raises an exception.
See also toTerm.
tryConvert
tryConvert : (<type> Type, Value) -> <type> Converted determ.
Checks whether the input term Value can be strictly converted into the specified domain Type and returns the converted term Converted.
Call-template for this function is:
ReturnTerm = tryConvert(returnDomain, InputTerm)
Arguments:
- returnDomain: Specifies a domain to which tryConvert/2-> predicate tries to convert the specified InputTerm. Here returnDomain can be any domain accessible in the current scope. The domain name returnDomain must be specified at compile-time, i.e. it cannot come from a variable.
- InputTerm: Specifies the term that must be converted. InputTerm may be any Prolog term or an expression. If InputTerm is an expression, then it will be evaluated before conversion.
- ReturnTerm: Returned term ReturnTerm will be of returnDomain domain.
The conversion rules are the same as of the embedded predicate convert/2->, but tryConvert/2-> fails when convert/2-> generates conversion errors.
This predicate succeeds if the corresponding conversion succeeds. Otherwise it fails. The tryConvert/2-> predicate tries to perform a clean and genuine conversion of the given InputTerm into a value of the specified domain returnDomain. The tryConvert/2-> predicate will fail if the required conversion cannot be performed. When tryConvert/2-> predicate succeeds, it returns the term ReturnTerm converted to the specified domain returnDomain.
For allowed conversions and rules of checked explicit conversions see convert/2-> predicate.
See also uncheckedConvert/2->.
typeDescriptorOf
typeDescriptorOf : (<type> Type) -> typeDescriptor TypeDescriptor. typeDescriptorOf : (Type Value) -> typeDescriptor TypeDescriptor.
Reflection predicate that returns the typeDescriptor of a type or a value.
A typeDescriptor is the reflection descriptor of an uninstantiated type/domain.
typeLibraryOf
typeLibraryOf : (<type> Type) -> typeLibrary TypeLibrary. typeLibraryOf : (Type Value) -> typeLibrary TypeLibrary.
Reflection predicate that returns the typeLibrary of a type or a value.
A typeLibrary is the reflection descriptor of an instantiated type/domain.
uncheckedConvert
uncheckedConvert : (<type> Type, Value) -> <type> Converted.
Unchecked conversion of a value to another type.
Call-template for this function is:
ReturnTerm = uncheckedConvert(returnDomain, InputTerm)
Arguments:
- returnDomain: Specifies a domain to which uncheckedConvert predicate unsafely converts the specified InputTerm. Here returnDomain can be any domain accessible in the current scope, the ReturnTerm should has the same bit-size as the InputTerm. The domain name returnDomain must be specified at compile-time, i.e. it cannot come from a variable.
- InputTerm: Specifies the value that must be converted. InputTerm may be any Prolog term or an expression. If InputTerm is an expression, then it will be evaluated before conversion.
- ReturnTerm: Returned parameter ReturnTerm will be of returnDomain type.
uncheckedConvert evaluates InputTerm, change the type to returnDomain without any modification of the memory pattern and unifies with ReturnTerm. The uncheckedConvert predicate performs no runtime checks. It makes only compile time checking of bit-size equality of the converted domains. So almost any term may be quite recklessly converted to any other term. So quite disastrous results may occur if you try to use variables incorrectly converted by uncheckedConvert. Be extremely careful implementing uncheckedConvert; we strongly recommend you always, when it is possible, using of convert/2-> and tryConvert/2->. But notice that, when an object is returned by COM system it is necessary to convert it by uncheckedConvert, as Prolog program does not have information about its actual type.
upperBound
upperBound : (<numeric-domain> NumericDomain) -> <numeric-domain> UpperBound.
Returns the upper bound value of the specified numeric domain.
Call-template for this function is:
UpperBound = upperBound(domainName)
The upperBound is a compiling-time predicate. The upperBound returns the upper bound value of the specified numeric domain domainName. The return value UpperBound belongs to the same domain domainName. The domainName parameter should be the name of any numerical domain; this domain name should be explicitly specified at compile-time (that is, domainName cannot come from a variable).
See also lowerBound/1->.
Will cause a compile time error if the specified domain domainName is not numeric domain.