YAP can emulate apply.pl with apply_macros.yap.
This commit is contained in:
Vítor Santos Costa
parent
b5dc71d080
commit
5fbede1afa
|
|
@ -26,7 +26,6 @@ YAP_EXTRAS=@YAP_EXTRAS@
|
|||
|
||||
PROGRAMS= \
|
||||
$(srcdir)/aggregate.pl \
|
||||
$(srcdir)/apply.pl \
|
||||
$(srcdir)/error.pl \
|
||||
$(srcdir)/occurs.yap \
|
||||
$(srcdir)/pairs.pl
|
||||
|
|
|
|||
144
GPL/apply.pl
144
GPL/apply.pl
|
|
@ -1,144 +0,0 @@
|
|||
/* $Id: apply.pl,v 1.1 2008-02-12 17:03:52 vsc Exp $
|
||||
|
||||
Part of SWI-Prolog
|
||||
|
||||
Author: Jan Wielemaker
|
||||
E-mail: wielemak@science.uva.nl
|
||||
WWW: http://www.swi-prolog.org
|
||||
Copyright (C): 1985-2007, University of Amsterdam
|
||||
|
||||
This program is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public License
|
||||
as published by the Free Software Foundation; either version 2
|
||||
of the License, or (at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public
|
||||
License along with this library; if not, write to the Free Software
|
||||
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||
|
||||
As a special exception, if you link this library with other files,
|
||||
compiled with a Free Software compiler, to produce an executable, this
|
||||
library does not by itself cause the resulting executable to be covered
|
||||
by the GNU General Public License. This exception does not however
|
||||
invalidate any other reasons why the executable file might be covered by
|
||||
the GNU General Public License.
|
||||
*/
|
||||
|
||||
:- 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
|
||||
]).
|
||||
:- 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 Move maplist/N from boot/apply.pl to here.
|
||||
@tbd Add include/4, include/5, exclude/4, exclude/5
|
||||
*/
|
||||
|
||||
:- module_transparent
|
||||
include/3,
|
||||
include_/3,
|
||||
exclude/3,
|
||||
exclude_/3,
|
||||
partition/4,
|
||||
partition_/4,
|
||||
partition/5,
|
||||
partition_/5,
|
||||
partition_7.
|
||||
|
||||
|
||||
%% include(:Goal, +List1, ?List2) is det.
|
||||
%
|
||||
% Filter elements for which Goal succeed. 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, [H|L], E, G) :- !,
|
||||
partition_(T, Pred, L, E, G).
|
||||
partition_(=, H, Pred, T, L, [H|E], G) :- !,
|
||||
partition_(T, Pred, L, E, G).
|
||||
partition_(>, H, Pred, T, L, E, [H|G]) :- !,
|
||||
partition_(T, Pred, L, E, G).
|
||||
partition_(Diff, _, _, _, _, _, _) :-
|
||||
must_be(oneof([<.=,>]), Diff).
|
||||
|
||||
|
||||
Reference in New Issue