Go to the first, previous, next, last section, table of contents.
Author(s): Göran Smedbäck.
Version: 1.10#7 (2006/4/26, 19:22:13 CEST)
Version of last change: 1.9#171 (2003/12/4, 17:46:50 CET)
This module offers predicate to check values according to their boundaries and offers lists of possible node ascendents.
- Library usage:
:- use_module(library(boundary)).
- Exports:
- Predicates:
boundary_check/3
,
boundary_rotation_first/2
,
boundary_rotation_last/2
,
reserved_words/1
,
children_nodes/1
.
- Other modules used:
- System library modules:
aggregates
,
dynamic
,
iso_misc
,
iso_byte_char
,
iso_incomplete
,
operators
,
read
,
write
,
provrml/internal_types
,
provrml/error
.
- PREDICATE: boundary_check/3:
-
Usage: boundary_check(+Value_to_check, +Init_value, +Bound)
- Description: This predicate check the boundaries of the given value according to the boudary values. If the value is wrong according to the boundaries, the value is checked according to the initial value given. If the value continues to be wrong, an error will be raised accordingly.
- Call and exit should be compatible with:
+Value_to_check
is an atom.
(basic_props:atm/1
)
+Init_value
is a list of atm
s.
(basic_props:list/2
)
+Bound
is a variable interval.
(internal_types:bound/1
)
- PREDICATE: boundary_rotation_first/2:
-
Usage: boundary_rotation_first(+Bound_double, -Bound)
- Description: The predicate will extract the first bounds from a double bound.
- Call and exit should be compatible with:
+Bound_double
is a variable interval.
(internal_types:bound_double/1
)
-Bound
is a variable interval.
(internal_types:bound/1
)
- PREDICATE: boundary_rotation_last/2:
-
Usage: boundary_rotation_last(+Bound_double, -Bound)
- Description: The predicate will extract the last bounds from a double bound.
- Call and exit should be compatible with:
+Bound_double
is a variable interval.
(internal_types:bound_double/1
)
-Bound
is a variable interval.
(internal_types:bound/1
)
- PREDICATE: reserved_words/1:
-
Usage: reserved_words(-List)
- Description: Returns a list with the reserved words, words prohibited to use in cases not appropiated.
- Call and exit should be compatible with:
-List
is a list of atm
s.
(basic_props:list/2
)
- PREDICATE: children_nodes/1:
-
Usage: children_nodes(-List)
- Description: Returns a list of all nodes possible as children nodes.
- Call and exit should be compatible with:
-List
is a list of atm
s.
(basic_props:list/2
)
Go to the first, previous, next, last section, table of contents.