Merge array bug fixes to master

Merge pull request #5 from Lastique/patch-1
Fix compilation for Oracle Studio 12.5
2017-01-31 08:00:48 -08:00 · 2017-01-23 20:00:25 -08:00 · 2017-01-24 02:31:27 +04:00 · 2016-10-27 20:12:38 +01:00 · 2016-10-07 23:03:40 -05:00 · 2015-01-08 14:10:08 -08:00
28 changed files with 1486 additions and 979 deletions
--- a/array.hpp.html
+++ b/array.hpp.html
@ -1,175 +0,0 @@
 <HTML>
 <HEAD>
 <TITLE>array.hpp</TITLE>
 </HEAD>
 <BODY TEXT="#000000" BGCOLOR="#FFFFFF">
 &nbsp;
 <TABLE HEIGHT=40 WIDTH="100%">
 <TR> <TD ALIGN=LEFT WIDTH="100%" BGCOLOR="#DDDDDD">
 <FONT face="Arial,Helvetica" size=+2><B>
 &nbsp;array.hpp
 </B></FONT>
 </TD></TR></TABLE><BR>
 <BR><BR>
 <TT>
 <SPAN class="Source">
 <Font color="0000FF" >/</FONT><I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*&nbsp;The&nbsp;following&nbsp;code&nbsp;declares&nbsp;class&nbsp;array,</FONT></I><BR>
 &nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*&nbsp;an&nbsp;STL&nbsp;container&nbsp;(as&nbsp;wrapper)&nbsp;for&nbsp;arrays&nbsp;of&nbsp;constant&nbsp;size.</FONT></I><BR>
 &nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*</FONT></I><BR>
 &nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*&nbsp;See</FONT></I><BR>
 &nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<a href="http://www.josuttis.com/cppcode">http://www.josuttis.com/cppcode</a></FONT></I><BR>
 &nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*&nbsp;for&nbsp;details&nbsp;and&nbsp;the&nbsp;latest&nbsp;version.</FONT></I><BR>
 &nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*</FONT></I><BR>
 &nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*&nbsp;(C)&nbsp;Copyright&nbsp;Nicolai&nbsp;M.&nbsp;Josuttis&nbsp;2001.</FONT></I><BR>
 &nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*&nbsp;Permission&nbsp;to&nbsp;copy,&nbsp;use,&nbsp;modify,&nbsp;sell&nbsp;and&nbsp;distribute&nbsp;this&nbsp;software</FONT></I><BR>
 &nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*&nbsp;is&nbsp;granted&nbsp;provided&nbsp;this&nbsp;copyright&nbsp;notice&nbsp;appears&nbsp;in&nbsp;all&nbsp;copies.</FONT></I><BR>
 &nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*&nbsp;This&nbsp;software&nbsp;is&nbsp;provided&nbsp;"as&nbsp;is"&nbsp;without&nbsp;express&nbsp;or&nbsp;implied</FONT></I><BR>
 &nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*&nbsp;warranty,&nbsp;and&nbsp;with&nbsp;no&nbsp;claim&nbsp;as&nbsp;to&nbsp;its&nbsp;suitability&nbsp;for&nbsp;any&nbsp;purpose.</FONT></I><BR>
 &nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*</FONT></I><BR>
 &nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*&nbsp;Aug&nbsp;05,&nbsp;2001</FONT></I><BR>
 &nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*/</FONT></I><BR>
 #ifndef&nbsp;BOOST_ARRAY_HPP<BR>
 #define&nbsp;BOOST_ARRAY_HPP<BR>
 <BR>
 #include&nbsp;&lt;cstddef&gt;<BR>
 #include&nbsp;&lt;stdexcept&gt;<BR>
 #include&nbsp;&lt;iterator&gt;<BR>
 #include&nbsp;&lt;algorithm&gt;<BR>
 <BR>
 <I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;FIXES&nbsp;for&nbsp;broken&nbsp;compilers</FONT></I><BR>
 #include&nbsp;&lt;<A href="../../boost/config.hpp">boost/config.hpp</A>&gt;<BR>
 <BR>
 namespace&nbsp;boost&nbsp;{<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;template&lt;class&nbsp;T,&nbsp;std::size_t&nbsp;N&gt;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;class&nbsp;array&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;public:<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;T&nbsp;elems[N];&nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;fixed-size&nbsp;array&nbsp;of&nbsp;elements&nbsp;of&nbsp;type&nbsp;T</FONT></I><BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;public:<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;type&nbsp;definitions</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;typedef&nbsp;T&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;value_type;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;typedef&nbsp;T*&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;iterator;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;typedef&nbsp;const&nbsp;T*&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;const_iterator;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;typedef&nbsp;T&&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;reference;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;typedef&nbsp;const&nbsp;T&&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;const_reference;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;typedef&nbsp;std::size_t&nbsp;&nbsp;&nbsp;&nbsp;size_type;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;typedef&nbsp;std::ptrdiff_t&nbsp;difference_type;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;iterator&nbsp;support</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;iterator&nbsp;begin()&nbsp;{&nbsp;return&nbsp;elems;&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;const_iterator&nbsp;begin()&nbsp;const&nbsp;{&nbsp;return&nbsp;elems;&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;iterator&nbsp;end()&nbsp;{&nbsp;return&nbsp;elems+N;&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;const_iterator&nbsp;end()&nbsp;const&nbsp;{&nbsp;return&nbsp;elems+N;&nbsp;}<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;reverse&nbsp;iterator&nbsp;support</FONT></I><BR>
 #if&nbsp;!defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)&nbsp;&&&nbsp;!defined(BOOST_MSVC_STD_ITERATOR)<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;typedef&nbsp;std::reverse_iterator&lt;iterator&gt;&nbsp;reverse_iterator;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;typedef&nbsp;std::reverse_iterator&lt;const_iterator&gt;&nbsp;const_reverse_iterator;<BR>
 #else<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;workaround&nbsp;for&nbsp;broken&nbsp;reverse_iterator&nbsp;implementations</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;typedef&nbsp;std::reverse_iterator&lt;iterator,T&gt;&nbsp;reverse_iterator;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;typedef&nbsp;std::reverse_iterator&lt;const_iterator,T&gt;&nbsp;const_reverse_iterator;<BR>
 #endif<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;reverse_iterator&nbsp;rbegin()&nbsp;{&nbsp;return&nbsp;reverse_iterator(end());&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;const_reverse_iterator&nbsp;rbegin()&nbsp;const&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;return&nbsp;const_reverse_iterator(end());<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;reverse_iterator&nbsp;rend()&nbsp;{&nbsp;return&nbsp;reverse_iterator(begin());&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;const_reverse_iterator&nbsp;rend()&nbsp;const&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;return&nbsp;const_reverse_iterator(begin());<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;operator[]</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;reference&nbsp;operator[](size_type&nbsp;i)&nbsp;{&nbsp;return&nbsp;elems[i];&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;const_reference&nbsp;operator[](size_type&nbsp;i)&nbsp;const&nbsp;{&nbsp;return&nbsp;elems[i];&nbsp;}<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;at()&nbsp;with&nbsp;range&nbsp;check</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;reference&nbsp;at(size_type&nbsp;i)&nbsp;{&nbsp;rangecheck(i);&nbsp;return&nbsp;elems[i];&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;const_reference&nbsp;at(size_type&nbsp;i)&nbsp;const&nbsp;{&nbsp;rangecheck(i);&nbsp;return&nbsp;elems[i];&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;front()&nbsp;and&nbsp;back()</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;reference&nbsp;front()&nbsp;{&nbsp;return&nbsp;elems[0];&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;const_reference&nbsp;front()&nbsp;const&nbsp;{&nbsp;return&nbsp;elems[0];&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;reference&nbsp;back()&nbsp;{&nbsp;return&nbsp;elems[N-1];&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;const_reference&nbsp;back()&nbsp;const&nbsp;{&nbsp;return&nbsp;elems[N-1];&nbsp;}<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;size&nbsp;is&nbsp;constant</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;static&nbsp;size_type&nbsp;size()&nbsp;{&nbsp;return&nbsp;N;&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;static&nbsp;bool&nbsp;empty()&nbsp;{&nbsp;return&nbsp;false;&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;static&nbsp;size_type&nbsp;max_size()&nbsp;{&nbsp;return&nbsp;N;&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;enum&nbsp;{&nbsp;static_size&nbsp;=&nbsp;N&nbsp;};<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;swap&nbsp;(note:&nbsp;linear&nbsp;complexity)</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;void&nbsp;swap&nbsp;(array&lt;T,N&gt;&&nbsp;y)&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;std::swap_ranges(begin(),end(),y.begin());<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;direct&nbsp;access&nbsp;to&nbsp;data</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;const&nbsp;T*&nbsp;data()&nbsp;const&nbsp;{&nbsp;return&nbsp;elems;&nbsp;}<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;assignment&nbsp;with&nbsp;type&nbsp;conversion</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;template&nbsp;&lt;typename&nbsp;T2&gt;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;array&lt;T,N&gt;&&nbsp;operator=&nbsp;(const&nbsp;array&lt;T2,N&gt;&&nbsp;rhs)&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;std::copy(rhs.begin(),rhs.end(),&nbsp;begin());<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;return&nbsp;*this;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;assign&nbsp;one&nbsp;value&nbsp;to&nbsp;all&nbsp;elements</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;void&nbsp;assign&nbsp;(const&nbsp;T&&nbsp;value)<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;std::fill_n(begin(),size(),value);<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 <BR>
 #ifndef&nbsp;BOOST_NO_PRIVATE_IN_AGGREGATE<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;private:<BR>
 #endif<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;check&nbsp;range&nbsp;(may&nbsp;be&nbsp;private&nbsp;because&nbsp;it&nbsp;is&nbsp;static)</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;static&nbsp;void&nbsp;rangecheck&nbsp;(size_type&nbsp;i)&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;if&nbsp;(i&nbsp;&gt;=&nbsp;size())&nbsp;{&nbsp;throw&nbsp;std::range_error("array");&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;};<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;comparisons</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;template&lt;class&nbsp;T,&nbsp;std::size_t&nbsp;N&gt;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;bool&nbsp;operator==&nbsp;(const&nbsp;array&lt;T,N&gt;&&nbsp;x,&nbsp;const&nbsp;array&lt;T,N&gt;&&nbsp;y)&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;return&nbsp;std::equal(x.begin(),&nbsp;x.end(),&nbsp;y.begin());<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;template&lt;class&nbsp;T,&nbsp;std::size_t&nbsp;N&gt;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;bool&nbsp;operator&lt;&nbsp;(const&nbsp;array&lt;T,N&gt;&&nbsp;x,&nbsp;const&nbsp;array&lt;T,N&gt;&&nbsp;y)&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;return&nbsp;std::lexicographical_compare(x.begin(),x.end(),y.begin(),y.end());<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;template&lt;class&nbsp;T,&nbsp;std::size_t&nbsp;N&gt;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;bool&nbsp;operator!=&nbsp;(const&nbsp;array&lt;T,N&gt;&&nbsp;x,&nbsp;const&nbsp;array&lt;T,N&gt;&&nbsp;y)&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;return&nbsp;!(x==y);<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;template&lt;class&nbsp;T,&nbsp;std::size_t&nbsp;N&gt;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;bool&nbsp;operator&gt;&nbsp;(const&nbsp;array&lt;T,N&gt;&&nbsp;x,&nbsp;const&nbsp;array&lt;T,N&gt;&&nbsp;y)&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;return&nbsp;y&lt;x;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;template&lt;class&nbsp;T,&nbsp;std::size_t&nbsp;N&gt;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;bool&nbsp;operator&lt;=&nbsp;(const&nbsp;array&lt;T,N&gt;&&nbsp;x,&nbsp;const&nbsp;array&lt;T,N&gt;&&nbsp;y)&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;return&nbsp;!(y&lt;x);<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;template&lt;class&nbsp;T,&nbsp;std::size_t&nbsp;N&gt;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;bool&nbsp;operator&gt;=&nbsp;(const&nbsp;array&lt;T,N&gt;&&nbsp;x,&nbsp;const&nbsp;array&lt;T,N&gt;&&nbsp;y)&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;return&nbsp;!(x&lt;y);<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;global&nbsp;swap()</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;template&lt;class&nbsp;T,&nbsp;std::size_t&nbsp;N&gt;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;inline&nbsp;void&nbsp;swap&nbsp;(array&lt;T,N&gt;&&nbsp;x,&nbsp;array&lt;T,N&gt;&&nbsp;y)&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;x.swap(y);<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 <BR>
 }&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >/*&nbsp;namespace&nbsp;boost&nbsp;*/</FONT></I><BR>
 <BR>
 #endif&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >/*BOOST_ARRAY_HPP*/</FONT></I><BR>
 </SPAN>
 </TT>
 </BODY>
 </HTML>
--- a/array.html
+++ b/array.html
@ -1,330 +0,0 @@
 <!doctype html public "-//w3c//dtd html 4.0 transitional//en">
 <html>
 <head>
   <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
 <meta name="Keywords" content="array, block, carray, c_array, array wrapper, adapter, adaptor, STL, C++ Standard Library, array.hpp">
 <title>array.hpp, an STL Array Wrapper</title>
 </head>
 <body text="#000000" bgcolor="#FFFFFF" link="#186ABF">
 <font face="Arial, Helvetica, sans-serif">&nbsp; </font> 
 <table width="100%" height="40">
  <tr> 
    <td BGCOLOR="#DDDDDD"><b><font face="Arial,helvetica" color="#000000" size="+1">Class 
      <font face="Courier New, Courier, mono">array</font>, an STL Container (as 
      Wrapper) for Arrays of Constant Size</font></b></td>
  </tr>
 </table>
 <p><font size="-1" face="Arial, Helvetica, sans-serif">[<a href="#intro">intro</a>] 
  [<a href="#interface">interface</a>] [<a href="#discussion">discussion</a>] 
  [<a href="#code">code</a>]</font>
 <p><font face="Arial, Helvetica, sans-serif" size="-1"><a name="intro"></a>The 
  C++ Standard Template Library STL as part of the C++ Standard Library provides 
  a framework for processing algorithms on different kind of containers. However, 
  ordinary arrays don't provide the interface of STL containers (although, they 
  provide the iterator interface of STL containers).</font> 
 <p><font face="Arial, Helvetica, sans-serif" size="-1">As replacement for ordinary 
  arrays, the STL provides class <font face="Courier New, Courier, mono">vector&lt;&gt;</font>. 
  However, <font face="Courier New, Courier, mono">vector&lt;&gt;</font> provides 
  the semantics of dynamic arrays. Thus, it manages data to be able to change 
  the number of elements. This results in some overhead in case only arrays with 
  static size are needed.</font> 
 <p><font face="Arial, Helvetica, sans-serif" size="-1">In his book, <i>Generic 
  Programming and the STL</i>, Matthew H. Austern introduces a useful wrapper 
  class for ordinary arrays with static size, called <font face="Courier New, Courier, mono"><b>block</b></font>. 
  It is safer and has no worse performance than ordinary arrays. In <i>The C++ 
  Programming Language</i>, 3rd edition, Bjarne Stroustrup introduces a similar 
  class, called <font face="Courier New, Courier, mono"><b>c_array</b></font>, 
  which I (<a href="http://www.josuttis.com">Nicolai Josuttis</a>) present slightly 
  modified in my book <i>The C++ Standard Library - A Tutorial and Reference</i>, 
  called <font face="Courier New, Courier, mono"><b>carray</b></font>. This is 
  the essence of these approaches spiced with many feedback from <a href="http://www.boost.org">boost</a>.</font> 
 <p><font face="Arial, Helvetica, sans-serif" size="-1">After considering different 
  names, we decided to name this class simply <font face="Courier New, Courier, mono"><b>array</b></font>.</font> 
 <p><font face="Arial, Helvetica, sans-serif" size="-1"><a name="interface"></a>The 
  class provides the following interface:</font> 
 <table border="0">
  <tr> 
    <td><font face="Arial, Helvetica, sans-serif" size="-1"><b>Types:</b></font></td>
    <td><font size="-1"></font></td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">value_type</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">type of the elements</font></td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">iterator</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">type of the iterator 
      (random-access iterator)</font></td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">const_iterator</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">type of iterator that 
      considers elements as being constant</font></td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">reference</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">type of element reference</font></td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">const_reference</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">type of element reference 
      that considers elements as being constant</font></td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">size_type</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">type for signed size 
      values</font></td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">difference_type</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">type for unsigned 
      difference values</font></td>
  </tr>
  <tr> 
    <td><font face="Arial, Helvetica, sans-serif" size="-1"><b>Operations:</b></font></td>
    <td><font size="-1"></font></td>
  </tr>
  <tr> 
    <td> 
      <p><font face="Courier New, Courier, mono" size="-1">array&lt;<i>type</i>,<i>num</i>&gt;</font></p>
    </td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">default constructor, 
      creates array of <i><font face="Courier New, Courier, mono">num</font></i> 
      element of <i><font face="Courier New, Courier, mono">type</font></i>, see 
      comment below</font></td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">array&lt;<i>type</i>,<i>num</i>&gt;(<i>a</i>)</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">copy constructor, 
      copies all elements of <i><font face="Courier New, Courier, mono">a</font></i> 
      (<i><font face="Courier New, Courier, mono">a</font></i> must have same 
      <i> <font face="Courier New, Courier, mono">type</font></i><font face="Courier New, Courier, mono"><font face="Arial, Helvetica, sans-serif"> 
      and </font></font><i><font face="Courier New, Courier, mono">num</font></i>)</font></td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">operator=</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">assignment, assigns 
      all elements</font></td>
  </tr>
  <tr>
    <td><font face="Courier New, Courier, mono" size="-1">assign(<i>val</i>)</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">assigns <i>val</i> 
      to all elements</font></td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">begin()</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">returns iterator for 
      the first element</font></td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">end()</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">returns iterator for 
      position after the last element</font></td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">rbegin()</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">returns reverse iterator 
      for position of first element of reverse iteration</font></td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">rend()</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">returns reverse iterator 
      for position behind last element of reverse iteration </font></td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">operator[<i>i</i>]</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">returns element with 
      index <i><font face="Courier New, Courier, mono">i</font></i> (no range 
      checking)</font></td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">at(<i>i</i>)</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">returns element with 
      index <font face="Courier New, Courier, mono"><i>i</i></font> (throw std::range_error 
      if <i><font face="Courier New, Courier, mono">i</font></i> is not valid)</font></td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">front()</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">returns first element 
      (caller has to ensure that it exists)</font></td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">back()</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">returns last element 
      (caller has to ensure that it exists)</font></td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">data()</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">returns raw element 
      array for read-only element access</font></td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">size()</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">returns number of 
      elements</font></td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">empty()</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">returns whether array 
      is empty</font></td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">max_size()</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">returns maximum possible 
      number of elements (same as size())</font></td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">swap(a)</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">swap elements with 
      array a</font></td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">==<font face="Arial, Helvetica, sans-serif">, 
      </font>!=</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">checks for equality</font></td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">&lt;<font face="Arial, Helvetica, sans-serif">, 
      </font>&lt;=<font face="Arial, Helvetica, sans-serif">, </font>&gt;<font face="Arial, Helvetica, sans-serif">, 
      </font>&gt;=</font></td>
    <td><font face="Arial, Helvetica, sans-serif" size="-1">compares array</font></td>
  </tr>
  <tr> 
    <td><font face="Arial, Helvetica, sans-serif" size="-1"><b>Values:</b></font></td>
    <td>&nbsp;</td>
  </tr>
  <tr> 
    <td><font face="Courier New, Courier, mono" size="-1">static_size</font></td>
    <td><font size="-1" face="Arial, Helvetica, sans-serif">yields size at compile 
      time</font></td>
  </tr>
 </table>
 <p><font face="Arial, Helvetica, sans-serif" size="-1"><a name="discussion"></a>Class 
  array fulfills most but not all of the requirements of &quot;reversible containers&quot; 
  (see Section 23.1, [lib.container.requirements] of the C++ Standard). The reasons 
  array is not an reversible STL container is because: </font> <font face="Arial, Helvetica, sans-serif" size="-1"><br>
  - No constructors are provided<br>
  - Elements may have an undetermined initial value (see below)<br>
  - swap() has no constant complexity<br>
  - size() is always constant, based on the second template argument of the type<br>
  - The container provides no allocator support</font> 
 <p><font face="Arial, Helvetica, sans-serif" size="-1">It doesn't fulfill the 
  requirements of a &quot;sequence&quot; (see Section 23.1.1, [lib.sequence.reqmts] 
  of the C++ Standard), except that</font> <font face="Arial, Helvetica, sans-serif" size="-1"><br>
  - front() and back() are provided<br>
  - operator[] and at() are provided</font>
 <p><font face="Arial, Helvetica, sans-serif" size="-1">Regarding the constructors 
  there was an important design tradeoff: We could implement array as an &quot;<b>aggregate</b>&quot; 
  (see Section 8.5.1, [dcl.init.aggr], of the C++ Standard). This would mean:</font></p>
 <ul>
  <li><font face="Arial, Helvetica, sans-serif" size="-1">An array can be initialized 
    with a brace-enclosing, comma-separated list of initializers for the elements 
    of the container, written in increasing subscript order:</font> 
    <blockquote> 
      <p><font face="Arial, Helvetica, sans-serif" size="-1">boost::array&lt;int,4&gt; 
        a = { { 1, 2, 3 } };</font></p>
    </blockquote>
    <p><font face="Arial, Helvetica, sans-serif" size="-1">Note that if there 
      are fewer elements in the initializer list, then each remaining element 
      gets default-initialized (thus, it has a defined value).</font></p>
  </li>
  <li><font face="Arial, Helvetica, sans-serif" size="-1">However, <b>passing 
    no initializer list means that the elements have an indetermined initial value</b>.</font></li>
  <li><font face="Arial, Helvetica, sans-serif" size="-1">It has no user-declared 
    constructors.</font></li>
  <li><font face="Arial, Helvetica, sans-serif" size="-1">It has no private or 
    protected non-static data members.</font></li>
  <li><font face="Arial, Helvetica, sans-serif" size="-1">It has no base classes.</font></li>
  <li><font face="Arial, Helvetica, sans-serif" size="-1">It has no virtual functions.</font></li>
 </ul>
 <p><font face="Arial, Helvetica, sans-serif" size="-1">The current implementation 
  uses this approach. However, being able to have indeterminate initial values 
  is a big drawback. So, please give me some feedback, how useful you consider 
  this feature to be. This leads to the list of <b>Open issues:</b></font> 
 <ul>
  <li><font face="Arial, Helvetica, sans-serif" size="-1">Do we want initializer 
    list support or would the following be OK?:</font> 
    <blockquote> 
      <p><font face="Courier New, Courier, mono" size="-1">int data[] = { 1, 2, 
        3, 4 }</font></p>
      <p><font face="Courier New, Courier, mono" size="-1">array&lt;int,5&gt; 
        x(data); <font face="Arial, Helvetica, sans-serif">or </font>&nbsp;&nbsp;array&lt;int,data&gt; 
        x;</font></p>
    </blockquote>
  </li>
  <li><font face="Arial, Helvetica, sans-serif" size="-1">Could &quot;<font face="Courier New, Courier, mono">{ 
    </font>...<font face="Courier New, Courier, mono"> }</font>&quot; be used 
    portably instead of &quot;<font face="Courier New, Courier, mono">{ { </font>...<font face="Courier New, Courier, mono"> 
    } }</font>&quot; to initialize values?</font> </li>
  <blockquote> 
    <p><font face="Arial, Helvetica, sans-serif" size="-1">8.5.1 (11) of the Standard 
      seems to allow it; however, gcc 2.95.2 prints a warning message.</font></p>
  </blockquote>
  <li><font face="Arial, Helvetica, sans-serif" size="-1">Any way to have determinate 
    initial values and initializer list support?</font></li>
  <li><font face="Arial, Helvetica, sans-serif" size="-1">Static_casts for reverse 
    iterator stuff?</font></li>
 </ul>
 <p><font face="Arial, Helvetica, sans-serif" size="-1">I'd appreciate any constructive 
  <a href="mailto:solutions@josuttis.com">feedback</a>. <b>Please note: I don't 
  have time to read all boost mails. Thus, to make sure that feedback arrives 
  me, please send me a copy of each mail regarding this class.</b></font> 
 <p><font face="Arial, Helvetica, sans-serif"><a name="code"></a>The code is provided 
  "as is" without expressed or implied warranty.</font> 
 <p><font face="Arial, Helvetica, sans-serif"><b>array.hpp</b>, the implementation 
  of <font face="Courier New, Courier, mono">array&lt;&gt;</font><b>:</b> </font> 
 <li><font face="Arial, Helvetica, sans-serif">
 	<a href="array.hpp.html">as HTML file</a></font></li>
 <li><font face="Arial, Helvetica, sans-serif">
 	<a href="../../boost/array.hpp">as plain file</a></font></li>
 <p> <font face="Arial, Helvetica, sans-serif"><b>array1.cpp</b>, a simple example 
  for using <font face="Courier New, Courier, mono">array&lt;&gt;<font face="Arial, Helvetica, sans-serif">:</font></font></font> 
 <li><font face="Arial, Helvetica, sans-serif">
 	<a href="array1.cpp.html">as HTML file</a></font> </li>
 <li><font face="Arial, Helvetica, sans-serif">
 	<a href="array1.cpp">as plain file</a></font></li>
 <p> <font face="Arial, Helvetica, sans-serif"><b>array2.cpp</b>, another example 
  for using <font face="Courier New, Courier, mono">array&lt;&gt;<font face="Arial, Helvetica, sans-serif">:</font></font></font> 
 <li><font face="Arial, Helvetica, sans-serif">
 	<a href="array2.cpp.html">as HTML file</a></font></li>
 <li><font face="Arial, Helvetica, sans-serif">
 	<a href="array2.cpp">as plain file</a></font></li>
 <p> <font face="Arial, Helvetica, sans-serif"><b>array3.cpp</b>, a third example 
  for using <font face="Courier New, Courier, mono">array&lt;&gt;<font face="Arial, Helvetica, sans-serif">:</font></font></font> 
 <li><font face="Arial, Helvetica, sans-serif">
 	<a href="array3.cpp.html">as HTML file</a></font></li>
 <li><font face="Arial, Helvetica, sans-serif">
 	<a href="array3.cpp">as plain file</a></font></li>
 <p> <font face="Arial, Helvetica, sans-serif"><b>array4.cpp</b>, an example for 
  using <font face="Courier New, Courier, mono">array</font>s of <font face="Courier New, Courier, mono">array</font>s<font face="Courier New, Courier, mono"><font face="Arial, Helvetica, sans-serif">:</font></font></font> 
 <li><font face="Arial, Helvetica, sans-serif"> <a href="array4.cpp.html">as HTML 
  file</a></font></li>
 <li><font face="Arial, Helvetica, sans-serif"> <a href="array4.cpp">as plain file</a></font></li>
 <p><font face="Arial, Helvetica, sans-serif"><b>array5.cpp</b>, an example for 
  testing other operations of <font face="Courier New, Courier, mono">array&lt;&gt;<font face="Arial, Helvetica, sans-serif">:</font></font></font> 
 <li><font face="Arial, Helvetica, sans-serif"> <a href="array5.cpp.html">as HTML 
  file</a></font></li>
 <li><font face="Arial, Helvetica, sans-serif"> <a href="array5.cpp">as plain file</a></font></li>
 <br>
 <br>
 <font face="Arial, Helvetica, sans-serif">
  To find more details about using ordinary arrays in C++ and the framework of 
  the STL, see e.g.</font> <font face="Arial, Helvetica, sans-serif"><br>
  <i>&nbsp;&nbsp;&nbsp;&nbsp; <a href="http://www.josuttis.com/libbook/">The C++ 
  Standard Library - A Tutorial and Reference</a></i> <br>
  &nbsp;&nbsp;&nbsp;&nbsp; by <a href="http://www.josuttis.com" target="_top">Nicolai 
  M. Josuttis</a></font> <font face="Arial, Helvetica, sans-serif"><br>
  &nbsp;&nbsp;&nbsp;&nbsp; Addison Wesley Longman, 1999</font> <font face="Arial, Helvetica, sans-serif"><br>
  &nbsp;&nbsp;&nbsp;&nbsp; ISBN 0-201-37926-0</font> <font face="Arial, Helvetica, sans-serif"><br>
  </font></li>
 <p><font face="Arial, Helvetica, sans-serif"><a href="http://www.josuttis.com/" TARGET="_top">Home 
  Page of Nicolai Josuttis</a></font><font face="Arial, Helvetica, sans-serif"> 
  </font>
 <p><font size="-1" face="Arial, Helvetica, sans-serif">[<a href="#intro">intro</a>] 
  [<a href="#interface">interface</a>] [<a href="#discussion">discussion</a>] 
  [<a href="#code">code</a>]</font> 
 <p><font face="Arial, Helvetica, sans-serif" size="-1"></font> 
 <p><font face="Arial, Helvetica, sans-serif">&nbsp; </font> 
 </body>
 </html>
--- a/array1.cpp.html
+++ b/array1.cpp.html
@ -1,69 +0,0 @@
 <HTML>
 <HEAD>
 <TITLE>array1.cpp</TITLE>
 </HEAD>
 <BODY TEXT="#000000" BGCOLOR="#FFFFFF">
 &nbsp;
 <TABLE HEIGHT=40 WIDTH="100%">
 <TR> <TD ALIGN=LEFT WIDTH="100%" BGCOLOR="#DDDDDD">
 <FONT face="Arial,Helvetica" size=+2><B>
 &nbsp;array1.cpp
 </B></FONT>
 </TD></TR></TABLE><BR>
 <BR><BR>
 <TT>
 <SPAN class="Source">
 <Font color="0000FF" >/</FONT><I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*&nbsp;simple&nbsp;example&nbsp;for&nbsp;using&nbsp;class&nbsp;array&lt;&gt;</FONT></I><BR>
 &nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*/</FONT></I><BR>
 #include&nbsp;&lt;iostream&gt;<BR>
 #include&nbsp;&lt;<A href="./array.hpp.html">boost/array.hpp</A>&gt;<BR>
 <BR>
 int&nbsp;main()<BR>
 {<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;define&nbsp;special&nbsp;type&nbsp;name</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;typedef&nbsp;boost::array&lt;float,6&gt;&nbsp;Array;<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;create&nbsp;and&nbsp;initialize&nbsp;an&nbsp;array</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;Array&nbsp;a&nbsp;=&nbsp;{&nbsp;{&nbsp;42&nbsp;}&nbsp;};<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;access&nbsp;elements</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;for&nbsp;(unsigned&nbsp;i=1;&nbsp;i&lt;a.size();&nbsp;++i)&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;a[i]&nbsp;=&nbsp;a[i-1]+1;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;use&nbsp;some&nbsp;common&nbsp;STL&nbsp;container&nbsp;operations</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"size:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;"&nbsp;&lt;&lt;&nbsp;a.size()&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"empty:&nbsp;&nbsp;&nbsp;&nbsp;"&nbsp;&lt;&lt;&nbsp;std::boolalpha&nbsp;&lt;&lt;&nbsp;a.empty()&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"max_size:&nbsp;"&nbsp;&lt;&lt;&nbsp;a.max_size()&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"front:&nbsp;&nbsp;&nbsp;&nbsp;"&nbsp;&lt;&lt;&nbsp;a.front()&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"back:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;"&nbsp;&lt;&lt;&nbsp;a.back()&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"elems:&nbsp;&nbsp;&nbsp;&nbsp;";<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;iterate&nbsp;through&nbsp;all&nbsp;elements</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;for&nbsp;(Array::const_iterator&nbsp;pos=a.begin();&nbsp;pos&lt;a.end();&nbsp;++pos)&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;*pos&nbsp;&lt;&lt;&nbsp;'&nbsp;';<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;check&nbsp;copy&nbsp;constructor&nbsp;and&nbsp;assignment&nbsp;operator</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;Array&nbsp;b(a);<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;Array&nbsp;c;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;c&nbsp;=&nbsp;a;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;if&nbsp;(a==b&nbsp;&&&nbsp;a==c)&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"copy&nbsp;construction&nbsp;and&nbsp;copy&nbsp;assignment&nbsp;are&nbsp;OK"<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;else&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"copy&nbsp;construction&nbsp;and&nbsp;copy&nbsp;assignment&nbsp;FAILED"<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;return&nbsp;0;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;makes&nbsp;Visual-C++&nbsp;compiler&nbsp;happy</FONT></I><BR>
 }<BR>
 <BR>
 </SPAN>
 </TT>
 </BODY>
 </HTML>
--- a/array2.cpp.html
+++ b/array2.cpp.html
@ -1,56 +0,0 @@
 <HTML>
 <HEAD>
 <TITLE>array2.cpp</TITLE>
 </HEAD>
 <BODY TEXT="#000000" BGCOLOR="#FFFFFF">
 &nbsp;
 <TABLE HEIGHT=40 WIDTH="100%">
 <TR> <TD ALIGN=LEFT WIDTH="100%" BGCOLOR="#DDDDDD">
 <FONT face="Arial,Helvetica" size=+2><B>
 &nbsp;array2.cpp
 </B></FONT>
 </TD></TR></TABLE><BR>
 <BR><BR>
 <TT>
 <SPAN class="Source">
 <Font color="0000FF" >/</FONT><I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*&nbsp;example&nbsp;for&nbsp;using&nbsp;class&nbsp;array&lt;&gt;</FONT></I><BR>
 &nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*/</FONT></I><BR>
 #include&nbsp;&lt;algorithm&gt;<BR>
 #include&nbsp;&lt;functional&gt;<BR>
 #include&nbsp;&lt;<A href="./array.hpp.html">boost/array.hpp</A>&gt;<BR>
 #include&nbsp;"<A href="print.hpp.html">print.hpp</A>"<BR>
 using&nbsp;namespace&nbsp;std;<BR>
 using&nbsp;namespace&nbsp;boost;<BR>
 <BR>
 int&nbsp;main()<BR>
 {<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;create&nbsp;and&nbsp;initialize&nbsp;array</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;array&lt;int,10&gt;&nbsp;a&nbsp;=&nbsp;{&nbsp;{&nbsp;1,&nbsp;2,&nbsp;3,&nbsp;4,&nbsp;5&nbsp;}&nbsp;};<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;print_elements(a);<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;modify&nbsp;elements&nbsp;directly</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;for&nbsp;(unsigned&nbsp;i=0;&nbsp;i&lt;a.size();&nbsp;++i)&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;++a[i];<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;print_elements(a);<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;change&nbsp;order&nbsp;using&nbsp;an&nbsp;STL&nbsp;algorithm</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;reverse(a.begin(),a.end());<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;print_elements(a);<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;negate&nbsp;elements&nbsp;using&nbsp;STL&nbsp;framework</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;transform(a.begin(),a.end(),&nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;source</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;a.begin(),&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;destination</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;negate&lt;int&gt;());&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;operation</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;print_elements(a);<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;return&nbsp;0;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;makes&nbsp;Visual-C++&nbsp;compiler&nbsp;happy</FONT></I><BR>
 }<BR>
 <BR>
 </SPAN>
 </TT>
 </BODY>
 </HTML>
--- a/array3.cpp.html
+++ b/array3.cpp.html
@ -1,71 +0,0 @@
 <HTML>
 <HEAD>
 <TITLE>array3.cpp</TITLE>
 </HEAD>
 <BODY TEXT="#000000" BGCOLOR="#FFFFFF">
 &nbsp;
 <TABLE HEIGHT=40 WIDTH="100%">
 <TR> <TD ALIGN=LEFT WIDTH="100%" BGCOLOR="#DDDDDD">
 <FONT face="Arial,Helvetica" size=+2><B>
 &nbsp;array3.cpp
 </B></FONT>
 </TD></TR></TABLE><BR>
 <BR><BR>
 <TT>
 <SPAN class="Source">
 <Font color="0000FF" >/</FONT><I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*&nbsp;example&nbsp;for&nbsp;using&nbsp;class&nbsp;array&lt;&gt;</FONT></I><BR>
 &nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*/</FONT></I><BR>
 #include&nbsp;&lt;string&gt;<BR>
 #include&nbsp;&lt;iostream&gt;<BR>
 #include&nbsp;&lt;<A href="./array.hpp.html">boost/array.hpp</A>&gt;<BR>
 <BR>
 template&nbsp;&lt;class&nbsp;T&gt;<BR>
 void&nbsp;print_elements&nbsp;(const&nbsp;T&&nbsp;x);<BR>
 <BR>
 int&nbsp;main()<BR>
 {<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;create&nbsp;array&nbsp;of&nbsp;four&nbsp;seasons</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;boost::array&lt;std::string,4&gt;&nbsp;seasons&nbsp;=&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;"spring",&nbsp;"summer",&nbsp;"autumn",&nbsp;"winter"&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;};<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;copy&nbsp;and&nbsp;change&nbsp;order</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;boost::array&lt;std::string,4&gt;&nbsp;seasons_orig&nbsp;=&nbsp;seasons;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;for&nbsp;(unsigned&nbsp;i=seasons.size()-1;&nbsp;i&gt;0;&nbsp;--i)&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;swap(seasons.at(i),seasons.at((i+1)%seasons.size()));<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"one&nbsp;way:&nbsp;&nbsp;&nbsp;";<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;print_elements(seasons);<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;try&nbsp;swap()</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"other&nbsp;way:&nbsp;";<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;swap(seasons,seasons_orig);<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;print_elements(seasons);<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;try&nbsp;reverse&nbsp;iterators</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"reverse:&nbsp;&nbsp;&nbsp;";<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;for&nbsp;(boost::array&lt;std::string,4&gt;::reverse_iterator&nbsp;pos<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=seasons.rbegin();&nbsp;pos&lt;seasons.rend();&nbsp;++pos)&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"&nbsp;"&nbsp;&lt;&lt;&nbsp;*pos;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;return&nbsp;0;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;makes&nbsp;Visual-C++&nbsp;compiler&nbsp;happy</FONT></I><BR>
 }<BR>
 <BR>
 template&nbsp;&lt;class&nbsp;T&gt;<BR>
 void&nbsp;print_elements&nbsp;(const&nbsp;T&&nbsp;x)<BR>
 {<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;for&nbsp;(unsigned&nbsp;i=0;&nbsp;i&lt;x.size();&nbsp;++i)&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"&nbsp;"&nbsp;&lt;&lt;&nbsp;x[i];<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 }<BR>
 <BR>
 </SPAN>
 </TT>
 </BODY>
 </HTML>
--- a/array4.cpp.html
+++ b/array4.cpp.html
@ -1,59 +0,0 @@
 <HTML>
 <HEAD>
 <TITLE>array4.cpp</TITLE>
 </HEAD>
 <BODY TEXT="#000000" BGCOLOR="#FFFFFF">
 &nbsp;
 <TABLE HEIGHT=40 WIDTH="100%">
 <TR> <TD ALIGN=LEFT WIDTH="100%" BGCOLOR="#DDDDDD">
 <FONT face="Arial,Helvetica" size=+2><B>
 &nbsp;array4.cpp
 </B></FONT>
 </TD></TR></TABLE><BR>
 <BR><BR>
 <TT>
 <SPAN class="Source">
 <Font color="0000FF" >/</FONT><I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*&nbsp;example&nbsp;for&nbsp;using&nbsp;class&nbsp;array&lt;&gt;</FONT></I><BR>
 &nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*/</FONT></I><BR>
 #include&nbsp;&lt;algorithm&gt;<BR>
 #include&nbsp;&lt;functional&gt;<BR>
 #include&nbsp;&lt;string&gt;<BR>
 #include&nbsp;&lt;iostream&gt;<BR>
 #include&nbsp;&lt;<A href="./array.hpp.html">boost/array.hpp</A>&gt;<BR>
 <BR>
 int&nbsp;main()<BR>
 {<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;array&nbsp;of&nbsp;arrays&nbsp;of&nbsp;seasons</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;boost::array&lt;boost::array&lt;std::string,4&gt;,2&gt;&nbsp;seasons_i18n&nbsp;=&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;{&nbsp;{&nbsp;"spring",&nbsp;"summer",&nbsp;"autumn",&nbsp;"winter",&nbsp;}&nbsp;},<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;{&nbsp;"Fruehling",&nbsp;"Sommer",&nbsp;"Herbst",&nbsp;"Winter"&nbsp;}&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;};<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;for&nbsp;any&nbsp;array&nbsp;of&nbsp;seasons&nbsp;print&nbsp;seasons</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;for&nbsp;(unsigned&nbsp;i=0;&nbsp;i&lt;seasons_i18n.size();&nbsp;++i)&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;boost::array&lt;std::string,4&gt;&nbsp;seasons&nbsp;=&nbsp;seasons_i18n[i];<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for&nbsp;(unsigned&nbsp;j=0;&nbsp;j&lt;seasons.size();&nbsp;++j)&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;seasons[j]&nbsp;&lt;&lt;&nbsp;"&nbsp;";<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;print&nbsp;first&nbsp;element&nbsp;of&nbsp;first&nbsp;array</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"first&nbsp;element&nbsp;of&nbsp;first&nbsp;array:&nbsp;"<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&lt;&lt;&nbsp;seasons_i18n[0][0]&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;print&nbsp;last&nbsp;element&nbsp;of&nbsp;last&nbsp;array</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"last&nbsp;element&nbsp;of&nbsp;last&nbsp;array:&nbsp;"<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&lt;&lt;&nbsp;seasons_i18n[seasons_i18n.size()-1][seasons_i18n[0].size()-1]<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;return&nbsp;0;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;makes&nbsp;Visual-C++&nbsp;compiler&nbsp;happy</FONT></I><BR>
 }<BR>
 <BR>
 </SPAN>
 </TT>
 </BODY>
 </HTML>
--- a/array5.cpp.html
+++ b/array5.cpp.html
@ -1,87 +0,0 @@
 <HTML>
 <HEAD>
 <TITLE>array5.cpp</TITLE>
 </HEAD>
 <BODY TEXT="#000000" BGCOLOR="#FFFFFF">
 &nbsp;
 <TABLE HEIGHT=40 WIDTH="100%">
 <TR> <TD ALIGN=LEFT WIDTH="100%" BGCOLOR="#DDDDDD">
 <FONT face="Arial,Helvetica" size=+2><B>
 &nbsp;array5.cpp
 </B></FONT>
 </TD></TR></TABLE><BR>
 <BR><BR>
 <TT>
 <SPAN class="Source">
 <Font color="0000FF" >/</FONT><I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*&nbsp;simple&nbsp;example&nbsp;for&nbsp;using&nbsp;class&nbsp;array&lt;&gt;</FONT></I><BR>
 &nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*/</FONT></I><BR>
 #include&nbsp;&lt;iostream&gt;<BR>
 #include&nbsp;&lt;<A href="./array.hpp.html">boost/array.hpp</A>&gt;<BR>
 <BR>
 template&nbsp;&lt;typename&nbsp;T&gt;<BR>
 void&nbsp;test_static_size&nbsp;(const&nbsp;T&&nbsp;cont)<BR>
 {<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;tmp[T::static_size];<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;for&nbsp;(unsigned&nbsp;i=0;&nbsp;i&lt;T::static_size;&nbsp;++i)&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;tmp[i]&nbsp;=&nbsp;int(cont[i]);<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;for&nbsp;(unsigned&nbsp;i=0;&nbsp;i&lt;T::static_size;&nbsp;++i)&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;tmp[i]&nbsp;&lt;&lt;&nbsp;'&nbsp;';<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 }<BR>
 <BR>
 int&nbsp;main()<BR>
 {<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;define&nbsp;special&nbsp;type&nbsp;name</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;typedef&nbsp;boost::array&lt;float,6&gt;&nbsp;Array;<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;create&nbsp;and&nbsp;initialize&nbsp;an&nbsp;array</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;const&nbsp;Array&nbsp;a&nbsp;=&nbsp;{&nbsp;{&nbsp;42.42&nbsp;}&nbsp;};<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;use&nbsp;some&nbsp;common&nbsp;STL&nbsp;container&nbsp;operations</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"static_size:&nbsp;"&nbsp;&lt;&lt;&nbsp;a.size()&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"size:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;"&nbsp;&lt;&lt;&nbsp;a.size()&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"empty:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;"&nbsp;&lt;&lt;&nbsp;std::boolalpha&nbsp;&lt;&lt;&nbsp;a.empty()&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"max_size:&nbsp;&nbsp;&nbsp;&nbsp;"&nbsp;&lt;&lt;&nbsp;a.max_size()&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"front:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;"&nbsp;&lt;&lt;&nbsp;a.front()&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"back:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;"&nbsp;&lt;&lt;&nbsp;a.back()&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"[0]:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;"&nbsp;&lt;&lt;&nbsp;a[0]&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"elems:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;";<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;iterate&nbsp;through&nbsp;all&nbsp;elements</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;for&nbsp;(Array::const_iterator&nbsp;pos=a.begin();&nbsp;pos&lt;a.end();&nbsp;++pos)&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;*pos&nbsp;&lt;&lt;&nbsp;'&nbsp;';<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;test_static_size(a);<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;check&nbsp;copy&nbsp;constructor&nbsp;and&nbsp;assignment&nbsp;operator</FONT></I><BR>
 &nbsp;&nbsp;&nbsp;&nbsp;Array&nbsp;b(a);<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;Array&nbsp;c;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;c&nbsp;=&nbsp;a;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;if&nbsp;(a==b&nbsp;&&&nbsp;a==c)&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"copy&nbsp;construction&nbsp;and&nbsp;copy&nbsp;assignment&nbsp;are&nbsp;OK"<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;else&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;"copy&nbsp;construction&nbsp;and&nbsp;copy&nbsp;assignment&nbsp;are&nbsp;BROKEN"<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;typedef&nbsp;boost::array&lt;double,6&gt;&nbsp;DArray;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;typedef&nbsp;boost::array&lt;int,6&gt;&nbsp;IArray;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;IArray&nbsp;ia&nbsp;=&nbsp;{&nbsp;1,&nbsp;2,&nbsp;3,&nbsp;4,&nbsp;5,&nbsp;6&nbsp;};<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;DArray&nbsp;da;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;da&nbsp;=&nbsp;ia;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;da.assign(42);<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;return&nbsp;0;&nbsp;&nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >//&nbsp;makes&nbsp;Visual-C++&nbsp;compiler&nbsp;happy</FONT></I><BR>
 }<BR>
 <BR>
 </SPAN>
 </TT>
 </BODY>
 </HTML>
--- a/doc/Jamfile.v2
+++ b/doc/Jamfile.v2
@ -0,0 +1,19 @@
 #~ Copyright Marshall Clow 2013
 #~ 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)
 using boostbook ;
 boostbook standalone
 	: array.xml 
 	: <xsl:param>boost.root=../../../.. ;
 ###############################################################################
 alias boostdoc
    : array.xml
    :
    :
    : ;
 explicit boostdoc ;
 alias boostrelease ;
 explicit boostrelease ;
--- a/doc/array.xml
+++ b/doc/array.xml
@ -0,0 +1,639 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
  "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
 <library name="Array" dirname="array" id="array" last-revision="$Date$">
  <libraryinfo>
    <author>
      <firstname>Nicolai</firstname>
      <surname>Josuttis</surname>
    </author>
    <maintainer>
      <firstname>Marshall</firstname>
      <surname>Clow</surname>
    </maintainer>
    <copyright>
      <year>2001</year>
      <year>2002</year>
      <year>2003</year>
      <year>2004</year>
      <holder>Nicolai M. Josuttis</holder>
    </copyright>
    <copyright>
      <year>2012</year>
      <holder>Marshall Clow</holder>
    </copyright>
    <legalnotice>
      <para>Distributed under the Boost Software License, Version 1.0.
      (See accompanying file <filename>LICENSE_1_0.txt</filename> or copy at 
      <ulink
      url="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</ulink>)
      </para>
    </legalnotice>
    <librarypurpose>STL compliant container wrapper for arrays of constant size</librarypurpose>
    <librarycategory name="category:containers"/>
  </libraryinfo>
  <title>Boost.Array</title>
  <section id="array.intro">
    <title>Introduction</title> 
    <using-namespace name="boost"/>
    <using-class name="array"/>
    <para>The C++ Standard Template Library STL as part of the C++
    Standard Library provides a framework for processing algorithms on
    different kind of containers. However, ordinary arrays don't
    provide the interface of STL containers (although, they provide
    the iterator interface of STL containers).</para>
    <para>As replacement for ordinary arrays, the STL provides class
    <code><classname>std::vector</classname></code>.  However,
    <code><classname>std::vector&lt;&gt;</classname></code> provides
    the semantics of dynamic arrays. Thus, it manages data to be able
    to change the number of elements. This results in some overhead in
    case only arrays with static size are needed.</para>
    <para>In his book, <emphasis>Generic Programming and the
    STL</emphasis>, Matthew H. Austern introduces a useful wrapper
    class for ordinary arrays with static size, called
    <code>block</code>.  It is safer and has no worse performance than
    ordinary arrays. In <emphasis>The C++ Programming
    Language</emphasis>, 3rd edition, Bjarne Stroustrup introduces a
    similar class, called <code>c_array</code>, which I (<ulink
    url="http://www.josuttis.com">Nicolai Josuttis</ulink>) present
    slightly modified in my book <emphasis>The C++ Standard Library -
    A Tutorial and Reference</emphasis>, called
    <code>carray</code>. This is the essence of these approaches
    spiced with many feedback from <ulink
    url="http://www.boost.org">boost</ulink>.</para>
    <para>After considering different names, we decided to name this
    class simply <code><classname>array</classname></code>.</para>
    <para>Note that this class is suggested to be part of the next
    Technical Report, which will extend the C++ Standard (see
    <ulink url="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2003/n1548.htm">http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2003/n1548.htm</ulink>).</para>
    <para>Update: <code>std::array</code> is (as of C++11) part of the C++ standard.
    The differences between <code>boost::array</code> and <code>std::array</code> are minimal.
    If you are using C++11, you should consider using <code>std::array</code> instead of <code>boost::array</code>.
    </para>
    <para>Class <code><classname>array</classname></code> fulfills most
    but not all of the requirements of "reversible containers" (see
    Section 23.1, [lib.container.requirements] of the C++
    Standard). The reasons array is not an reversible STL container is
    because:
      <itemizedlist spacing="compact">
        <listitem><simpara>No constructors are provided.</simpara></listitem>
        <listitem><simpara>Elements may have an undetermined initial value (see <xref linkend="array.rationale"/>).</simpara></listitem>
        <listitem><simpara><functionname>swap</functionname>() has no constant complexity.</simpara></listitem>
        <listitem><simpara><methodname>size</methodname>() is always constant, based on the second template argument of the type.</simpara></listitem>
        <listitem><simpara>The container provides no allocator support.</simpara></listitem>
      </itemizedlist>
    </para>
    <para>It doesn't fulfill the requirements of a "sequence" (see Section 23.1.1, [lib.sequence.reqmts] of the C++ Standard), except that:
      <itemizedlist spacing="compact">
        <listitem><simpara><methodname>front</methodname>() and <methodname>back</methodname>() are provided.</simpara></listitem>
        <listitem><simpara><methodname>operator[]</methodname> and <methodname>at</methodname>() are provided.</simpara></listitem>
      </itemizedlist>
    </para>
  </section>
  <library-reference>
    <header name="boost/array.hpp">
      <namespace name="boost">
        <class name="array">
          <template>
            <template-type-parameter name="T"/>
            <template-nontype-parameter name="N">
              <type>std::size_t</type>
            </template-nontype-parameter>
          </template>
          <purpose><para>STL compliant container wrapper for arrays of constant size</para></purpose>
          <typedef name="value_type">
            <type>T</type>
          </typedef>
          <typedef name="iterator">
             <type>T*</type>
          </typedef>
          <typedef name="const_iterator">
             <type>const T*</type>
          </typedef>
          <typedef name="reverse_iterator">
             <type><classname>std::reverse_iterator</classname>&lt;iterator&gt;</type>
          </typedef>
          <typedef name="const_reverse_iterator">
             <type><classname>std::reverse_iterator</classname>&lt;const_iterator&gt;</type>
          </typedef>
          <typedef name="reference">
             <type>T&amp;</type>
          </typedef>
          <typedef name="const_reference">
             <type>const T&amp;</type>
          </typedef>
          <typedef name="size_type">
             <type>std::size_t</type>
          </typedef>
          <typedef name="difference_type">
             <type>std::ptrdiff_t</type>
          </typedef>
          <static-constant name="static_size">
            <type>size_type</type>
            <default>N</default>
          </static-constant>
          <copy-assignment>
            <template>
              <template-type-parameter name="U"/>
            </template>
            <parameter name="other">
              <paramtype>const <classname>array</classname>&lt;U, N&gt;&amp;</paramtype>
            </parameter>
            <effects><simpara><code>std::copy(rhs.<methodname>begin</methodname>(),rhs.<methodname>end</methodname>(), <methodname>begin</methodname>())</code></simpara></effects>
          </copy-assignment>
          <method-group name="iterator support">
            <overloaded-method name="begin">
              <signature>
                <type>iterator</type>
              </signature>
              <signature cv="const">
                <type>const_iterator</type>
              </signature>
              <returns><simpara>iterator for the first element</simpara></returns>
              <throws><simpara>will not throw</simpara></throws>
            </overloaded-method>
            <overloaded-method name="end">
              <signature>
                <type>iterator</type>
              </signature>
              <signature cv="const">
                <type>const_iterator</type>
              </signature>
              <returns><simpara>iterator for position after the last element</simpara></returns>
              <throws><simpara>will not throw</simpara></throws>
            </overloaded-method>
            <overloaded-method name="cbegin" cv="const">
              <signature>
                <type>const_iterator</type>
              </signature>
              <returns><simpara>constant iterator for the first element</simpara></returns>
              <throws><simpara>will not throw</simpara></throws>
            </overloaded-method>
            <overloaded-method name="cend" cv="const">
              <signature>
                <type>const_iterator</type>
              </signature>
              <returns><simpara>constant iterator for position after the last element</simpara></returns>
              <throws><simpara>will not throw</simpara></throws>
            </overloaded-method>
          </method-group>
          <method-group name="reverse iterator support">
            <overloaded-method name="rbegin">
              <signature>
                <type>reverse_iterator</type>
              </signature>
              <signature cv="const">
                <type>const_reverse_iterator</type>
              </signature>
              <returns><simpara>reverse iterator for the first element of reverse iteration</simpara></returns>
            </overloaded-method>
            <overloaded-method name="rend">
              <signature>
                <type>reverse_iterator</type>
              </signature>
              <signature cv="const">
                <type>const_reverse_iterator</type>
              </signature>
              <returns><simpara>reverse iterator for position after the last element in reverse iteration</simpara></returns>
            </overloaded-method>
            <overloaded-method name="crbegin" cv="const">
              <signature>
                <type>const_reverse_iterator</type>
              </signature>
              <returns><simpara>constant reverse iterator for the first element of reverse iteration</simpara></returns>
              <throws><simpara>will not throw</simpara></throws>
            </overloaded-method>
            <overloaded-method name="crend" cv="const">
              <signature>
                <type>const_reverse_iterator</type>
              </signature>
              <returns><simpara>constant reverse iterator for position after the last element in reverse iteration</simpara></returns>
              <throws><simpara>will not throw</simpara></throws>
            </overloaded-method>
          </method-group>
          <method-group name="capacity">
            <method name="size">
              <type>size_type</type>
              <returns><simpara><code>N</code></simpara></returns>
            </method>
            <method name="empty">
              <type>bool</type>
              <returns><simpara><code>N==0</code></simpara></returns>
              <throws><simpara>will not throw</simpara></throws>
            </method>
            <method name="max_size">
              <type>size_type</type>
              <returns><simpara><code>N</code></simpara></returns>
              <throws><simpara>will not throw</simpara></throws>
            </method>
          </method-group>
          <method-group name="element access">
            <overloaded-method name="operator[]">
              <signature>
                <type>reference</type>
                <parameter name="i">
                  <paramtype>size_type</paramtype>
                </parameter>
              </signature>
              <signature cv="const">
                <type>const_reference</type>
                <parameter name="i">
                  <paramtype>size_type</paramtype>
                </parameter>
              </signature>
              <requires><simpara><code>i &lt; N</code></simpara></requires>
              <returns><simpara>element with index <code>i</code></simpara></returns>
              <throws><simpara>will not throw.</simpara></throws>
            </overloaded-method>
            <overloaded-method name="at">
              <signature>
                <type>reference</type>
                <parameter name="i">
                  <paramtype>size_type</paramtype>
                </parameter>
              </signature>
              <signature cv="const">
                <type>const_reference</type>
                <parameter name="i">
                  <paramtype>size_type</paramtype>
                </parameter>
              </signature>
              <returns><simpara>element with index <code>i</code></simpara></returns>
              <throws><simpara><code><classname>std::range_error</classname></code> if <code>i &gt;= N</code></simpara></throws>
            </overloaded-method>
            <overloaded-method name="front">
              <signature>
                <type>reference</type>
              </signature>
              <signature cv="const">
                <type>const_reference</type>
              </signature>
              <requires><simpara><code>N &gt; 0</code></simpara></requires>
              <returns><simpara>the first element</simpara></returns>
              <throws><simpara>will not throw</simpara></throws>
            </overloaded-method>
            <overloaded-method name="back">
              <signature>
                <type>reference</type>
              </signature>
              <signature cv="const">
                <type>const_reference</type>
              </signature>
              <requires><simpara><code>N &gt; 0</code></simpara></requires>
              <returns><simpara>the last element</simpara></returns>
              <throws><simpara>will not throw</simpara></throws>
            </overloaded-method>
            <method name="data" cv="const">
              <type>const T*</type>
              <returns><simpara><code>elems</code></simpara></returns>
              <throws><simpara>will not throw</simpara></throws>
            </method>
           <method name="c_array">
              <type>T*</type>
              <returns><simpara><code>elems</code></simpara></returns>
              <throws><simpara>will not throw</simpara></throws>
            </method>
          </method-group>
          <method-group name="modifiers">
            <method name="swap">
              <type>void</type>
              <parameter name="other">
                <paramtype><classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
              </parameter>
              <effects><simpara><code>std::swap_ranges(<methodname>begin</methodname>(), <methodname>end</methodname>(), other.<methodname>begin</methodname>())</code></simpara></effects>
              <complexity><simpara>linear in <code>N</code></simpara></complexity>
            </method>
            <method name="assign">
              <type>void</type>
              <parameter name="value">
                <paramtype>const T&amp;</paramtype>
              </parameter>
              <effects><simpara><code>std::fill_n(<methodname>begin</methodname>(), N, value)</code></simpara></effects>
            </method>
          </method-group>
          <data-member name="elems[N]"> <!-- HACK -->
            <type>T</type>
          </data-member>
          <free-function-group name="specialized algorithms">
            <function name="swap"> 
              <template>
                <template-type-parameter name="T"/>
                <template-nontype-parameter name="N">
                  <type>std::size_t</type>
                </template-nontype-parameter>
              </template>
              <type>void</type>
              <parameter name="x">
                <paramtype><classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
              </parameter>
              <parameter name="y">
                <paramtype><classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
              </parameter>
              <effects><simpara><code>x.<methodname>swap</methodname>(y)</code></simpara></effects>
              <throws><simpara>will not throw.</simpara></throws>
            </function>
          </free-function-group>
          <free-function-group name="comparisons">
            <function name="operator==">
              <template>
                <template-type-parameter name="T"/>
                <template-nontype-parameter name="N">
                  <type>std::size_t</type>
                </template-nontype-parameter>
              </template>
              <type>bool</type>
              <parameter name="x">
                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
              </parameter>
              <parameter name="y">
                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
              </parameter>
              <returns><simpara><code>std::equal(x.<methodname>begin</methodname>(), x.<methodname>end</methodname>(), y.<methodname>begin</methodname>())</code></simpara>
              </returns>
            </function>
            <function name="operator!=">
              <template>
                <template-type-parameter name="T"/>
                <template-nontype-parameter name="N">
                  <type>std::size_t</type>
                </template-nontype-parameter>
              </template>
              <type>bool</type>
              <parameter name="x">
                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
              </parameter>
              <parameter name="y">
                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
              </parameter>
              <returns><simpara><code>!(x == y)</code></simpara>
              </returns>
            </function>
            <function name="operator&lt;">
              <template>
                <template-type-parameter name="T"/>
                <template-nontype-parameter name="N">
                  <type>std::size_t</type>
                </template-nontype-parameter>
              </template>
              <type>bool</type>
              <parameter name="x">
                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
              </parameter>
              <parameter name="y">
                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
              </parameter>
              <returns><simpara><code>std::lexicographical_compare(x.<methodname>begin</methodname>(), x.<methodname>end</methodname>(), y.<methodname>begin</methodname>(), y.<methodname>end</methodname>())</code></simpara>
              </returns>
            </function>
            <function name="operator&gt;">
              <template>
                <template-type-parameter name="T"/>
                <template-nontype-parameter name="N">
                  <type>std::size_t</type>
                </template-nontype-parameter>
              </template>
              <type>bool</type>
              <parameter name="x">
                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
              </parameter>
              <parameter name="y">
                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
              </parameter>
              <returns><simpara><code>y &lt; x</code></simpara></returns>
            </function>
            <function name="operator&lt;=">
              <template>
                <template-type-parameter name="T"/>
                <template-nontype-parameter name="N">
                  <type>std::size_t</type>
                </template-nontype-parameter>
              </template>
              <type>bool</type>
              <parameter name="x">
                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
              </parameter>
              <parameter name="y">
                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
              </parameter>
              <returns><simpara><code>!(y &lt; x)</code></simpara></returns>
            </function>
            <function name="operator&gt;=">
              <template>
                <template-type-parameter name="T"/>
                <template-nontype-parameter name="N">
                  <type>std::size_t</type>
                </template-nontype-parameter>
              </template>
              <type>bool</type>
              <parameter name="x">
                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
              </parameter>
              <parameter name="y">
                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
              </parameter>
              <returns><simpara><code>!(x &lt; y)</code></simpara></returns>
            </function>
          </free-function-group>
          <free-function-group name="specializations">
            <function name="boost::get">
              <template>
                <template-type-parameter name="T"/>
                <template-nontype-parameter name="N">
                  <type>std::size_t</type>
                </template-nontype-parameter>
                <template-nontype-parameter name="Idx">
                  <type>std::size_t</type>
                </template-nontype-parameter>
              </template>
              <type>T</type>
              <parameter name="arr">
                <paramtype><classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
              </parameter>
              <returns><simpara>element of array with index <code>Idx</code></simpara></returns>
              <effects><simpara>Will <code>static_assert</code> if <code>Idx >= N</code></simpara></effects>
            </function>
            <function name="boost::get">
              <template>
                <template-type-parameter name="T"/>
                <template-nontype-parameter name="N">
                  <type>std::size_t</type>
                </template-nontype-parameter>
                <template-nontype-parameter name="Idx">
                  <type>std::size_t</type>
                </template-nontype-parameter>
              </template>
              <type>T</type>
              <parameter name="arr">
                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
              </parameter>
              <returns><simpara>const element of array with index <code>Idx</code></simpara></returns>
              <effects><simpara>Will <code>static_assert</code> if <code>Idx >= N</code></simpara></effects>
            </function>
          </free-function-group>
        </class>
      </namespace>
    </header>
  </library-reference>
 <section id="array.rationale">
  <title>Design Rationale</title>
  <para>There was an important design tradeoff regarding the
  constructors: We could implement array as an "aggregate" (see
  Section 8.5.1, [dcl.init.aggr], of the C++ Standard). This would
  mean:
    <itemizedlist>
      <listitem><simpara>An array can be initialized with a
      brace-enclosing, comma-separated list of initializers for the
      elements of the container, written in increasing subscript
      order:</simpara>
      <programlisting><classname>boost::array</classname>&lt;int,4&gt; a = { { 1, 2, 3 } };</programlisting>
      <simpara>Note that if there are fewer elements in the
      initializer list, then each remaining element gets
      default-initialized (thus, it has a defined value).</simpara>
  </listitem></itemizedlist></para>
  <para>However, this approach has its drawbacks: <emphasis
  role="bold"> passing no initializer list means that the elements
  have an indetermined initial value</emphasis>, because the rule says
  that aggregates may have:
    <itemizedlist>
      <listitem><simpara>No user-declared constructors.</simpara></listitem>
      <listitem><simpara>No private or protected non-static data members.</simpara></listitem>
      <listitem><simpara>No base classes.</simpara></listitem>
      <listitem><simpara>No virtual functions.</simpara></listitem>
    </itemizedlist>
  </para>
  <para>Nevertheless, The current implementation uses this approach.</para>
  <para>Note that for standard conforming compilers it is possible to
  use fewer braces (according to 8.5.1 (11) of the Standard). That is,
  you can initialize an array as follows:</para>
 <programlisting>
 <classname>boost::array</classname>&lt;int,4&gt; a = { 1, 2, 3 };
 </programlisting>
  <para>I'd appreciate any constructive feedback. <emphasis
  role="bold">Please note: I don't have time to read all boost
  mails. Thus, to make sure that feedback arrives to me, please send
  me a copy of each mail regarding this class.</emphasis></para>
  <para>The code is provided "as is" without expressed or implied
  warranty.</para>
 </section>
 <section id="array.more.info">
  <title>For more information...</title>
  <para>To find more details about using ordinary arrays in C++ and
  the framework of the STL, see e.g.
    <literallayout>The C++ Standard Library - A Tutorial and Reference
 by Nicolai M. Josuttis
 Addison Wesley Longman, 1999
 ISBN 0-201-37926-0</literallayout>
   </para>
  <para><ulink url="http://www.josuttis.com/">Home Page of Nicolai
  Josuttis</ulink></para>
 </section>
 <section id="array.ack">
  <title>Acknowledgements</title>
  <para>Doug Gregor ported the documentation to the BoostBook format.</para>
 </section>
 <!-- Notes:
   empty() should return N != 0
   size(), empty(), max_size() should be const
   -->
 </library>
--- a/include/boost/array.hpp
+++ b/include/boost/array.hpp
@ -2,30 +2,59 @@
 * an STL container (as wrapper) for arrays of constant size.
 *
 * See
- *      http://www.josuttis.com/cppcode
+ *      http://www.boost.org/libs/array/
- * for details and the latest version.
+ * for documentation.
 *
 * The original author site is at: http://www.josuttis.com/
 *
 * (C) Copyright Nicolai M. Josuttis 2001.
 * Permission to copy, use, modify, sell and distribute this software
 * is granted provided this copyright notice appears in all copies.
 * This software is provided "as is" without express or implied
 * warranty, and with no claim as to its suitability for any purpose.
 *
 * 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)
 *
 *  9 Jan 2013 - (mtc) Added constexpr
 * 14 Apr 2012 - (mtc) Added support for boost::hash
 * 28 Dec 2010 - (mtc) Added cbegin and cend (and crbegin and crend) for C++Ox compatibility.
 * 10 Mar 2010 - (mtc) fill method added, matching resolution of the standard library working group.
 *      See <http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#776> or Trac issue #3168
 *      Eventually, we should remove "assign" which is now a synonym for "fill" (Marshall Clow)
 * 10 Mar 2010 - added workaround for SUNCC and !STLPort [trac #3893] (Marshall Clow)
 * 29 Jan 2004 - c_array() added, BOOST_NO_PRIVATE_IN_AGGREGATE removed (Nico Josuttis)
 * 23 Aug 2002 - fix for Non-MSVC compilers combined with MSVC libraries.
 * 05 Aug 2001 - minor update (Nico Josuttis)
 * 20 Jan 2001 - STLport fix (Beman Dawes)
 * 29 Sep 2000 - Initial Revision (Nico Josuttis)
 *
 * Jan 29, 2004
 */
 #ifndef BOOST_ARRAY_HPP
 #define BOOST_ARRAY_HPP
 #include <boost/detail/workaround.hpp>
 #if BOOST_WORKAROUND(BOOST_MSVC, >= 1400)  
 # pragma warning(push)  
 # pragma warning(disable:4996) // 'std::equal': Function call with parameters that may be unsafe
 # pragma warning(disable:4510) // boost::array<T,N>' : default constructor could not be generated 
 # pragma warning(disable:4610) // warning C4610: class 'boost::array<T,N>' can never be instantiated - user defined constructor required 
 #endif
 #include <cstddef>
 #include <stdexcept>
-#include <iterator>
+#include <boost/assert.hpp>
 #include <boost/static_assert.hpp>
 #include <boost/swap.hpp>
 // Handles broken standard libraries better than <iterator>
 #include <boost/detail/iterator.hpp>
 #include <boost/throw_exception.hpp>
 #include <algorithm>
 // FIXES for broken compilers
 #include <boost/config.hpp>
 namespace boost {
    template<class T, std::size_t N>
@ -42,23 +71,25 @@ namespace boost {
        typedef const T&       const_reference;
        typedef std::size_t    size_type;
        typedef std::ptrdiff_t difference_type;
-    
+
        // iterator support
-        iterator begin() { return elems; }
+        iterator        begin()       { return elems; }
-        const_iterator begin() const { return elems; }
+        const_iterator  begin() const { return elems; }
-        iterator end() { return elems+N; }
+        const_iterator cbegin() const { return elems; }
-        const_iterator end() const { return elems+N; }
+        
        iterator        end()       { return elems+N; }
        const_iterator  end() const { return elems+N; }
        const_iterator cend() const { return elems+N; }
        // reverse iterator support
-#if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) && !defined(BOOST_MSVC_STD_ITERATOR)
+#if !defined(BOOST_MSVC_STD_ITERATOR) && !defined(BOOST_NO_STD_ITERATOR_TRAITS)
        typedef std::reverse_iterator<iterator> reverse_iterator;
        typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
-#elif defined(BOOST_MSVC) && (BOOST_MSVC == 1300)
+#elif defined(_RWSTD_NO_CLASS_PARTIAL_SPEC) 
-        // workaround for broken reverse_iterator in VC7
+        typedef std::reverse_iterator<iterator, std::random_access_iterator_tag, 
-        typedef std::reverse_iterator<std::_Ptrit<value_type, difference_type, iterator,
+              value_type, reference, iterator, difference_type> reverse_iterator; 
-                                      reference, iterator, reference> > reverse_iterator;
+        typedef std::reverse_iterator<const_iterator, std::random_access_iterator_tag,
-        typedef std::reverse_iterator<std::_Ptrit<value_type, difference_type, const_iterator,
+              value_type, const_reference, const_iterator, difference_type> const_reverse_iterator;
 		                                const_reference, iterator, reference> > const_reverse_iterator;
 #else
        // workaround for broken reverse_iterator implementations
        typedef std::reverse_iterator<iterator,T> reverse_iterator;
@ -69,38 +100,72 @@ namespace boost {
        const_reverse_iterator rbegin() const {
            return const_reverse_iterator(end());
        }
        const_reverse_iterator crbegin() const {
            return const_reverse_iterator(end());
        }
        reverse_iterator rend() { return reverse_iterator(begin()); }
        const_reverse_iterator rend() const {
            return const_reverse_iterator(begin());
        }
        const_reverse_iterator crend() const {
            return const_reverse_iterator(begin());
        }
        // operator[]
-        reference operator[](size_type i) { return elems[i]; }
+        reference operator[](size_type i) 
-        const_reference operator[](size_type i) const { return elems[i]; }
+        { 
            return BOOST_ASSERT_MSG( i < N, "out of range" ), elems[i]; 
        }
        /*BOOST_CONSTEXPR*/ const_reference operator[](size_type i) const 
        {     
            return BOOST_ASSERT_MSG( i < N, "out of range" ), elems[i]; 
        }
        // at() with range check
-        reference at(size_type i) { rangecheck(i); return elems[i]; }
+        reference                           at(size_type i)       { return rangecheck(i), elems[i]; }
-        const_reference at(size_type i) const { rangecheck(i); return elems[i]; }
+        /*BOOST_CONSTEXPR*/ const_reference at(size_type i) const { return rangecheck(i), elems[i]; }
        // front() and back()
-        reference front() { return elems[0]; }
+        reference front() 
-        const_reference front() const { return elems[0]; }
+        { 
-        reference back() { return elems[N-1]; }
+            return elems[0]; 
-        const_reference back() const { return elems[N-1]; }
+        }
        BOOST_CONSTEXPR const_reference front() const 
        {
            return elems[0];
        }
        reference back() 
        { 
            return elems[N-1]; 
        }
        BOOST_CONSTEXPR const_reference back() const 
        { 
            return elems[N-1]; 
        }
        // size is constant
-        static size_type size() { return N; }
+        static BOOST_CONSTEXPR size_type size() { return N; }
-        static bool empty() { return false; }
+        static BOOST_CONSTEXPR bool empty() { return false; }
-        static size_type max_size() { return N; }
+        static BOOST_CONSTEXPR size_type max_size() { return N; }
        enum { static_size = N };
        // swap (note: linear complexity)
        void swap (array<T,N>& y) {
-            std::swap_ranges(begin(),end(),y.begin());
+            for (size_type i = 0; i < N; ++i)
                boost::swap(elems[i],y.elems[i]);
        }
-        // direct access to data
+        // direct access to data (read-only)
        const T* data() const { return elems; }
        T* data() { return elems; }
        // use array as C array (direct read/write access to data)
        T* c_array() { return elems; }
        // assignment with type conversion
        template <typename T2>
@ -110,21 +175,150 @@ namespace boost {
        }
        // assign one value to all elements
-        void assign (const T& value)
+        void assign (const T& value) { fill ( value ); }    // A synonym for fill
        void fill   (const T& value)
        {
            std::fill_n(begin(),size(),value);
        }
 #ifndef BOOST_NO_PRIVATE_IN_AGGREGATE
      private:
 #endif
        // check range (may be private because it is static)
-        static void rangecheck (size_type i) {
+        static BOOST_CONSTEXPR bool rangecheck (size_type i) {
-            if (i >= size()) { throw std::range_error("array"); }
+            return i > size() ? boost::throw_exception(std::out_of_range ("array<>: index out of range")), true : true;
        }
    };
    template< class T >
    class array< T, 0 > {
      public:
        // type definitions
        typedef T              value_type;
        typedef T*             iterator;
        typedef const T*       const_iterator;
        typedef T&             reference;
        typedef const T&       const_reference;
        typedef std::size_t    size_type;
        typedef std::ptrdiff_t difference_type;
        // iterator support
        iterator        begin()       { return       iterator( reinterpret_cast<       T * >( this ) ); }
        const_iterator  begin() const { return const_iterator( reinterpret_cast< const T * >( this ) ); }
        const_iterator cbegin() const { return const_iterator( reinterpret_cast< const T * >( this ) ); }
        iterator        end()       { return  begin(); }
        const_iterator  end() const { return  begin(); }
        const_iterator cend() const { return cbegin(); }
        // reverse iterator support
 #if !defined(BOOST_MSVC_STD_ITERATOR) && !defined(BOOST_NO_STD_ITERATOR_TRAITS)
        typedef std::reverse_iterator<iterator> reverse_iterator;
        typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
 #elif defined(_RWSTD_NO_CLASS_PARTIAL_SPEC) 
        typedef std::reverse_iterator<iterator, std::random_access_iterator_tag, 
              value_type, reference, iterator, difference_type> reverse_iterator; 
        typedef std::reverse_iterator<const_iterator, std::random_access_iterator_tag,
              value_type, const_reference, const_iterator, difference_type> const_reverse_iterator;
 #else
        // workaround for broken reverse_iterator implementations
        typedef std::reverse_iterator<iterator,T> reverse_iterator;
        typedef std::reverse_iterator<const_iterator,T> const_reverse_iterator;
 #endif
        reverse_iterator rbegin() { return reverse_iterator(end()); }
        const_reverse_iterator rbegin() const {
            return const_reverse_iterator(end());
        }
        const_reverse_iterator crbegin() const {
            return const_reverse_iterator(end());
        }
        reverse_iterator rend() { return reverse_iterator(begin()); }
        const_reverse_iterator rend() const {
            return const_reverse_iterator(begin());
        }
        const_reverse_iterator crend() const {
            return const_reverse_iterator(begin());
        }
        // operator[]
        reference operator[](size_type /*i*/)
        {
            return failed_rangecheck();
        }
        /*BOOST_CONSTEXPR*/ const_reference operator[](size_type /*i*/) const
        {
            return failed_rangecheck();
        }
        // at() with range check
        reference at(size_type /*i*/)               {   return failed_rangecheck(); }
        /*BOOST_CONSTEXPR*/ const_reference at(size_type /*i*/) const   { return failed_rangecheck(); }
        // front() and back()
        reference front()
        {
            return failed_rangecheck();
        }
        BOOST_CONSTEXPR const_reference front() const
        {
            return failed_rangecheck();
        }
        reference back()
        {
            return failed_rangecheck();
        }
        BOOST_CONSTEXPR const_reference back() const
        {
            return failed_rangecheck();
        }
        // size is constant
        static BOOST_CONSTEXPR size_type size() { return 0; }
        static BOOST_CONSTEXPR bool empty() { return true; }
        static BOOST_CONSTEXPR size_type max_size() { return 0; }
        enum { static_size = 0 };
        void swap (array<T,0>& /*y*/) {
        }
        // direct access to data (read-only)
        const T* data() const { return 0; }
        T* data() { return 0; }
        // use array as C array (direct read/write access to data)
        T* c_array() { return 0; }
        // assignment with type conversion
        template <typename T2>
        array<T,0>& operator= (const array<T2,0>& ) {
            return *this;
        }
        // assign one value to all elements
        void assign (const T& value) { fill ( value ); }
        void fill   (const T& ) {}
        // check range (may be private because it is static)
        static reference failed_rangecheck () {
                std::out_of_range e("attempt to access element of an empty array");
                boost::throw_exception(e);
 #if defined(BOOST_NO_EXCEPTIONS) || (!defined(BOOST_MSVC) && !defined(__PATHSCALE__))
                //
                // We need to return something here to keep
                // some compilers happy: however we will never
                // actually get here....
                //
                static T placeholder;
                return placeholder;
 #endif
            }
    };
    // comparisons
    template<class T, std::size_t N>
    bool operator== (const array<T,N>& x, const array<T,N>& y) {
@ -157,7 +351,107 @@ namespace boost {
        x.swap(y);
    }
 #if defined(__SUNPRO_CC)
 //  Trac ticket #4757; the Sun Solaris compiler can't handle
 //  syntax like 'T(&get_c_array(boost::array<T,N>& arg))[N]'
 //  
 //  We can't just use this for all compilers, because the 
 //      borland compilers can't handle this form. 
    namespace detail {
       template <typename T, std::size_t N> struct c_array
       {
           typedef T type[N];
       };
    }
   // Specific for boost::array: simply returns its elems data member.
   template <typename T, std::size_t N>
   typename detail::c_array<T,N>::type& get_c_array(boost::array<T,N>& arg)
   {
       return arg.elems;
   }
   // Specific for boost::array: simply returns its elems data member.
   template <typename T, std::size_t N>
   typename detail::c_array<T,N>::type const& get_c_array(const boost::array<T,N>& arg)
   {
       return arg.elems;
   }
 #else
 // Specific for boost::array: simply returns its elems data member.
    template <typename T, std::size_t N>
    T(&get_c_array(boost::array<T,N>& arg))[N]
    {
        return arg.elems;
    }
    // Const version.
    template <typename T, std::size_t N>
    const T(&get_c_array(const boost::array<T,N>& arg))[N]
    {
        return arg.elems;
    }
 #endif
 #if 0
    // Overload for std::array, assuming that std::array will have
    // explicit conversion functions as discussed at the WG21 meeting
    // in Summit, March 2009.
    template <typename T, std::size_t N>
    T(&get_c_array(std::array<T,N>& arg))[N]
    {
        return static_cast<T(&)[N]>(arg);
    }
    // Const version.
    template <typename T, std::size_t N>
    const T(&get_c_array(const std::array<T,N>& arg))[N]
    {
        return static_cast<T(&)[N]>(arg);
    }
 #endif
    template <class It> std::size_t hash_range(It, It);
    template<class T, std::size_t N>
    std::size_t hash_value(const array<T,N>& arr)
    {
        return boost::hash_range(arr.begin(), arr.end());
    }
   template <size_t Idx, typename T, size_t N>
   T &get(boost::array<T,N> &arr) BOOST_NOEXCEPT {
       BOOST_STATIC_ASSERT_MSG ( Idx < N, "boost::get<>(boost::array &) index out of range" );
       return arr[Idx];
       }
   template <size_t Idx, typename T, size_t N>
   const T &get(const boost::array<T,N> &arr) BOOST_NOEXCEPT {
       BOOST_STATIC_ASSERT_MSG ( Idx < N, "boost::get<>(const boost::array &) index out of range" );
       return arr[Idx];
       }
 } /* namespace boost */
-#endif /*BOOST_ARRAY_HPP*/
+#ifndef BOOST_NO_CXX11_HDR_ARRAY
 //  If we don't have std::array, I'm assuming that we don't have std::get
 namespace std {
   template <size_t Idx, typename T, size_t N>
   T &get(boost::array<T,N> &arr) BOOST_NOEXCEPT {
       BOOST_STATIC_ASSERT_MSG ( Idx < N, "std::get<>(boost::array &) index out of range" );
       return arr[Idx];
       }
   template <size_t Idx, typename T, size_t N>
   const T &get(const boost::array<T,N> &arr) BOOST_NOEXCEPT {
       BOOST_STATIC_ASSERT_MSG ( Idx < N, "std::get<>(const boost::array &) index out of range" );
       return arr[Idx];
       }
 }
 #endif
 #if BOOST_WORKAROUND(BOOST_MSVC, >= 1400)  
 # pragma warning(pop)  
 #endif 
 #endif /*BOOST_ARRAY_HPP*/
--- a/index.htm
+++ b/index.htm
@ -1,35 +0,0 @@
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
 <meta name="GENERATOR" content="Microsoft FrontPage 4.0">
 <meta name="ProgId" content="FrontPage.Editor.Document">
 <title>Array Wrapper Libary</title>
 </head>
 <body bgcolor="#FFFFFF" text="#000000">
 <table border="1" bgcolor="#007F7F" cellpadding="2">
  <tr>
    <td bgcolor="#FFFFFF"><img src="../../c++boost.gif" alt="c++boost.gif (8819 bytes)" width="277" height="86"></td>
    <td><a href="../../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
    <td><a href="../libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
    <td><a href="../../people/people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
    <td><a href="../../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
    <td><a href="../../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
  </tr>
 </table>
 <h1>Array wrapper library</h1>
 <p>The header array.hpp provides an STL compliant container wrapper for arrays
 of constant size.
 <ul>
  <li><a href="array.html">Documentation</a> (HTML).</li>
  <li>Header <a href="../../boost/array.hpp">array.hpp</a></li>
  <li>See docs for links to example programs.</li>
  <li>Submitted by <a href="http://www.josuttis.com">Nicolai M. Josuttis</a>.</li>
 </ul>
 <p>Revised <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %b %Y" startspan -->14 Mar 2001<!--webbot bot="Timestamp" endspan i-checksum="14885" --></p>
 </body>
 </html>
--- a/index.html
+++ b/index.html
@ -0,0 +1,13 @@
 <html>
 <head>
 <meta http-equiv="refresh" content="0; URL=../../doc/html/array.html">
 </head>
 <body>
 Automatic redirection failed, please go to
 <a href="../../doc/html/array.html">../../doc/html/array.html</a> &nbsp;<hr>
 <p><EFBFBD> Copyright Beman Dawes, 2001</p>
 <p>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">www.boost.org/LICENSE_1_0.txt</a>)</p>
 </body>
 </html>
--- a/meta/libraries.json
+++ b/meta/libraries.json
@ -0,0 +1,17 @@
 {
    "key": "array",
    "name": "Array",
    "authors": [
        "Nicolai Josuttis"
    ],
    "description": "STL compliant container wrapper for arrays of constant size.",
    "std": [
        "tr1"
    ],
    "category": [
        "Containers"
    ],
    "maintainers": [
        "Marshall Clow <marshall -at- idio.com>"
    ]
 }
--- a/print.hpp.html
+++ b/print.hpp.html
@ -1,48 +0,0 @@
 <HTML>
 <HEAD>
 <TITLE>PRINT_ELEMENTS()</TITLE>
 </HEAD>
 <BODY TEXT="#000000" BGCOLOR="#FFFFFF">
 &nbsp;
 <TABLE HEIGHT=40 WIDTH="100%">
 <TR> <TD ALIGN=LEFT WIDTH="100%" BGCOLOR="#DDDDDD">
 <FONT face="Arial,Helvetica" size=+2><B>
 &nbsp;PRINT_ELEMENTS()
 </B></FONT>
 </TD></TR></TABLE><BR>
 <FONT face="Arial,Helvetica"><B>
 The following code example is taken from the book<BR>
 <A HREF="http://www.josuttis.com/libbook/" TARGET="_top">
  The C++ Standard Library - A Tutorial and Reference</A><BR>
 by Nicolai M. Josuttis, Addison-Wesley, 1999<BR>
 <A HREF="http://www.josuttis.com/libbook/copyright.html">
  &copy; Copyright</A> Nicolai M. Josuttis 1999<BR>
 </B></FONT>
 <BR><BR>
 <TT>
 <SPAN class="Source">
 #include&nbsp;&lt;iostream&gt;<BR>
 <BR>
 <Font color="0000FF" >/</FONT><I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*&nbsp;print_elements()</FONT></I><BR>
 &nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*&nbsp;-&nbsp;prints&nbsp;optional&nbsp;C-string&nbsp;optcstr&nbsp;followed&nbsp;by</FONT></I><BR>
 &nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*&nbsp;-&nbsp;all&nbsp;elements&nbsp;of&nbsp;the&nbsp;collection&nbsp;coll</FONT></I><BR>
 &nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*&nbsp;-&nbsp;separated&nbsp;by&nbsp;spaces</FONT></I><BR>
 &nbsp;<I><FONT face="Arial,Helvetica,sans-serif" color="0000FF" >*/</FONT></I><BR>
 template&nbsp;&lt;class&nbsp;T&gt;<BR>
 inline&nbsp;void&nbsp;print_elements&nbsp;(const&nbsp;T&&nbsp;coll,&nbsp;const&nbsp;char*&nbsp;optcstr="")<BR>
 {<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;typename&nbsp;T::const_iterator&nbsp;pos;<BR>
 <BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;optcstr;<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;for&nbsp;(pos=coll.begin();&nbsp;pos!=coll.end();&nbsp;++pos)&nbsp;{<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;*pos&nbsp;&lt;&lt;&nbsp;'&nbsp;';<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;}<BR>
 &nbsp;&nbsp;&nbsp;&nbsp;std::cout&nbsp;&lt;&lt;&nbsp;std::endl;<BR>
 }<BR>
 </SPAN>
 </TT>
 </BODY>
 </HTML>
--- a/test/Jamfile.v2
+++ b/test/Jamfile.v2
@ -0,0 +1,25 @@
 #~ Copyright Rene Rivera 2008
 #~ 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)
 import testing ;
 alias unit_test_framework
    : # sources
        /boost//unit_test_framework
    ;        
 test-suite array :
    [ run array0.cpp unit_test_framework  : : : : array0 ]
    [ run array1.cpp ]
    [ run array2.cpp ]
    [ run array3.cpp ]
    [ run array4.cpp ]
    [ run array5.cpp ]
    [ run array6.cpp unit_test_framework  : : : : array6 ]
    [ run array7.cpp unit_test_framework  : : : : array7 ]
 #    [ run array_constexpr.cpp unit_test_framework  : : : : array_constexpr ]
    [ compile-fail array_getfail1.cpp ]
    [ compile-fail array_getfail2.cpp ]
    [ run array_hash.cpp unit_test_framework  : : : : array_hash ]
    ;
--- a/test/array0.cpp
+++ b/test/array0.cpp
@ -0,0 +1,89 @@
 /* tests for using class array<> specialization for size 0
 * (C) Copyright Alisdair Meredith 2006.
 * 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)
 */
 #include <string>
 #include <iostream>
 #include <boost/array.hpp>
 #define BOOST_TEST_MAIN
 #include <boost/test/unit_test.hpp>
 namespace {
 template< class T >
 void    BadValue( const T &  )
 {
    BOOST_CHECK ( false );
 }
 template< class T >
 void    RunTests()
 {
    typedef boost::array< T, 0 >    test_type;
    //  Test value and aggegrate initialization
    test_type                   test_case   =   {};
    const boost::array< T, 0 >  const_test_case = test_type();
    test_case.fill ( T() );
    //  front/back and operator[] must compile, but calling them is undefined
    //  Likewise, all tests below should evaluate to false, avoiding undefined behaviour
    BOOST_CHECK (       test_case.empty());
    BOOST_CHECK ( const_test_case.empty());
    BOOST_CHECK (       test_case.size() == 0 );
    BOOST_CHECK ( const_test_case.size() == 0 );
    //  Assert requirements of TR1 6.2.2.4
    BOOST_CHECK ( test_case.begin()  == test_case.end());
    BOOST_CHECK ( test_case.cbegin() == test_case.cend());
    BOOST_CHECK ( const_test_case.begin() == const_test_case.end());
    BOOST_CHECK ( const_test_case.cbegin() == const_test_case.cend());
    BOOST_CHECK ( test_case.begin() != const_test_case.begin() );
    if( test_case.data() == const_test_case.data() ) {
    //  Value of data is unspecified in TR1, so no requirement this test pass or fail
    //  However, it must compile!
    }
    //  Check can safely use all iterator types with std algorithms
    std::for_each( test_case.begin(), test_case.end(), BadValue< T > );
    std::for_each( test_case.rbegin(), test_case.rend(), BadValue< T > );
    std::for_each( test_case.cbegin(), test_case.cend(), BadValue< T > );
    std::for_each( const_test_case.begin(), const_test_case.end(), BadValue< T > );
    std::for_each( const_test_case.rbegin(), const_test_case.rend(), BadValue< T > );
    std::for_each( const_test_case.cbegin(), const_test_case.cend(), BadValue< T > );
    //  Check swap is well formed
    std::swap( test_case, test_case );
    //  Check assignment operator and overloads are well formed
    test_case   =   const_test_case;
    //  Confirm at() throws the std lib defined exception
    try {
        BadValue( test_case.at( 0 ));
    } catch ( const std::out_of_range & ) {
    }
    try {
        BadValue( const_test_case.at( 0 ) );
    } catch ( const std::out_of_range & ) {
    }
 }
 }
 BOOST_AUTO_TEST_CASE( test_main )
 {
    RunTests< bool >();
    RunTests< void * >();
    RunTests< long double >();
    RunTests< std::string >();
 }
--- a/test/array1.cpp
+++ b/test/array1.cpp
@ -1,9 +1,15 @@
 /* simple example for using class array<>
 *
 * (C) Copyright Nicolai M. Josuttis 2001.
 * 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)
 * 
 * Changelog:
 * 20 Jan 2001 - Removed boolalpha use since stock GCC doesn't support it
 *               (David Abrahams)
 */
 #include <iostream>
 #include <boost/array.hpp>
--- a/test/array2.cpp
+++ b/test/array2.cpp
@ -1,16 +1,25 @@
 /* example for using class array<>
 * (C) Copyright Nicolai M. Josuttis 2001.
 * 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)
 */
 #ifndef _SCL_SECURE_NO_WARNINGS
 // Suppress warnings from the std lib:
 #  define _SCL_SECURE_NO_WARNINGS
 #endif
 #include <algorithm>
 #include <functional>
 #include <boost/array.hpp>
 #include "print.hpp"
 using namespace std;
 using namespace boost;
 int main()
 {
    // create and initialize array
-    array<int,10> a = { { 1, 2, 3, 4, 5 } };
+    boost::array<int,10> a = { { 1, 2, 3, 4, 5 } };
    print_elements(a);
--- a/test/array3.cpp
+++ b/test/array3.cpp
@ -1,5 +1,10 @@
 /* example for using class array<>
 * (C) Copyright Nicolai M. Josuttis 2001.
 * 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)
 */
 #include <string>
 #include <iostream>
 #include <boost/array.hpp>
@ -16,7 +21,7 @@ int main()
    // copy and change order
    boost::array<std::string,4> seasons_orig = seasons;
-    for (unsigned i=seasons.size()-1; i>0; --i) {
+    for (std::size_t i=seasons.size()-1; i>0; --i) {
        std::swap(seasons.at(i),seasons.at((i+1)%seasons.size()));
    }
@ -34,6 +39,13 @@ int main()
           =seasons.rbegin(); pos<seasons.rend(); ++pos) {
        std::cout << " " << *pos;
    }
    // try constant reverse iterators
    std::cout << "reverse:   ";
    for (boost::array<std::string,4>::const_reverse_iterator pos
           =seasons.crbegin(); pos<seasons.crend(); ++pos) {
        std::cout << " " << *pos;
    }
    std::cout << std::endl;
    return 0;  // makes Visual-C++ compiler happy
--- a/test/array4.cpp
+++ b/test/array4.cpp
@ -1,5 +1,10 @@
 /* example for using class array<>
 * (C) Copyright Nicolai M. Josuttis 2001.
 * 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)
 */
 #include <algorithm>
 #include <functional>
 #include <string>
--- a/test/array5.cpp
+++ b/test/array5.cpp
@ -1,5 +1,10 @@
 /* simple example for using class array<>
 * (C) Copyright Nicolai M. Josuttis 2001.
 * 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)
 */
 #include <iostream>
 #include <boost/array.hpp>
@ -10,8 +15,8 @@ void test_static_size (const T& cont)
    for (unsigned i=0; i<T::static_size; ++i) {
        tmp[i] = int(cont[i]);
    }
-    for (unsigned i=0; i<T::static_size; ++i) {
+    for (unsigned j=0; j<T::static_size; ++j) {
-        std::cout << tmp[i] << ' ';
+        std::cout << tmp[j] << ' ';
    }
    std::cout << std::endl;
 }
@ -22,7 +27,7 @@ int main()
    typedef boost::array<float,6> Array;
    // create and initialize an array
-    const Array a = { { 42.42 } };
+    const Array a = { { 42.42f } };
    // use some common STL container operations
    std::cout << "static_size: " << a.size() << std::endl;
--- a/test/array6.cpp
+++ b/test/array6.cpp
@ -0,0 +1,40 @@
 /* tests for using class array<> specialization for size 0
 * (C) Copyright Alisdair Meredith 2006.
 * 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)
 */
 #include <string>
 #include <iostream>
 #include <boost/array.hpp>
 #include <algorithm>
 #define BOOST_TEST_MAIN
 #include <boost/test/unit_test.hpp>
 namespace {
    template< class T >
    void    RunTests()
    {
        typedef boost::array< T, 5 >    test_type;
        typedef T arr[5];
        test_type           test_case; //   =   { 1, 1, 2, 3, 5 };
        arr &aRef = get_c_array ( test_case );
        BOOST_CHECK ( &*test_case.begin () == &aRef[0] );
        const arr &caRef = get_c_array ( test_case );
        typename test_type::const_iterator iter = test_case.begin ();
        BOOST_CHECK ( &*iter == &caRef[0] );
    }
 }
 BOOST_AUTO_TEST_CASE( test_main )
 {
    RunTests< bool >();
    RunTests< void * >();
    RunTests< long double >();
    RunTests< std::string >();
 }
--- a/test/array7.cpp
+++ b/test/array7.cpp
@ -0,0 +1,67 @@
 /* tests using std::get on boost:array
 * (C) Copyright Marshall Clow 2012
 * 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)
 */
 #include <string>
 #include <iostream>
 #include <boost/array.hpp>
 #include <algorithm>
 #ifndef BOOST_NO_CXX11_HDR_ARRAY
 #include <array>
 #endif
 #define BOOST_TEST_MAIN
 #include <boost/test/unit_test.hpp>
 namespace {
    #ifndef BOOST_NO_CXX11_HDR_ARRAY
    template< class T >
    void    RunStdTests()
    {
        typedef boost::array< T, 5 >    test_type;
        typedef T arr[5];
        test_type           test_case; //   =   { 1, 1, 2, 3, 5 };
        T &aRef = std::get<0> ( test_case );
        BOOST_CHECK ( &*test_case.begin () == &aRef );
        const T &caRef = std::get<0> ( test_case );
        BOOST_CHECK ( &*test_case.cbegin () == &caRef );
    }
    #endif
    template< class T >
    void    RunBoostTests()
    {
        typedef boost::array< T, 5 >    test_type;
        typedef T arr[5];
        test_type           test_case; //   =   { 1, 1, 2, 3, 5 };
        T &aRef = boost::get<0> ( test_case );
        BOOST_CHECK ( &*test_case.begin () == &aRef );
        const T &caRef = boost::get<0> ( test_case );
        BOOST_CHECK ( &*test_case.cbegin () == &caRef );
    }
 }
 BOOST_AUTO_TEST_CASE( test_main )
 {
    RunBoostTests< bool >();
    RunBoostTests< void * >();
    RunBoostTests< long double >();
    RunBoostTests< std::string >();
 #ifndef BOOST_NO_CXX11_HDR_ARRAY
    RunStdTests< bool >();
    RunStdTests< void * >();
    RunStdTests< long double >();
    RunStdTests< std::string >();
 #endif
 }
--- a/test/array_constexpr.cpp
+++ b/test/array_constexpr.cpp
@ -0,0 +1,42 @@
 /* tests using constexpr on boost:array
 * (C) Copyright Marshall Clow 2012
 * 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)
 */
 #include <string>
 #include <iostream>
 #include <boost/array.hpp>
 #include <algorithm>
 #ifndef BOOST_NO_CXX11_HDR_ARRAY
 #include <array>
 #endif
 #define BOOST_TEST_MAIN
 #include <boost/test/unit_test.hpp>
 #ifndef BOOST_NO_CXX11_CONSTEXPR
 constexpr boost::array<int, 10> arr  {{ 0,1,2,3,4,5,6,7,8,9 }};
 constexpr std::array<int, 10> arr_std {{ 0,1,2,3,4,5,6,7,8,9 }};
 template <typename T>
 void sink ( T t ) {}
 template <typename T, size_t N>
 void sink ( boost::array<T,N> &arr ) {}
 BOOST_AUTO_TEST_CASE( test_main )
 {
 //    constexpr int two = arr_std.at (2);
    constexpr int three = arr.at (3);
    int whatever [ arr.at(4) ];
    (void)three;
    (void) whatever;
 }
 #else   // no constexpr means no constexpr tests!
 BOOST_AUTO_TEST_CASE( test_main )
 {
 }
 #endif
--- a/test/array_getfail1.cpp
+++ b/test/array_getfail1.cpp
@ -0,0 +1,49 @@
 /* tests using std::get on boost:array
 * (C) Copyright Marshall Clow 2012
 * 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)
 */
 #include <boost/array.hpp>
 #include <boost/static_assert.hpp>
 #include <string>
 #include <iostream>
 #include <algorithm>
 #ifndef BOOST_NO_CXX11_HDR_ARRAY
 #include <array>
 #endif
 #define BOOST_TEST_MAIN
 #include <boost/test/unit_test.hpp>
 namespace {
    #ifndef BOOST_NO_CXX11_HDR_ARRAY
    template< class T >
    void    RunStdTests()
    {
        typedef boost::array< T, 5 >    test_type;
        typedef T arr[5];
        test_type           test_case; //   =   { 1, 1, 2, 3, 5 };
        T &aRef = std::get<5> ( test_case );    // should fail to compile
        BOOST_CHECK ( &*test_case.begin () == &aRef );
    }
    #endif
 }
 BOOST_AUTO_TEST_CASE( test_main )
 {
 #ifndef BOOST_NO_CXX11_HDR_ARRAY
    RunStdTests< bool >();
    RunStdTests< void * >();
    RunStdTests< long double >();
    RunStdTests< std::string >();
 #else
    BOOST_STATIC_ASSERT ( false );  // fail on C++03 systems.
 #endif
 }
--- a/test/array_getfail2.cpp
+++ b/test/array_getfail2.cpp
@ -0,0 +1,64 @@
 /* tests using std::get on boost:array
 * (C) Copyright Marshall Clow 2012
 * 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)
 */
 #include <string>
 #include <iostream>
 #include <boost/array.hpp>
 #include <algorithm>
 #ifndef BOOST_NO_CXX11_HDR_ARRAY
 #include <array>
 #endif
 #define BOOST_TEST_MAIN
 #include <boost/test/unit_test.hpp>
 namespace {
    #ifndef BOOST_NO_CXX11_HDR_ARRAY
    template< class T >
    void    RunStdTests()
    {
        typedef boost::array< T, 5 >    test_type;
        typedef T arr[5];
        test_type           test_case; //   =   { 1, 1, 2, 3, 5 };
        T &aRef = std::get<0> ( test_case );
        BOOST_CHECK ( &*test_case.begin () == &aRef );
        const T &caRef = std::get<0> ( test_case );
        BOOST_CHECK ( &*test_case.cbegin () == &caRef );
    }
    #endif
    template< class T >
    void    RunBoostTests()
    {
        typedef boost::array< T, 5 >    test_type;
        typedef T arr[5];
        test_type           test_case; //   =   { 1, 1, 2, 3, 5 };
        T &aRef = boost::get<5> ( test_case );
        BOOST_CHECK ( &*test_case.begin () == &aRef );
    }
 }
 BOOST_AUTO_TEST_CASE( test_main )
 {
    RunBoostTests< bool >();
    RunBoostTests< void * >();
    RunBoostTests< long double >();
    RunBoostTests< std::string >();
 #ifndef BOOST_NO_CXX11_HDR_ARRAY
    RunStdTests< bool >();
    RunStdTests< void * >();
    RunStdTests< long double >();
    RunStdTests< std::string >();
 #endif
 }
--- a/test/array_hash.cpp
+++ b/test/array_hash.cpp
@ -0,0 +1,43 @@
 /* tests for using boost::hash with boost::array
 * (C) Copyright Marshall Clow 2012
 * 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)
 */
 #include <string>
 #include <iostream>
 #include <boost/array.hpp>
 #include <algorithm>
 #include <boost/functional/hash.hpp>
 #define BOOST_TEST_MAIN
 #include <boost/test/unit_test.hpp>
 namespace {
    template< class T >
    void    RunTests()
    {
    //    std::size_t hash0 = boost::hash<boost::array<T,0> > () ( boost::array<T, 0> ());
    //    std::size_t hash1 = boost::hash<boost::array<T,1> > () ( boost::array<T, 1> ());
        typedef boost::array< T, 5 >    barr;
        typedef T arr[5];
        barr           test_barr =   {{ 1, 1, 2, 3, 5 }};
        arr            test_arr  =    { 1, 1, 2, 3, 5 };
        std::size_t bhash = boost::hash<barr> () ( test_barr );
        std::size_t ahash = boost::hash<arr>  () ( test_arr );
        BOOST_CHECK ( ahash == bhash );
    }
 }
 BOOST_AUTO_TEST_CASE( test_main )
 {
    RunTests< int >();
    RunTests< long >();
    RunTests< long double >();
 }
--- a/test/print.hpp
+++ b/test/print.hpp
@ -3,10 +3,9 @@
 * by Nicolai M. Josuttis, Addison-Wesley, 1999
 *
 * (C) Copyright Nicolai M. Josuttis 1999.
- * Permission to copy, use, modify, sell and distribute this software
+ * Distributed under the Boost Software License, Version 1.0. (See
- * is granted provided this copyright notice appears in all copies.
+ * accompanying file LICENSE_1_0.txt or copy at
- * This software is provided "as is" without express or implied
+ * http://www.boost.org/LICENSE_1_0.txt)
 * warranty, and with no claim as to its suitability for any purpose.
 */
 #include <iostream>
Author	SHA1	Message	Date
Marshall Clow	8f3aea2200	Merge array bug fixes to master	2017-01-31 08:00:48 -08:00
Marshall Clow	cef221d8b4	Merge pull request #5 from Lastique/patch-1 Fix compilation for Oracle Studio 12.5	2017-01-23 20:00:25 -08:00
Andrey Semashev	5d06f1074a	Fix compilation for Oracle Studio 12.5 The compiler expects a qualified dependent name after `typename`, so move `const` after the name.	2017-01-24 02:31:27 +04:00
Daniel	4c27456a43	Copy doc jamfile from develop It's need to build the documentation now.	2016-10-27 20:12:38 +01:00
Rene Rivera	16824fe0f1	Add, and update, documentation build targets.	2016-10-07 23:03:40 -05:00
Marshall Clow	0d4fa276f4	Merge pull request #3 from boostorg/pull_request/remove_hash_fwd Replace inclusion of hash_fwd.hpp with a declaration of hash_range. Patch from Peter Dimov.	2015-01-08 14:10:08 -08:00
Peter Dimov	cb4df41bd6	Replace inclusion of hash_fwd.hpp with a declaration of hash_range	2015-01-09 00:01:41 +02:00
Marshall Clow	cd9888316a	Merge pull request #2 from danieljames/metadata Create metadata file.	2014-08-18 09:16:48 -07:00
Daniel James	ce71078681	Add metadata file.	2014-08-18 14:57:18 +01:00
Daniel James	9678f6aa3b	Create merge base for git.	2014-04-06 13:53:46 +01:00
Michel Morin	c0b1609ddb	Merge r86524 (Correct broken links to C++ standard papers); fixes #9212 [SVN r86673]	2013-11-13 03:22:55 +00:00
Michel Morin	dfeb6bd0a5	Correct broken links to C++ standard papers. Refs #9212 . [SVN r86524]	2013-10-30 12:51:24 +00:00
Marshall Clow	1966dd034b	Updated license and copyright [SVN r86311]	2013-10-14 21:35:20 +00:00
Marshall Clow	40c5dae84c	Remove tabs [SVN r86310]	2013-10-14 21:31:19 +00:00
Stephen Kelly	4584f63f01	Simplify multi-component ifdefs containing BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION [SVN r86248]	2013-10-11 23:20:59 +00:00
Stephen Kelly	2e0052d49f	Remove BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION Process #ifndef...#endif conditions. [SVN r86244]	2013-10-11 23:15:00 +00:00
Stephen Kelly	6ad6249e1c	Array: Remove obsolete MSVC version check. [SVN r85903]	2013-09-25 13:51:37 +00:00
Marshall Clow	a73b6fb582	Merged boost::algorithm::gather and updated tests for Utility, Algorithm and Utility libraries [SVN r83154]	2013-02-25 18:43:26 +00:00
Marshall Clow	12fcbb59c2	Back out some of the constexpr support Boost.Array; it crashes gcc [SVN r82906]	2013-02-15 17:11:09 +00:00
Marshall Clow	4a60b8c146	Add constexpr support to Boost.Array [SVN r82834]	2013-02-12 18:07:15 +00:00
Marshall Clow	117584a2ce	Update Boost.Array tests to use newer Boost.Test features [SVN r82822]	2013-02-11 17:16:55 +00:00
Marshall Clow	97a26a1599	Documented boost::get support in Boost.Array [SVN r82105]	2012-12-19 20:32:34 +00:00
Marshall Clow	88abb34b4d	Fix bug where failure test failed for the wrong reason on C++03 [SVN r82102]	2012-12-19 17:49:04 +00:00
Marshall Clow	e02e7dcc00	Add boost::get<> support to Boost.Array [SVN r82089]	2012-12-19 00:53:31 +00:00
Marshall Clow	daeb19f693	Add support for std::get<> to Boost.Array [SVN r82083]	2012-12-18 17:59:08 +00:00
Marshall Clow	ba1a2437cf	Merge doc changes to release; fixes #6988 [SVN r78948]	2012-06-14 16:01:03 +00:00
Marshall Clow	f41b1d2d4c	Added a note about std::array in C++11 [SVN r78947]	2012-06-14 15:52:44 +00:00
Marshall Clow	3db6930a22	Added support Boost.Hash; checked in a test yesterday, but forgot to merge the actual code [SVN r78581]	2012-05-24 13:04:02 +00:00
Marshall Clow	859fb5aa97	Merged changes for Boost.Array to release; adds support for Boost.Hash [SVN r78558]	2012-05-23 16:35:13 +00:00
Marshall Clow	f4a0cbd364	Added support for Boost.Hash to Boost.Array; fixes #6791 [SVN r77976]	2012-04-14 18:07:34 +00:00
Marshall Clow	992299f2bf	Use BOOST_ASSERT_MSG instead of naked BOOST_ASSERT [SVN r77135]	2012-02-28 18:47:28 +00:00
Marshall Clow	5a97de6f2e	Merge changes in Boost.Array to release [SVN r70698]	2011-03-29 14:49:32 +00:00
Marshall Clow	eea368fadf	Merge changes in Boost.Array to release [SVN r70697]	2011-03-29 14:47:50 +00:00
Marshall Clow	e6a44cf529	Removed tabs [SVN r70442]	2011-03-22 23:55:20 +00:00
Marshall Clow	111e93aa4c	qualify array to avoid conflict with std::array; Refs #5233 [SVN r69291]	2011-02-26 01:35:48 +00:00
Bryce Adelstein-Lelbach	5072c551ec	Pathscale-4.0 configuration code/workarounds. [SVN r68142]	2011-01-14 02:59:34 +00:00
Marshall Clow	26edbea113	Merging changes to release; fixes #4761 [SVN r68100]	2011-01-13 15:49:03 +00:00
Marshall Clow	97e912e82e	Added crbegin and crend to Boost.Array; refs #4761 . Will close ticket when merged to release branch [SVN r67481]	2010-12-28 19:14:23 +00:00
Marshall Clow	05aa660128	Added cbegin and cend to Boost.Array; refs #4761 . Will close ticket when merged to release branch [SVN r67478]	2010-12-28 18:39:14 +00:00
Marshall Clow	9644ee6662	Merged array changes to release; fixes #4757 [SVN r67477]	2010-12-28 18:28:22 +00:00
Marshall Clow	7256882760	Fix? for borland [SVN r66781]	2010-11-26 20:16:34 +00:00
Marshall Clow	5329bd6f1c	Slight tweak of get_c_array [SVN r66712]	2010-11-24 16:13:12 +00:00
Marshall Clow	80fa50df2e	SunPro workaround; references #4757 [SVN r66651]	2010-11-20 00:48:33 +00:00
Marshall Clow	6fbc8ee741	Added a test for 'get_c_array' [SVN r66294]	2010-10-31 02:25:04 +00:00
Marshall Clow	38217688e1	Fix elems for Sun compilers [SVN r66154]	2010-10-23 19:11:16 +00:00
Marshall Clow	a603bffc48	Merged Array changes to release [SVN r63410]	2010-06-28 17:59:21 +00:00
Marshall Clow	2595eda739	Removed tabs [SVN r62803]	2010-06-11 14:46:31 +00:00
Marshall Clow	64e5394540	Added get_c_array to Boost.Array [SVN r62487]	2010-06-06 16:05:13 +00:00
Marshall Clow	c37498364e	Detab array.hpp [SVN r61415]	2010-04-19 21:41:21 +00:00
Marshall Clow	0c8902e8c2	Merged array changes from trunk to release; Fixes #3893 and #3168 [SVN r60824]	2010-03-25 15:32:12 +00:00
Marshall Clow	5e81100035	Added support for SunCC and 'fill' operation; tickets #3893 and #3168 respectively [SVN r60436]	2010-03-10 18:03:30 +00:00
Marshall Clow	79cadb97d7	Changed exception throwing to use boost::throw_exception [SVN r60417]	2010-03-10 14:23:49 +00:00
Marshall Clow	9609395af0	Applied patches to fix #2886 [SVN r59476]	2010-02-04 18:22:13 +00:00
John Maddock	fb72e72640	MSVC warning suppression - fixes #3599 . [SVN r59439]	2010-02-03 12:10:56 +00:00
Marshall Clow	88868ba0df	Merged array changes from trunk to release [SVN r58921]	2010-01-12 05:55:52 +00:00
Troy D. Straszheim	e875287d55	rm cmake from trunk. I'm not entirely sure this is necessary to satisfy the inspect script, but I'm not taking any chances, and it is easy to put back [SVN r56942]	2009-10-17 02:07:38 +00:00
Troy D. Straszheim	99631823f6	rm cmake from the release branch before it goes out broken. Policy dictates that you never commit to release, you commit to trunk and merge to release. [SVN r56941]	2009-10-17 01:10:45 +00:00
Troy D. Straszheim	100b5d687b	Copyrights on CMakeLists.txt to keep them from clogging up the inspect reports. This is essentially the same commit as r55095 on the release branch. [SVN r55159]	2009-07-26 00:49:56 +00:00
Troy D. Straszheim	5661b8cd63	Add basic copyright/license to keep cmake out of the inspection report [SVN r55095]	2009-07-22 21:51:01 +00:00
Thorsten Jørgen Ottosen	7fb9412ea8	removed warning on vc++ for using std::equal [SVN r54541]	2009-06-30 20:04:45 +00:00
Steven Watanabe	86b069ad0e	Merge [53104] and [53105] from the trunk [SVN r53198]	2009-05-23 06:00:42 +00:00
Steven Watanabe	471bc9bf06	Supress warnings in array [SVN r53105]	2009-05-19 03:00:53 +00:00
Steven Watanabe	9cf5e0c9a1	Use boost::swap instead of std::swap_ranges to enable ADL. Fixes #2753 . [SVN r53104]	2009-05-19 02:37:04 +00:00
Troy D. Straszheim	3d20bb1310	merge of cmake build files from trunk per beman [SVN r50756]	2009-01-24 18:57:20 +00:00
Boris Gubenko	e7122b3f20	merge tests and Jamfiles for 7 libraries [SVN r50456]	2009-01-04 05:17:02 +00:00
Michael A. Jackson	d2910e195a	Updating dependency information for modularized libraries. [SVN r49628]	2008-11-07 17:05:27 +00:00
Michael A. Jackson	b3ace9fb6e	Updating CMake files to latest trunk. Added dependency information for regression tests and a few new macros for internal use. [SVN r49627]	2008-11-07 17:02:56 +00:00
Michael A. Jackson	a6b531b5b1	Continuing merge of CMake build system files into trunk with the encouragement of Doug Gregor [SVN r49510]	2008-11-01 13:15:41 +00:00
Rene Rivera	9804292dad	Move array test into canonical test subdir structure. [SVN r44376]	2008-04-13 22:12:12 +00:00
Beman Dawes	4dd2cf1b64	Full merge from trunk at revision 41356 of entire boost-root tree. [SVN r41370]	2007-11-25 18:38:02 +00:00
Beman Dawes	2e88dc228d	Full merge from trunk at revision 41356 of entire boost-root tree. [SVN r41369]	2007-11-25 18:07:19 +00:00
Beman Dawes	0a4d7e81ef	Starting point for releases [SVN r39706]	2007-10-05 14:25:06 +00:00
nobody	96d4c5f737	This commit was manufactured by cvs2svn to create tag 'Version_1_34_1'. [SVN r38286]	2007-07-24 19:28:14 +00:00
Beman Dawes	069b5e2ca1	Throw out_of_range rather than range_error. See 21.1.1 paragraph 13. [SVN r36304]	2006-12-08 16:54:30 +00:00
Beman Dawes	526953fc5e	Test for out_of_range rather than range_error. See 21.1.1 paragraph 13. [SVN r36303]	2006-12-08 16:53:49 +00:00
Andreas Huber	5a23b06a83	Merged L & C issue fixes from trunk to branch. [SVN r36225]	2006-12-01 11:34:43 +00:00
Andreas Huber	b06f12b0b7	Fixed license & copyright issues. [SVN r36224]	2006-12-01 10:29:49 +00:00
Beman Dawes	e85feee293	Merged copyright and license addition [SVN r35907]	2006-11-07 19:27:00 +00:00
Beman Dawes	f0bbb8b211	Add copyright, license [SVN r35905]	2006-11-07 19:11:57 +00:00
Gennaro Prota	b6522b3f60	(merge from head) http://www.josuttis.com/ hasn't the latest version any more [SVN r34856]	2006-08-08 18:53:30 +00:00
Gennaro Prota	d7a5408143	http://www.josuttis.com/ hasn't the latest version any more [SVN r34855]	2006-08-08 18:49:30 +00:00
John Maddock	3044ab376c	Simplified code. [SVN r34384]	2006-06-24 11:31:19 +00:00
John Maddock	564e4029d0	Simplified code. [SVN r34384]	2006-06-24 11:31:19 +00:00
John Maddock	69188c998f	Fix compiler errors resulting from missing return values. [SVN r34259]	2006-06-09 11:40:07 +00:00
John Maddock	0dc11c2f23	Fix compiler errors resulting from missing return values. [SVN r34259]	2006-06-09 11:40:07 +00:00
Alisdair Meredith	4c5212f5e4	Remove size zero support for old compilers that do not support partial template specialization [SVN r34162]	2006-06-04 12:10:17 +00:00
Alisdair Meredith	7da1c4b310	Remove size zero support for old compilers that do not support partial template specialization [SVN r34161]	2006-06-04 11:01:59 +00:00
Alisdair Meredith	276cd991f3	Support for zero length arrays [SVN r34156]	2006-06-03 13:04:27 +00:00
Alisdair Meredith	8f10fdf27e	Support for zero length arrays [SVN r34154]	2006-06-03 12:51:13 +00:00
nobody	1f8298fb08	This commit was manufactured by cvs2svn to create branch 'RC_1_34_0'. [SVN r33417]	2006-03-21 02:26:31 +00:00
Douglas Gregor	b41f7fdebe	Merged from Version_1_33_1 [SVN r31949]	2005-12-08 03:23:02 +00:00
Douglas Gregor	2fde5e334b	License update [SVN r24990]	2004-09-09 13:59:01 +00:00
Thorsten Jørgen Ottosen	4ee6e051fe	* empty log message * [SVN r24128]	2004-07-27 20:00:34 +00:00
Thorsten Jørgen Ottosen	bac6446111	added debug bounds checking; added new empty() definition [SVN r24127]	2004-07-27 19:58:09 +00:00
Douglas Gregor	cfb6d6eae6	array.xml: documentation updates from Nico [SVN r22066]	2004-01-30 03:51:06 +00:00
Douglas Gregor	0543286830	Installed some updates from Nicolai Josuttis [SVN r22065]	2004-01-30 03:32:19 +00:00
Beman Dawes	1c6f9ef038	index.htm renamed index.html [SVN r21230]	2003-12-11 23:13:19 +00:00
Douglas Gregor	d38c367afd	Switch over to BoostBook documentation [SVN r21068]	2003-12-02 06:40:44 +00:00
Douglas Gregor	a5a75f81bd	Updated to reflect BoostBook changes [SVN r17941]	2003-03-15 23:12:35 +00:00
Douglas Gregor	ab72ec517c	Lots of cleanups as BoostBook becomes more strict [SVN r17871]	2003-03-13 00:29:57 +00:00
Douglas Gregor	8a119110be	Import of BoostBook documentation for any, array, bind, function, ref, and signals libraries. [SVN r17866]	2003-03-12 23:27:25 +00:00
Björn Karlsson	3daa34744f	Added copyright [SVN r17183]	2003-02-04 07:21:29 +00:00
Beman Dawes	0f3969f9e0	Add /libs/lib-name to comment [SVN r16685]	2002-12-23 02:43:12 +00:00
John Maddock	c501468b53	Fixed reverse iterator workaround test, should now work with Intel C++ as well as VC7. [SVN r16195]	2002-11-11 12:40:56 +00:00
John Maddock	faf0005e86	Added BOOST_DINKUMWARE_STDLIB macro [SVN r16172]	2002-11-09 11:54:05 +00:00
Dave Abrahams	785e98fcac	No sense in failing just because a compiler doesn't implement correct for loop scoping! [SVN r15327]	2002-09-15 04:04:10 +00:00
John Maddock	13d4e8bc40	Stripped tabs, added VC7+STLport fixes [SVN r15193]	2002-09-07 10:45:04 +00:00
John Maddock	9ea2182afa	One more attempt to get Intel config right. [SVN r15166]	2002-09-05 10:18:10 +00:00
John Maddock	bf3b240686	Second try at fixing Intel errors, without messing up Intel+STLport config. [SVN r15141]	2002-09-03 11:34:12 +00:00
John Maddock	6b9c6c9de3	Added (hopeful) Intel C++ fixes for broken std::reverse_iterator. [SVN r15124]	2002-09-01 10:43:04 +00:00
Ronald Garcia	fe013c42b7	Added a fix for non Microsoft compilers using Microsoft libraries. [SVN r15068]	2002-08-23 14:32:39 +00:00