Update of /cvsroot/boost/boost/libs/disjoint_sets
In directory sc8-pr-cvs3.sourceforge.net:/tmp/cvs-serv25824/libs/disjoint_sets
Modified Files:
bibliography.html disjoint_sets.html
Log Message:
Fixed license issues and converted to HTML 4.01
Index: bibliography.html
===================================================================
RCS file: /cvsroot/boost/boost/libs/disjoint_sets/bibliography.html,v
retrieving revision 1.5
retrieving revision 1.6
diff -u -d -r1.5 -r1.6
--- bibliography.html 5 Oct 2004 15:45:19 -0000 1.5
+++ bibliography.html 1 Dec 2006 12:50:21 -0000 1.6
@@ -1,51 +1,57 @@
-<HTML>
-<!--
- -- Copyright (c) Jeremy Siek 2000
- --
- -- Permission to use, copy, modify, distribute and sell this software
- -- and its documentation for any purpose is hereby granted without fee,
- -- provided that the above copyright notice appears in all copies and
- -- that both that copyright notice and this permission notice appear
- -- in supporting documentation. Silicon Graphics makes no
- -- representations about the suitability of this software for any
- -- purpose. It is provided "as is" without express or implied warranty.
- -->
-<Head>
-<Title>Boost Utility Library: Bibliography</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
- ALINK="#ff0000">
-<IMG SRC="../../boost.png"
- ALT="C++ Boost" width="277" height="86">
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<BR Clear>
+<html>
+<head>
+ <meta http-equiv="Content-Language" content="en-us">
+ <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+ <title>Boost Utility Library: Bibliography</title>
+</head>
-<H2>Bibliography</H2>
+<body bgcolor="#FFFFFF" link="#0000EE" text="#000000" vlink="#551A8B" alink=
+"#FF0000">
+ <img src="../../boost.png" alt="C++ Boost" width="277" height=
+ "86"><br clear="none">
-<DL COMPACT>
+ <h2>Bibliography</h2>
-<P></P><DT><A NAME="tarjan83:_data_struct_network_algo">1</A>
-<DD>
-R. E. Tarjan.
-<BR><EM>Data Structures and Network Algorithms</EM>.
-<BR>Society for Industrial and Applied Mathematics, 1983.
+ <dl compact>
+ <dt><a name="tarjan83:_data_struct_network_algo" id=
+ "tarjan83:_data_struct_network_algo">1</a></dt>
-<P></P><DT><A NAME="clr90">2</A>
-<DD>
-T. Cormen, C. Leiserson, and R. Rivest.
-<BR><EM>Introduction to Algorithms</EM>.
-<BR>McGraw-Hill, 1990.
+ <dd>R. E. Tarjan.<br>
+ <em>Data Structures and Network Algorithms</em>.<br>
+ Society for Industrial and Applied Mathematics, 1983.</dd>
+ <dt><a name="clr90" id="clr90">2</a></dt>
-</DL>
+ <dd>T. Cormen, C. Leiserson, and R. Rivest.<br>
+ <em>Introduction to Algorithms</em>.<br>
+ McGraw-Hill, 1990.</dd>
+ </dl><br>
+ <hr>
-<br>
-<HR>
-<TABLE>
-<TR valign=top>
-<TD nowrap>Copyright © 2000</TD><TD>
-<a HREF="../../people/jeremy_siek.htm">Jeremy Siek</a>, Univ.of Notre Dame (<A
HREF="mailto:[EMAIL PROTECTED]">[EMAIL PROTECTED]</A>)
-</TD></TR></TABLE>
+ <p><a href="http://validator.w3.org/check?uri=referer";><img border="0" src=
+ "http://www.w3.org/Icons/valid-html401"; alt="Valid HTML 4.01 Transitional"
+ height="31" width="88"></a></p>
-</BODY>
-</HTML>
+ <p>Revised
+ <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan
-->01
+ December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38508" --></p>
+
+ <table summary="">
+ <tr valign="top">
+ <td nowrap><i>Copyright © 2000</i></td>
+
+ <td><i><a href="../../people/jeremy_siek.htm">Jeremy Siek</a>, Univ.of
+ Notre Dame (<a href=
+ "mailto:[EMAIL PROTECTED]">[EMAIL PROTECTED]</a>)</i></td>
+ </tr>
+ </table>
+
+ <p><i>Distributed under the Boost Software License, Version 1.0. (See
+ accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+ copy at <a href=
+
"http://www.boost.org/LICENSE_1_0.txt";>http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>
Index: disjoint_sets.html
===================================================================
RCS file: /cvsroot/boost/boost/libs/disjoint_sets/disjoint_sets.html,v
retrieving revision 1.11
retrieving revision 1.12
diff -u -d -r1.11 -r1.12
--- disjoint_sets.html 12 Aug 2005 13:02:33 -0000 1.11
+++ disjoint_sets.html 1 Dec 2006 12:50:21 -0000 1.12
@@ -1,89 +1,76 @@
-<HTML>
-<!--
- -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
- --
- -- Permission to use, copy, modify, distribute and sell this software
- -- and its documentation for any purpose is hereby granted without fee,
- -- provided that the above copyright notice appears in all copies and
- -- that both that copyright notice and this permission notice appear
- -- in supporting documentation. We make no
- -- representations about the suitability of this software for any
- -- purpose. It is provided "as is" without express or implied warranty.
- -->
-<Head>
-<Title>Boost Disjoint Sets</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
- ALINK="#ff0000">
-<IMG SRC="../../boost.png"
- ALT="C++ Boost" width="277" height="86">
-
-<BR Clear>
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+<head>
+ <meta http-equiv="Content-Language" content="en-us">
+ <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
-<H1><A NAME="sec:disjoint-sets"></A>
-Disjoint Sets
-</H1>
+ <title>Boost Disjoint Sets</title>
+</head>
-<P>
+<body bgcolor="#FFFFFF" link="#0000EE" text="#000000" vlink="#551A8B" alink=
+"#FF0000">
+ <img src="../../boost.png" alt="C++ Boost" width="277" height=
+ "86"><br clear="none">
-<H2>
-</h2>
-<PRE>
+ <h1><a name="sec:disjoint-sets" id="sec:disjoint-sets"></a> Disjoint
+ Sets</h1>
+ <pre>
disjoint_sets<Rank, Parent, FindCompress>
-</PRE>
+</pre>
-<P>
-This is class that provides disjoint sets operations with <I>union by
-rank</I> and <I>path compression</I>. A disjoint-sets data structure
-maintains a collection <i>S = {S<sub>1</sub>, S<sub>2</sub>, ...,
-S<sub>k</sub>}</i> of disjoint sets. Each set is identified by a
-<I>representative</I> which is some member of of the set. Sets are
-represented by rooted trees which are encoded in the <TT>Parent</TT>
-property map. Two heuristics: "union by rank" and
-"path compression" are used to speed up the
-operations [<a
-href="./bibliography.html#tarjan83:_data_struct_network_algo">1</a>, <a
-href="./bibliography.html#clr90">2</a>].
+ <p>This is class that provides disjoint sets operations with <i>union by
+ rank</i> and <i>path compression</i>. A disjoint-sets data structure
+ maintains a collection <i>S = {S<sub>1</sub>, S<sub>2</sub>, ...,
+ S<sub>k</sub>}</i> of disjoint sets. Each set is identified by a
+ <i>representative</i> which is some member of of the set. Sets are
+ represented by rooted trees which are encoded in the <tt>Parent</tt>
+ property map. Two heuristics: "union by rank" and "path compression" are
+ used to speed up the operations [<a href=
+ "./bibliography.html#tarjan83:_data_struct_network_algo">1</a>, <a href=
+ "./bibliography.html#clr90">2</a>].</p>
-<P>
+ <h3>Where Defined</h3><a href=
+ "../../boost/pending/disjoint_sets.hpp"><tt>boost/disjoint_sets.hpp</tt></a>
-<h3>Where Defined</h3>
+ <h3>Template Parameters</h3>
-<a
href="../../boost/pending/disjoint_sets.hpp"><tt>boost/disjoint_sets.hpp</tt></a>
+ <table border summary="">
+ <tr>
+ <td><tt>Rank</tt></td>
-<H3>Template Parameters</H3>
+ <td>must be a model of <a href=
+ "../property_map/ReadWritePropertyMap.html">ReadWritePropertyMap</a>
+ with an integer value type and a key type equal to the set's element
+ type.</td>
+ </tr>
-<P>
-<TABLE border>
-<TR><TD><TT>Rank</TT></TD> <TD>must be a model of <a
-href="../property_map/ReadWritePropertyMap.html">ReadWritePropertyMap</a>
-with an integer value type and a key type equal to the set's element
-type.</TD>
-</TR>
-<TR><TD><TT>Parent</TT></TD> <TD>must be a model of <a
-href="../property_map/ReadWritePropertyMap.html">ReadWritePropertyMap</a>
-and the key and value type the same as the set's element type.</TD>
-</TR>
-<TR><TD><TT>FindCompress</TT></TD>
-<TD>should be one of the find representative and
- path compress function objects.</TD>
-</TR>
-</TABLE>
-<P>
+ <tr>
+ <td><tt>Parent</tt></td>
-<H3>Example</H3>
+ <td>must be a model of <a href=
+ "../property_map/ReadWritePropertyMap.html">ReadWritePropertyMap</a>
+ and the key and value type the same as the set's element type.</td>
+ </tr>
-<P>
-A typical usage pattern for <TT>disjoint_sets</TT> can be seen in the
-<a
-href="../graph/doc/kruskal_min_spanning_tree.html"><TT>kruskal_minimum_spanning_tree()</TT></a>
-algorithm. In this example, we call <TT>link()</TT> instead of
-<TT>union_set()</TT> because <TT>u</TT> and <TT>v</TT> were obtained
-from <TT>find_set()</TT> and therefore are already the representatives
-for their sets.
+ <tr>
+ <td><tt>FindCompress</tt></td>
-<P>
-<PRE>
+ <td>should be one of the find representative and path compress function
+ objects.</td>
+ </tr>
+ </table>
+
+ <h3>Example</h3>
+
+ <p>A typical usage pattern for <tt>disjoint_sets</tt> can be seen in the
+ <a href=
+
"../graph/doc/kruskal_min_spanning_tree.html"><tt>kruskal_minimum_spanning_tree()</tt></a>
+ algorithm. In this example, we call <tt>link()</tt> instead of
+ <tt>union_set()</tt> because <tt>u</tt> and <tt>v</tt> were obtained from
+ <tt>find_set()</tt> and therefore are already the representatives for their
+ sets.</p>
+ <pre>
...
disjoint_sets<Rank, Parent, FindCompress> dsets(rank, p);
@@ -100,269 +87,223 @@
dsets.link(u, v);
}
}
-</PRE>
+</pre>
-<P>
+ <h3>Members</h3>
-<H3>Members</H3>
+ <table border summary="">
+ <tr>
+ <th>Member</th>
-<P>
+ <th>Description</th>
+ </tr>
-<table border>
-<tr>
-<th>Member</th><th>Description</th>
-</tr>
+ <tr>
+ <td><tt>disjoint_sets(Rank r, Parent p)</tt></td>
-<tr>
-<td><tt>
-disjoint_sets(Rank r, Parent p)
-</tt></td>
-<td>
-Constructor.
-</td>
-</tr>
+ <td>Constructor.</td>
+ </tr>
-<tr>
-<td><tt>
-disjoint_sets(const disjoint_sets& x)
-</tt></td>
-<td>
-Copy constructor.
-</td>
-</tr>
+ <tr>
+ <td><tt>disjoint_sets(const disjoint_sets& x)</tt></td>
-<tr>
-<td><tt>
-template <class Element><br>
-void make_set(Element x)
-</tt></td>
-<td>
-Creates a singleton set containing Element <TT>x</TT>.
-</td>
-</tr>
+ <td>Copy constructor.</td>
+ </tr>
-<tr>
-<td><tt>
-template <class Element><br>
-void link(Element x, Element y)
-</tt></td>
-<td>
-Union the two sets <I>represented</I> by element <TT>x</TT> and <TT>y</TT>.
-</td>
-</tr>
+ <tr>
+ <td><tt>template <class Element><br>
+ void make_set(Element x)</tt></td>
-<tr>
-<td><tt>
-template <class Element><br>
-void union_set(Element x, Element y)
-</tt></td>
-<td>
-Union the two sets that <I>contain</I> elements <TT>x</TT> and <TT>y</TT>.
-This is equivalent to <TT>link(find_set(x),find_set(y))</TT>.
-</td>
-</tr>
+ <td>Creates a singleton set containing Element <tt>x</tt>.</td>
+ </tr>
-<tr>
-<td><tt>
-template <class Element><br>
-Element find_set(Element x)
-</tt></td>
-<td>
-Return the representative for the set containing element <TT>x</TT>.
-</td>
-</tr>
+ <tr>
+ <td><tt>template <class Element><br>
+ void link(Element x, Element y)</tt></td>
-<tr>
-<td><tt>
-template <class ElementIterator><br>
-std::size_t count_sets(ElementIterator first, ElementIterator last)
-</tt></td>
-<td>
-Returns the number of disjoint sets.
-</td>
-</tr>
+ <td>Union the two sets <i>represented</i> by element <tt>x</tt> and
+ <tt>y</tt>.</td>
+ </tr>
-<tr>
-<td><tt>
-template <class ElementIterator><br>
-void compress_sets(ElementIterator first, ElementIterator last)
-</tt></td>
-<td>
-Flatten the parents tree so that the parent of every element is
-its representative.
-</td>
-</tr>
+ <tr>
+ <td><tt>template <class Element><br>
+ void union_set(Element x, Element y)</tt></td>
-</table>
+ <td>Union the two sets that <i>contain</i> elements <tt>x</tt> and
+ <tt>y</tt>. This is equivalent to
+ <tt>link(find_set(x),find_set(y))</tt>.</td>
+ </tr>
-<p>
+ <tr>
+ <td><tt>template <class Element><br>
+ Element find_set(Element x)</tt></td>
-<H3>Complexity</H3>
+ <td>Return the representative for the set containing element
+ <tt>x</tt>.</td>
+ </tr>
-<P>
-The time complexity is <i>O(m alpha(m,n))</i>, where <i>alpha</i> is
-the inverse Ackermann's function, <i>m</i> is the number of
-disjoint-set operations (<TT>make_set()</TT>, <TT>find_set()</TT>, and
-<TT>link()</TT> and <i>n</i> is the number of elements. The
-<i>alpha</i> function grows very slowly, much more slowly than the
-<i>log</i> function.
+ <tr>
+ <td><tt>template <class ElementIterator><br>
+ std::size_t count_sets(ElementIterator first, ElementIterator
+ last)</tt></td>
-<P>
+ <td>Returns the number of disjoint sets.</td>
+ </tr>
-<h3>See Also</h3>
+ <tr>
+ <td><tt>template <class ElementIterator><br>
+ void compress_sets(ElementIterator first, ElementIterator
+ last)</tt></td>
-<a
href="../graph/doc/incremental_components.html"><tt>incremental_connected_components()</tt></a>
+ <td>Flatten the parents tree so that the parent of every element is its
+ representative.</td>
+ </tr>
+ </table>
+ <h3>Complexity</h3>
-<hr>
+ <p>The time complexity is <i>O(m alpha(m,n))</i>, where <i>alpha</i> is the
+ inverse Ackermann's function, <i>m</i> is the number of disjoint-set
+ operations (<tt>make_set()</tt>, <tt>find_set()</tt>, and <tt>link()</tt>
+ and <i>n</i> is the number of elements. The <i>alpha</i> function grows
+ very slowly, much more slowly than the <i>log</i> function.</p>
-<H2>
-</h2>
-<PRE>
+ <h3>See Also</h3><a href=
+
"../graph/doc/incremental_components.html"><tt>incremental_connected_components()</tt></a>
+ <hr>
+ <pre>
disjoint_sets_with_storage<ID,InverseID,FindCompress>
-</PRE>
+</pre>
-<P>
-This class manages the storage for the rank and parent properties
-internally. The storage is in arrays, which are indexed by element ID,
-hence the requirement for the <TT>ID</TT> and <TT>InverseID</TT>
-functors. The rank and parent properties are initialized during
-construction so the each element is in a set by itself (so it is not
-necessary to initialize objects of this class with the <a
-href="../graph/doc/incremental_components.html#sec:initialize-incremental-components"><TT>initialize_incremental_components()</TT></a>
-function). This class is especially useful when computing the
-(dynamic) connected components of an <TT>edge_list</TT> graph which
-does not provide a place to store vertex properties.
+ <p>This class manages the storage for the rank and parent properties
+ internally. The storage is in arrays, which are indexed by element ID,
+ hence the requirement for the <tt>ID</tt> and <tt>InverseID</tt> functors.
+ The rank and parent properties are initialized during construction so the
+ each element is in a set by itself (so it is not necessary to initialize
+ objects of this class with the <a href=
+
"../graph/doc/incremental_components.html#sec:initialize-incremental-components">
+ <tt>initialize_incremental_components()</tt></a> function). This class is
+ especially useful when computing the (dynamic) connected components of an
+ <tt>edge_list</tt> graph which does not provide a place to store vertex
+ properties.</p>
-<P>
+ <h3>Template Parameters</h3>
-<H3>Template Parameters</H3>
+ <table border summary="">
+ <tr>
+ <th>Parameter</th>
-<TABLE border>
-<TR>
-<th>Parameter</th><th>Description</th><th>Default</th>
-</tr>
+ <th>Description</th>
-<TR>
-<TD><TT>ID</TT></TD>
-<TD>must be a model of <a
href="../property_map/ReadablePropertyMap.html">ReadablePropertyMap</a>
- that maps elements to integers between zero 0 and N, the total
- number of elements in the sets.</TD>
-<TD><TT>boost::identity_property_map</TT></TD>
-</TR>
+ <th>Default</th>
+ </tr>
-<TR>
-<TD><TT>InverseID</TT></TD>
-<TD>must be a model of <a
href="../property_map/ReadablePropertyMap.html">ReadablePropertyMap</a> that
maps integers to elements.</TD>
-<TD><TT>boost::identity_property_map</TT></TD>
-</TR>
+ <tr>
+ <td><tt>ID</tt></td>
-<TR><TD><TT>FindCompress</TT></TD>
-<TD>should be one of the find representative and
- path compress function objects.</TD>
-<TD><TT>representative_with_full_path_compression</TT></TD>
-</TR>
+ <td>must be a model of <a href=
+ "../property_map/ReadablePropertyMap.html">ReadablePropertyMap</a> that
+ maps elements to integers between zero 0 and N, the total number of
+ elements in the sets.</td>
-</TABLE>
-<P>
+ <td><tt>boost::identity_property_map</tt></td>
+ </tr>
-<H3>Members</H3>
+ <tr>
+ <td><tt>InverseID</tt></td>
-<P>
-This class has all of the members in <TT>disjoint_sets</TT> as well as
-the following members.
+ <td>must be a model of <a href=
+ "../property_map/ReadablePropertyMap.html">ReadablePropertyMap</a> that
+ maps integers to elements.</td>
-<P>
-
-<P> <P>
- <PRE>
+ <td><tt>boost::identity_property_map</tt></td>
+ </tr>
+
+ <tr>
+ <td><tt>FindCompress</tt></td>
+
+ <td>should be one of the find representative and path compress function
+ objects.</td>
+
+ <td><tt>representative_with_full_path_compression</tt></td>
+ </tr>
+ </table>
+
+ <h3>Members</h3>
+
+ <p>This class has all of the members in <tt>disjoint_sets</tt> as well as
+ the following members.</p>
+ <pre>
disjoint_sets_with_storage(size_type n = 0,
ID id = ID(),
InverseID inv = InverseID())
-</PRE>
-Constructor.
-<P>
-
-<P> <P>
- <PRE>
+</pre>Constructor.
+ <pre>
template <class ElementIterator>
void disjoint_sets_with_storage::
normalize_sets(ElementIterator first, ElementIterator last)
-</PRE>
-This rearranges the representatives such that the representative
-of each set is the element with the smallest ID.
-<BR>
-Postcondition: <TT>v >= parent[v]</TT>
-<BR>
-Precondition: the disjoint sets structure must be compressed.
-<BR>
-<P>
-
-<P>
-
-
-
-
-<hr>
+</pre>This rearranges the representatives such that the representative of
+each set is the element with the smallest ID.<br>
+ Postcondition: <tt>v >= parent[v]</tt><br>
+ Precondition: the disjoint sets structure must be compressed.<br>
+ <hr>
-<H2><A NAME="sec:representative-with-path-halving"></A>
-</h2>
-<PRE>
+ <h2><a name="sec:representative-with-path-halving" id=
+ "sec:representative-with-path-halving"></a></h2>
+ <pre>
representative_with_path_halving<Parent>
-</PRE>
-
-<P>
-This is a functor which finds the representative vertex for the same
-component as the element <TT>x</TT>. While traversing up the
-representative tree, the functor also applies the path halving
-technique to shorten the height of the tree.
+</pre>
-<P>
-
-<P> <PRE>
+ <p>This is a functor which finds the representative vertex for the same
+ component as the element <tt>x</tt>. While traversing up the representative
+ tree, the functor also applies the path halving technique to shorten the
+ height of the tree.</p>
+ <pre>
Element operator()(Parent p, Element x)
-</PRE>
-<P>
-
-
-
-<hr>
+</pre>
+ <hr>
-<H2>
-<A NAME="sec:representative-with-full-path-compression"></A>
-<BR>
-</h2>
-<PRE>
+ <h2><a name="sec:representative-with-full-path-compression" id=
+ "sec:representative-with-full-path-compression"></a><br></h2>
+ <pre>
representative_with_full_path_compression<Parent>
-</PRE>
-
-<P>
-This is a functor which finds the representative element for the set
-that element <TT>x</TT> belongs to.
+</pre>
-<P>
-
-<P> <PRE>
+ <p>This is a functor which finds the representative element for the set
+ that element <tt>x</tt> belongs to.</p>
+ <pre>
Element operator()(Parent p, Element x)
-</PRE>
-<P>
+</pre>
-<P>
+ <p><br></p>
+ <hr>
+ <p><a href="http://validator.w3.org/check?uri=referer";><img border="0" src=
+ "http://www.w3.org/Icons/valid-html401"; alt="Valid HTML 4.01 Transitional"
+ height="31" width="88"></a></p>
-<br>
-<HR>
-<TABLE>
-<TR valign=top>
-<TD nowrap>Copyright © 2000</TD><TD>
-<a HREF="../../people/jeremy_siek.htm">Jeremy Siek</a>,
-Univ.of Notre Dame (<A
-HREF="mailto:[EMAIL PROTECTED]">[EMAIL PROTECTED]</A>)<br>
-<A HREF="http://www.boost.org/people/liequan_lee.htm";>Lie-Quan Lee</A>,
Univ.of Notre Dame (<A HREF="mailto:[EMAIL PROTECTED]">[EMAIL
PROTECTED]</A>)<br>
-<A HREF=http://www.lsc.nd.edu/~lums>Andrew Lumsdaine</A>,
-Univ.of Notre Dame (<A
-HREF="mailto:[EMAIL PROTECTED]">[EMAIL PROTECTED]</A>)
-</TD></TR></TABLE>
+ <p>Revised
+ <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan
-->01
+ December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38508" --></p>
-</BODY>
-</HTML>
+ <table summary="">
+ <tr valign="top">
+ <td nowrap><i>Copyright © 2000</i></td>
+
+ <td><i><a href="../../people/jeremy_siek.htm">Jeremy Siek</a>, Univ.of
+ Notre Dame (<a href="mailto:[EMAIL PROTECTED]">[EMAIL PROTECTED]</a>)<br>
+ <a href="http://www.boost.org/people/liequan_lee.htm";>Lie-Quan Lee</a>,
+ Univ.of Notre Dame (<a href=
+ "mailto:[EMAIL PROTECTED]">[EMAIL PROTECTED]</a>)<br>
+ <a href="http://www.lsc.nd.edu/~lums";>Andrew Lumsdaine</a>, Univ.of
+ Notre Dame (<a href=
+ "mailto:[EMAIL PROTECTED]">[EMAIL PROTECTED]</a>)</i></td>
+ </tr>
+ </table>
+
+ <p><i>Distributed under the Boost Software License, Version 1.0. (See
+ accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+ copy at <a href=
+
"http://www.boost.org/LICENSE_1_0.txt";>http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>
-------------------------------------------------------------------------
Take Surveys. Earn Cash. Influence the Future of IT
Join SourceForge.net's Techsay panel and you'll get the chance to share your
opinions on IT & business topics through brief surveys - and earn cash
http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV
_______________________________________________
Boost-cvs mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/boost-cvs
