|
|
|||||||||
checks whether a term is member of the blackboard.
bb_contains(+Board, ?Term)
Blackboards are collections of (Key,Value) tuples. bb_contains/2 allows to retrieve the Value part of the blackboard.
If Term is not a free variable then bb_contains succeeds if the blackboard Board contains Term as Value at least once.
If Term is a free variable then by backtracing bb_contains/2
lists in an unspecific order all terms which are elements of the blackboard Board.
Arguments
Board blackboard Term term
Examples
Assume there exists a blackboard 'blackboard' with elements (100, abc), (101, element101), (102, abc).
| bb_contains(blackboard,abc). | Succeeds. |
| bb_contains(blackboard, X). | Succeeds three times with substitution
X <- abc X <- element101 X <- abc |
Standard
This predicate is not part of the ISO-Prolog Standard.
See also
bb_clear/1, bb_clear_2/2, bb_create/1, bb_contains/2, bb_contains_key/2, bb_get/3, bb_get_4/4, bb_put/3, bb_put_4/4, bb_remove/2. bb_keys/2. bb_elements/2.| document: http://www.ifcomputer.co.jp/MINERVA/Manual/Reference/Predicates/blackboard/bb_contains/print_en.html published 2008/10/13 update 2001/2/7 (c) 1996-2006 IF Computer Japan | ||||||||
|
