object

# `rbtree`

Red-Black tree implementation of the dictionary protocol. Uses standard order to compare keys.

Availability:
`logtalk_load(dictionaries(loader))`
Author: Vitor Santos Costa; Logtalk port and additional predicates by Paulo Moura.
Version: 1:9:0
Date: 2021-04-12
Compilation flags:
`static, context_switching_calls`
Implements:
`public` dictionaryp
Extends:
`public` term
Remarks:
(none)
Inherited public predicates:
(<)/2 (=:=)/2 (=<)/2 (=\=)/2 (>)/2 (>=)/2 apply/4 as_curly_bracketed/2 as_dictionary/2 as_list/2 check/1 clone/3 clone/4 delete/4 delete_max/4 delete_min/4 depth/2 empty/1 ground/1 insert/4 intersection/2 intersection/3 keys/2 lookup/2 lookup/3 map/2 map/3 max/3 min/3 new/1 next/4 numbervars/1 numbervars/3 occurs/2 previous/4 singletons/2 size/2 subsumes/2 subterm/2 update/3 update/4 update/5 valid/1 values/2 variables/2 variant/2 varnumbers/2 varnumbers/3

## Public predicates

### `partial_map/4`

Applies a closure to the tree pairs identified by a set of keys.

Compilation flags:
`static`
Template:
`partial_map(Tree,Keys,Closure,NewTree)`
Meta-predicate template:
`partial_map(*,*,2,*)`
Mode and number of proofs:
`partial_map(+tree,+list,@closure,-tree)` - `zero_or_one`

## Protected predicates

(no local declarations; see entity ancestors if any)

## Private predicates

(no local declarations; see entity ancestors if any)

## Operators

(none)

See also

avltree, bintree