.. index:: rbtree
.. _rbtree/0:

.. rst-class:: right

**object**

``rbtree``
==========

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

| **Author:** Vitor Santos Costa; Logtalk port and additional predicates by Paulo Moura.
| **Version:** 1.7
| **Date:** 2019/5/17

| **Compilation flags:**
|    ``static, context_switching_calls``


| **Implements:**
|    ``public`` :ref:`dictionaryp <dictionaryp/0>`
| **Extends:**
|    ``public`` :ref:`compound <compound/0>`

| **Remarks:**
|    (none)

.. contents::
   :local:
   :backlinks: top

Public predicates
-----------------

.. raw:: html

   <div id="partial_map/4"> </div>

.. index:: partial_map/4
.. _rbtree/0::partial_map/4:

``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
--------------------

(see entity ancestors)

Private predicates
------------------

(see entity ancestors)

Operators
---------

(none)

.. seealso::

   :ref:`avltree <avltree/0>`, :ref:`bintree <bintree/0>`

