Lines Matching defs:is
10 % Software distributed under the License is distributed on an "AS IS"
15 % The Original Code is The ECLiPSe Constraint Logic Programming System.
16 % The Initial Developer of the Original Code is Cisco Systems, Inc.
68 list argument is required to be a proper list in the sense of is_list/1,
116 % L3 is the intersection of L1 and L2, with arguments ordered as in L1
129 % L3 is (L1-L2) + L2
149 % succeeds iff List is a proper list and Length is its length
157 New is SoFar+1,
201 Depth1 is Depth - 1,
267 Offset is Imin-1,
268 N is Imax-Offset,
272 I is J+Offset,
287 amode:(collection_to_list(+,-) is semidet),
290 fail_if:"Collection is not a collection",
296 The list is returned unchanged.
298 The array is converted into a list using array_list/2.
300 subscript/3 is called to evaluate the subscript reference. If this
301 results in a single array element, a one-element list is returned.
302 If subscript/3 results in a sub-array, this is converted into a list.
303 For multi-dimensional sub-arrays, only the top level is converted
306 If the collection is nested (multi-dimensional), the top N nesting
309 If the collection is nested (multi-dimensional), all nesting
310 structure is removed and a flat list is returned. All subterms that
360 % Xs is a list, D>0 or D<0
367 % X is either sub-collection or element
369 D1 is D-1,
406 amode:(collection_to_array(+,-) is semidet),
407 fail_if:"Collection is not a collection",
415 The list is converted into an array using array_list/2.
417 The array is returned unchanged.
419 subscript/3 is called to evaluate the subscript reference. If this
420 results in a single array element, a one-element array is returned.
421 If subscript/3 results in a sub-array, this is returned.
423 If the collection is nested (multi-dimensional), the top N nesting
426 If the collection is nested (multi-dimensional), all nesting
427 structure is removed and a flat array is returned. All subterms that
463 % Xz is an array, D>0 or D<0
470 % X is either sub-collection or element
472 D1 is D-1,
506 amode:(halve(+,-,-) is det),
509 the original List. The length of the sub-lists is half the length of
510 the original. If the original length is odd, Front is one longer"),
531 amode:(splice(+,+,-) is det),
532 amode:(splice(-,-,+) is multi),
534 starting with the first. When one input list is longer, its extra
537 The reverse mode splice(-,-,+) is nondeterministic, and
587 amode:(shuffle(+,-) is det),
610 amode:(print_list(+) is det),
622 amode:(middle_out(+,-) is det),
653 summary:"Succeeds if List2 is List1 less an occurence of Element in List1.\n\n",
654 amode:(select(+,+,-) is nondet), % redundant, but common
655 amode:(select(-,+,-) is nondet), % redundant, but common
656 amode:(select(-,-,-) is multi),
665 The definition of this Prolog library predicate is:
708 summary:"Succeeds if List2 is List1 less an occurence of Element in List1.\n\n",
709 amode:(delete(+,+,-) is nondet), % redundant, but common
710 amode:(delete(-,+,-) is nondet), % redundant, but common
711 amode:(delete(-,-,-) is multi),
720 The definition of this Prolog library predicate is:
736 amode:(intersection(+,+,-) is det),
739 Common is unified with a list which contains the common elements of
742 The definition of this Prolog library predicate is:
765 summary:"Succeeds if the length of list List is N.\n\n",
766 amode:(length(+,+) is semidet),
767 amode:(length(+,-) is det),
768 amode:(length(-,+) is det),
769 amode:(length(-,-) is multi),
774 is:
785 N1 is N+1,
790 N1 is Length-1,
803 amode:(member(-,+) is nondet),
804 amode:(member(+,-) is nondet),
805 amode:(member(-,-) is multi),
810 If Term is a variable and List is a list, all the members of the list
813 If List is not instantiated, member/2 binds List to a new partial list
816 The definition of this Prolog library predicate is:
830 summary:"Succeeds if Term is a member of the list List.\n\n",
831 amode:(memberchk(+,+) is semidet),
832 amode:(memberchk(+,-) is det),
837 If List is not instantiated, memberchk/2 binds List to a new partial
840 The definition of this Prolog library predicate is:
849 fail_if:" Fails if Term is not a member of the list List.\n\n",
854 summary:"Succeeds if Element is not an element of the list List.\n\n",
855 amode:(nonmember(+,+) is semidet),
858 Used to check that Element is not a member of the list List.
860 The definition of this Prolog library predicate is:
874 fail_if:" Fails if Element is an element of the list List.\n\n",
879 summary:"Succeeds if Remainder is the list which contains those elements of List1\nwhich are not in List2.\n\n",
880 amode:(subtract(+,+,-) is det),
886 The definition of this Prolog library Predicate is:
908 summary:"Succeeds if Union is the list which contains the union of elements in List1\nand those in List2.\n\n",
909 amode:(union(+,+,-) is det),
915 The definition of this Prolog library predicate is:
937 summary:"Succeeds if Reversed is the reversed list List.\n\n",
938 amode:(reverse(+,-) is det),
941 The List is reversed and the resulting list is unified with Reverse.
943 The definition of this Prolog library predicate is:
961 summary:"Succeeds if List3 is the result of appending List2 to List1.\n\n",
962 amode:(append(+,+,-) is det),
963 amode:(append(-,-,+) is multi),
970 The definition of this Prolog library predicate is:
990 Pred with one aditional argument which is this element succeeds.
992 The definition of this Prolog library predicate is:
1007 resat:"Resatisfiable if at least for one element of List the invocation of Pred with this additional argument is resatisfiable.",
1013 summary:"Succeeds if FlatList is the list of all elements in NestedList, as found in\na left-to-right, depth-first traversal of NestedList.\n\n",
1014 amode:(flatten(+,-) is det),
1017 FlatList is the list built from all the non-list elements of NestedList
1018 and the flattened sublists. The sequence of elements in FlatList is
1021 The definition of this Prolog library predicate is:
1044 amode:(flatten(++,+,-) is det),
1092 The definition of this Prolog library predicate is:
1107 resat:"Resatisfiable if at least for one pair of corresponding elements of OldList and NewList the invocation of Pred with these two additional arguments is resatisfiable",
1113 summary:"Succeeds if List is the list which contains all elements from SubList in\nthe same order as in SubList.\n\n",
1114 amode:(subset(-,+) is multi),
1120 The definition of this Prolog library predicate is: