- swipl
- library
- error.pl
- debug.pl
- apply.pl -- Apply predicates on a list
- lists.pl
- broadcast.pl
- shlib.pl -- Utility library for loading foreign objects (DLLs, shared objects)
- option.pl
- thread_pool.pl -- Resource bounded thread management
- gensym.pl
- settings.pl -- Setting management
- arithmetic.pl
- main.pl
- readutil.pl
- operators.pl -- Manage operators
- pairs.pl -- Operations on key-value lists
- prolog_source.pl -- Examine Prolog source-files
- quasi_quotations.pl
- url.pl
- www_browser.pl -- Open a URL in the users browser
- prolog_colour.pl
- record.pl
- prolog_xref.pl -- Prolog cross-referencer data collection
- occurs.pl
- ordsets.pl -- Ordered set manipulation
- assoc.pl -- Binary associations
- ugraphs.pl -- Graph manipulation library
- solution_sequences.pl
- atom.pl -- Operations on atoms
- prolog_pack.pl -- A package manager for Prolog
- git.pl -- Run GIT commands
- ctypes.pl
- utf8.pl
- base64.pl -- Base64 encoding and decoding
- persistency.pl -- Provide persistent dynamic predicates
- pure_input.pl
- nb_set.pl -- Non-backtrackable sets
- aggregate.pl
- csv.pl -- Process CSV (Comma-Separated Values) data
- iostream.pl -- Utilities to deal with streams
- dialect.pl -- Support multiple Prolog dialects
- apply_macros.pl -- Goal expansion rules to avoid meta-calling
- yall.pl -- Lambda expressions
- prolog_code.pl -- Utilities for reasoning about code
- dif.pl -- The dif/2 constraint
- thread.pl -- High level thread primitives
- predicate_options.pl -- Access and analyse predicate options
- rbtrees.pl -- 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_visit_range/4
- rb_map/3
- rb_map/2
- 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
- nb_rbtrees.pl -- Non-backtrackable operations on red black trees
- sandbox.pl
- prolog_format.pl -- Analyse format specifications
- random.pl
- pprint.pl
- modules.pl -- Module utility predicates
- lazy_lists.pl -- Lazy list handling
- edinburgh.pl
- prolog_clause.pl
- prolog_breakpoints.pl
- dicts.pl
- backcomp.pl -- Backward compatibility
- date.pl -- Process dates and times
- oset.pl -- Ordered set manipulation
- prolog_profile.pl -- Execution profiler
- listing.pl
- quintus.pl
- optparse.pl
- prolog_jiti.pl -- Just In Time Indexing (JITI) utilities
- make.pl
- terms.pl -- Term manipulation
- threadutil.pl -- Interactive thread utilities
- varnumbers.pl -- Utilities for numbered terms
- ansi_term.pl
- zip.pl -- Access resource ZIP archives
- tableutil.pl -- Table inspection and statistics utilities
- charsio.pl
- prolog_trace.pl -- Print access to predicates
- shell.pl -- Elementary shell commands
- hashtable.pl -- Hash tables
- prolog_stack.pl -- Examine the Prolog stack
- strings.pl
- heaps.pl
- prolog_coverage.pl -- Coverage analysis tool
- system.pl -- System utilities
- writef.pl
- prolog_versions.pl
- prolog_codewalk.pl -- Prolog code walker
- prolog_debug.pl -- User level debugging tools
- statistics.pl -- Get information about resource usage
- macros.pl -- Macro expansion
- files.pl
- coinduction.pl
- edit.pl
- check.pl
- intercept.pl -- Intercept and signal interface
- prolog_config.pl -- Provide configuration information
- help.pl -- Text based manual
- wfs.pl -- Well Founded Semantics interface
- qsave.pl -- Save current program as a state or executable
- tables.pl -- XSB interface to tables
- increval.pl
- base32.pl -- Base32 encoding and decoding
- codesio.pl -- I/O on Lists of Character Codes
- sort.pl
- when.pl
- prolog_autoload.pl -- Autoload all dependencies
- prolog_history.pl -- Per-directory persistent commandline history
- streams.pl -- Manage Prolog streams
- tty.pl -- Terminal operations
- portray_text.pl -- Portray text
- prolog_metainference.pl
- prolog_wrap.pl -- Wrapping predicates
- prolog_qlfmake.pl -- Compile the library to QLF format
- explain.pl
- exceptions.pl -- Exception classification
- library
- rb_map(+Tree, :G, -NewTree) is semidet
- For all nodes Key in the tree Tree, if the value associated with key
Key is Val0 in tree Tree, and if
call(G,Val0,ValF)holds, then the value associated with Key in NewTree is ValF. Fails ifcall(G,Val0,ValF)is not satisfiable for all Val0. If G is non-deterministic, rb_map/3 will backtrack over all possible values fromcall(G,Val0,ValF). You should not depend on the order of tree traversal (currently: key order).