<HTML> <HEAD> <!-- Created by texi2html 1.56k + clip patches and <A href="http://www.clip.dia.fi.upm.es/Software">lpdoc</A> from ciao.texi on 28 January 2007 --> <LINK rel="stylesheet" href="ciao.css" type="text/css"> <TITLE>The Ciao Prolog System - Set Operations</TITLE> </HEAD> <BODY> Go to the <A HREF="ciao_1.html">first</A>, <A HREF="ciao_174.html">previous</A>, <A HREF="ciao_176.html">next</A>, <A HREF="ciao_241.html">last</A> section, <A HREF="ciao_toc.html">table of contents</A>. <P><HR><P> <H1><A NAME="SEC717" HREF="ciao_toc.html#TOC717">Set Operations</A></H1> <P> <A NAME="IDX8003"></A> <P> <STRONG>Author(s):</STRONG> Lena Flood. <P> <STRONG>Version:</STRONG> 1.10#7 (2006/4/26, 19:22:13 CEST) <P> <STRONG>Version of last change:</STRONG> 1.9#239 (2003/12/22, 18:32:52 CET) <P> This module implements set operations. Sets are just ordered lists. <UL> <LI><A HREF="ciao_175.html#SEC718">Usage and interface (sets)</A> <LI><A HREF="ciao_175.html#SEC719">Documentation on exports (sets)</A> </UL> <H2><A NAME="SEC718" HREF="ciao_toc.html#TOC718">Usage and interface (<CODE>sets</CODE>)</A></H2> <div class="cartouche"> <UL> <LI><STRONG>Library usage:</STRONG> <CODE>:- use_module(library(sets)).</CODE> <LI><STRONG>Exports:</STRONG> <UL> <LI><EM>Predicates:</EM> <A NAME="IDX8004"></A> <CODE>insert/3</CODE>, <A NAME="IDX8005"></A> <CODE>ord_delete/3</CODE>, <A NAME="IDX8006"></A> <CODE>ord_member/2</CODE>, <A NAME="IDX8007"></A> <CODE>ord_test_member/3</CODE>, <A NAME="IDX8008"></A> <CODE>ord_subtract/3</CODE>, <A NAME="IDX8009"></A> <CODE>ord_intersection/3</CODE>, <A NAME="IDX8010"></A> <CODE>ord_intersection_diff/4</CODE>, <A NAME="IDX8011"></A> <CODE>ord_intersect/2</CODE>, <A NAME="IDX8012"></A> <CODE>ord_subset/2</CODE>, <A NAME="IDX8013"></A> <CODE>ord_subset_diff/3</CODE>, <A NAME="IDX8014"></A> <CODE>ord_union/3</CODE>, <A NAME="IDX8015"></A> <CODE>ord_union_diff/4</CODE>, <A NAME="IDX8016"></A> <CODE>ord_union_symdiff/4</CODE>, <A NAME="IDX8017"></A> <CODE>ord_union_change/3</CODE>, <A NAME="IDX8018"></A> <CODE>merge/3</CODE>, <A NAME="IDX8019"></A> <CODE>ord_disjoint/2</CODE>, <A NAME="IDX8020"></A> <CODE>setproduct/3</CODE>. </UL> <LI><STRONG>Other modules used:</STRONG> <UL> <LI><EM>System library modules:</EM> <A NAME="IDX8021"></A> <CODE>sort</CODE>. </UL> </UL> </div class="cartouche"> <H2><A NAME="SEC719" HREF="ciao_toc.html#TOC719">Documentation on exports (<CODE>sets</CODE>)</A></H2> <P> <A NAME="IDX8022"></A> <A NAME="IDX8023"></A> <DL> <DT><span class="define">PREDICATE:</span> <B>insert/3:</B> <DD><A NAME="IDX8024"></A> <P> <STRONG>Usage:</STRONG> <CODE>insert(+Set1, +Element, -Set2)</CODE> <UL> <LI><EM>Description:</EM> It is true when <CODE>Set2</CODE> is <CODE>Set1</CODE> with <CODE>Element</CODE> inserted in it, preserving the order. </UL> </DL> <P> <A NAME="IDX8025"></A> <A NAME="IDX8026"></A> <DL> <DT><span class="define">PREDICATE:</span> <B>ord_delete/3:</B> <DD><A NAME="IDX8027"></A> <P> <STRONG>Usage:</STRONG> <CODE>ord_delete(+Set0, +X, -Set)</CODE> <UL> <LI><EM>Description:</EM> It succeeds if <CODE>Set</CODE> is <CODE>Set0</CODE> without element <CODE>X</CODE>. </UL> </DL> <P> <A NAME="IDX8028"></A> <A NAME="IDX8029"></A> <DL> <DT><span class="define">PREDICATE:</span> <B>ord_member/2:</B> <DD><A NAME="IDX8030"></A> <P> <STRONG>Usage:</STRONG> <CODE>ord_member(+X, +Set)</CODE> <UL> <LI><EM>Description:</EM> It succeeds if <CODE>X</CODE> is member of <CODE>Set</CODE>. </UL> </DL> <P> <A NAME="IDX8031"></A> <A NAME="IDX8032"></A> <DL> <DT><span class="define">PREDICATE:</span> <B>ord_test_member/3:</B> <DD><A NAME="IDX8033"></A> <P> <STRONG>Usage:</STRONG> <CODE>ord_test_member(+Set, +X, -Result)</CODE> <UL> <LI><EM>Description:</EM> If <CODE>X</CODE> is member of <CODE>Set</CODE> then <CODE>Result</CODE>=<CODE>yes</CODE>. Otherwise <CODE>Result</CODE>=<CODE>no</CODE>. </UL> </DL> <P> <A NAME="IDX8034"></A> <A NAME="IDX8035"></A> <DL> <DT><span class="define">PREDICATE:</span> <B>ord_subtract/3:</B> <DD><A NAME="IDX8036"></A> <P> <STRONG>Usage:</STRONG> <CODE>ord_subtract(+Set1, +Set2, ?Difference)</CODE> <UL> <LI><EM>Description:</EM> It is true when <CODE>Difference</CODE> contains all and only the elements of <CODE>Set1</CODE> which are not also in <CODE>Set2</CODE>. </UL> </DL> <P> <A NAME="IDX8037"></A> <A NAME="IDX8038"></A> <DL> <DT><span class="define">PREDICATE:</span> <B>ord_intersection/3:</B> <DD><A NAME="IDX8039"></A> <P> <STRONG>Usage:</STRONG> <CODE>ord_intersection(+Set1, +Set2, ?Intersection)</CODE> <UL> <LI><EM>Description:</EM> It is true when <CODE>Intersection</CODE> is the ordered representation of <CODE>Set1</CODE> and <CODE>Set2</CODE>, provided that <CODE>Set1</CODE> and <CODE>Set2</CODE> are ordered lists. </UL> </DL> <P> <A NAME="IDX8040"></A> <A NAME="IDX8041"></A> <DL> <DT><span class="define">PREDICATE:</span> <B>ord_intersection_diff/4:</B> <DD><A NAME="IDX8042"></A> <P> <STRONG>Usage:</STRONG> <CODE>ord_intersection_diff(+Set1, +Set2, -Intersect, -NotIntersect)</CODE> <UL> <LI><EM>Description:</EM> <CODE>Intersect</CODE> contains those elements which are both in <CODE>Set1</CODE> and <CODE>Set2</CODE>, and <CODE>NotIntersect</CODE> those which are in <CODE>Set1</CODE> but not in <CODE>Set2</CODE>. </UL> </DL> <P> <A NAME="IDX8043"></A> <A NAME="IDX8044"></A> <DL> <DT><span class="define">PREDICATE:</span> <B>ord_intersect/2:</B> <DD><A NAME="IDX8045"></A> <P> <STRONG>Usage:</STRONG> <CODE>ord_intersect(+Xs, +Ys)</CODE> <UL> <LI><EM>Description:</EM> Succeeds when the two ordered lists have at least one element in common. </UL> </DL> <P> <A NAME="IDX8046"></A> <A NAME="IDX8047"></A> <DL> <DT><span class="define">PREDICATE:</span> <B>ord_subset/2:</B> <DD><A NAME="IDX8048"></A> <P> <STRONG>Usage:</STRONG> <CODE>ord_subset(+Xs, +Ys)</CODE> <UL> <LI><EM>Description:</EM> Succeeds when every element of <CODE>Xs</CODE> appears in <CODE>Ys</CODE>. </UL> </DL> <P> <A NAME="IDX8049"></A> <A NAME="IDX8050"></A> <DL> <DT><span class="define">PREDICATE:</span> <B>ord_subset_diff/3:</B> <DD><A NAME="IDX8051"></A> <P> <STRONG>Usage:</STRONG> <CODE>ord_subset_diff(+Set1, +Set2, -Difference)</CODE> <UL> <LI><EM>Description:</EM> It succeeds when every element of <CODE>Set1</CODE> appears in <CODE>Set2</CODE> and <CODE>Difference</CODE> has the elements of <CODE>Set2</CODE> which are not in <CODE>Set1</CODE>. </UL> </DL> <P> <A NAME="IDX8052"></A> <A NAME="IDX8053"></A> <DL> <DT><span class="define">PREDICATE:</span> <B>ord_union/3:</B> <DD><A NAME="IDX8054"></A> <P> <STRONG>Usage:</STRONG> <CODE>ord_union(+Set1, +Set2, ?Union)</CODE> <UL> <LI><EM>Description:</EM> It is true when <CODE>Union</CODE> is the union of <CODE>Set1</CODE> and <CODE>Set2</CODE>. When some element occurs in both sets, <CODE>Union</CODE> retains only one copy. </UL> </DL> <P> <A NAME="IDX8055"></A> <A NAME="IDX8056"></A> <DL> <DT><span class="define">PREDICATE:</span> <B>ord_union_diff/4:</B> <DD><A NAME="IDX8057"></A> <P> <STRONG>Usage:</STRONG> <CODE>ord_union_diff(+Set1, +Set2, -Union, -Difference)</CODE> <UL> <LI><EM>Description:</EM> It succeeds when <CODE>Union</CODE> is the union of <CODE>Set1</CODE> and <CODE>Set2</CODE>, and <CODE>Difference</CODE> is <CODE>Set2</CODE> set-minus <CODE>Set1</CODE>. </UL> </DL> <P> <A NAME="IDX8058"></A> <A NAME="IDX8059"></A> <DL> <DT><span class="define">PREDICATE:</span> <B>ord_union_symdiff/4:</B> <DD><A NAME="IDX8060"></A> <P> <STRONG>Usage:</STRONG> <CODE>ord_union_symdiff(+Set1, +Set2, -Union, -Diff)</CODE> <UL> <LI><EM>Description:</EM> It is true when Diff is the symmetric difference of Set1 and Set2, and Union is the union of Set1 and Set2. </UL> </DL> <P> <A NAME="IDX8061"></A> <A NAME="IDX8062"></A> <DL> <DT><span class="define">PREDICATE:</span> <B>ord_union_change/3:</B> <DD><A NAME="IDX8063"></A> <P> <STRONG>Usage:</STRONG> <CODE>ord_union_change(+Set1, +Set2, -Union)</CODE> <UL> <LI><EM>Description:</EM> <CODE>Union</CODE> is the union of <CODE>Set1</CODE> and <CODE>Set2</CODE> and <CODE>Union</CODE> is different from <CODE>Set2</CODE>. </UL> </DL> <P> <A NAME="IDX8064"></A> <A NAME="IDX8065"></A> <DL> <DT><span class="define">PREDICATE:</span> <B>merge/3:</B> <DD><A NAME="IDX8066"></A> <P> <STRONG>Usage:</STRONG> <CODE>merge(+Set1, +Set2, ?Union)</CODE> <UL> <LI><EM>Description:</EM> See <CODE>ord_union/3</CODE>. </UL> </DL> <P> <A NAME="IDX8067"></A> <A NAME="IDX8068"></A> <DL> <DT><span class="define">PREDICATE:</span> <B>ord_disjoint/2:</B> <DD><A NAME="IDX8069"></A> <P> <STRONG>Usage:</STRONG> <CODE>ord_disjoint(+Set1, +Set2)</CODE> <UL> <LI><EM>Description:</EM> <CODE>Set1</CODE> and <CODE>Set2</CODE> have no element in common. </UL> </DL> <P> <A NAME="IDX8070"></A> <A NAME="IDX8071"></A> <DL> <DT><span class="define">PREDICATE:</span> <B>setproduct/3:</B> <DD><A NAME="IDX8072"></A> <P> <STRONG>Usage:</STRONG> <CODE>setproduct(+Set1, +Set2, -Product)</CODE> <UL> <LI><EM>Description:</EM> <CODE>Product</CODE> has all two element sets such that one element is in <CODE>Set1</CODE> and the other in <CODE>set2</CODE>, except that if the same element belongs to both, then the corresponding one element set is in <CODE>Product</CODE>. </UL> </DL> <P><HR><P> Go to the <A HREF="ciao_1.html">first</A>, <A HREF="ciao_174.html">previous</A>, <A HREF="ciao_176.html">next</A>, <A HREF="ciao_241.html">last</A> section, <A HREF="ciao_toc.html">table of contents</A>. </BODY> </HTML>
