.. index:: rbtree .. _rbtree/0: .. rst-class:: right **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`` :ref:`dictionaryp ` | **Extends:** | ``public`` :ref:`term ` | **Remarks:** | (none) | **Inherited public predicates:** |  :ref:`comparingp/0::(<)/2`  :ref:`comparingp/0::(=:=)/2`  :ref:`comparingp/0::(=<)/2`  :ref:`comparingp/0::(=\=)/2`  :ref:`comparingp/0::(>)/2`  :ref:`comparingp/0::(>=)/2`  :ref:`dictionaryp/0::apply/4`  :ref:`dictionaryp/0::as_curly_bracketed/2`  :ref:`dictionaryp/0::as_dictionary/2`  :ref:`dictionaryp/0::as_list/2`  :ref:`termp/0::check/1`  :ref:`dictionaryp/0::clone/3`  :ref:`dictionaryp/0::clone/4`  :ref:`dictionaryp/0::delete/4`  :ref:`dictionaryp/0::delete_max/4`  :ref:`dictionaryp/0::delete_min/4`  :ref:`termp/0::depth/2`  :ref:`dictionaryp/0::empty/1`  :ref:`termp/0::ground/1`  :ref:`dictionaryp/0::insert/4`  :ref:`dictionaryp/0::intersection/2`  :ref:`dictionaryp/0::intersection/3`  :ref:`dictionaryp/0::keys/2`  :ref:`dictionaryp/0::lookup/2`  :ref:`dictionaryp/0::lookup/3`  :ref:`dictionaryp/0::map/2`  :ref:`dictionaryp/0::map/3`  :ref:`dictionaryp/0::max/3`  :ref:`dictionaryp/0::min/3`  :ref:`termp/0::new/1`  :ref:`dictionaryp/0::next/4`  :ref:`termp/0::numbervars/1`  :ref:`termp/0::numbervars/3`  :ref:`termp/0::occurs/2`  :ref:`dictionaryp/0::previous/4`  :ref:`termp/0::singletons/2`  :ref:`dictionaryp/0::size/2`  :ref:`termp/0::subsumes/2`  :ref:`termp/0::subterm/2`  :ref:`dictionaryp/0::update/3`  :ref:`dictionaryp/0::update/4`  :ref:`dictionaryp/0::update/5`  :ref:`termp/0::valid/1`  :ref:`dictionaryp/0::values/2`  :ref:`termp/0::variables/2`  :ref:`termp/0::variant/2`  :ref:`termp/0::varnumbers/2`  :ref:`termp/0::varnumbers/3`   .. contents:: :local: :backlinks: top Public predicates ----------------- .. 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 -------------------- (no local declarations; see entity ancestors if any) Private predicates ------------------ (no local declarations; see entity ancestors if any) Operators --------- (none) .. seealso:: :ref:`avltree `, :ref:`bintree `