object

# rbtree

> Red-Black trees. Uses standard order to compare keys.

author:
  `Vitor Santos Costa; adapted to Logtalk by Paulo Moura.`
version:
  `1.1`
date:
  `2016/5/13`

compilation flags:
  `static, context_switching_calls`

implements:
  `public dictionaryp`
extends:
  `public compound`

## Public interface

### 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 – number of proofs:
  `partial_map(+tree,+list,@closure,-tree) – zero_or_one`

## Protected interface

(see related entities)

## Private predicates

(see related entities)

## Operators

### (none)

## Remarks

### (none)

## See also

### (none)