| Did you know ... | Search Documentation: |
 | Predicate rb_map/3 |
- HOME
- DOWNLOAD
- DOCUMENTATION
- TUTORIALS
- Beginner▶
- Advanced▶
- Web applications▶
- Semantic web▶
- Graphics▶
- Machine learning▶
- External collections▶
- For packagers▶
- COMMUNITY
- COMMERCIAL
- WIKI
- swipl
- library
- debug.pl -- Print debug messages and test assertions
- settings.pl
- arithmetic.pl -- Extensible arithmetic
- predicate_options.pl -- Access and analyse predicate options
- error.pl
- option.pl -- Option list processing
- broadcast.pl -- Event service
- lists.pl -- List Manipulation
- apply.pl -- Apply predicates on a list
- operators.pl -- Manage operators
- pairs.pl -- Operations on key-value lists
- prolog_source.pl -- Examine Prolog source-files
- thread_pool.pl -- Resource bounded thread management
- shlib.pl -- Utility library for loading foreign objects (DLLs, shared objects)
- gensym.pl -- Generate unique symbols
- main.pl -- Provide entry point for scripts
- readutil.pl -- Read utilities
- aggregate.pl -- Aggregation operators on backtrackable predicates
- quasi_quotations.pl -- Define Quasi Quotation syntax
- url.pl -- Analysing and constructing URL
- www_browser.pl -- Open a URL in the users browser
- prolog_colour.pl
- record.pl -- Access compound arguments by name
- prolog_xref.pl -- Prolog cross-referencer data collection
- occurs.pl -- Finding and counting sub-terms
- ordsets.pl -- Ordered set manipulation
- assoc.pl -- Binary associations
- ugraphs.pl -- Graph manipulation library
- iostream.pl -- Utilities to deal with streams
- atom.pl -- Operations on atoms
- prolog_pack.pl -- A package manager for Prolog
- solution_sequences.pl -- Modify solution sequences
- prolog_stack.pl -- Examine the Prolog stack
- pure_input.pl -- Pure Input from files and streams
- utf8.pl -- UTF-8 encoding/decoding on lists of character codes.
- base64.pl -- Base64 encoding and decoding
- persistency.pl -- Provide persistent dynamic predicates
- codesio.pl -- I/O on Lists of Character Codes
- git.pl -- Run GIT commands
- prolog_versions.pl -- Demand specific (Prolog) versions
- random.pl -- Random numbers
- prolog_code.pl -- Utilities for reasoning about code
- make.pl -- Reload modified source files
- ansi_term.pl -- Print decorated text to ANSI consoles
- apply_macros.pl -- Goal expansion rules to avoid meta-calling
- yall.pl -- Lambda expressions
- backcomp.pl -- Backward compatibility
- base32.pl -- Base32 encoding and decoding
- charsio.pl -- I/O on Lists of Character Codes
- check.pl -- Consistency checking
- check_installation.pl -- Check installation issues and features
- dialect.pl -- Support multiple Prolog dialects
- pio.pl -- Pure I/O
- coinduction.pl -- Co-Logic Programming
- console_input.pl
- csv.pl -- Process CSV (Comma-Separated Values) data
- ctypes.pl -- Character code classification
- date.pl -- Process dates and times
- 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_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
- prolog_wrap.pl -- Wrapping predicates
- shell.pl -- Elementary shell commands
- terms.pl -- Term manipulation
- quintus.pl -- Quintus compatibility
- tables.pl -- XSB interface to tables
- nb_set.pl -- Non-backtrackable sets
- thread.pl -- High level thread primitives
- dicts.pl -- Dict utilities
- dif.pl -- The dif/2 constraint
- edinburgh.pl -- Some traditional Edinburgh predicates
- edit.pl -- Editor interface
- explain.pl -- Describe Prolog Terms
- modules.pl -- Module utility predicates
- sort.pl
- sandbox.pl -- Sandboxed Prolog code
- prolog_format.pl -- Analyse format specifications
- fastrw.pl -- Fast reading and writing of terms
- files.pl
- hashtable.pl -- Hash tables
- heaps.pl -- heaps/priority queues
- help.pl -- Text based manual
- hotfix.pl -- Load hotfixes into executables
- increval.pl -- Incremental dynamic predicate modification
- intercept.pl -- Intercept and signal interface
- lazy_lists.pl -- Lazy list handling
- listing.pl -- List programs and pretty print clauses
- macros.pl -- Macro expansion
- nb_rbtrees.pl -- Non-backtrackable operations on red black trees
- obfuscate.pl -- Code obfuscating
- optparse.pl -- command line parsing
- oset.pl -- Ordered set manipulation
- portray_text.pl -- Portray text
- pprint.pl -- Pretty Print Prolog terms
- prolog_autoload.pl -- Autoload all dependencies
- prolog_breakpoints.pl -- Manage Prolog break-points
- prolog_clause.pl -- Get detailed source-information about a clause
- prolog_codewalk.pl -- Prolog code walker
- prolog_config.pl -- Provide configuration information
- prolog_coverage.pl -- Coverage analysis tool
- prolog_debug.pl -- User level debugging tools
- prolog_deps.pl -- Compute file dependencies
- prolog_evaluable.pl -- Inspect properties of evaluable functions
- prolog_history.pl -- Per-directory persistent commandline history
- prolog_jiti.pl -- Just In Time Indexing (JITI) utilities
- prolog_locale.pl -- Tweak the locale for Prolog development
- prolog_metainference.pl -- Infer meta-predicate properties
- prolog_profile.pl -- Execution profiler
- prolog_trace.pl -- Print access to predicates
- qpforeign.pl -- Quintus compatible foreign loader
- qsave.pl -- Save current program as a state or executable
- zip.pl -- Access resource ZIP archives
- readln.pl -- Read line as list of tokens
- rwlocks.pl -- Read/write locks
- statistics.pl -- Get information about resource usage
- streams.pl -- Manage Prolog streams
- strings.pl -- String utilities
- system.pl -- System utilities
- threadutil.pl -- Interactive thread utilities
- tty.pl -- Terminal operations
- varnumbers.pl -- Utilities for numbered terms
- vm.pl -- SWI-Prolog Virtual Machine utilities
- wfs.pl -- Well Founded Semantics interface
- when.pl -- Conditional coroutining
- writef.pl -- Old-style formatted write
- win_menu.pl -- Console window menu
- 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).
Tags are associated to your profile if you are logged in
Tags:
login to add a new annotation post.