Lines Matching defs:of
4 % The contents of this file are subject to the Cisco-style Mozilla Public
6 % in compliance with the License. You may obtain a copy of the License
15 % The Initial Developer of the Original Code is Cisco Systems, Inc.
53 \item the arity of the structure is not implied (and can be changed
56 Sometimes it is necessary to refer to the numerical position of a
63 arg(year of book, B, Y)
68 of-syntax when working with them, and never write them in canonical
80 the use of an iteration construct
92 Process all elements of one list and construct another:
98 Process a list to compute the sum of its elements:
125 iterate Goals with X ranging over all elements of List.
127 iterate Goals with X ranging over all arguments of StructOrArray.
129 same as before, but Idx is set to the argument position of X in
132 like foreacharg/2, but iterates over all elements of an array
133 of arbitrary dimension.
135 same as before, but Idx is set to the index position of X in
149 much to increment each element of List by).
156 \See{For details and more examples see the description of the
162 \section{Working with Arrays of Items}
165 arrays of items.
166 Arrays can be of any dimension, and can be declared with the
177 query the dimensions of an array:
188 To access a specific element of an array in an expression, specify the index
189 list of the desired element, e.g.\
210 \See{For further details see the Array Notation section of the User Manual.}
217 In pure logic programming, the complete state of a computation is
234 across failures. A typical application is the collection of
239 bag_enter/2, and the whole contents of the bag can be retrieved
241 A simple version of the findall/3 predicate from section \ref{all-solutions}
259 across failures. A typical application is counting of solutions,
260 keeping track of the best solution,
264 backtracking. The content of each slot can be set and retrieved
272 For example, here is a meta-predicate to count the number of solutions
312 The predicates of the write-group are generic in the sense that they
317 printed data can be read back by the predicates of the read-family.
386 Here are some examples of printing numbers:
404 allows to print like the predicates of the write-family:
409 The \%w format allows a number of modifiers in order to access all the
410 existing options for the printing of \eclipse{} terms.
439 gives end of file).
459 \bipref{open/3}{../bips/kernel/iostream/open-3.html} of a device file \\
482 All types of streams are closed using
484 \See{See the complete description of the
487 For network communication over sockets, there is a full set of predicates
510 unification) instead of head unification.
511 Such clauses are written with the {\bf ?-} functor instead of {\bf :-}.
567 The length/2 predicate can be used to compute the length of a list
568 or to construct a list of a given length:
627 Apart from unification/matching, there are a number of generic built-in
661 The copy_term/2 predicate creates a copy of a term with fresh variables:
674 The \eclipse{} module system controls the visibility of
682 %All of what a module exports can be imported by invoking
706 This is a module which contains two predicates. One of them, hello/0
743 i.e.\ in the case where a predicate of the same name is defined
745 In this case, none of the conflicting
758 of the same predicate by specifying several lookup modules:
803 perform some kind of recovery action.
816 goal, if {\tt BTag} occurs as an argument of {\tt Recovery}.
829 printf("Execution of main/3 aborted with %w%n", [Problem])
861 To obtain the CPU time consumption of a (succeeding) goal, use the scheme
913 dictionary of functors, various tables and buffers.
915 This is likely to be the largest consumer of memory.
943 into the resolvent (the sequence of executing goals).
981 returns a list containing the elements of the array in reverse order.