Did you know ...
Search Documentation:
Predicate rb_visit/2
HOME
DOWNLOAD
SWI-Prolog
Sources/building
Docker images
Add-ons
Browse GIT
DOCUMENTATION
Manual
Packages
FAQ
Command line
PlDoc
Bluffers
▶
Prolog syntax
PceEmacs
HTML generation
License
Publications
Rev 7 Extensions
TUTORIALS
Beginner
▶
Getting started
Learn Prolog Now!
Simply Logical
Debugger
Development tools
Advanced
▶
Modules
Grammars (DCGs)
clp(fd)
Printing messages
PlDoc
Web applications
▶
Web applications
Let's Encrypt!
Pengines
Semantic web
▶
ClioPatria
RDF namespaces
Graphics
▶
XPCE
GUI options
Machine learning
▶
Probabilistic Logic Programming
External collections
▶
Meta level tutorials
For packagers
▶
Linux packages
COMMUNITY
Forum & mailing list
Blog
News
Report a bug
Submit a patch
Submit an add-on
Roadmap (on GitHub)
External links
Contributing
Code of Conduct
Contributors
SWI-Prolog items
COMMERCIAL
WIKI
Login
View changes
Sandbox
Wiki help
All tags
Documentation
Reference manual
The SWI-Prolog library
library(rbtrees): Red black trees
rb_new/1
rb_empty/1
rb_lookup/3
rb_min/3
rb_max/3
rb_next/4
rb_previous/4
rb_update/4
rb_update/5
rb_apply/4
rb_in/3
rb_insert/4
rb_insert_new/4
rb_delete/3
rb_delete/4
rb_del_min/4
rb_del_max/4
rb_visit/2
rb_map/2
rb_map/3
rb_fold/4
rb_clone/3
rb_partial_map/4
rb_keys/2
list_to_rbtree/2
ord_list_to_rbtree/2
rb_size/2
is_rbtree/1
Packages
Availability:
:- use_module(
library(rbtrees)
).
(can be autoloaded)
[det]
rb_visit
(
+Tree, -Pairs
)
Pairs
is an infix visit of tree
Tree
, where each element of
Pairs
is of the form Key-Value.