- swipl
- library
- error.pl
- debug.pl
- apply.pl
- lists.pl
- broadcast.pl
- predicate_options.pl
- shlib.pl
- option.pl
- thread_pool.pl
- gensym.pl
- settings.pl
- 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 -- 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
- git.pl -- Run GIT commands
- ctypes.pl -- Character code classification
- utf8.pl -- UTF-8 encoding/decoding on lists of character codes.
- base64.pl -- Base64 encoding and decoding
- persistency.pl -- Provide persistent dynamic predicates
- pure_input.pl -- Pure Input from files and streams
- nb_set.pl -- Non-backtrackable sets
- aggregate.pl -- Aggregation operators on backtrackable predicates
- csv.pl -- Process CSV (Comma-Separated Values) data
- 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
- rbtrees.pl -- Red black trees
- nb_rbtrees.pl -- Non-backtrackable operations on red black trees
- random.pl -- Random numbers
- sandbox.pl -- Sandboxed Prolog code
- prolog_format.pl -- Analyse format specifications
- 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
- tables.pl -- XSB interface to tables
- strings.pl -- String utilities
- oset.pl -- Ordered set manipulation
- intercept.pl -- Intercept and signal interface
- optparse.pl -- command line parsing
- help.pl -- Text based manual
- check.pl -- Consistency checking
- coinduction.pl -- Co-Logic Programming
- wfs.pl -- Well Founded Semantics interface
- listing.pl -- List programs and pretty print clauses
- prolog_stack.pl -- Examine the Prolog stack
- when.pl -- Conditional coroutining
- prolog_profile.pl -- Execution profiler
- prolog_coverage.pl -- Coverage analysis tool
- terms.pl -- Term manipulation
- date.pl -- Process dates and times
- quintus.pl -- Quintus compatibility
- threadutil.pl -- Interactive thread utilities
- ansi_term.pl -- Print decorated text to ANSI consoles
- prolog_codewalk.pl -- Prolog code walker
- charsio.pl -- I/O on Lists of Character Codes
- statistics.pl -- Get information about resource usage
- system.pl -- System utilities
- prolog_history.pl -- Per-directory persistent commandline history
- prolog_config.pl -- Provide configuration information
- codesio.pl -- I/O on Lists of Character Codes
- prolog_versions.pl -- Demand specific (Prolog) versions
- edit.pl -- Editor interface
- make.pl -- Reload modified source files
- prolog_metainference.pl -- Infer meta-predicate properties
- base32.pl -- Base32 encoding and decoding
- streams.pl -- Manage Prolog streams
- library
- phrase_from_file(:Grammar, +File) is nondet
- Process the content of File using the DCG rule Grammar. The
space usage of this mechanism depends on the length of the not
committed part of Grammar. Committed parts of the temporary list
are reclaimed by the garbage collector, while the list is
extended on demand due to unification of the attributed tail
variable. Below is an example that counts the number of times a
string appears in a file. The library dcg/basics provides
string//1 matching an arbitrary string and remainder//1 which
matches the remainder of the input without parsing.
:- use_module(library(dcg/basics)). file_contains(File, Pattern) :- phrase_from_file(match(Pattern), File). match(Pattern) --> string(_), string(Pattern), remainder(_). match_count(File, Pattern, Count) :- aggregate_all(count, file_contains(File, Pattern), Count).This can be called as (note that the pattern must be a string (code list)):
?- match_count('pure_input.pl', `file`, Count).