<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> <!--NewPage--> <HTML> <HEAD> <!-- Generated by javadoc (build 1.6.0_18) on Fri Dec 09 20:48:14 GMT 2011 --> <TITLE> IntSet </TITLE> <META NAME="date" CONTENT="2011-12-09"> <LINK REL ="stylesheet" TYPE="text/css" HREF="../../../../../stylesheet.css" TITLE="Style"> <SCRIPT type="text/javascript"> function windowTitle() { if (location.href.indexOf('is-external=true') == -1) { parent.document.title="IntSet"; } } </SCRIPT> <NOSCRIPT> </NOSCRIPT> </HEAD> <BODY BGCOLOR="white" onload="windowTitle();"> <HR> <!-- ========= START OF TOP NAVBAR ======= --> <A NAME="navbar_top"><!-- --></A> <A HREF="#skip-navbar_top" title="Skip navigation links"></A> <TABLE BORDER="0" WIDTH="100%" CELLPADDING="1" CELLSPACING="0" SUMMARY=""> <TR> <TD COLSPAN=2 BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A NAME="navbar_top_firstrow"><!-- --></A> <TABLE BORDER="0" CELLPADDING="0" CELLSPACING="3" SUMMARY=""> <TR ALIGN="center" VALIGN="top"> <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../../overview-summary.html"><FONT CLASS="NavBarFont1"><B>Overview</B></FONT></A> </TD> <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="package-summary.html"><FONT CLASS="NavBarFont1"><B>Package</B></FONT></A> </TD> <TD BGCOLOR="#FFFFFF" CLASS="NavBarCell1Rev"> <FONT CLASS="NavBarFont1Rev"><B>Class</B></FONT> </TD> <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="package-tree.html"><FONT CLASS="NavBarFont1"><B>Tree</B></FONT></A> </TD> <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../../deprecated-list.html"><FONT CLASS="NavBarFont1"><B>Deprecated</B></FONT></A> </TD> <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../../index-all.html"><FONT CLASS="NavBarFont1"><B>Index</B></FONT></A> </TD> <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../../help-doc.html"><FONT CLASS="NavBarFont1"><B>Help</B></FONT></A> </TD> </TR> </TABLE> </TD> <TD ALIGN="right" VALIGN="top" ROWSPAN=3><EM> </EM> </TD> </TR> <TR> <TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2"> <A HREF="../../../../../net/sf/saxon/expr/sort/IntRangeSet.html" title="class in net.sf.saxon.expr.sort"><B>PREV CLASS</B></A> <A HREF="../../../../../net/sf/saxon/expr/sort/IntSingletonSet.html" title="class in net.sf.saxon.expr.sort"><B>NEXT CLASS</B></A></FONT></TD> <TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2"> <A HREF="../../../../../index.html?net/sf/saxon/expr/sort/IntSet.html" target="_top"><B>FRAMES</B></A> <A HREF="IntSet.html" target="_top"><B>NO FRAMES</B></A> <SCRIPT type="text/javascript"> <!-- if(window==top) { document.writeln('<A HREF="../../../../../allclasses-noframe.html"><B>All Classes</B></A>'); } //--> </SCRIPT> <NOSCRIPT> <A HREF="../../../../../allclasses-noframe.html"><B>All Classes</B></A> </NOSCRIPT> </FONT></TD> </TR> <TR> <TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2"> SUMMARY: NESTED | FIELD | CONSTR | <A HREF="#method_summary">METHOD</A></FONT></TD> <TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2"> DETAIL: FIELD | CONSTR | <A HREF="#method_detail">METHOD</A></FONT></TD> </TR> </TABLE> <A NAME="skip-navbar_top"></A> <!-- ========= END OF TOP NAVBAR ========= --> <HR> <!-- ======== START OF CLASS DATA ======== --> <H2> <FONT SIZE="-1"> net.sf.saxon.expr.sort</FONT> <BR> Interface IntSet</H2> <DL> <DT><B>All Known Implementing Classes:</B> <DD><A HREF="../../../../../net/sf/saxon/expr/sort/AbstractIntSet.html" title="class in net.sf.saxon.expr.sort">AbstractIntSet</A>, <A HREF="../../../../../net/sf/saxon/expr/sort/IntArraySet.html" title="class in net.sf.saxon.expr.sort">IntArraySet</A>, <A HREF="../../../../../net/sf/saxon/expr/sort/IntComplementSet.html" title="class in net.sf.saxon.expr.sort">IntComplementSet</A>, <A HREF="../../../../../net/sf/saxon/expr/sort/IntEmptySet.html" title="class in net.sf.saxon.expr.sort">IntEmptySet</A>, <A HREF="../../../../../net/sf/saxon/expr/sort/IntHashSet.html" title="class in net.sf.saxon.expr.sort">IntHashSet</A>, <A HREF="../../../../../net/sf/saxon/expr/sort/IntRangeSet.html" title="class in net.sf.saxon.expr.sort">IntRangeSet</A>, <A HREF="../../../../../net/sf/saxon/expr/sort/IntSingletonSet.html" title="class in net.sf.saxon.expr.sort">IntSingletonSet</A>, <A HREF="../../../../../net/sf/saxon/expr/sort/IntUniversalSet.html" title="class in net.sf.saxon.expr.sort">IntUniversalSet</A></DD> </DL> <HR> <DL> <DT><PRE>public interface <B>IntSet</B></DL> </PRE> <P> A set of integers represented as int values <P> <P> <HR> <P> <!-- ========== METHOD SUMMARY =========== --> <A NAME="method_summary"><!-- --></A> <TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY=""> <TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor"> <TH ALIGN="left" COLSPAN="2"><FONT SIZE="+2"> <B>Method Summary</B></FONT></TH> </TR> <TR BGCOLOR="white" CLASS="TableRowColor"> <TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> <CODE> boolean</CODE></FONT></TD> <TD><CODE><B><A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html#add(int)">add</A></B>(int value)</CODE> <BR> Add an integer to the set</TD> </TR> <TR BGCOLOR="white" CLASS="TableRowColor"> <TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> <CODE> void</CODE></FONT></TD> <TD><CODE><B><A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html#clear()">clear</A></B>()</CODE> <BR> Clear the contents of the IntSet (making it an empty set)</TD> </TR> <TR BGCOLOR="white" CLASS="TableRowColor"> <TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> <CODE> boolean</CODE></FONT></TD> <TD><CODE><B><A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html#contains(int)">contains</A></B>(int value)</CODE> <BR> Determine whether a particular integer is present in the set</TD> </TR> <TR BGCOLOR="white" CLASS="TableRowColor"> <TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> <CODE> boolean</CODE></FONT></TD> <TD><CODE><B><A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html#containsAll(net.sf.saxon.expr.sort.IntSet)">containsAll</A></B>(<A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html" title="interface in net.sf.saxon.expr.sort">IntSet</A> other)</CODE> <BR> Test if this set is a superset of another set</TD> </TR> <TR BGCOLOR="white" CLASS="TableRowColor"> <TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> <CODE> <A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html" title="interface in net.sf.saxon.expr.sort">IntSet</A></CODE></FONT></TD> <TD><CODE><B><A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html#copy()">copy</A></B>()</CODE> <BR> Create a copy of this IntSet that leaves the original unchanged.</TD> </TR> <TR BGCOLOR="white" CLASS="TableRowColor"> <TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> <CODE> <A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html" title="interface in net.sf.saxon.expr.sort">IntSet</A></CODE></FONT></TD> <TD><CODE><B><A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html#except(net.sf.saxon.expr.sort.IntSet)">except</A></B>(<A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html" title="interface in net.sf.saxon.expr.sort">IntSet</A> other)</CODE> <BR> Form a new set that is the difference of this set and another set.</TD> </TR> <TR BGCOLOR="white" CLASS="TableRowColor"> <TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> <CODE> <A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html" title="interface in net.sf.saxon.expr.sort">IntSet</A></CODE></FONT></TD> <TD><CODE><B><A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html#intersect(net.sf.saxon.expr.sort.IntSet)">intersect</A></B>(<A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html" title="interface in net.sf.saxon.expr.sort">IntSet</A> other)</CODE> <BR> Form a new set that is the intersection of this IntSet and another.</TD> </TR> <TR BGCOLOR="white" CLASS="TableRowColor"> <TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> <CODE> boolean</CODE></FONT></TD> <TD><CODE><B><A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html#isEmpty()">isEmpty</A></B>()</CODE> <BR> Determine if the set is empty</TD> </TR> <TR BGCOLOR="white" CLASS="TableRowColor"> <TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> <CODE> <A HREF="../../../../../net/sf/saxon/expr/sort/IntIterator.html" title="interface in net.sf.saxon.expr.sort">IntIterator</A></CODE></FONT></TD> <TD><CODE><B><A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html#iterator()">iterator</A></B>()</CODE> <BR> Get an iterator over the values</TD> </TR> <TR BGCOLOR="white" CLASS="TableRowColor"> <TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> <CODE> <A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html" title="interface in net.sf.saxon.expr.sort">IntSet</A></CODE></FONT></TD> <TD><CODE><B><A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html#mutableCopy()">mutableCopy</A></B>()</CODE> <BR> Create a copy of this IntSet that contains the same set of integers.</TD> </TR> <TR BGCOLOR="white" CLASS="TableRowColor"> <TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> <CODE> boolean</CODE></FONT></TD> <TD><CODE><B><A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html#remove(int)">remove</A></B>(int value)</CODE> <BR> Remove an integer from the set</TD> </TR> <TR BGCOLOR="white" CLASS="TableRowColor"> <TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> <CODE> int</CODE></FONT></TD> <TD><CODE><B><A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html#size()">size</A></B>()</CODE> <BR> Get the number of integers in the set</TD> </TR> <TR BGCOLOR="white" CLASS="TableRowColor"> <TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> <CODE> <A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html" title="interface in net.sf.saxon.expr.sort">IntSet</A></CODE></FONT></TD> <TD><CODE><B><A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html#union(net.sf.saxon.expr.sort.IntSet)">union</A></B>(<A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html" title="interface in net.sf.saxon.expr.sort">IntSet</A> other)</CODE> <BR> Form a new set that is the union of this IntSet and another.</TD> </TR> </TABLE> <P> <!-- ============ METHOD DETAIL ========== --> <A NAME="method_detail"><!-- --></A> <TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY=""> <TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor"> <TH ALIGN="left" COLSPAN="1"><FONT SIZE="+2"> <B>Method Detail</B></FONT></TH> </TR> </TABLE> <A NAME="copy()"><!-- --></A><H3> copy</H3> <PRE> <A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html" title="interface in net.sf.saxon.expr.sort">IntSet</A> <B>copy</B>()</PRE> <DL> <DD>Create a copy of this IntSet that leaves the original unchanged. <P> <DD><DL> <DT><B>Returns:</B><DD>an IntSet containing the same integers. The result will not necessarily be the same class as the original. It will either be an immutable object, or a newly constructed object.</DL> </DD> </DL> <HR> <A NAME="mutableCopy()"><!-- --></A><H3> mutableCopy</H3> <PRE> <A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html" title="interface in net.sf.saxon.expr.sort">IntSet</A> <B>mutableCopy</B>()</PRE> <DL> <DD>Create a copy of this IntSet that contains the same set of integers. <P> <DD><DL> <DT><B>Returns:</B><DD>an IntSet containing the same integers. The result will not necessarily be the same class as the original. It will always be a mutable object</DL> </DD> </DL> <HR> <A NAME="clear()"><!-- --></A><H3> clear</H3> <PRE> void <B>clear</B>()</PRE> <DL> <DD>Clear the contents of the IntSet (making it an empty set) <P> <DD><DL> </DL> </DD> </DL> <HR> <A NAME="size()"><!-- --></A><H3> size</H3> <PRE> int <B>size</B>()</PRE> <DL> <DD>Get the number of integers in the set <P> <DD><DL> <DT><B>Returns:</B><DD>the size of the set</DL> </DD> </DL> <HR> <A NAME="isEmpty()"><!-- --></A><H3> isEmpty</H3> <PRE> boolean <B>isEmpty</B>()</PRE> <DL> <DD>Determine if the set is empty <P> <DD><DL> <DT><B>Returns:</B><DD>true if the set is empty, false if not</DL> </DD> </DL> <HR> <A NAME="contains(int)"><!-- --></A><H3> contains</H3> <PRE> boolean <B>contains</B>(int value)</PRE> <DL> <DD>Determine whether a particular integer is present in the set <P> <DD><DL> <DT><B>Parameters:</B><DD><CODE>value</CODE> - the integer under test <DT><B>Returns:</B><DD>true if value is present in the set, false if not</DL> </DD> </DL> <HR> <A NAME="remove(int)"><!-- --></A><H3> remove</H3> <PRE> boolean <B>remove</B>(int value)</PRE> <DL> <DD>Remove an integer from the set <P> <DD><DL> <DT><B>Parameters:</B><DD><CODE>value</CODE> - the integer to be removed <DT><B>Returns:</B><DD>true if the integer was present in the set, false if it was not present</DL> </DD> </DL> <HR> <A NAME="add(int)"><!-- --></A><H3> add</H3> <PRE> boolean <B>add</B>(int value)</PRE> <DL> <DD>Add an integer to the set <P> <DD><DL> <DT><B>Parameters:</B><DD><CODE>value</CODE> - the integer to be added <DT><B>Returns:</B><DD>true if the integer was added, false if it was already present</DL> </DD> </DL> <HR> <A NAME="iterator()"><!-- --></A><H3> iterator</H3> <PRE> <A HREF="../../../../../net/sf/saxon/expr/sort/IntIterator.html" title="interface in net.sf.saxon.expr.sort">IntIterator</A> <B>iterator</B>()</PRE> <DL> <DD>Get an iterator over the values <P> <DD><DL> <DT><B>Returns:</B><DD>an iterator over the integers in the set</DL> </DD> </DL> <HR> <A NAME="union(net.sf.saxon.expr.sort.IntSet)"><!-- --></A><H3> union</H3> <PRE> <A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html" title="interface in net.sf.saxon.expr.sort">IntSet</A> <B>union</B>(<A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html" title="interface in net.sf.saxon.expr.sort">IntSet</A> other)</PRE> <DL> <DD>Form a new set that is the union of this IntSet and another. The result will either be an immutable object, or a newly constructed object. <P> <DD><DL> <DT><B>Parameters:</B><DD><CODE>other</CODE> - the second set <DT><B>Returns:</B><DD>the union of the two sets</DL> </DD> </DL> <HR> <A NAME="intersect(net.sf.saxon.expr.sort.IntSet)"><!-- --></A><H3> intersect</H3> <PRE> <A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html" title="interface in net.sf.saxon.expr.sort">IntSet</A> <B>intersect</B>(<A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html" title="interface in net.sf.saxon.expr.sort">IntSet</A> other)</PRE> <DL> <DD>Form a new set that is the intersection of this IntSet and another. The result will either be an immutable object, or a newly constructed object. <P> <DD><DL> <DT><B>Parameters:</B><DD><CODE>other</CODE> - the second set <DT><B>Returns:</B><DD>the intersection of the two sets</DL> </DD> </DL> <HR> <A NAME="except(net.sf.saxon.expr.sort.IntSet)"><!-- --></A><H3> except</H3> <PRE> <A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html" title="interface in net.sf.saxon.expr.sort">IntSet</A> <B>except</B>(<A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html" title="interface in net.sf.saxon.expr.sort">IntSet</A> other)</PRE> <DL> <DD>Form a new set that is the difference of this set and another set. The result will either be an immutable object, or a newly constructed object. <P> <DD><DL> <DT><B>Parameters:</B><DD><CODE>other</CODE> - the second set <DT><B>Returns:</B><DD>the intersection of the two sets</DL> </DD> </DL> <HR> <A NAME="containsAll(net.sf.saxon.expr.sort.IntSet)"><!-- --></A><H3> containsAll</H3> <PRE> boolean <B>containsAll</B>(<A HREF="../../../../../net/sf/saxon/expr/sort/IntSet.html" title="interface in net.sf.saxon.expr.sort">IntSet</A> other)</PRE> <DL> <DD>Test if this set is a superset of another set <P> <DD><DL> <DT><B>Parameters:</B><DD><CODE>other</CODE> - the other set <DT><B>Returns:</B><DD>true if every integer in the other set is also present in this set</DL> </DD> </DL> <!-- ========= END OF CLASS DATA ========= --> <HR> <!-- ======= START OF BOTTOM NAVBAR ====== --> <A NAME="navbar_bottom"><!-- --></A> <A HREF="#skip-navbar_bottom" title="Skip navigation links"></A> <TABLE BORDER="0" WIDTH="100%" CELLPADDING="1" CELLSPACING="0" SUMMARY=""> <TR> <TD COLSPAN=2 BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A NAME="navbar_bottom_firstrow"><!-- --></A> <TABLE BORDER="0" CELLPADDING="0" CELLSPACING="3" SUMMARY=""> <TR ALIGN="center" VALIGN="top"> <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../../overview-summary.html"><FONT CLASS="NavBarFont1"><B>Overview</B></FONT></A> </TD> <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="package-summary.html"><FONT CLASS="NavBarFont1"><B>Package</B></FONT></A> </TD> <TD BGCOLOR="#FFFFFF" CLASS="NavBarCell1Rev"> <FONT CLASS="NavBarFont1Rev"><B>Class</B></FONT> </TD> <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="package-tree.html"><FONT CLASS="NavBarFont1"><B>Tree</B></FONT></A> </TD> <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../../deprecated-list.html"><FONT CLASS="NavBarFont1"><B>Deprecated</B></FONT></A> </TD> <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../../index-all.html"><FONT CLASS="NavBarFont1"><B>Index</B></FONT></A> </TD> <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../../help-doc.html"><FONT CLASS="NavBarFont1"><B>Help</B></FONT></A> </TD> </TR> </TABLE> </TD> <TD ALIGN="right" VALIGN="top" ROWSPAN=3><EM> </EM> </TD> </TR> <TR> <TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2"> <A HREF="../../../../../net/sf/saxon/expr/sort/IntRangeSet.html" title="class in net.sf.saxon.expr.sort"><B>PREV CLASS</B></A> <A HREF="../../../../../net/sf/saxon/expr/sort/IntSingletonSet.html" title="class in net.sf.saxon.expr.sort"><B>NEXT CLASS</B></A></FONT></TD> <TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2"> <A HREF="../../../../../index.html?net/sf/saxon/expr/sort/IntSet.html" target="_top"><B>FRAMES</B></A> <A HREF="IntSet.html" target="_top"><B>NO FRAMES</B></A> <SCRIPT type="text/javascript"> <!-- if(window==top) { document.writeln('<A HREF="../../../../../allclasses-noframe.html"><B>All Classes</B></A>'); } //--> </SCRIPT> <NOSCRIPT> <A HREF="../../../../../allclasses-noframe.html"><B>All Classes</B></A> </NOSCRIPT> </FONT></TD> </TR> <TR> <TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2"> SUMMARY: NESTED | FIELD | CONSTR | <A HREF="#method_summary">METHOD</A></FONT></TD> <TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2"> DETAIL: FIELD | CONSTR | <A HREF="#method_detail">METHOD</A></FONT></TD> </TR> </TABLE> <A NAME="skip-navbar_bottom"></A> <!-- ======== END OF BOTTOM NAVBAR ======= --> <HR> Copyright (c) 2004-2011 Saxonica Limited. All rights reserved. </BODY> </HTML>