Boost-Commit mailing page: [Boost-commit] svn:boost r81212 - in sandbox/graph-associative_incidence/libs/graph/doc: . src/bitset_grid

Date view	Thread view	Subject view	Author view

Subject: [Boost-commit] svn:boost r81212 - in sandbox/graph-associative_incidence/libs/graph/doc: . src/bitset_grid_graph
From: sponage_at_[hidden]
Date: 2012-11-06 01:00:18

Next message: dnljms_at_[hidden]: "[Boost-commit] svn:boost r81213 - in website/public_html/live/generated: . state"
Previous message: john_at_[hidden]: "[Boost-commit] svn:boost r81211 - in sandbox/big_number/boost/multiprecision: . detail"

Author: expaler
Date: 2012-11-06 01:00:17 EST (Tue, 06 Nov 2012)
New Revision: 81212
URL: http://svn.boost.org/trac/boost/changeset/81212

Log:
Boost.Graph.AssociativeIncidence: clarified bitset_grid_graph edge key description.
Added:
sandbox/graph-associative_incidence/libs/graph/doc/bitset_grid_graph.html (contents, props changed)
sandbox/graph-associative_incidence/libs/graph/doc/src/bitset_grid_graph/doc.qbk (contents, props changed)

Added: sandbox/graph-associative_incidence/libs/graph/doc/bitset_grid_graph.html
==============================================================================
--- (empty file)
+++ sandbox/graph-associative_incidence/libs/graph/doc/bitset_grid_graph.html 2012-11-06 01:00:17 EST (Tue, 06 Nov 2012)
@@ -0,0 +1,1136 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>bitset_grid_graph</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="bitset_grid_graph.html" title="bitset_grid_graph">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav"></div>
+<div class="article">
+<div class="titlepage">
+<div>
+<div><h2 class="title">
+<a name="bitset_grid_graph"></a>bitset_grid_graph</h2></div>
+<div>Copyright © 2012 Cromwell Enage</div>
+<div><div class="legalnotice">
+<a name="bitset_grid_graph.legal"></a>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</div></div>
+</div>
+<hr>
+</div>
+<div class="toc">
+Table of Contents
+<dl>
+<dt>Description</dt>
+<dt>Where Declared</dt>
+<dt>Where Defined</dt>
+<dt>Template Parameters</dt>
+<dt>Model of</dt>
+<dt>Public Base Classes</dt>
+<dt>Members</dt>
+<dt>Non-members</dt>
+</dl>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="bitset_grid_graph.description"></a><a class="link" href="bitset_grid_graph.html#bitset_grid_graph.description" title="Description">Description</a>
+</h2></div></div></div>
+
+ BGL representation of a multi-dimensional grid whose vertices are bitsets.
+ Two vertices are considered adjacent to each other if their disjunction contains
+ exactly one bit on. The position of this bit is the edge key that each of the
+ adjacent vertices associates with the other. Therefore, a <code class="computeroutput">bitset_grid_graph</code>
+ has as many edge keys as each vertex has bits; this bit count also represents
+ the number of dimensions.
+ 
+
+ In each dimension, a <code class="computeroutput">bitset_grid_graph</code>
+ has length <code class="computeroutput">2</code> (<code class="computeroutput">true</code>
+ and <code class="computeroutput">false</code>) and wraps around.
+ 
+
+ This data structure is an implicit graph,
+ which means that its vertices and edges take up no internal memory.
+ 
+</div>
+<div class="important"><table border="0" summary="Important">
+<tr>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="http://www.boost.org/doc/libs/release/doc/src/images/important.png"></td>
+<th align="left">Important</th>
+</tr>
+<tr><td align="left" valign="top">
+ This component depends on Boost.ContainerGen, which is not yet a part
+ of Boost. For now, you must perform a Subversion checkout from the <a href="http://svn.boost.org/" target="_top">SVN
+ Trac</a>.
+ </td></tr>
+</table></div>
+<div class="section">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="bitset_grid_graph.declaration"></a><a class="link" href="bitset_grid_graph.html#bitset_grid_graph.declaration" title="Where Declared">Where Declared</a>
+</h2></div></div></div>
+
+
+<pre class="programlisting">#include <boost/graph/bitset_grid_graph_fwd.hpp>
+</pre>
+
+ 
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="bitset_grid_graph.definition"></a><a class="link" href="bitset_grid_graph.html#bitset_grid_graph.definition" title="Where Defined">Where Defined</a>
+</h2></div></div></div>
+
+
+<pre class="programlisting">#include <boost/graph/bitset_grid_graph.hpp>
+</pre>
+
+ 
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="bitset_grid_graph.tpl_param"></a><a class="link" href="bitset_grid_graph.html#bitset_grid_graph.tpl_param" title="Template Parameters">Template Parameters</a>
+</h2></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Parameter
+ 
+ </th>
+<th>
+ 
+ Description
+ 
+ </th>
+<th>
+ 
+ Requirements
+ 
+ </th>
+<th>
+ 
+ Default
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ <code class="computeroutput">BitCount</code>
+ 
+ </td>
+<td>
+ 
+ Compile-time representation of the number of bits in each vertex.
+ 
+ </td>
+<td>
+ 
+ It must model the MPL Integral Constant concept, and
+ its value must not be less than <code class="computeroutput">2</code>.
+ 
+ </td>
+<td>
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">VertexIndex</code>
+ 
+ </td>
+<td>
+ 
+ The type used to represent the number of vertices in this graph.
+ 
+ </td>
+<td>
+ 
+ It must be an unsigned integer type.
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">typename graph_traits<bitset_grid_graph>::degree_size_type
+</pre>
+
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">EdgeIndex</code>
+ 
+ </td>
+<td>
+ 
+ The type used to represent the number of vertices in this graph.
+ 
+ </td>
+<td>
+ 
+ It must be an unsigned integer type.
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">typename graph_traits<bitset_grid_graph>::vertices_size_type
+</pre>
+
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">AllocSel</code>
+ 
+ </td>
+<td>
+ 
+ A metafunction class that takes in the value type of <code class="computeroutput">BitCount</code> and returns an allocator
+ model.
+ 
+ </td>
+<td>
+ 
+ It must model the Unary Metafunction Class concept.
+ 
+ </td>
+<td>
+ 
+ boost::std_allocator_selector
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="bitset_grid_graph.model_of"></a><a class="link" href="bitset_grid_graph.html#bitset_grid_graph.model_of" title="Model of">Model of</a>
+</h2></div></div></div>
+<pre class="programlisting">* Bidirectional Grid Graph
+* Bidirectional Indexable Incidence Graph
+* Vertex List Graph
+* Edge List Graph
+* Adjacency Graph
+* Adjacency Matrix
+* Property Graph
+* Default Constructible
+* Copy Constructible
+* Assignable
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="bitset_grid_graph.public_bases"></a><a class="link" href="bitset_grid_graph.html#bitset_grid_graph.public_bases" title="Public Base Classes">Public Base Classes</a>
+</h2></div></div></div>
+
+ None.
+ 
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="bitset_grid_graph.members"></a><a class="link" href="bitset_grid_graph.html#bitset_grid_graph.members" title="Members">Members</a>
+</h2></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Name
+ 
+ </th>
+<th>
+ 
+ Definition
+ 
+ </th>
+<th>
+ 
+ Where defined
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ Default constructor
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">bitset_grid_graph();
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ Default Constructible
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Copy constructor
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">bitset_grid_graph(bitset_grid_graph const& copy);
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ Copy Constructible
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Assignment operator
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">bitset_grid_graph& operator=(bitset_grid_graph const& copy);
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ Assignable
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Dimension count
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">typename vertex_dimension_trait<bitset_grid_graph>::type
+ dimensions() const;
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ Grid Graph
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Dimension length
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">boost::uint8_t
+ length(
+ typename vertex_dimension_trait<
+ bitset_grid_graph
+ >::type const& dimension
+ ) const;
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ Grid Graph
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Dimension wraparound query
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">bool
+ wrapped(
+ typename vertex_dimension_trait<
+ bitset_grid_graph
+ >::type const& dimension
+ ) const;
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ Grid Graph
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Next vertex
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">template <typename Distance>
+typename graph_traits<bitset_grid_graph>::vertex_descriptor
+ next(
+ typename graph_traits<
+ bitset_grid_graph
+ >::vertex_descriptor const& vertex
+ , typename edge_key_trait<bitset_grid_graph>::type const& key
+ , Distance const& distance
+ ) const;
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ Grid Graph
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Previous vertex
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">template <typename Distance>
+typename graph_traits<bitset_grid_graph>::vertex_descriptor
+ previous(
+ typename graph_traits<
+ bitset_grid_graph
+ >::vertex_descriptor const& vertex
+ , typename edge_key_trait<bitset_grid_graph>::type const& key
+ , Distance const& distance
+ ) const;
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <a href="BidirectionalGridGraph.html" target="_top">Bidirectional
+ Grid Graph</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Next vertex
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">typename graph_traits<bitset_grid_graph>::vertex_descriptor
+ next(
+ typename graph_traits<
+ bitset_grid_graph
+ >::vertex_descriptor const& vertex
+ , typename edge_key_trait<bitset_grid_graph>::type const& key
+ ) const;
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <a href="AssociativeIncidenceGraph.html" target="_top">Associative
+ Incidence Graph</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Previous vertex
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">typename graph_traits<bitset_grid_graph>::vertex_descriptor
+ previous(
+ typename graph_traits<
+ bitset_grid_graph
+ >::vertex_descriptor const& vertex
+ , typename edge_key_trait<bitset_grid_graph>::type const& key
+ ) const;
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <a href="BidirAssocIncidenceGraph.html" target="_top">Bidirectional
+ Associative Incidence Graph</a>
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="bitset_grid_graph.non_members"></a><a class="link" href="bitset_grid_graph.html#bitset_grid_graph.non_members" title="Non-members">Non-members</a>
+</h2></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Name
+ 
+ </th>
+<th>
+ 
+ Definition
+ 
+ </th>
+<th>
+ 
+ Where defined
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ Null vertex
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">typename graph_traits<bitset_grid_graph>::vertex_descriptor
+ typename graph_traits<bitset_grid_graph>::null_vertex();
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ Graph
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Edge key count
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">typename graph_traits<bitset_grid_graph>::degree_size_type
+ num_edge_keys(bitset_grid_graph const& graph);
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <a href="AssociativeIncidenceGraph.html" target="_top">Associative
+ Incidence Graph</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Edge key indexed access
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">typename edge_key_trait<bitset_grid_graph>::type
+ edge_key(
+ typename graph_traits<
+ bitset_grid_graph
+ >::degree_size_type const& index
+ , bitset_grid_graph const& graph
+ );
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <a href="AssociativeIncidenceGraph.html" target="_top">Associative
+ Incidence Graph</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Vertex range
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">std::pair<
+ typename graph_traits<bitset_grid_graph>::vertex_iterator
+ , typename graph_traits<bitset_grid_graph>::vertex_iterator
+>
+ vertices(bitset_grid_graph const& graph);
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ Vertex List Graph
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Vertex count
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">typename graph_traits<bitset_grid_graph>::vertices_size_type const&
+ num_vertices(bitset_grid_graph const& graph);
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ Vertex List Graph
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Vertex indexed access
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">typename graph_traits<bitset_grid_graph>::vertex_descriptor
+ vertex(
+ typename graph_traits<
+ bitset_grid_graph
+ >::vertices_size_type const& index
+ , bitset_grid_graph const& graph
+ );
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ bitset_grid_graph
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Edge range
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">std::pair<
+ typename graph_traits<bitset_grid_graph>::edge_iterator
+ , typename graph_traits<bitset_grid_graph>::edge_iterator
+>
+ edges(bitset_grid_graph const& graph);
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <a href="http://www.boost.org/libs/graph/doc/EdgeListGraph.html" target="_top">Edge
+ List Graph</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Edge count
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">typename graph_traits<bitset_grid_graph>::edges_size_type const&
+ num_edges(bitset_grid_graph const& graph);
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <a href="http://www.boost.org/libs/graph/doc/EdgeListGraph.html" target="_top">Edge
+ List Graph</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Edge indexed access
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">typename graph_traits<bitset_grid_graph>::edge_descriptor
+ edge_at(
+ typename graph_traits<
+ bitset_grid_graph
+ >::edges_size_type const& index
+ , zeta_grid_graph const& graph
+ );
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ bitset_grid_graph
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Vertex out-edge range
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">std::pair<
+ typename graph_traits<bitset_grid_graph>::out_edge_iterator
+ , typename graph_traits<bitset_grid_graph>::out_edge_iterator
+>
+ out_edges(
+ typename graph_traits<
+ bitset_grid_graph
+ >::vertex_descriptor const& v
+ , bitset_grid_graph const& graph
+ );
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <a href="http://www.boost.org/libs/graph/doc/IncidenceGraph.html" target="_top">Incidence
+ Graph</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Vertex out-degree
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">typename graph_traits<bitset_grid_graph>::degree_size_type
+ out_degree(
+ typename graph_traits<
+ bitset_grid_graph
+ >::vertex_descriptor const& v
+ , bitset_grid_graph const& graph
+ );
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <a href="http://www.boost.org/libs/graph/doc/IncidenceGraph.html" target="_top">Incidence
+ Graph</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Vertex out-edge indexed access
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">typename graph_traits<bitset_grid_graph>::edge_descriptor
+ out_edge_at(
+ typename graph_traits<
+ bitset_grid_graph
+ >::vertex_descriptor const& v
+ , typename graph_traits<
+ bitset_grid_graph
+ >::degree_size_type const& index
+ , bitset_grid_graph const& graph
+ );
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <a href="IndexableIncidenceGraph.html" target="_top">Indexable
+ Incidence Graph</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Vertex adjacency range
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">std::pair<
+ typename graph_traits<bitset_grid_graph>::adjacency_iterator
+ , typename graph_traits<bitset_grid_graph>::adjacency_iterator
+>
+ adjacent_vertices(
+ typename graph_traits<
+ bitset_grid_graph
+ >::vertex_descriptor const& v
+ , bitset_grid_graph const& graph
+ );
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <a href="http://www.boost.org/libs/graph/doc/AdjacencyGraph.html" target="_top">Adjacency
+ Graph</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Vertex in-edge range
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">std::pair<
+ typename graph_traits<bitset_grid_graph>::in_edge_iterator
+ , typename graph_traits<bitset_grid_graph>::in_edge_iterator
+>
+ in_edges(
+ typename graph_traits<
+ bitset_grid_graph
+ >::vertex_descriptor const& v
+ , bitset_grid_graph const& graph
+ );
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ Bidirectional Graph
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Vertex in-degree
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">typename graph_traits<bitset_grid_graph>::degree_size_type
+ in_degree(
+ typename graph_traits<
+ bitset_grid_graph
+ >::vertex_descriptor const& v
+ , bitset_grid_graph const& graph
+ );
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ Bidirectional Graph
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Vertex degree
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">typename graph_traits<bitset_grid_graph>::degree_size_type
+ degree(
+ typename graph_traits<
+ bitset_grid_graph
+ >::vertex_descriptor const& v
+ , bitset_grid_graph const& graph
+ );
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ Bidirectional Graph
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Vertex in-edge indexed access
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">typename graph_traits<bitset_grid_graph>::edge_descriptor
+ in_edge_at(
+ typename graph_traits<
+ bitset_grid_graph
+ >::vertex_descriptor const& v
+ , typename graph_traits<
+ bitset_grid_graph
+ >::degree_size_type const& index
+ , bitset_grid_graph const& graph
+ );
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <a href="BidirIndexIncidenceGraph.html" target="_top">Bidirectional
+ Indexable Incidence Graph</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Direct edge access
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">std::pair<
+ typename graph_traits<bitset_grid_graph>::edge_descriptor
+ , bool
+>
+ edge(
+ typename graph_traits<
+ bitset_grid_graph
+ >::vertex_descriptor const& u
+ , typename graph_traits<
+ bitset_grid_graph
+ >::vertex_descriptor const& v
+ , bitset_grid_graph const& graph
+ );
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ Adjacency Matrix
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Vertex index property map access
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">typename property_map<bitset_grid_graph,vertex_index_t>::type
+ get(vertex_index_t, bitset_grid_graph const& graph);
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <a href="http://www.boost.org/libs/graph/doc/PropertyGraph.html" target="_top">Property
+ Graph</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Vertex index access
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">typename graph_traits<bitset_grid_graph>::vertices_size_type
+ get(
+ vertex_index_t
+ , bitset_grid_graph const& graph
+ , typename graph_traits<
+ bitset_grid_graph
+ >::vertex_descriptor const& v
+ );
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <a href="http://www.boost.org/libs/graph/doc/PropertyGraph.html" target="_top">Property
+ Graph</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Edge index property map access
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">typename property_map<bitset_grid_graph,edge_index_t>::type
+ get(edge_index_t, bitset_grid_graph const& graph);
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <a href="http://www.boost.org/libs/graph/doc/PropertyGraph.html" target="_top">Property
+ Graph</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Edge index access
+ 
+ </td>
+<td>
+ 
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">typename graph_traits<bitset_grid_graph>::edges_size_type
+ get(
+ edge_index_t
+ , bitset_grid_graph const& graph
+ , typename graph_traits<
+ bitset_grid_graph
+ >::edge_descriptor const& e
+ );
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <a href="http://www.boost.org/libs/graph/doc/PropertyGraph.html" target="_top">Property
+ Graph</a>
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left">Last revised: November 06, 2012 at 01:48:27 GMT</td>
+<td align="right"><div class="copyright-footer"></div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav"></div>
+</body>
+</html>

Added: sandbox/graph-associative_incidence/libs/graph/doc/src/bitset_grid_graph/doc.qbk
==============================================================================
--- (empty file)
+++ sandbox/graph-associative_incidence/libs/graph/doc/src/bitset_grid_graph/doc.qbk 2012-11-06 01:00:17 EST (Tue, 06 Nov 2012)
@@ -0,0 +1,529 @@
+[article bitset_grid_graph
+ [quickbook 1.5]
+ [copyright 2012 Cromwell Enage]
+ [license
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ [@http://www.boost.org/LICENSE_1_0.txt])
+ ]
+]
+
+[def __SVN_Trac__ [@http://svn.boost.org/ SVN Trac]]
+[def __Boost_ContainerGen__ [@http://svn.boost.org/svn/boost/sandbox/container_gen/libs/container_gen/doc/html/ [*Boost.ContainerGen]]]
+[def __MPL_Integral_Constant__ [@boost:libs/mpl/doc/refmanual/integral-constant.html [*MPL Integral Constant]]]
+[def __Unary_Metafunction_Class__ [@boost:libs/mpl/doc/refmanual/metafunction-class.html [*Unary Metafunction Class]]]
+[def __Graph__ [@boost:libs/graph/doc/Graph.html [*Graph]]]
+[def __Incidence_Graph__ [@boost:libs/graph/doc/IncidenceGraph.html [*Incidence Graph]]]
+[def __Bidirectional_Graph__ [@boost:libs/graph/doc/BidirectionalGraph.html [*Bidirectional Graph]]]
+[def __Associative_Incidence_Graph__ [@AssociativeIncidenceGraph.html [*Associative Incidence Graph]]]
+[def __Bidirectional_Associative_Incidence_Graph__ [@BidirAssocIncidenceGraph.html [*Bidirectional Associative Incidence Graph]]]
+[def __Grid_Graph__ [@GridGraph.html [*Grid Graph]]]
+[def __Bidirectional_Grid_Graph__ [@BidirectionalGridGraph.html [*Bidirectional Grid Graph]]]
+[def __Indexable_Incidence_Graph__ [@IndexableIncidenceGraph.html [*Indexable Incidence Graph]]]
+[def __Bidirectional_Indexable_Incidence_Graph__ [@BidirIndexIncidenceGraph.html [*Bidirectional Indexable Incidence Graph]]]
+[def __Vertex_List_Graph__ [@boost:libs/graph/doc/VertexListGraph.html [*Vertex List Graph]]]
+[def __Edge_List_Graph__ [@boost:libs/graph/doc/EdgeListGraph.html [*Edge List Graph]]]
+[def __Adjacency_Graph__ [@boost:libs/graph/doc/AdjacencyGraph.html [*Adjacency Graph]]]
+[def __Adjacency_Matrix__ [@boost:libs/graph/doc/AdjacencyMatrix.html [*Adjacency Matrix]]]
+[def __Property_Graph__ [@boost:libs/graph/doc/PropertyGraph.html [*Property Graph]]]
+[def __Default_Constructible__ [@http://www.sgi.com/tech/stl/DefaultConstructible.html [*Default Constructible]]]
+[def __Copy_Constructible__ [@boost:libs/utility/CopyConstructible.html [*Copy Constructible]]]
+[def __Assignable__ [@boost:libs/utility/Assignable.html [*Assignable]]]
+[def _std_pair_ [@http://www.sgi.com/tech/stl/pair.html std::pair]]
+[def _std_tr1_array_ [@boost:doc/html/boost_tr1/subject_list.html#boost_tr1.subject_list.array std::tr1::array]]
+[def _property_map_ [@boost:libs/graph/doc/property_map.html property_map]]
+[def _graph_traits_ [@boost:libs/graph/doc/graph_traits.html graph_traits]]
+[def __std_allocator_selector__ [@http://svn.boost.org/svn/boost/sandbox/container_gen/libs/container_gen/doc/html/container_gen/reference/selectors.html `boost::std_allocator_selector`]]
+[def _edge_key_trait_ [@edge_key_trait.html edge_key_trait]]
+[def _vertex_dimension_trait_ [@vertex_dimension_trait.html vertex_dimension_trait]]
+[def __boost_graph_bitset_grid_graph_fwd_hpp__ [@../../../boost/graph/bitset_grid_graph_fwd.hpp boost/graph/bitset_grid_graph_fwd.hpp]]
+[def __boost_graph_bitset_grid_graph_hpp__ [@../../../boost/graph/bitset_grid_graph.hpp boost/graph/bitset_grid_graph.hpp]]
+
+[section Description]
+BGL representation of a multi-dimensional grid whose vertices are bitsets. Two
+vertices are considered adjacent to each other if their disjunction contains
+exactly one bit on. The position of this bit is the edge key that each of the
+adjacent vertices associates with the other. Therefore, a `bitset_grid_graph`
+has as many edge keys as each vertex has bits; this bit count also represents
+the number of dimensions.
+
+In each dimension, a `bitset_grid_graph` has length `2` (`true` and `false`)
+and wraps around.
+
+This data structure is an *implicit graph*, which means that its vertices and
+edges take up no internal memory.
+[endsect]
+
+[important
+ This component depends on __Boost_ContainerGen__, which is not yet a part
+ of Boost. For now, you must perform a Subversion checkout from the
+ __SVN_Trac__.
+]
+
+[section:declaration Where Declared]
+``
+#include <__boost_graph_bitset_grid_graph_fwd_hpp__>
+``
+[endsect]
+
+[section:definition Where Defined]
+``
+#include <__boost_graph_bitset_grid_graph_hpp__>
+``
+[endsect]
+
+[section:tpl_param Template Parameters]
+[table
+ [[Parameter][Description][Requirements][Default]]
+ [
+ [`BitCount`]
+ [Compile-time representation of the number of bits in each vertex.]
+ [
+ It must model the __MPL_Integral_Constant__ concept, and its value
+ must not be less than `2`.
+ ]
+ []
+ ]
+ [
+ [`VertexIndex`]
+ [The type used to represent the number of vertices in this graph.]
+ [It must be an unsigned integer type.]
+ [``
+ typename _graph_traits_<bitset_grid_graph>::degree_size_type
+ ``]
+ ]
+ [
+ [`EdgeIndex`]
+ [The type used to represent the number of vertices in this graph.]
+ [It must be an unsigned integer type.]
+ [``
+ typename _graph_traits_<bitset_grid_graph>::vertices_size_type
+ ``]
+ ]
+ [
+ [`AllocSel`]
+ [
+ A metafunction class that takes in the value type of `BitCount`
+ and returns an allocator model.
+ ]
+ [It must model the __Unary_Metafunction_Class__ concept.]
+ [__std_allocator_selector__]
+ ]
+]
+[endsect]
+
+[section:model_of Model of]
+
+ * __Bidirectional_Grid_Graph__
+ * __Bidirectional_Indexable_Incidence_Graph__
+ * __Vertex_List_Graph__
+ * __Edge_List_Graph__
+ * __Adjacency_Graph__
+ * __Adjacency_Matrix__
+ * __Property_Graph__
+ * __Default_Constructible__
+ * __Copy_Constructible__
+ * __Assignable__
+
+[endsect]
+
+[section:public_bases Public Base Classes]
+None.
+[endsect]
+
+[section Members]
+[table
+ [[Name][Definition][Where defined]]
+ [
+ [Default constructor]
+ [``
+ bitset_grid_graph();
+ ``]
+ [__Default_Constructible__]
+ ]
+ [
+ [Copy constructor]
+ [``
+ bitset_grid_graph(bitset_grid_graph const& copy);
+ ``]
+ [__Copy_Constructible__]
+ ]
+ [
+ [Assignment operator]
+ [``
+ bitset_grid_graph& operator=(bitset_grid_graph const& copy);
+ ``]
+ [__Assignable__]
+ ]
+ [
+ [Dimension count]
+ [``
+ typename _vertex_dimension_trait_<bitset_grid_graph>::type
+ dimensions() const;
+ ``]
+ [__Grid_Graph__]
+ ]
+ [
+ [Dimension length]
+ [``
+ boost::uint8_t
+ length(
+ typename _vertex_dimension_trait_<
+ bitset_grid_graph
+ >::type const& dimension
+ ) const;
+ ``]
+ [__Grid_Graph__]
+ ]
+ [
+ [Dimension wraparound query]
+ [``
+ bool
+ wrapped(
+ typename _vertex_dimension_trait_<
+ bitset_grid_graph
+ >::type const& dimension
+ ) const;
+ ``]
+ [__Grid_Graph__]
+ ]
+ [
+ [Next vertex]
+ [``
+ template <typename Distance>
+ typename _graph_traits_<bitset_grid_graph>::vertex_descriptor
+ next(
+ typename _graph_traits_<
+ bitset_grid_graph
+ >::vertex_descriptor const& vertex
+ , typename _edge_key_trait_<bitset_grid_graph>::type const& key
+ , Distance const& distance
+ ) const;
+ ``]
+ [__Grid_Graph__]
+ ]
+ [
+ [Previous vertex]
+ [``
+ template <typename Distance>
+ typename _graph_traits_<bitset_grid_graph>::vertex_descriptor
+ previous(
+ typename _graph_traits_<
+ bitset_grid_graph
+ >::vertex_descriptor const& vertex
+ , typename _edge_key_trait_<bitset_grid_graph>::type const& key
+ , Distance const& distance
+ ) const;
+ ``]
+ [__Bidirectional_Grid_Graph__]
+ ]
+ [
+ [Next vertex]
+ [``
+ typename _graph_traits_<bitset_grid_graph>::vertex_descriptor
+ next(
+ typename _graph_traits_<
+ bitset_grid_graph
+ >::vertex_descriptor const& vertex
+ , typename _edge_key_trait_<bitset_grid_graph>::type const& key
+ ) const;
+ ``]
+ [__Associative_Incidence_Graph__]
+ ]
+ [
+ [Previous vertex]
+ [``
+ typename _graph_traits_<bitset_grid_graph>::vertex_descriptor
+ previous(
+ typename _graph_traits_<
+ bitset_grid_graph
+ >::vertex_descriptor const& vertex
+ , typename _edge_key_trait_<bitset_grid_graph>::type const& key
+ ) const;
+ ``]
+ [__Bidirectional_Associative_Incidence_Graph__]
+ ]
+]
+[endsect]
+
+[section Non-members]
+[table
+ [[Name][Definition][Where defined]]
+ [
+ [Null vertex]
+ [``
+ typename _graph_traits_<bitset_grid_graph>::vertex_descriptor
+ typename _graph_traits_<bitset_grid_graph>::null_vertex();
+ ``]
+ [__Graph__]
+ ]
+ [
+ [Edge key count]
+ [``
+ typename _graph_traits_<bitset_grid_graph>::degree_size_type
+ num_edge_keys(bitset_grid_graph const& graph);
+ ``]
+ [__Associative_Incidence_Graph__]
+ ]
+ [
+ [Edge key indexed access]
+ [``
+ typename _edge_key_trait_<bitset_grid_graph>::type
+ edge_key(
+ typename _graph_traits_<
+ bitset_grid_graph
+ >::degree_size_type const& index
+ , bitset_grid_graph const& graph
+ );
+ ``]
+ [__Associative_Incidence_Graph__]
+ ]
+ [
+ [Vertex range]
+ [``
+ _std_pair_<
+ typename _graph_traits_<bitset_grid_graph>::vertex_iterator
+ , typename _graph_traits_<bitset_grid_graph>::vertex_iterator
+ >
+ vertices(bitset_grid_graph const& graph);
+ ``]
+ [__Vertex_List_Graph__]
+ ]
+ [
+ [Vertex count]
+ [``
+ typename _graph_traits_<bitset_grid_graph>::vertices_size_type const&
+ num_vertices(bitset_grid_graph const& graph);
+ ``]
+ [__Vertex_List_Graph__]
+ ]
+ [
+ [Vertex indexed access]
+ [``
+ typename _graph_traits_<bitset_grid_graph>::vertex_descriptor
+ vertex(
+ typename _graph_traits_<
+ bitset_grid_graph
+ >::vertices_size_type const& index
+ , bitset_grid_graph const& graph
+ );
+ ``]
+ [bitset_grid_graph]
+ ]
+ [
+ [Edge range]
+ [``
+ _std_pair_<
+ typename _graph_traits_<bitset_grid_graph>::edge_iterator
+ , typename _graph_traits_<bitset_grid_graph>::edge_iterator
+ >
+ edges(bitset_grid_graph const& graph);
+ ``]
+ [__Edge_List_Graph__]
+ ]
+ [
+ [Edge count]
+ [``
+ typename _graph_traits_<bitset_grid_graph>::edges_size_type const&
+ num_edges(bitset_grid_graph const& graph);
+ ``]
+ [__Edge_List_Graph__]
+ ]
+ [
+ [Edge indexed access]
+ [``
+ typename _graph_traits_<bitset_grid_graph>::edge_descriptor
+ edge_at(
+ typename _graph_traits_<
+ bitset_grid_graph
+ >::edges_size_type const& index
+ , zeta_grid_graph const& graph
+ );
+ ``]
+ [bitset_grid_graph]
+ ]
+ [
+ [Vertex out-edge range]
+ [``
+ _std_pair_<
+ typename _graph_traits_<bitset_grid_graph>::out_edge_iterator
+ , typename _graph_traits_<bitset_grid_graph>::out_edge_iterator
+ >
+ out_edges(
+ typename _graph_traits_<
+ bitset_grid_graph
+ >::vertex_descriptor const& v
+ , bitset_grid_graph const& graph
+ );
+ ``]
+ [__Incidence_Graph__]
+ ]
+ [
+ [Vertex out-degree]
+ [``
+ typename _graph_traits_<bitset_grid_graph>::degree_size_type
+ out_degree(
+ typename _graph_traits_<
+ bitset_grid_graph
+ >::vertex_descriptor const& v
+ , bitset_grid_graph const& graph
+ );
+ ``]
+ [__Incidence_Graph__]
+ ]
+ [
+ [Vertex out-edge indexed access]
+ [``
+ typename _graph_traits_<bitset_grid_graph>::edge_descriptor
+ out_edge_at(
+ typename _graph_traits_<
+ bitset_grid_graph
+ >::vertex_descriptor const& v
+ , typename _graph_traits_<
+ bitset_grid_graph
+ >::degree_size_type const& index
+ , bitset_grid_graph const& graph
+ );
+ ``]
+ [__Indexable_Incidence_Graph__]
+ ]
+ [
+ [Vertex adjacency range]
+ [``
+ _std_pair_<
+ typename _graph_traits_<bitset_grid_graph>::adjacency_iterator
+ , typename _graph_traits_<bitset_grid_graph>::adjacency_iterator
+ >
+ adjacent_vertices(
+ typename _graph_traits_<
+ bitset_grid_graph
+ >::vertex_descriptor const& v
+ , bitset_grid_graph const& graph
+ );
+ ``]
+ [__Adjacency_Graph__]
+ ]
+ [
+ [Vertex in-edge range]
+ [``
+ _std_pair_<
+ typename _graph_traits_<bitset_grid_graph>::in_edge_iterator
+ , typename _graph_traits_<bitset_grid_graph>::in_edge_iterator
+ >
+ in_edges(
+ typename _graph_traits_<
+ bitset_grid_graph
+ >::vertex_descriptor const& v
+ , bitset_grid_graph const& graph
+ );
+ ``]
+ [__Bidirectional_Graph__]
+ ]
+ [
+ [Vertex in-degree]
+ [``
+ typename _graph_traits_<bitset_grid_graph>::degree_size_type
+ in_degree(
+ typename _graph_traits_<
+ bitset_grid_graph
+ >::vertex_descriptor const& v
+ , bitset_grid_graph const& graph
+ );
+ ``]
+ [__Bidirectional_Graph__]
+ ]
+ [
+ [Vertex degree]
+ [``
+ typename _graph_traits_<bitset_grid_graph>::degree_size_type
+ degree(
+ typename _graph_traits_<
+ bitset_grid_graph
+ >::vertex_descriptor const& v
+ , bitset_grid_graph const& graph
+ );
+ ``]
+ [__Bidirectional_Graph__]
+ ]
+ [
+ [Vertex in-edge indexed access]
+ [``
+ typename _graph_traits_<bitset_grid_graph>::edge_descriptor
+ in_edge_at(
+ typename _graph_traits_<
+ bitset_grid_graph
+ >::vertex_descriptor const& v
+ , typename _graph_traits_<
+ bitset_grid_graph
+ >::degree_size_type const& index
+ , bitset_grid_graph const& graph
+ );
+ ``]
+ [__Bidirectional_Indexable_Incidence_Graph__]
+ ]
+ [
+ [Direct edge access]
+ [``
+ _std_pair_<
+ typename _graph_traits_<bitset_grid_graph>::edge_descriptor
+ , bool
+ >
+ edge(
+ typename _graph_traits_<
+ bitset_grid_graph
+ >::vertex_descriptor const& u
+ , typename _graph_traits_<
+ bitset_grid_graph
+ >::vertex_descriptor const& v
+ , bitset_grid_graph const& graph
+ );
+ ``]
+ [__Adjacency_Matrix__]
+ ]
+ [
+ [Vertex index property map access]
+ [``
+ typename _property_map_<bitset_grid_graph,vertex_index_t>::type
+ get(vertex_index_t, bitset_grid_graph const& graph);
+ ``]
+ [__Property_Graph__]
+ ]
+ [
+ [Vertex index access]
+ [``
+ typename _graph_traits_<bitset_grid_graph>::vertices_size_type
+ get(
+ vertex_index_t
+ , bitset_grid_graph const& graph
+ , typename _graph_traits_<
+ bitset_grid_graph
+ >::vertex_descriptor const& v
+ );
+ ``]
+ [__Property_Graph__]
+ ]
+ [
+ [Edge index property map access]
+ [``
+ typename _property_map_<bitset_grid_graph,edge_index_t>::type
+ get(edge_index_t, bitset_grid_graph const& graph);
+ ``]
+ [__Property_Graph__]
+ ]
+ [
+ [Edge index access]
+ [``
+ typename _graph_traits_<bitset_grid_graph>::edges_size_type
+ get(
+ edge_index_t
+ , bitset_grid_graph const& graph
+ , typename _graph_traits_<
+ bitset_grid_graph
+ >::edge_descriptor const& e
+ );
+ ``]
+ [__Property_Graph__]
+ ]
+]
+[endsect]
+

Next message: dnljms_at_[hidden]: "[Boost-commit] svn:boost r81213 - in website/public_html/live/generated: . state"
Previous message: john_at_[hidden]: "[Boost-commit] svn:boost r81211 - in sandbox/big_number/boost/multiprecision: . detail"

Date view	Thread view	Subject view	Author view