Functions — github.com/dagit/rust-prolog

CodeHub MCPcopy Create free account

hub / github.com/dagit/rust-prolog / functions

Functions65 in github.com/dagit/rust-prolog

⨍ Functions 65 ◇ Types & classes 15

↓ 19 callersMethodinsert_term

(&mut self, t: Term, lt: Lifetime)

↓ 13 callersFunctionmake_atom

Helper to build a simple atom like "human(socrates)"

src/solve.rs:493

↓ 8 callersFunctionassert

Add a new assertion at the end of the current database. */

src/solve.rs:48

↓ 8 callersFunctionmake_const

(heap: &mut Heap, name: &str)

src/solve.rs:497

↓ 6 callersMethodinsert_string

(&mut self, s: String, lt: Lifetime)

↓ 6 callersFunctionmake_goals

(atoms: Vec<Atom>)

src/solve.rs:512

↓ 6 callersFunctionmake_search

( db: &'a Database, heap: &'a mut Heap, interrupted: &'a Arc<AtomicBool>, goal

src/solve.rs:519

↓ 5 callersFunctionmake_interrupted

src/solve.rs:508

↓ 4 callersFunctionexec_cmds

[exec_cmds cmds] executes the list of toplevel commands [cmds]. */

src/main.rs:119

↓ 3 callersFunctionmake_complementary

Compute the complementary term for an atom. We assume the arity of `not` is exactly 1 and fail to produce a term if it is used at any other arity. No

src/syntax.rs:284

↓ 3 callersFunctionsubst_term

[subst_term sub t] substitutes in term [t] values for variables, as specified by the associative list [s]. It substitutes repeatedly until the terms s

src/syntax.rs:77

↓ 2 callersFunctioninsert_thing

( perm_heap: &mut HashSet<Arc<A>>, ephemeral_heap: &mut HashSet<Arc<A>>, t: A, lt: Lifetime, )

↓ 2 callersFunctionmake_var

(heap: &mut Heap, name: &str, level: i32)

src/solve.rs:501

↓ 2 callersMethodnext_outcome

Like `next()` but distinguishes "no more solutions" from "search depth exhausted".

src/solve.rs:275

↓ 2 callersFunctionrenumber_atom

[renumber_atom n a] renumbers all variable instances occurring in atom [a] so that they have level [n]. */

src/solve.rs:77

↓ 2 callersFunctionstring_of_term

[string_of_term t] converts term [t] to its string representation. */

src/syntax.rs:99

↓ 2 callersFunctionterm_to_atom

src/syntax.rs:242

↓ 2 callersFunctionunify_lists

[unify_lists env lst1 lst2] unifies two lists of terms in current environment [env] and returns a new environment [env'] on success. It returns [NoUni

src/unify.rs:50

↓ 2 callersFunctionunify_terms

[unify_terms env t1 t2] unifies terms [t1] and [t2] in the current environment [env]. On success it returns the environment extended with the result o

src/unify.rs:13

↓ 1 callersFunctionarb_constant

src/syntax.rs:345

↓ 1 callersFunctionarb_term

src/syntax.rs:349

↓ 1 callersMethodcleanup

↓ 1 callersFunctionexec_cmd

[exec_cmd cmd] executes the toplevel command [cmd]. Returns Some() when the computation succeeded and None when the command failed. */

↓ 1 callersFunctionexec_file

[exec_file fn] executes the contents of file [fn]. */

↓ 1 callersFunctionexists

[exists fn ls] returns [true] if [fn] returns true on at least one element of [ls], and returns [false] otherwise. This was added to mimic the standar

src/syntax.rs:212

↓ 1 callersFunctiongenerate_contrapositives

Look through the user's inference rule [a :- b1, ..., bn] and compute all the contrapositives of the rule: not(b1) :- not(a), b2, ..., bn not(b2) :- n

src/syntax.rs:241

↓ 1 callersMethodhas_more_choices

Whether there are still remaining choice points to explore.

src/solve.rs:299

↓ 1 callersFunctionis_complementary

uses unification to search for framed atoms whose complement unifies with the given atom. */

src/solve.rs:316

↓ 1 callersFunctionlist_map

(list: &Term, f: &dyn Fn(&Term) -> A)

src/syntax.rs:134

↓ 1 callersFunctionlookup

[lookup env x] returns the value of variable instance [x] in environment [env]. It returns [Var x] if the variable does not occur in [env]. */

src/syntax.rs:66

↓ 1 callersFunctionnat_to_word

src/syntax.rs:158

↓ 1 callersMethodnext_token

src/lexer.rs:65

↓ 1 callersFunctionoccurs

[occurs x t] returns [true] when variable instance [x] appears in term [t]. */

src/syntax.rs:226

↓ 1 callersFunctionreduce_atom

[reduce_atom a asrl] reduces atom [a] to subgoals by using the first assertion in the assertion list [asrl] whose conclusion matches [a]. It returns [

src/solve.rs:342

↓ 1 callersFunctionrenumber_term

[renumber_term t n] renumbers all variable instances occurring in term [t] so that they have level [n]. */

src/solve.rs:59

↓ 1 callersMethodreset_for_depth

Reset solver state for a new depth iteration.

src/solve.rs:140

↓ 1 callersMethodsolve_step

Iterative solver for a single depth level. Replaces the former mutually-recursive Solver::solve/continue_search pair. Every former recursive c

src/solve.rs:151

↓ 1 callersFunctionsolve_toplevel

[solve_toplevel c] searches for the proof of clause [c] using the "global" database. This function is called from the main program */

src/solve.rs:371

↓ 1 callersMethodsolver_next

Advance the search by one solution at the current depth level.

src/solve.rs:251

↓ 1 callersFunctionstring_of_app

src/syntax.rs:117

↓ 1 callersFunctionstring_of_const

src/syntax.rs:108

↓ 1 callersFunctionstring_of_env

[string_of_env env] converts environment [env] to its string representation. It only keeps instance variables at level 0, i.e., those that appear in t

src/syntax.rs:191

↓ 1 callersFunctionstring_of_list

(args: &[Arc<Term>])

src/syntax.rs:180

↓ 1 callersFunctionunify_atoms

[unify_atoms env a1 a2] unifies atomic propositions [a1] and [a2] in current environment [env] and returns a new environment [env'] on success. It rai

src/unify.rs:70

Functionarb_atom

src/syntax.rs:370

Functionarb_variable

src/syntax.rs:341

src/main.rs:144

Methodmatch_and_consume

( text: &mut &'input str, pos: &mut usize, re: &Regex, action: F, )

src/lexer.rs:46

(text: &'input str)

src/lexer.rs:38

( db: &'a Database, heap: &'a mut Heap, interrupted: &'a Arc<AtomicBool>, goal

src/solve.rs:117

src/lexer.rs:126

src/solve.rs:307

Functionsolve_empty_database

src/solve.rs:634

Functionsolve_interrupted

src/solve.rs:616

Functionsolve_no_match

src/solve.rs:545

Functionsolve_simple_fact

src/solve.rs:529

Functionsolve_variable_binding

src/solve.rs:563

Functionsolve_with_rule

src/solve.rs:591

Functionstr_to_nat

(heap: &mut Heap, input: &str, lt: Lifetime)

src/syntax.rs:314

Functionstring_of_env_empty_is_yes

src/syntax.rs:499

Functionvar_levels

Collect all variable levels from a term

src/solve.rs:427

Functionvec_to_list

(heap: &mut Heap, elts: Vec<Arc<Term>>, lt: Lifetime)

src/syntax.rs:325