/usr/lib/swi-prolog/library/apply.pl is in swi-prolog-nox 7.6.4+dfsg-1build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 | /* Part of SWI-Prolog
Author: Jan Wielemaker
E-mail: J.Wielemaker@vu.nl
WWW: http://www.swi-prolog.org
Copyright (c) 2007-2015, University of Amsterdam
VU University Amsterdam
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
*/
:- module(apply,
[ include/3, % :Pred, +List, -Ok
exclude/3, % :Pred. +List, -NotOk
partition/4, % :Pred, +List, -Included, -Excluded
partition/5, % :Pred, +List, ?Less, ?Equal, ?Greater
maplist/2, % :Pred, +List
maplist/3, % :Pred, ?List, ?List
maplist/4, % :Pred, ?List, ?List, ?List
maplist/5, % :Pred, ?List, ?List, ?List, ?List
convlist/3, % :Pred, +List, -List
foldl/4, % :Pred, +List, ?V0, ?V
foldl/5, % :Pred, +List1, +List2, ?V0, ?V
foldl/6, % :Pred, +List1, +List2, +List3, ?V0, ?V
foldl/7, % :Pred, +List1, +List2, +List3, +List4,
% ?V0, ?V
scanl/4, % :Pred, +List, ?V0, ?Vs
scanl/5, % :Pred, +List1, +List2, ?V0, ?Vs
scanl/6, % :Pred, +List1, +List2, +List3, ?V0, ?Vs
scanl/7 % :Pred, +List1, +List2, +List3, +List4,
% ?V0, ?Vs
]).
:- use_module(library(error)).
/** <module> Apply predicates on a list
This module defines meta-predicates that apply a predicate on all
members of a list.
@see apply_macros.pl provides compile-time expansion for part of this
library.
@see http://www.cs.otago.ac.nz/staffpriv/ok/pllib.htm
@tbd Add include/4, include/5, exclude/4, exclude/5
*/
:- meta_predicate
include(1, +, -),
exclude(1, +, -),
partition(1, +, -, -),
partition(2, +, -, -, -),
maplist(1, ?),
maplist(2, ?, ?),
maplist(3, ?, ?, ?),
maplist(4, ?, ?, ?, ?),
convlist(2, +, -),
foldl(3, +, +, -),
foldl(4, +, +, +, -),
foldl(5, +, +, +, +, -),
foldl(6, +, +, +, +, +, -),
scanl(3, +, +, -),
scanl(4, +, +, +, -),
scanl(5, +, +, +, +, -),
scanl(6, +, +, +, +, +, -).
%! include(:Goal, +List1, ?List2) is det.
%
% Filter elements for which Goal succeeds. True if List2 contains
% those elements Xi of List1 for which call(Goal, Xi) succeeds.
%
% @see Older versions of SWI-Prolog had sublist/3 with the same
% arguments and semantics.
include(Goal, List, Included) :-
include_(List, Goal, Included).
include_([], _, []).
include_([X1|Xs1], P, Included) :-
( call(P, X1)
-> Included = [X1|Included1]
; Included = Included1
),
include_(Xs1, P, Included1).
%! exclude(:Goal, +List1, ?List2) is det.
%
% Filter elements for which Goal fails. True if List2 contains
% those elements Xi of List1 for which call(Goal, Xi) fails.
exclude(Goal, List, Included) :-
exclude_(List, Goal, Included).
exclude_([], _, []).
exclude_([X1|Xs1], P, Included) :-
( call(P, X1)
-> Included = Included1
; Included = [X1|Included1]
),
exclude_(Xs1, P, Included1).
%! partition(:Pred, +List, ?Included, ?Excluded) is det.
%
% Filter elements of List according to Pred. True if Included
% contains all elements for which call(Pred, X) succeeds and
% Excluded contains the remaining elements.
partition(Pred, List, Included, Excluded) :-
partition_(List, Pred, Included, Excluded).
partition_([], _, [], []).
partition_([H|T], Pred, Incl, Excl) :-
( call(Pred, H)
-> Incl = [H|I],
partition_(T, Pred, I, Excl)
; Excl = [H|E],
partition_(T, Pred, Incl, E)
).
%! partition(:Pred, +List, ?Less, ?Equal, ?Greater) is semidet.
%
% Filter List according to Pred in three sets. For each element Xi
% of List, its destination is determined by call(Pred, Xi, Place),
% where Place must be unified to one of =|<|=, =|=|= or =|>|=.
% Pred must be deterministic.
partition(Pred, List, Less, Equal, Greater) :-
partition_(List, Pred, Less, Equal, Greater).
partition_([], _, [], [], []).
partition_([H|T], Pred, L, E, G) :-
call(Pred, H, Diff),
partition_(Diff, H, Pred, T, L, E, G).
partition_(<, H, Pred, T, L, E, G) :-
!,
L = [H|Rest],
partition_(T, Pred, Rest, E, G).
partition_(=, H, Pred, T, L, E, G) :-
!,
E = [H|Rest],
partition_(T, Pred, L, Rest, G).
partition_(>, H, Pred, T, L, E, G) :-
!,
G = [H|Rest],
partition_(T, Pred, L, E, Rest).
partition_(Diff, _, _, _, _, _, _) :-
must_be(oneof([<,=,>]), Diff).
/*******************************
* MAPLIST/2... *
*******************************/
%! maplist(:Goal, ?List)
%
% True if Goal can successfully be applied on all elements of
% List. Arguments are reordered to gain performance as well as to
% make the predicate deterministic under normal circumstances.
maplist(Goal, List) :-
maplist_(List, Goal).
maplist_([], _).
maplist_([Elem|Tail], Goal) :-
call(Goal, Elem),
maplist_(Tail, Goal).
%! maplist(:Goal, ?List1, ?List2)
%
% As maplist/2, operating on pairs of elements from two lists.
maplist(Goal, List1, List2) :-
maplist_(List1, List2, Goal).
maplist_([], [], _).
maplist_([Elem1|Tail1], [Elem2|Tail2], Goal) :-
call(Goal, Elem1, Elem2),
maplist_(Tail1, Tail2, Goal).
%! maplist(:Goal, ?List1, ?List2, ?List3)
%
% As maplist/2, operating on triples of elements from three lists.
maplist(Goal, List1, List2, List3) :-
maplist_(List1, List2, List3, Goal).
maplist_([], [], [], _).
maplist_([Elem1|Tail1], [Elem2|Tail2], [Elem3|Tail3], Goal) :-
call(Goal, Elem1, Elem2, Elem3),
maplist_(Tail1, Tail2, Tail3, Goal).
%! maplist(:Goal, ?List1, ?List2, ?List3, ?List4)
%
% As maplist/2, operating on quadruples of elements from four
% lists.
maplist(Goal, List1, List2, List3, List4) :-
maplist_(List1, List2, List3, List4, Goal).
maplist_([], [], [], [], _).
maplist_([Elem1|Tail1], [Elem2|Tail2], [Elem3|Tail3], [Elem4|Tail4], Goal) :-
call(Goal, Elem1, Elem2, Elem3, Elem4),
maplist_(Tail1, Tail2, Tail3, Tail4, Goal).
%! convlist(:Goal, +ListIn, -ListOut) is det.
%
% Similar to maplist/3, but elements for which call(Goal, ElemIn, _)
% fails are omitted from ListOut. For example (using library(yall)):
%
% ```
% ?- convlist([X,Y]>>(integer(X), Y is X^2),
% [3, 5, 4.4, 2], L).
% L = [9, 25, 4].
% ```
%
% @compat Also appears in YAP =|library(maplist)|= and SICStus
% =|library(lists)|=.
convlist(Goal, ListIn, ListOut) :-
convlist_(ListIn, ListOut, Goal).
convlist_([], [], _).
convlist_([H0|T0], ListOut, Goal) :-
( call(Goal, H0, H)
-> ListOut = [H|T],
convlist_(T0, T, Goal)
; convlist_(T0, ListOut, Goal)
).
/*******************************
* FOLDL *
*******************************/
%! foldl(:Goal, +List, +V0, -V).
%! foldl(:Goal, +List1, +List2, +V0, -V).
%! foldl(:Goal, +List1, +List2, +List3, +V0, -V).
%! foldl(:Goal, +List1, +List2, +List3, +List4, +V0, -V).
%
% Fold a list, using arguments of the list as left argument. The
% foldl family of predicates is defined by:
%
% ==
% foldl(P, [X11,...,X1n], ..., [Xm1,...,Xmn], V0, Vn) :-
% P(X11, ..., Xm1, V0, V1),
% ...
% P(X1n, ..., Xmn, V', Vn).
% ==
foldl(Goal, List, V0, V) :-
foldl_(List, Goal, V0, V).
foldl_([], _, V, V).
foldl_([H|T], Goal, V0, V) :-
call(Goal, H, V0, V1),
foldl_(T, Goal, V1, V).
foldl(Goal, List1, List2, V0, V) :-
foldl_(List1, List2, Goal, V0, V).
foldl_([], [], _, V, V).
foldl_([H1|T1], [H2|T2], Goal, V0, V) :-
call(Goal, H1, H2, V0, V1),
foldl_(T1, T2, Goal, V1, V).
foldl(Goal, List1, List2, List3, V0, V) :-
foldl_(List1, List2, List3, Goal, V0, V).
foldl_([], [], [], _, V, V).
foldl_([H1|T1], [H2|T2], [H3|T3], Goal, V0, V) :-
call(Goal, H1, H2, H3, V0, V1),
foldl_(T1, T2, T3, Goal, V1, V).
foldl(Goal, List1, List2, List3, List4, V0, V) :-
foldl_(List1, List2, List3, List4, Goal, V0, V).
foldl_([], [], [], [], _, V, V).
foldl_([H1|T1], [H2|T2], [H3|T3], [H4|T4], Goal, V0, V) :-
call(Goal, H1, H2, H3, H4, V0, V1),
foldl_(T1, T2, T3, T4, Goal, V1, V).
/*******************************
* SCANL *
*******************************/
%! scanl(:Goal, +List, +V0, -Values).
%! scanl(:Goal, +List1, +List2, +V0, -Values).
%! scanl(:Goal, +List1, +List2, +List3, +V0, -Values).
%! scanl(:Goal, +List1, +List2, +List3, +List4, +V0, -Values).
%
% Left scan of list. The scanl family of higher order list
% operations is defined by:
%
% ==
% scanl(P, [X11,...,X1n], ..., [Xm1,...,Xmn], V0,
% [V0,V1,...,Vn]) :-
% P(X11, ..., Xm1, V0, V1),
% ...
% P(X1n, ..., Xmn, V', Vn).
% ==
scanl(Goal, List, V0, [V0|Values]) :-
scanl_(List, Goal, V0, Values).
scanl_([], _, _, []).
scanl_([H|T], Goal, V, [VH|VT]) :-
call(Goal, H, V, VH),
scanl_(T, Goal, VH, VT).
scanl(Goal, List1, List2, V0, [V0|Values]) :-
scanl_(List1, List2, Goal, V0, Values).
scanl_([], [], _, _, []).
scanl_([H1|T1], [H2|T2], Goal, V, [VH|VT]) :-
call(Goal, H1, H2, V, VH),
scanl_(T1, T2, Goal, VH, VT).
scanl(Goal, List1, List2, List3, V0, [V0|Values]) :-
scanl_(List1, List2, List3, Goal, V0, Values).
scanl_([], [], [], _, _, []).
scanl_([H1|T1], [H2|T2], [H3|T3], Goal, V, [VH|VT]) :-
call(Goal, H1, H2, H3, V, VH),
scanl_(T1, T2, T3, Goal, VH, VT).
scanl(Goal, List1, List2, List3, List4, V0, [V0|Values]) :-
scanl_(List1, List2, List3, List4, Goal, V0, Values).
scanl_([], [], [], [], _, _, []).
scanl_([H1|T1], [H2|T2], [H3|T3], [H4|T4], Goal, V, [VH|VT]) :-
call(Goal, H1, H2, H3, H4, V, VH),
scanl_(T1, T2, T3, T4, Goal, VH, VT).
/*******************************
* SANDBOX *
*******************************/
:- multifile
sandbox:safe_meta_predicate/1.
safe_api(Name/Arity, sandbox:safe_meta_predicate(apply:Name/Arity)).
term_expansion(safe_api, Clauses) :-
module_property(apply, exports(API)),
maplist(safe_api, API, Clauses).
safe_api.
|