- swipl
- library
- error.pl -- Error generating support
- apply.pl -- Apply predicates on a list
- lists.pl -- List Manipulation
- debug.pl -- Print debug messages and test assertions
- broadcast.pl -- Event service
- socket.pl -- Network socket (TCP and UDP) library
- predicate_options.pl -- Access and analyse predicate options
- shlib.pl -- Utility library for loading foreign objects (DLLs, shared objects)
- option.pl -- Option list processing
- uid.pl -- User and group management on Unix systems
- unix.pl -- Unix specific operations
- syslog.pl -- Unix syslog interface
- thread_pool.pl -- Resource bounded thread management
- gensym.pl -- Generate unique symbols
- settings.pl -- Setting management
- arithmetic.pl -- Extensible arithmetic
- main.pl -- Provide entry point for scripts
- readutil.pl -- Read utilities
- ssl.pl -- Secure Socket Layer (SSL) library
- crypto.pl -- Cryptography and authentication library
- filesex.pl -- Extended operations on files
- doc_http.pl -- Documentation server
- pldoc.pl -- Process source documentation
- operators.pl -- Manage operators
- pairs.pl -- Operations on key-value lists
- prolog_source.pl -- Examine Prolog source-files
- sgml.pl -- SGML, XML and HTML parser
- quasi_quotations.pl -- Define Quasi Quotation syntax
- uri.pl -- Process URIs
- url.pl -- Analysing and constructing URL
- www_browser.pl -- Open a URL in the users browser
- prolog_colour.pl -- Prolog syntax colouring support.
- 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
- memfile.pl
- xpath.pl -- Select nodes in an XML DOM
- iostream.pl -- Utilities to deal with streams
- atom.pl -- Operations on atoms
- porter_stem.pl
- solution_sequences.pl -- Modify solution sequences
- prolog_pack.pl -- A package manager for Prolog
- prolog_config.pl -- Provide configuration information
- process.pl -- Create processes and redirect I/O
- git.pl -- Run GIT commands
- ctypes.pl -- Character code classification
- time.pl -- Time and alarm library
- utf8.pl -- UTF-8 encoding/decoding on lists of character codes.
- base64.pl -- Base64 encoding and decoding
- sha.pl -- SHA secure hashes
- crypt.pl
- persistency.pl -- Provide persistent dynamic predicates
- pure_input.pl -- Pure Input from files and streams
- nb_set.pl -- Non-backtrackable sets
- xsdp_types.pl -- XML-Schema primitive types
- uuid.pl -- Universally Unique Identifier (UUID) Library
- pcre.pl -- Perl compatible regular expression matching for SWI-Prolog
- aggregate.pl -- Aggregation operators on backtrackable predicates
- rdf_write.pl -- Write RDF/XML from a list of triples
- rdf.pl -- RDF/XML parser
- sgml_write.pl -- XML/SGML writer module
- archive.pl -- Access several archive formats
- csv.pl -- Process CSV (Comma-Separated Values) data
- dialect.pl -- Support multiple Prolog dialects
- apply_macros.pl -- Goal expansion rules to avoid meta-calling
- prolog_code.pl -- Utilities for reasoning about code
- dif.pl -- The dif/2 constraint
- thread.pl -- High level thread primitives
- rdf_triple.pl -- Create triples from intermediate representation
- rdf_parser.pl
- rewrite_term.pl
- rbtrees.pl -- Red black trees
- nb_rbtrees.pl -- Non-backtrackable operations on red black trees
- pengines.pl -- Pengines: Web Logic Programming Made Easy
- yall.pl -- Lambda expressions
- sandbox.pl -- Sandboxed Prolog code
- prolog_format.pl -- Analyse format specifications
- random.pl -- Random numbers
- pengines_io.pl -- Provide Prolog I/O for HTML clients
- zlib.pl -- Zlib wrapper for SWI-Prolog
- bdb.pl -- Berkeley DB interface
- hash_stream.pl -- Maintain a hash on a stream
- md5.pl -- MD5 hashes
- pprint.pl -- Pretty Print Prolog terms
- modules.pl -- Module utility predicates
- lazy_lists.pl -- Lazy list handling
- edinburgh.pl -- Some traditional Edinburgh predicates
- prolog_clause.pl -- Get detailed source-information about a clause
- prolog_breakpoints.pl -- Manage Prolog break-points
- dicts.pl -- Dict utilities
- backcomp.pl -- Backward compatibility
- date.pl -- Process dates and times
- term_to_json.pl
- snowball.pl -- The Snowball multi-lingual stemmer library
- system.pl -- System utilities
- quintus.pl -- Quintus compatibility
- make.pl -- Reload modified source files
- edit.pl -- Editor interface
- prolog_debug.pl -- User level debugging tools
- intercept.pl -- Intercept and signal interface
- unicode.pl -- Unicode string handling
- udp_broadcast.pl -- A UDP broadcast proxy
- strings.pl -- String utilities
- charsio.pl -- I/O on Lists of Character Codes
- statistics.pl -- Get information about resource usage
- jpl.pl -- A Java interface for SWI Prolog 7.x
- heaps.pl -- heaps/priority queues
- tables.pl -- XSB interface to tables
- increval.pl -- Incremental dynamic predicate modification
- base32.pl -- Base32 encoding and decoding
- prolog_history.pl -- Per-directory persistent commandline history
- readline.pl -- GNU readline interface
- table.pl
- sort.pl
- paxos.pl -- A Replicated Data Store
- odbc.pl
- oset.pl -- Ordered set manipulation
- zip.pl -- Access resource ZIP archives
- redis.pl -- Redis client
- check.pl -- Consistency checking
- prolog_stack.pl -- Examine the Prolog stack
- threadutil.pl -- Interactive thread utilities
- prolog_autoload.pl -- Autoload all dependencies
- qsave.pl -- Save current program as a state or executable
- stomp.pl -- STOMP client.
- redis_streams.pl -- Using Redis streams
- editline.pl -- BSD libedit based command line editing
- optparse.pl -- command line parsing
- win_menu.pl -- Console window menu
- tty.pl -- Terminal operations
- streampool.pl -- Input multiplexing
- plunit.pl -- Unit Testing
- ansi_term.pl -- Print decorated text to ANSI consoles
- listing.pl -- List programs and pretty print clauses
- doc_latex.pl -- PlDoc LaTeX backend
- explain.pl -- Describe Prolog Terms
- prolog_trace.pl -- Print access to predicates
- prolog_wrap.pl -- Wrapping predicates
- wfs.pl -- Well Founded Semantics interface
- prolog_stream.pl -- A stream with Prolog callbacks
- shell.pl -- Elementary shell commands
- terms.pl -- Term manipulation
- when.pl -- Conditional coroutining
- mqi.pl
- prolog_codewalk.pl -- Prolog code walker
- help.pl -- Text based manual
- varnumbers.pl -- Utilities for numbered terms
- hashtable.pl -- Hash tables
- fastrw.pl -- Fast reading and writing of terms
- isub.pl -- isub: a string similarity measure
- files.pl
- yaml.pl -- Process YAML data
- protobufs.pl -- Google's Protocol Buffers ("protobufs")
- codesio.pl -- I/O on Lists of Character Codes
- coinduction.pl -- Co-Logic Programming
- portray_text.pl -- Portray text
- c14n2.pl -- C14n2 canonical XML documents
- prolog_metainference.pl -- Infer meta-predicate properties
- pdt_console.pl
- prolog_jiti.pl -- Just In Time Indexing (JITI) utilities
- writef.pl -- Old-style formatted write
- test_cover.pl -- Clause coverage analysis
- xmlenc.pl -- XML encryption library
- double_metaphone.pl -- Phonetic string matching
- xmldsig.pl -- XML Digital signature
- library
- concurrent(+N, :Goals, +Options) is semidet
- Run Goals in parallel using N threads. This call blocks until
all work has been done. The Goals must be independent. They
should not communicate using shared variables or any form of
global data. All Goals must be thread-safe.
Execution succeeds if all goals have succeeded. If one goal fails or throws an exception, other workers are abandoned as soon as possible and the entire computation fails or re-throws the exception. Note that if multiple goals fail or raise an error it is not defined which error or failure is reported.
On successful completion, variable bindings are returned. Note however that threads have independent stacks and therefore the goal is copied to the worker thread and the result is copied back to the caller of concurrent/3.
Choosing the right number of threads is not always obvious. Here are some scenarios:
- If the goals are CPU intensive and normally all succeeding, typically the number of CPUs is the optimal number of threads. Less does not use all CPUs, more wastes time in context switches and also uses more memory.
- If the tasks are I/O bound the number of threads is typically higher than the number of CPUs.
- If one or more of the goals may fail or produce an error, using a higher number of threads may find this earlier.
- Arguments:
-
N - Number of worker-threads to create. Using 1, no threads are created. If N is larger than the number of Goals we create exactly as many threads as there are Goals. Goals - List of callable terms. Options - Passed to thread_create/3 for creating the workers. Only options changing the stack-sizes can be used. In particular, do not pass the detached or alias options. - See also
- - In many cases, concurrent_maplist/2 and friends is easier to program and is tractable to program analysis.