Dictionaries

Author(s): The CLIP Group.

Version: 1.9#240 (2003/12/22, 18:52:17 CET)

This module provides predicates for implementing dictionaries. Such dictionaries are currently implemented as ordered binary trees of key-value pairs.

• Usage and interface (dict)
• Documentation on exports (dict)

Usage and interface (dict)

Documentation on exports (dict)

PROPERTY: dictionary/1:

Usage: dictionary(D)

• Description: D is a dictionary.

PREDICATE: dictionary/5:

Usage: dictionary(D, K, V, L, R)

• Description: The dictionary node D has key K, value V, left child L, and right child R.

PREDICATE: dic_node/2:

Usage: dic_node(D, N)

• Description: N is a sub-dictionary of D.
• Calls should, and exit will be compatible with: D is a dictionary. (dict:dictionary/1) N is a dictionary. (dict:dictionary/1)

PREDICATE: dic_lookup/3:

Usage: dic_lookup(D, K, V)

• Description: D contains value V at key K. If it was not already in D it is added.
• Calls should, and exit will be compatible with: D is a dictionary. (dict:dictionary/1)

PREDICATE: dic_lookup/4:

Usage: dic_lookup(D, K, V, O)

• Description: Same as dic_lookup(D,K,V). O indicates if it was already in D (old) or not (new).
• Calls should, and exit will be compatible with: D is a dictionary. (dict:dictionary/1)

PREDICATE: dic_get/3:

Usage: dic_get(D, K, V)

• Description: D contains value V at key K. Fails if it is not already in D.
• Calls should, and exit will be compatible with: D is a dictionary. (dict:dictionary/1)

PREDICATE: dic_replace/4:

Usage: dic_replace(D, K, V, D1)

• Description: D and D1 are identical except for the element at key K, which in D1 contains value V, whatever has (or whether it is) in D.
• Calls should, and exit will be compatible with: D is a dictionary. (dict:dictionary/1) D1 is a dictionary. (dict:dictionary/1)

Go to the first, previous, next, last section, table of contents.