1/*  Part of Ciao Prolog compatibility library
    2
    3    Author:        The Ciao Development Team, ported by Edison Mera
    4    E-mail:        efmera@gmail.com
    5    WWW:           http://www.edisonm.com
    6    Copyright (C): 2013, Process Design Center, Breda, The Netherlands.
    7
    8    This program is free software; you can redistribute it and/or
    9    modify it under the terms of the GNU General Public License
   10    as published by the Free Software Foundation; either version 2
   11    of the License, or (at your option) any later version.
   12
   13    This program is distributed in the hope that it will be useful,
   14    but WITHOUT ANY WARRANTY; without even the implied warranty of
   15    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   16    GNU General Public License for more details.
   17
   18    You should have received a copy of the GNU General Public
   19    License along with this library; if not, write to the Free Software
   20    Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
   21
   22    As a special exception, if you link this library with other files,
   23    compiled with a Free Software compiler, to produce an executable, this
   24    library does not by itself cause the resulting executable to be covered
   25    by the GNU General Public License. This exception does not however
   26    invalidate any other reasons why the executable file might be covered by
   27    the GNU General Public License.
   28*/
   29
   30:- module(terms_vars, [varset/2, intersect_vars/3, member_var/2, diff_vars/3,
   31		       varsbag/3, term_variables/2],
   32	  [assertions]).   33
   34varset(Term, List) :- term_variables(Term, List).
   35
   36%-------------------------------------------------------------------------
   37
   38:- pred varset_in_args(T, LL) : nonvar(T) => list(LL, list(var)) # "Each
   39   list of @var{LL} contains the variables of an argument of @var{T},
   40   for each argument, and in left to right order.".
   41
   42varset_in_args(Term, Xss) :-
   43	Term =.. [_|Args],
   44	vars_in_args(Args, Xss).
   45
   46vars_in_args([],         []).
   47vars_in_args([Arg|Rest], [Arg_list|Rest_list]) :-
   48	varset(Arg, Arg_list),
   49	vars_in_args(Rest, Rest_list).
   50
   51intersect_vars([],     _,  []).
   52intersect_vars([X|S1], S2, S) :-
   53	( member_var(S2, X) ->
   54	    S = [X|SList] ;
   55	    S = SList ),
   56	intersect_vars(S1, S2, SList).
   57
   58diff_vars([],     _L, []).
   59diff_vars([H|L1], L2, L3) :-
   60	member_var(L2, H),
   61	!,
   62	diff_vars(L1, L2, L3).
   63diff_vars([H|L1], L2, [H|L3]) :-
   64	diff_vars(L1, L2, L3).
   65
   66% member_var([],       _) :- fail.
   67member_var([E|List], Ele) :-
   68	E == Ele -> true ; member_var(List, Ele).

 varsbag(+Term, -Vs, ?Xs)

Vs is the list of all the variables in Term ordered as they appear in Term right-to-left depth-first (including duplicates) plus Xs.

   76varsbag(X, Vars, Tail) :-
   77	var(X), !,
   78	Vars = [X|Tail].
   79varsbag([H|T], Vars, Tail) :- !,
   80	varsbag(H, Vars,  Tail0),
   81	varsbag(T, Tail0, Tail).
   82varsbag(Term, Vars, Tail) :-
   83	functor(Term, _, A),
   84	go_inside(A, Term, Vars, Tail).
   85
   86go_inside(0, _, Tail, Tail) :- !.
   87go_inside(N, T, Bag,  Tail) :-
   88	Nth is N-1,
   89	arg(N, T, ARG),
   90	varsbag(ARG, Bag, Tail0),
   91	go_inside(Nth, T, Tail0, Tail)