[Boost-commit] svn:boost r40851 - in branches/proto/v3: . boost boost/fusion boost/fusion/container boost/fusion/container/generation boost/fusion/include boost/fusion/sequence boost/fusion/sequence/generation boost/fusion/view/ext_ boost/gil boost/gil/extension/dynamic_image boost/interprocess boost/interprocess/detail boost/math/distributions boost/spirit/core/primitives/impl doc libs libs/config/test/link/test libs/disjoint_sets libs/dynamic_bitset libs/format/benchmark libs/fusion libs/fusion/doc libs/fusion/doc/html libs/fusion/doc/html/fusion libs/fusion/doc/html/fusion/adapted libs/fusion/doc/html/fusion/algorithm libs/fusion/doc/html/fusion/algorithm/iteration libs/fusion/doc/html/fusion/algorithm/iteration/functions libs/fusion/doc/html/fusion/algorithm/iteration/metafunctions libs/fusion/doc/html/fusion/algorithm/query libs/fusion/doc/html/fusion/algorithm/query/functions libs/fusion/doc/html/fusion/algorithm/query/metafunctions libs/fusion/doc/html/fusion/algorithm/transformation libs/fusion/doc/html/fusion/algorithm/transformation/functions libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions libs/fusion/doc/html/fusion/container libs/fusion/doc/html/fusion/container/conversion libs/fusion/doc/html/fusion/container/conversion/functions libs/fusion/doc/html/fusion/container/conversion/metafunctions libs/fusion/doc/html/fusion/container/generation libs/fusion/doc/html/fusion/container/generation/functions libs/fusion/doc/html/fusion/container/generation/metafunctions libs/fusion/doc/html/fusion/extension libs/fusion/doc/html/fusion/extension/macros libs/fusion/doc/html/fusion/functional libs/fusion/doc/html/fusion/functional/adapters libs/fusion/doc/html/fusion/functional/concepts libs/fusion/doc/html/fusion/functional/generation libs/fusion/doc/html/fusion/functional/generation/functions libs/fusion/doc/html/fusion/functional/generation/metafunctions libs/fusion/doc/html/fusion/functional/invocation libs/fusion/doc/html/fusion/functional/invocation/functions libs/fusion/doc/html/fusion/functional/invocation/metafunctions libs/fusion/doc/html/fusion/iterator libs/fusion/doc/html/fusion/iterator/concepts libs/fusion/doc/html/fusion/iterator/functions libs/fusion/doc/html/fusion/iterator/metafunctions libs/fusion/doc/html/fusion/iterator/operator libs/fusion/doc/html/fusion/sequence libs/fusion/doc/html/fusion/sequence/concepts libs/fusion/doc/html/fusion/sequence/intrinsic libs/fusion/doc/html/fusion/sequence/intrinsic/functions libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions libs/fusion/doc/html/fusion/sequence/operator libs/fusion/doc/html/fusion/sequence/operator/comparison libs/fusion/doc/html/fusion/sequence/operator/i_o libs/fusion/doc/html/fusion/support libs/fusion/doc/html/fusion/tuple libs/fusion/doc/html/fusion/tuple/class_template_tuple libs/fusion/doc/html/fusion/view libs/fusion/test/algorithm libs/fusion/test/algorithm/ext_ libs/fusion/test/functional libs/fusion/test/sequence libs/fusion/test/sequence/ext_ libs/graph/test/planar_input_graphs libs/integer libs/math/test libs/multi_index/doc libs/system/test libs/thread/test more status tools/build/v2/tools tools/inspect tools/regression tools/regression/src

From: eric_at_[hidden]
Date: 2007-11-06 15:13:36

Author: eric_niebler
Date: 2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
New Revision: 40851
URL: http://svn.boost.org/trac/boost/changeset/40851

Log:
Merged revisions 40815-40850 via svnmerge from 
https://svn.boost.org/svn/boost/trunk

........
  r40816 | nasonov | 2007-11-05 14:22:48 -0800 (Mon, 05 Nov 2007) | 1 line
  
  #839 fixed: local variable shadow patch
........
  r40817 | danmarsden | 2007-11-05 14:24:53 -0800 (Mon, 05 Nov 2007) | 1 line
  
  fixed spelling mistake in documentation
........
  r40818 | noel_belcourt | 2007-11-05 14:39:49 -0800 (Mon, 05 Nov 2007) | 3 lines
  
  Commit patch submitted by John Maddock.
........
  r40819 | grafik | 2007-11-05 14:48:41 -0800 (Mon, 05 Nov 2007) | 1 line
  
  Add missing action for --skip-tests option since it's a boolean flag.
........
  r40820 | grafik | 2007-11-05 14:49:09 -0800 (Mon, 05 Nov 2007) | 1 line
  
  Oops, forgot a comma.
........
  r40822 | djowel | 2007-11-05 17:44:49 -0800 (Mon, 05 Nov 2007) | 1 line
  
  fix for real number parsers with custom types that do not have a std::numeric_limits specialization.
........
  r40824 | bemandawes | 2007-11-05 18:29:50 -0800 (Mon, 05 Nov 2007) | 1 line
  
  Make message test conditional for Windows, Linux, HP-UX, OSF, and VMS (Boris Gubenko)
........
  r40825 | bemandawes | 2007-11-05 18:54:29 -0800 (Mon, 05 Nov 2007) | 1 line
  
  Remove prematurely committed portion of prior change
........
  r40827 | djowel | 2007-11-06 02:09:38 -0800 (Tue, 06 Nov 2007) | 1 line
  
  doc updates to reflect structure changes
........
  r40828 | djowel | 2007-11-06 03:40:27 -0800 (Tue, 06 Nov 2007) | 1 line
  
  Regenerating/reorganizing docs
........
  r40829 | schoepflin | 2007-11-06 03:52:01 -0800 (Tue, 06 Nov 2007) | 2 lines
  
  Again removed markup which has been wrongly reintroduced by @40735.
........
  r40830 | djowel | 2007-11-06 03:58:37 -0800 (Tue, 06 Nov 2007) | 1 line
  
  doc updates + some more header tweaks
........
  r40831 | djowel | 2007-11-06 04:05:12 -0800 (Tue, 06 Nov 2007) | 1 line
  
  doc updates + some more header tweaks
........
  r40832 | djowel | 2007-11-06 04:13:52 -0800 (Tue, 06 Nov 2007) | 1 line
  
  Regenerating/reorganizing docs
........
  r40833 | djowel | 2007-11-06 04:17:26 -0800 (Tue, 06 Nov 2007) | 1 line
  
  todo update
........
  r40834 | bemandawes | 2007-11-06 05:24:38 -0800 (Tue, 06 Nov 2007) | 1 line
  
  Add missing Boost.System entry
........
  r40835 | bemandawes | 2007-11-06 05:41:19 -0800 (Tue, 06 Nov 2007) | 1 line
  
  Add missing copyright and license
........
  r40836 | aaron_windsor | 2007-11-06 05:55:05 -0800 (Tue, 06 Nov 2007) | 1 line
  
  Renaming planar graph test files to under 32 characters each.
........
  r40837 | bemandawes | 2007-11-06 06:22:00 -0800 (Tue, 06 Nov 2007) | 1 line
  
  Add license
........
  r40838 | joaquin | 2007-11-06 06:33:59 -0800 (Tue, 06 Nov 2007) | 1 line
  
  updated according to latest regression tests results
........
  r40840 | bemandawes | 2007-11-06 08:10:11 -0800 (Tue, 06 Nov 2007) | 1 line
  
  Add repository URL and revision number, plus other minor tweaks and fixes.
........
  r40841 | igaztanaga | 2007-11-06 08:56:28 -0800 (Tue, 06 Nov 2007) | 1 line
  
  Corrected _CRT_SECURE_NO_DEPRECATE detection 
........
  r40842 | igaztanaga | 2007-11-06 08:56:48 -0800 (Tue, 06 Nov 2007) | 1 line
  
  Initialized native handle to avoid warnings in Visual2005
........
  r40843 | johnmaddock | 2007-11-06 08:58:46 -0800 (Tue, 06 Nov 2007) | 1 line
  
  Disabled static assertions for compilers that don't support them.
........
  r40844 | johnmaddock | 2007-11-06 09:02:26 -0800 (Tue, 06 Nov 2007) | 1 line
  
  Still trying to get the Solaris error rates correct.
........
  r40845 | johnmaddock | 2007-11-06 09:09:33 -0800 (Tue, 06 Nov 2007) | 1 line
  
  Still trying to get those Solaris error rates correct.
........
  r40846 | anthonyw | 2007-11-06 09:15:50 -0800 (Tue, 06 Nov 2007) | 1 line
  
  use condition so we know when threads have unblocked, to avoid hard-coding a delay
........
  r40847 | johnmaddock | 2007-11-06 09:21:28 -0800 (Tue, 06 Nov 2007) | 1 line
  
  Fix for Mac OS error rates.
........
  r40848 | johnmaddock | 2007-11-06 10:32:57 -0800 (Tue, 06 Nov 2007) | 1 line
  
  Updates for new toolset Sun-5.9.
........
  r40850 | hljin | 2007-11-06 11:15:03 -0800 (Tue, 06 Nov 2007) | 1 line
  
  GIL: removed an extra semi-colon and made some cosmetic changes
........

Added:
   branches/proto/v3/boost/fusion/container/generation/
      - copied from r40850, /trunk/boost/fusion/container/generation/
   branches/proto/v3/boost/fusion/container/generation.hpp
      - copied unchanged from r40850, /trunk/boost/fusion/container/generation.hpp
   branches/proto/v3/boost/fusion/container/generation/cons_tie.hpp
      - copied unchanged from r40850, /trunk/boost/fusion/container/generation/cons_tie.hpp
   branches/proto/v3/boost/fusion/container/generation/deque_tie.hpp
      - copied unchanged from r40850, /trunk/boost/fusion/container/generation/deque_tie.hpp
   branches/proto/v3/boost/fusion/container/generation/ignore.hpp
      - copied unchanged from r40850, /trunk/boost/fusion/container/generation/ignore.hpp
   branches/proto/v3/boost/fusion/container/generation/list_tie.hpp
      - copied unchanged from r40850, /trunk/boost/fusion/container/generation/list_tie.hpp
   branches/proto/v3/boost/fusion/container/generation/make_cons.hpp
      - copied unchanged from r40850, /trunk/boost/fusion/container/generation/make_cons.hpp
   branches/proto/v3/boost/fusion/container/generation/make_deque.hpp
      - copied unchanged from r40850, /trunk/boost/fusion/container/generation/make_deque.hpp
   branches/proto/v3/boost/fusion/container/generation/make_list.hpp
      - copied unchanged from r40850, /trunk/boost/fusion/container/generation/make_list.hpp
   branches/proto/v3/boost/fusion/container/generation/make_map.hpp
      - copied unchanged from r40850, /trunk/boost/fusion/container/generation/make_map.hpp
   branches/proto/v3/boost/fusion/container/generation/make_set.hpp
      - copied unchanged from r40850, /trunk/boost/fusion/container/generation/make_set.hpp
   branches/proto/v3/boost/fusion/container/generation/make_vector.hpp
      - copied unchanged from r40850, /trunk/boost/fusion/container/generation/make_vector.hpp
   branches/proto/v3/boost/fusion/container/generation/map_tie.hpp
      - copied unchanged from r40850, /trunk/boost/fusion/container/generation/map_tie.hpp
   branches/proto/v3/boost/fusion/container/generation/pair_tie.hpp
      - copied unchanged from r40850, /trunk/boost/fusion/container/generation/pair_tie.hpp
   branches/proto/v3/boost/fusion/container/generation/vector_tie.hpp
      - copied unchanged from r40850, /trunk/boost/fusion/container/generation/vector_tie.hpp
   branches/proto/v3/libs/fusion/doc/adapted.qbk
      - copied unchanged from r40850, /trunk/libs/fusion/doc/adapted.qbk
   branches/proto/v3/libs/fusion/doc/algorithm.qbk
      - copied unchanged from r40850, /trunk/libs/fusion/doc/algorithm.qbk
   branches/proto/v3/libs/fusion/doc/container.qbk
      - copied unchanged from r40850, /trunk/libs/fusion/doc/container.qbk
   branches/proto/v3/libs/fusion/doc/html/fusion/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/
   branches/proto/v3/libs/fusion/doc/html/fusion/acknowledgements.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/acknowledgements.html
   branches/proto/v3/libs/fusion/doc/html/fusion/adapted/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/adapted/
   branches/proto/v3/libs/fusion/doc/html/fusion/adapted.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/adapted.html
   branches/proto/v3/libs/fusion/doc/html/fusion/adapted/boost__array.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/adapted/boost__array.html
   branches/proto/v3/libs/fusion/doc/html/fusion/adapted/boost__tuple.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/adapted/boost__tuple.html
   branches/proto/v3/libs/fusion/doc/html/fusion/adapted/boost__variant.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/adapted/boost__variant.html
   branches/proto/v3/libs/fusion/doc/html/fusion/adapted/mpl_sequence.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/adapted/mpl_sequence.html
   branches/proto/v3/libs/fusion/doc/html/fusion/adapted/std__pair.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/adapted/std__pair.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/iteration/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/iteration/
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/iteration.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/iteration.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/iteration/functions/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/iteration/functions/
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/iteration/functions.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/iteration/functions.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/iteration/functions/accumulate.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/iteration/functions/accumulate.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/iteration/functions/fold.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/iteration/functions/fold.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/iteration/functions/for_each.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/iteration/functions/for_each.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/iteration/metafunctions/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/iteration/metafunctions/
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/iteration/metafunctions.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/iteration/metafunctions.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/iteration/metafunctions/accumulate.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/iteration/metafunctions/accumulate.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/iteration/metafunctions/fold.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/iteration/metafunctions/fold.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/iteration/metafunctions/for_each.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/iteration/metafunctions/for_each.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/query/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/query/
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/query.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/query.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/query/functions/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/query/functions/
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/query/functions.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/query/functions.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/query/functions/all.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/query/functions/all.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/query/functions/any.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/query/functions/any.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/query/functions/count.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/query/functions/count.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/query/functions/count_if.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/query/functions/count_if.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/query/functions/find.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/query/functions/find.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/query/functions/find_if.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/query/functions/find_if.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/query/functions/none.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/query/functions/none.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/query/metafunctions/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/query/metafunctions/
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/query/metafunctions.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/query/metafunctions.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/query/metafunctions/all.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/query/metafunctions/all.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/query/metafunctions/any.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/query/metafunctions/any.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/query/metafunctions/count.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/query/metafunctions/count.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/query/metafunctions/count_if.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/query/metafunctions/count_if.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/query/metafunctions/find.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/query/metafunctions/find.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/query/metafunctions/find_if.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/query/metafunctions/find_if.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/query/metafunctions/none.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/query/metafunctions/none.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/functions/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/functions/
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/functions.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/functions.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/functions/clear.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/functions/clear.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/functions/erase.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/functions/erase.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/functions/erase_key.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/functions/erase_key.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/functions/filter.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/functions/filter.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/functions/filter_if.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/functions/filter_if.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/functions/insert.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/functions/insert.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/functions/insert_range.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/functions/insert_range.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/functions/join.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/functions/join.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/functions/pop_back.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/functions/pop_back.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/functions/pop_front.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/functions/pop_front.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/functions/push_back.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/functions/push_back.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/functions/push_front.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/functions/push_front.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/functions/remove.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/functions/remove.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/functions/remove_if.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/functions/remove_if.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/functions/replace.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/functions/replace.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/functions/replace_if.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/functions/replace_if.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/functions/reverse.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/functions/reverse.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/functions/transform.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/functions/transform.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/functions/zip.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/functions/zip.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/clear.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/clear.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/erase.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/erase.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/erase_key.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/erase_key.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/filter.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/filter.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/filter_if.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/filter_if.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/insert.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/insert.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/insert_range.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/insert_range.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/join.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/join.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/pop_back.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/pop_back.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/pop_front.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/pop_front.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/push_back.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/push_back.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/push_front.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/push_front.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/remove.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/remove.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/remove_if.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/remove_if.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/replace.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/replace.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/replace_if.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/replace_if.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/reverse.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/reverse.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/transform.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/transform.html
   branches/proto/v3/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/zip.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/zip.html
   branches/proto/v3/libs/fusion/doc/html/fusion/change_log.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/change_log.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/container/
   branches/proto/v3/libs/fusion/doc/html/fusion/container.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/cons.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/cons.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/conversion/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/container/conversion/
   branches/proto/v3/libs/fusion/doc/html/fusion/container/conversion.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/conversion.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/conversion/functions/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/container/conversion/functions/
   branches/proto/v3/libs/fusion/doc/html/fusion/container/conversion/functions.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/conversion/functions.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/conversion/functions/as_list.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/conversion/functions/as_list.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/conversion/functions/as_map.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/conversion/functions/as_map.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/conversion/functions/as_set.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/conversion/functions/as_set.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/conversion/functions/as_vector.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/conversion/functions/as_vector.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/conversion/metafunctions/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/container/conversion/metafunctions/
   branches/proto/v3/libs/fusion/doc/html/fusion/container/conversion/metafunctions.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/conversion/metafunctions.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/conversion/metafunctions/as_list.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/conversion/metafunctions/as_list.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/conversion/metafunctions/as_map.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/conversion/metafunctions/as_map.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/conversion/metafunctions/as_set.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/conversion/metafunctions/as_set.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/conversion/metafunctions/as_vector.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/conversion/metafunctions/as_vector.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/generation/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/container/generation/
   branches/proto/v3/libs/fusion/doc/html/fusion/container/generation.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/generation.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/generation/functions/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/container/generation/functions/
   branches/proto/v3/libs/fusion/doc/html/fusion/container/generation/functions.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/generation/functions.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/generation/functions/list_tie.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/generation/functions/list_tie.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/generation/functions/make_cons.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/generation/functions/make_cons.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/generation/functions/make_list.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/generation/functions/make_list.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/generation/functions/make_map.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/generation/functions/make_map.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/generation/functions/make_set.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/generation/functions/make_set.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/generation/functions/make_vector.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/generation/functions/make_vector.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/generation/functions/map_tie.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/generation/functions/map_tie.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/generation/functions/tiers.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/generation/functions/tiers.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/generation/functions/vector_tie.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/generation/functions/vector_tie.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/generation/metafunctions/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/container/generation/metafunctions/
   branches/proto/v3/libs/fusion/doc/html/fusion/container/generation/metafunctions.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/generation/metafunctions.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/generation/metafunctions/list_tie.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/generation/metafunctions/list_tie.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/generation/metafunctions/make_cons.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/generation/metafunctions/make_cons.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/generation/metafunctions/make_list.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/generation/metafunctions/make_list.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/generation/metafunctions/make_map.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/generation/metafunctions/make_map.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/generation/metafunctions/make_set.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/generation/metafunctions/make_set.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/generation/metafunctions/make_vector.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/generation/metafunctions/make_vector.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/generation/metafunctions/map_tie.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/generation/metafunctions/map_tie.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/generation/metafunctions/vector_tie.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/generation/metafunctions/vector_tie.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/list.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/list.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/map.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/map.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/set.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/set.html
   branches/proto/v3/libs/fusion/doc/html/fusion/container/vector.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/container/vector.html
   branches/proto/v3/libs/fusion/doc/html/fusion/extension/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/extension/
   branches/proto/v3/libs/fusion/doc/html/fusion/extension.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/extension.html
   branches/proto/v3/libs/fusion/doc/html/fusion/extension/ext_full.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/extension/ext_full.html
   branches/proto/v3/libs/fusion/doc/html/fusion/extension/iterator_facade.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/extension/iterator_facade.html
   branches/proto/v3/libs/fusion/doc/html/fusion/extension/macros/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/extension/macros/
   branches/proto/v3/libs/fusion/doc/html/fusion/extension/macros.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/extension/macros.html
   branches/proto/v3/libs/fusion/doc/html/fusion/extension/macros/adapt_assoc.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/extension/macros/adapt_assoc.html
   branches/proto/v3/libs/fusion/doc/html/fusion/extension/macros/adapt_struct.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/extension/macros/adapt_struct.html
   branches/proto/v3/libs/fusion/doc/html/fusion/extension/sequence_facade.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/extension/sequence_facade.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/functional/
   branches/proto/v3/libs/fusion/doc/html/fusion/functional.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/adapters/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/functional/adapters/
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/adapters.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/adapters.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/adapters/fused.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/adapters/fused.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/adapters/fused_function_object.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/adapters/fused_function_object.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/adapters/fused_procedure.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/adapters/fused_procedure.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/adapters/unfused_generic.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/adapters/unfused_generic.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/adapters/unfused_lvalue_args.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/adapters/unfused_lvalue_args.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/adapters/unfused_rvalue_args.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/adapters/unfused_rvalue_args.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/adapters/unfused_typed.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/adapters/unfused_typed.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/concepts/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/functional/concepts/
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/concepts.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/concepts.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/concepts/callable.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/concepts/callable.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/concepts/def_callable.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/concepts/def_callable.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/concepts/poly.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/concepts/poly.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/concepts/reg_callable.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/concepts/reg_callable.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/generation/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/functional/generation/
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/generation.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/generation.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/generation/functions/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/functional/generation/functions/
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/generation/functions.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/generation/functions.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/generation/functions/mk_fused.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/generation/functions/mk_fused.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/generation/functions/mk_fused_fobj.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/generation/functions/mk_fused_fobj.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/generation/functions/mk_fused_proc.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/generation/functions/mk_fused_proc.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/generation/functions/mk_unfused_genrc.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/generation/functions/mk_unfused_genrc.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/generation/functions/mk_unfused_lvargs.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/generation/functions/mk_unfused_lvargs.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/generation/functions/mk_unfused_rvargs.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/generation/functions/mk_unfused_rvargs.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/generation/metafunctions/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/functional/generation/metafunctions/
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/generation/metafunctions.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/generation/metafunctions.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/generation/metafunctions/mk_fused.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/generation/metafunctions/mk_fused.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/generation/metafunctions/mk_fused_fobj.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/generation/metafunctions/mk_fused_fobj.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/generation/metafunctions/mk_fused_proc.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/generation/metafunctions/mk_fused_proc.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/generation/metafunctions/mk_unfused_genrc.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/generation/metafunctions/mk_unfused_genrc.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/generation/metafunctions/mk_unfused_lvargs.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/generation/metafunctions/mk_unfused_lvargs.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/generation/metafunctions/mk_unfused_rvargs.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/generation/metafunctions/mk_unfused_rvargs.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/invocation/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/functional/invocation/
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/invocation.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/invocation.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/invocation/functions/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/functional/invocation/functions/
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/invocation/functions.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/invocation/functions.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/invocation/functions/invoke.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/invocation/functions/invoke.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/invocation/functions/invoke_fobj.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/invocation/functions/invoke_fobj.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/invocation/functions/invoke_proc.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/invocation/functions/invoke_proc.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/invocation/metafunctions/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/functional/invocation/metafunctions/
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/invocation/metafunctions.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/invocation/metafunctions.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/invocation/metafunctions/invoke.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/invocation/metafunctions/invoke.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/invocation/metafunctions/invoke_fobj.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/invocation/metafunctions/invoke_fobj.html
   branches/proto/v3/libs/fusion/doc/html/fusion/functional/invocation/metafunctions/invoke_proc.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/functional/invocation/metafunctions/invoke_proc.html
   branches/proto/v3/libs/fusion/doc/html/fusion/introduction.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/introduction.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/concepts/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/concepts/
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/concepts.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/concepts.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/concepts/bidirectional_iterator.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/concepts/bidirectional_iterator.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/concepts/forward_iterator.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/concepts/forward_iterator.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/concepts/random_access_iterator.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/concepts/random_access_iterator.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/functions/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/functions/
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/functions.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/functions.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/functions/advance.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/functions/advance.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/functions/advance_c.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/functions/advance_c.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/functions/deref.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/functions/deref.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/functions/distance.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/functions/distance.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/functions/next.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/functions/next.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/functions/prior.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/functions/prior.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/metafunctions/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/metafunctions/
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/metafunctions.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/metafunctions.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/metafunctions/advance.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/metafunctions/advance.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/metafunctions/advance_c.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/metafunctions/advance_c.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/metafunctions/deref.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/metafunctions/deref.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/metafunctions/distance.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/metafunctions/distance.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/metafunctions/equal_to.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/metafunctions/equal_to.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/metafunctions/next.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/metafunctions/next.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/metafunctions/prior.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/metafunctions/prior.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/metafunctions/value_of.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/metafunctions/value_of.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/operator/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/operator/
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/operator.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/operator.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/operator/operator_equality.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/operator/operator_equality.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/operator/operator_inequality.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/operator/operator_inequality.html
   branches/proto/v3/libs/fusion/doc/html/fusion/iterator/operator/operator_unary_star.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/iterator/operator/operator_unary_star.html
   branches/proto/v3/libs/fusion/doc/html/fusion/notes.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/notes.html
   branches/proto/v3/libs/fusion/doc/html/fusion/organization.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/organization.html
   branches/proto/v3/libs/fusion/doc/html/fusion/preface.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/preface.html
   branches/proto/v3/libs/fusion/doc/html/fusion/quick_start.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/quick_start.html
   branches/proto/v3/libs/fusion/doc/html/fusion/references.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/references.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/concepts/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/concepts/
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/concepts.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/concepts.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/concepts/associative_sequence.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/concepts/associative_sequence.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/concepts/bidirectional_sequence.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/concepts/bidirectional_sequence.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/concepts/forward_sequence.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/concepts/forward_sequence.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/concepts/random_access_sequence.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/concepts/random_access_sequence.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/functions/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/functions/
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/functions.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/functions.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/functions/at.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/functions/at.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/functions/at_c.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/functions/at_c.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/functions/at_key.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/functions/at_key.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/functions/back.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/functions/back.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/functions/begin.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/functions/begin.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/functions/empty.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/functions/empty.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/functions/end.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/functions/end.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/functions/front.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/functions/front.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/functions/has_key.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/functions/has_key.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/functions/size.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/functions/size.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/functions/swap.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/functions/swap.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/at.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/at.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/at_c.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/at_c.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/at_key.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/at_key.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/back.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/back.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/begin.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/begin.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/empty.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/empty.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/end.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/end.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/front.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/front.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/has_key.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/has_key.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/size.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/size.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/swap.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/swap.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/value_at.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/value_at.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/value_at_c.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/value_at_c.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/value_at_key.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/intrinsic/metafunctions/value_at_key.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/operator/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/operator/
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/operator.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/operator.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/operator/comparison/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/operator/comparison/
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/operator/comparison.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/operator/comparison.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/operator/comparison/equal.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/operator/comparison/equal.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/operator/comparison/greater_than.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/operator/comparison/greater_than.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/operator/comparison/greater_than_equal.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/operator/comparison/greater_than_equal.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/operator/comparison/less_than.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/operator/comparison/less_than.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/operator/comparison/less_than_equal.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/operator/comparison/less_than_equal.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/operator/comparison/not_equal.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/operator/comparison/not_equal.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/operator/i_o/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/operator/i_o/
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/operator/i_o.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/operator/i_o.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/operator/i_o/in.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/operator/i_o/in.html
   branches/proto/v3/libs/fusion/doc/html/fusion/sequence/operator/i_o/out.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/sequence/operator/i_o/out.html
   branches/proto/v3/libs/fusion/doc/html/fusion/support/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/support/
   branches/proto/v3/libs/fusion/doc/html/fusion/support.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/support.html
   branches/proto/v3/libs/fusion/doc/html/fusion/support/category_of.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/support/category_of.html
   branches/proto/v3/libs/fusion/doc/html/fusion/support/deduce.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/support/deduce.html
   branches/proto/v3/libs/fusion/doc/html/fusion/support/deduce_sequence.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/support/deduce_sequence.html
   branches/proto/v3/libs/fusion/doc/html/fusion/support/is_sequence.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/support/is_sequence.html
   branches/proto/v3/libs/fusion/doc/html/fusion/support/is_view.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/support/is_view.html
   branches/proto/v3/libs/fusion/doc/html/fusion/support/pair.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/support/pair.html
   branches/proto/v3/libs/fusion/doc/html/fusion/support/tag_of.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/support/tag_of.html
   branches/proto/v3/libs/fusion/doc/html/fusion/tuple/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/tuple/
   branches/proto/v3/libs/fusion/doc/html/fusion/tuple.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/tuple.html
   branches/proto/v3/libs/fusion/doc/html/fusion/tuple/class_template_tuple/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/tuple/class_template_tuple/
   branches/proto/v3/libs/fusion/doc/html/fusion/tuple/class_template_tuple.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/tuple/class_template_tuple.html
   branches/proto/v3/libs/fusion/doc/html/fusion/tuple/class_template_tuple/construction.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/tuple/class_template_tuple/construction.html
   branches/proto/v3/libs/fusion/doc/html/fusion/tuple/class_template_tuple/element_access.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/tuple/class_template_tuple/element_access.html
   branches/proto/v3/libs/fusion/doc/html/fusion/tuple/class_template_tuple/relational_operators.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/tuple/class_template_tuple/relational_operators.html
   branches/proto/v3/libs/fusion/doc/html/fusion/tuple/class_template_tuple/tuple_creation_functions.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/tuple/class_template_tuple/tuple_creation_functions.html
   branches/proto/v3/libs/fusion/doc/html/fusion/tuple/class_template_tuple/tuple_helper_classes.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/tuple/class_template_tuple/tuple_helper_classes.html
   branches/proto/v3/libs/fusion/doc/html/fusion/tuple/pairs.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/tuple/pairs.html
   branches/proto/v3/libs/fusion/doc/html/fusion/view/
      - copied from r40850, /trunk/libs/fusion/doc/html/fusion/view/
   branches/proto/v3/libs/fusion/doc/html/fusion/view.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/view.html
   branches/proto/v3/libs/fusion/doc/html/fusion/view/filter_view.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/view/filter_view.html
   branches/proto/v3/libs/fusion/doc/html/fusion/view/iterator_range.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/view/iterator_range.html
   branches/proto/v3/libs/fusion/doc/html/fusion/view/joint_view.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/view/joint_view.html
   branches/proto/v3/libs/fusion/doc/html/fusion/view/reverse_view.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/view/reverse_view.html
   branches/proto/v3/libs/fusion/doc/html/fusion/view/single_view.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/view/single_view.html
   branches/proto/v3/libs/fusion/doc/html/fusion/view/transform_view.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/view/transform_view.html
   branches/proto/v3/libs/fusion/doc/html/fusion/view/zip_view.html
      - copied unchanged from r40850, /trunk/libs/fusion/doc/html/fusion/view/zip_view.html
   branches/proto/v3/libs/fusion/doc/iterator.qbk
      - copied unchanged from r40850, /trunk/libs/fusion/doc/iterator.qbk
   branches/proto/v3/libs/fusion/doc/sequence.qbk
      - copied unchanged from r40850, /trunk/libs/fusion/doc/sequence.qbk
   branches/proto/v3/libs/fusion/doc/tuple.qbk
      - copied unchanged from r40850, /trunk/libs/fusion/doc/tuple.qbk
   branches/proto/v3/libs/fusion/doc/view.qbk
      - copied unchanged from r40850, /trunk/libs/fusion/doc/view.qbk
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_1000_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_1000_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_1000_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_1000_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_1000_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_1000_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_1000_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_1000_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_1000_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_1000_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_1000_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_1000_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_1000_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_1000_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_1000_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_1000_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_1000_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_1000_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_1000_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_1000_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_10.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_10.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_100.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_100.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_1000.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_1000.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_100_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_100_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_100_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_100_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_100_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_100_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_100_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_100_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_100_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_100_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_100_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_100_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_100_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_100_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_100_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_100_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_100_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_100_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_100_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_100_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_10_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_10_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_10_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_10_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_10_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_10_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_10_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_10_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_10_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_10_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_10_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_10_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_10_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_10_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_10_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_10_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_10_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_10_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_10_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_10_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_11.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_11.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_11_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_11_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_11_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_11_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_11_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_11_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_11_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_11_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_11_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_11_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_11_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_11_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_11_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_11_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_11_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_11_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_11_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_11_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_11_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_11_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_12.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_12.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_12_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_12_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_12_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_12_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_12_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_12_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_12_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_12_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_12_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_12_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_12_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_12_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_12_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_12_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_12_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_12_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_12_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_12_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_12_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_12_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_13.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_13.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_13_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_13_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_13_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_13_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_13_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_13_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_13_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_13_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_13_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_13_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_13_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_13_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_13_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_13_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_13_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_13_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_13_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_13_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_13_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_13_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_14.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_14.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_14_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_14_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_14_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_14_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_14_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_14_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_14_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_14_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_14_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_14_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_14_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_14_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_14_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_14_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_14_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_14_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_14_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_14_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_14_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_14_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_15.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_15.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_15_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_15_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_15_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_15_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_15_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_15_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_15_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_15_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_15_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_15_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_15_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_15_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_15_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_15_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_15_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_15_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_15_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_15_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_15_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_15_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_16.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_16.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_16_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_16_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_16_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_16_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_16_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_16_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_16_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_16_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_16_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_16_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_16_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_16_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_16_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_16_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_16_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_16_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_16_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_16_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_16_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_16_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_17.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_17.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_17_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_17_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_17_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_17_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_17_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_17_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_17_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_17_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_17_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_17_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_17_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_17_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_17_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_17_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_17_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_17_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_17_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_17_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_17_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_17_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_18.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_18.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_18_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_18_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_18_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_18_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_18_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_18_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_18_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_18_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_18_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_18_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_18_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_18_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_18_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_18_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_18_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_18_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_18_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_18_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_18_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_18_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_19.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_19.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_19_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_19_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_19_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_19_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_19_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_19_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_19_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_19_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_19_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_19_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_19_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_19_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_19_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_19_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_19_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_19_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_19_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_19_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_19_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_19_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_20.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_20.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_20_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_20_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_20_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_20_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_20_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_20_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_20_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_20_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_20_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_20_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_20_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_20_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_20_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_20_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_20_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_20_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_20_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_20_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_20_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_20_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_30.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_30.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_30_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_30_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_30_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_30_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_30_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_30_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_30_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_30_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_30_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_30_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_30_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_30_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_30_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_30_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_30_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_30_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_30_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_30_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_30_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_30_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_40.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_40.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_40_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_40_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_40_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_40_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_40_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_40_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_40_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_40_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_40_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_40_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_40_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_40_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_40_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_40_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_40_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_40_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_40_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_40_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_40_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_40_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_50.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_50.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_50_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_50_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_50_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_50_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_50_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_50_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_50_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_50_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_50_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_50_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_50_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_50_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_50_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_50_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_50_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_50_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_50_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_50_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_50_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_50_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_7_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_7_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_7_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_7_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_7_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_7_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_7_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_7_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_7_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_7_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_7_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_7_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_7_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_7_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_7_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_7_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_7_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_7_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_7_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_7_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_8_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_8_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_8_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_8_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_8_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_8_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_8_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_8_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_8_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_8_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_8_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_8_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_8_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_8_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_8_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_8_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_8_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_8_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_8_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_8_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_9_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_9_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_9_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_9_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_9_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_9_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_9_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_9_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_9_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_9_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_9_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_9_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_9_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_9_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_9_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_9_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_9_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_9_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_9_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_3_3_e_9_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_10.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_10.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_100.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_100.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_100_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_100_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_100_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_100_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_100_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_100_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_100_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_100_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_100_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_100_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_100_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_100_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_100_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_100_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_100_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_100_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_100_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_100_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_100_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_100_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_10_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_10_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_10_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_10_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_10_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_10_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_10_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_10_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_10_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_10_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_10_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_10_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_10_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_10_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_10_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_10_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_10_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_10_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_10_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_10_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_11.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_11.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_11_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_11_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_11_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_11_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_11_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_11_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_11_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_11_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_11_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_11_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_11_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_11_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_11_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_11_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_11_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_11_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_11_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_11_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_11_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_11_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_12.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_12.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_12_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_12_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_12_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_12_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_12_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_12_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_12_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_12_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_12_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_12_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_12_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_12_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_12_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_12_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_12_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_12_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_12_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_12_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_12_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_12_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_13.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_13.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_13_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_13_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_13_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_13_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_13_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_13_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_13_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_13_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_13_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_13_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_13_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_13_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_13_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_13_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_13_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_13_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_13_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_13_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_13_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_13_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_14.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_14.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_14_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_14_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_14_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_14_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_14_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_14_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_14_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_14_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_14_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_14_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_14_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_14_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_14_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_14_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_14_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_14_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_14_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_14_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_14_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_14_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_15.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_15.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_15_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_15_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_15_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_15_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_15_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_15_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_15_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_15_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_15_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_15_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_15_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_15_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_15_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_15_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_15_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_15_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_15_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_15_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_15_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_15_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_16.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_16.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_16_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_16_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_16_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_16_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_16_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_16_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_16_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_16_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_16_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_16_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_16_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_16_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_16_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_16_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_16_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_16_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_16_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_16_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_16_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_16_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_17.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_17.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_17_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_17_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_17_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_17_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_17_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_17_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_17_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_17_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_17_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_17_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_17_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_17_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_17_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_17_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_17_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_17_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_17_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_17_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_17_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_17_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_18.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_18.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_18_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_18_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_18_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_18_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_18_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_18_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_18_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_18_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_18_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_18_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_18_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_18_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_18_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_18_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_18_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_18_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_18_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_18_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_18_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_18_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_19.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_19.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_19_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_19_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_19_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_19_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_19_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_19_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_19_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_19_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_19_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_19_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_19_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_19_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_19_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_19_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_19_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_19_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_19_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_19_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_19_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_19_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_20.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_20.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_20_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_20_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_20_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_20_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_20_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_20_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_20_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_20_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_20_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_20_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_20_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_20_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_20_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_20_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_20_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_20_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_20_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_20_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_20_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_20_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_30.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_30.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_30_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_30_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_30_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_30_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_30_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_30_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_30_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_30_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_30_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_30_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_30_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_30_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_30_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_30_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_30_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_30_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_30_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_30_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_30_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_30_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_40.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_40.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_40_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_40_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_40_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_40_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_40_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_40_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_40_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_40_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_40_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_40_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_40_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_40_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_40_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_40_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_40_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_40_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_40_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_40_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_40_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_40_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_50.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_50.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_50_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_50_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_50_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_50_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_50_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_50_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_50_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_50_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_50_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_50_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_50_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_50_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_50_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_50_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_50_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_50_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_50_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_50_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_50_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_50_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_6_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_6_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_6_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_6_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_6_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_6_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_6_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_6_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_6_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_6_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_6_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_6_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_6_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_6_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_6_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_6_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_6_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_6_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_6_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_6_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_7_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_7_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_7_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_7_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_7_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_7_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_7_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_7_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_7_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_7_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_7_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_7_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_7_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_7_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_7_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_7_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_7_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_7_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_7_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_7_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_8_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_8_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_8_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_8_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_8_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_8_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_8_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_8_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_8_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_8_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_8_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_8_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_8_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_8_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_8_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_8_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_8_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_8_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_8_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_8_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_9_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_9_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_9_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_9_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_9_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_9_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_9_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_9_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_9_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_9_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_9_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_9_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_9_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_9_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_9_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_9_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_9_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_9_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_9_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_K_5_e_9_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_case_B_sc.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_case_B_sc.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_case_B_scl.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_case_B_scl.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_case_B_z_w.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_case_B_z_w.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_10.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_10.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_100.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_100.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_100_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_100_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_100_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_100_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_100_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_100_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_100_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_100_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_100_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_100_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_100_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_100_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_100_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_100_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_100_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_100_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_100_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_100_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_100_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_100_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_10_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_10_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_10_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_10_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_10_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_10_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_10_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_10_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_10_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_10_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_10_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_10_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_10_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_10_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_10_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_10_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_10_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_10_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_10_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_10_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_30.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_30.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_30_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_30_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_30_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_30_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_30_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_30_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_30_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_30_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_30_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_30_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_30_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_30_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_30_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_30_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_30_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_30_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_30_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_30_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_30_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_30_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_50.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_50.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_50_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_50_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_50_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_50_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_50_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_50_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_50_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_50_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_50_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_50_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_50_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_50_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_50_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_50_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_50_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_50_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_50_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_50_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_mpo_50_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_mpo_50_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_rot_case_D.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_rot_case_D.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/nonplanar_twisted_sc.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/nonplanar_twisted_sc.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_a.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_a.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_a_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_a_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_a_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_a_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_a_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_a_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_a_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_a_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_a_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_a_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_a_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_a_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_a_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_a_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_a_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_a_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_a_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_a_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_a_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_a_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_b.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_b.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_b_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_b_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_b_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_b_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_b_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_b_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_b_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_b_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_b_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_b_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_b_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_b_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_b_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_b_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_b_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_b_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_b_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_b_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_b_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_b_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_c.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_c.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_c_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_c_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_c_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_c_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_c_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_c_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_c_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_c_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_c_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_c_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_c_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_c_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_c_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_c_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_c_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_c_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_c_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_c_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_c_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_c_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_d.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_d.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_d_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_d_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_d_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_d_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_d_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_d_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_d_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_d_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_d_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_d_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_d_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_d_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_d_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_d_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_d_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_d_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_d_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_d_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_d_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_d_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_e.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_e.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_e_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_e_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_e_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_e_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_e_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_e_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_e_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_e_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_e_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_e_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_e_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_e_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_e_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_e_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_e_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_e_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_e_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_e_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_5_con_cycles_e_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_5_con_cycles_e_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_1_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_1_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_1_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_1_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_1_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_1_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_1_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_1_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_1_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_1_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_1_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_1_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_1_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_1_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_1_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_1_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_1_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_1_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_1_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_1_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_2_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_2_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_2_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_2_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_2_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_2_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_2_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_2_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_2_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_2_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_2_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_2_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_2_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_2_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_2_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_2_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_2_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_2_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_2_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_2_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_3_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_3_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_3_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_3_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_3_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_3_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_3_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_3_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_3_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_3_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_3_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_3_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_3_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_3_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_3_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_3_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_3_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_3_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_3_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_3_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_5_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_5_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_5_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_5_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_5_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_5_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_5_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_5_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_5_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_5_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_5_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_5_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_5_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_5_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_5_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_5_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_5_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_5_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_5_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_5_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_6_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_6_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_6_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_6_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_6_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_6_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_6_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_6_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_6_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_6_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_6_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_6_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_6_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_6_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_6_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_6_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_6_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_6_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_6_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_6_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_7_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_7_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_7_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_7_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_7_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_7_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_7_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_7_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_7_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_7_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_7_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_7_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_7_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_7_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_7_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_7_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_7_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_7_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_7_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_7_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_8_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_8_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_8_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_8_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_8_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_8_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_8_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_8_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_8_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_8_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_8_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_8_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_8_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_8_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_8_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_8_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_8_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_8_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_8_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_8_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_9_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_9_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_9_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_9_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_9_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_9_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_9_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_9_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_9_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_9_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_9_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_9_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_9_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_9_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_9_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_9_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_9_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_9_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_9_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_3_3_sub_9_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_10.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_10.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_100.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_100.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_100_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_100_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_100_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_100_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_100_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_100_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_100_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_100_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_100_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_100_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_100_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_100_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_100_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_100_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_100_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_100_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_100_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_100_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_100_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_100_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_10_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_10_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_10_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_10_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_10_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_10_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_10_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_10_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_10_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_10_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_10_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_10_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_10_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_10_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_10_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_10_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_10_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_10_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_10_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_10_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_11.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_11.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_11_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_11_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_11_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_11_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_11_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_11_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_11_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_11_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_11_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_11_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_11_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_11_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_11_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_11_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_11_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_11_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_11_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_11_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_11_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_11_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_12.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_12.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_12_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_12_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_12_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_12_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_12_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_12_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_12_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_12_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_12_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_12_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_12_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_12_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_12_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_12_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_12_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_12_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_12_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_12_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_12_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_12_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_13.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_13.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_13_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_13_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_13_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_13_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_13_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_13_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_13_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_13_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_13_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_13_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_13_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_13_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_13_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_13_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_13_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_13_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_13_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_13_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_13_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_13_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_14.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_14.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_14_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_14_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_14_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_14_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_14_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_14_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_14_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_14_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_14_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_14_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_14_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_14_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_14_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_14_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_14_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_14_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_14_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_14_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_14_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_14_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_15.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_15.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_15_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_15_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_15_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_15_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_15_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_15_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_15_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_15_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_15_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_15_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_15_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_15_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_15_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_15_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_15_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_15_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_15_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_15_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_15_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_15_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_16.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_16.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_16_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_16_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_16_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_16_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_16_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_16_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_16_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_16_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_16_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_16_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_16_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_16_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_16_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_16_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_16_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_16_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_16_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_16_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_16_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_16_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_17.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_17.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_17_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_17_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_17_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_17_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_17_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_17_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_17_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_17_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_17_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_17_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_17_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_17_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_17_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_17_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_17_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_17_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_17_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_17_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_17_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_17_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_18.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_18.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_18_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_18_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_18_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_18_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_18_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_18_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_18_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_18_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_18_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_18_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_18_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_18_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_18_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_18_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_18_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_18_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_18_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_18_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_18_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_18_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_19.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_19.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_19_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_19_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_19_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_19_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_19_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_19_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_19_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_19_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_19_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_19_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_19_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_19_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_19_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_19_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_19_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_19_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_19_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_19_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_19_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_19_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_20.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_20.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_20_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_20_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_20_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_20_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_20_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_20_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_20_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_20_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_20_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_20_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_20_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_20_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_20_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_20_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_20_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_20_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_20_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_20_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_20_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_20_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_21.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_21.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_21_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_21_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_21_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_21_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_21_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_21_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_21_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_21_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_21_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_21_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_21_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_21_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_21_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_21_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_21_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_21_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_21_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_21_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_21_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_21_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_25.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_25.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_25_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_25_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_25_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_25_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_25_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_25_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_25_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_25_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_25_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_25_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_25_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_25_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_25_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_25_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_25_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_25_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_25_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_25_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_25_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_25_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_30.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_30.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_30_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_30_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_30_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_30_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_30_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_30_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_30_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_30_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_30_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_30_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_30_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_30_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_30_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_30_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_30_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_30_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_30_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_30_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_30_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_30_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_50.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_50.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_50_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_50_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_50_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_50_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_50_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_50_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_50_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_50_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_50_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_50_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_50_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_50_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_50_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_50_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_50_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_50_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_50_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_50_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_50_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_50_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_5_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_5_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_5_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_5_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_5_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_5_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_5_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_5_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_5_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_5_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_5_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_5_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_5_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_5_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_5_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_5_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_5_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_5_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_5_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_5_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_6_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_6_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_6_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_6_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_6_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_6_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_6_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_6_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_6_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_6_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_6_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_6_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_6_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_6_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_6_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_6_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_6_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_6_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_6_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_6_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_7_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_7_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_7_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_7_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_7_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_7_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_7_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_7_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_7_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_7_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_7_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_7_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_7_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_7_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_7_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_7_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_7_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_7_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_7_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_7_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_8_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_8_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_8_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_8_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_8_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_8_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_8_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_8_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_8_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_8_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_8_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_8_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_8_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_8_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_8_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_8_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_8_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_8_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_8_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_8_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_9_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_9_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_9_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_9_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_9_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_9_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_9_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_9_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_9_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_9_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_9_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_9_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_9_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_9_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_9_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_9_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_9_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_9_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_4_e_9_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_4_e_9_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_10.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_10.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_10_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_10_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_10_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_10_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_10_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_10_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_10_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_10_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_10_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_10_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_10_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_10_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_10_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_10_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_10_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_10_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_10_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_10_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_10_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_10_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_1_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_1_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_1_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_1_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_1_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_1_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_1_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_1_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_1_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_1_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_1_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_1_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_1_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_1_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_1_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_1_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_1_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_1_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_1_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_1_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_2_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_2_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_2_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_2_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_2_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_2_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_2_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_2_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_2_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_2_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_2_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_2_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_2_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_2_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_2_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_2_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_2_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_2_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_2_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_2_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_3_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_3_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_3_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_3_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_3_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_3_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_3_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_3_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_3_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_3_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_3_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_3_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_3_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_3_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_3_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_3_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_3_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_3_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_3_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_3_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_4_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_4_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_4_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_4_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_4_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_4_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_4_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_4_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_4_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_4_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_4_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_4_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_4_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_4_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_4_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_4_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_4_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_4_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_4_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_4_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_5_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_5_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_5_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_5_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_5_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_5_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_5_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_5_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_5_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_5_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_5_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_5_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_5_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_5_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_5_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_5_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_5_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_5_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_5_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_5_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_6_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_6_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_6_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_6_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_6_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_6_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_6_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_6_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_6_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_6_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_6_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_6_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_6_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_6_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_6_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_6_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_6_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_6_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_6_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_6_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_7_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_7_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_7_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_7_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_7_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_7_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_7_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_7_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_7_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_7_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_7_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_7_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_7_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_7_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_7_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_7_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_7_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_7_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_7_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_7_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_8_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_8_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_8_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_8_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_8_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_8_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_8_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_8_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_8_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_8_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_8_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_8_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_8_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_8_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_8_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_8_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_8_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_8_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_8_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_8_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_9_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_9_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_9_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_9_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_9_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_9_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_9_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_9_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_9_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_9_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_9_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_9_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_9_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_9_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_9_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_9_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_9_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_9_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_K_5_sub_9_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_K_5_sub_9_p9.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_non_bicon_1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_non_bicon_1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_non_bicon_2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_non_bicon_2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_non_con.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_non_con.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_non_con_p0.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_non_con_p0.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_non_con_p1.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_non_con_p1.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_non_con_p2.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_non_con_p2.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_non_con_p3.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_non_con_p3.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_non_con_p4.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_non_con_p4.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_non_con_p5.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_non_con_p5.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_non_con_p6.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_non_con_p6.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_non_con_p7.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_non_con_p7.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_non_con_p8.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_non_con_p8.dimacs
   branches/proto/v3/libs/graph/test/planar_input_graphs/planar_non_con_p9.dimacs
      - copied unchanged from r40850, /trunk/libs/graph/test/planar_input_graphs/planar_non_con_p9.dimacs
Removed:
   branches/proto/v3/boost/fusion/sequence/generation/
   branches/proto/v3/boost/fusion/sequence/generation.hpp
   branches/proto/v3/libs/fusion/doc/algorithms.qbk
   branches/proto/v3/libs/fusion/doc/iterators.qbk
   branches/proto/v3/libs/fusion/doc/sequences.qbk
   branches/proto/v3/libs/fusion/doc/tuples.qbk
Properties modified: 
   branches/proto/v3/   (props changed)
Text files modified: 
   branches/proto/v3/boost/fusion/container.hpp                                 |     3                                         
   branches/proto/v3/boost/fusion/include/cons_tie.hpp                          |     2                                         
   branches/proto/v3/boost/fusion/include/deque_tie.hpp                         |     2                                         
   branches/proto/v3/boost/fusion/include/generation.hpp                        |     2                                         
   branches/proto/v3/boost/fusion/include/ignore.hpp                            |     2                                         
   branches/proto/v3/boost/fusion/include/list_tie.hpp                          |     2                                         
   branches/proto/v3/boost/fusion/include/make_cons.hpp                         |     2                                         
   branches/proto/v3/boost/fusion/include/make_deque.hpp                        |     2                                         
   branches/proto/v3/boost/fusion/include/make_list.hpp                         |     2                                         
   branches/proto/v3/boost/fusion/include/make_map.hpp                          |     2                                         
   branches/proto/v3/boost/fusion/include/make_set.hpp                          |     2                                         
   branches/proto/v3/boost/fusion/include/make_vector.hpp                       |     2                                         
   branches/proto/v3/boost/fusion/include/map_tie.hpp                           |     2                                         
   branches/proto/v3/boost/fusion/include/pair_tie.hpp                          |     2                                         
   branches/proto/v3/boost/fusion/include/vector_tie.hpp                        |     2                                         
   branches/proto/v3/boost/fusion/sequence.hpp                                  |     1                                         
   branches/proto/v3/boost/fusion/tuple.hpp                                     |     2                                         
   branches/proto/v3/boost/fusion/view/ext_/segmented_iterator.hpp              |     2                                         
   branches/proto/v3/boost/gil/extension/dynamic_image/apply_operation_base.hpp |    12                                         
   branches/proto/v3/boost/gil/image_view_factory.hpp                           |     6                                         
   branches/proto/v3/boost/interprocess/detail/config_begin.hpp                 |     2                                         
   branches/proto/v3/boost/interprocess/mapped_region.hpp                       |     2                                         
   branches/proto/v3/boost/lexical_cast.hpp                                     |     6                                         
   branches/proto/v3/boost/math/distributions/find_scale.hpp                    |     4                                         
   branches/proto/v3/boost/spirit/core/primitives/impl/numerics.ipp             |    95 ++++++---                               
   branches/proto/v3/doc/Jamfile.v2                                             |     5                                         
   branches/proto/v3/libs/config/test/link/test/Jamfile.v2                      |     4                                         
   branches/proto/v3/libs/disjoint_sets/Jamfile                                 |     4                                         
   branches/proto/v3/libs/dynamic_bitset/Jamfile.v2                             |     6                                         
   branches/proto/v3/libs/format/benchmark/Jamfile                              |     6                                         
   branches/proto/v3/libs/fusion/doc/extension.qbk                              |    70 +++---                                  
   branches/proto/v3/libs/fusion/doc/functional.qbk                             |    45 ++--                                    
   branches/proto/v3/libs/fusion/doc/fusion.qbk                                 |   379 ++++++++++++++++++++------------------- 
   branches/proto/v3/libs/fusion/doc/html/index.html                            |   189 ++++++++++--------                      
   branches/proto/v3/libs/fusion/doc/organization.qbk                           |    84 +++++---                                
   branches/proto/v3/libs/fusion/doc/quick_start.qbk                            |     4                                         
   branches/proto/v3/libs/fusion/doc/support.qbk                                |     7                                         
   branches/proto/v3/libs/fusion/test/algorithm/clear.cpp                       |     2                                         
   branches/proto/v3/libs/fusion/test/algorithm/erase.cpp                       |     2                                         
   branches/proto/v3/libs/fusion/test/algorithm/erase_key.cpp                   |     6                                         
   branches/proto/v3/libs/fusion/test/algorithm/ext_/find_if_s.cpp              |     2                                         
   branches/proto/v3/libs/fusion/test/algorithm/ext_/for_each_s.cpp             |     2                                         
   branches/proto/v3/libs/fusion/test/algorithm/filter.cpp                      |     2                                         
   branches/proto/v3/libs/fusion/test/algorithm/filter_if.cpp                   |     2                                         
   branches/proto/v3/libs/fusion/test/algorithm/fold.cpp                        |     2                                         
   branches/proto/v3/libs/fusion/test/algorithm/insert.cpp                      |     2                                         
   branches/proto/v3/libs/fusion/test/algorithm/insert_range.cpp                |     2                                         
   branches/proto/v3/libs/fusion/test/algorithm/join.cpp                        |     2                                         
   branches/proto/v3/libs/fusion/test/algorithm/pop_back.cpp                    |     2                                         
   branches/proto/v3/libs/fusion/test/algorithm/pop_front.cpp                   |     2                                         
   branches/proto/v3/libs/fusion/test/algorithm/push_back.cpp                   |     2                                         
   branches/proto/v3/libs/fusion/test/algorithm/push_front.cpp                  |     2                                         
   branches/proto/v3/libs/fusion/test/algorithm/remove.cpp                      |     2                                         
   branches/proto/v3/libs/fusion/test/algorithm/remove_if.cpp                   |     2                                         
   branches/proto/v3/libs/fusion/test/algorithm/replace.cpp                     |     2                                         
   branches/proto/v3/libs/fusion/test/algorithm/replace_if.cpp                  |     2                                         
   branches/proto/v3/libs/fusion/test/algorithm/reverse.cpp                     |     2                                         
   branches/proto/v3/libs/fusion/test/algorithm/transform.cpp                   |     2                                         
   branches/proto/v3/libs/fusion/test/algorithm/zip.cpp                         |     2                                         
   branches/proto/v3/libs/fusion/test/functional/fused.cpp                      |     2                                         
   branches/proto/v3/libs/fusion/test/functional/fused_function_object.cpp      |     2                                         
   branches/proto/v3/libs/fusion/test/functional/fused_procedure.cpp            |     2                                         
   branches/proto/v3/libs/fusion/test/functional/make_fused.cpp                 |     2                                         
   branches/proto/v3/libs/fusion/test/functional/make_fused_function_object.cpp |     2                                         
   branches/proto/v3/libs/fusion/test/functional/make_fused_procedure.cpp       |     2                                         
   branches/proto/v3/libs/fusion/test/sequence/adapt_assoc_struct.cpp           |     2                                         
   branches/proto/v3/libs/fusion/test/sequence/adapt_struct.cpp                 |     2                                         
   branches/proto/v3/libs/fusion/test/sequence/as_list.cpp                      |     4                                         
   branches/proto/v3/libs/fusion/test/sequence/as_map.cpp                       |     4                                         
   branches/proto/v3/libs/fusion/test/sequence/as_set.cpp                       |     4                                         
   branches/proto/v3/libs/fusion/test/sequence/as_vector.cpp                    |     4                                         
   branches/proto/v3/libs/fusion/test/sequence/back_extended_deque.cpp          |     2                                         
   branches/proto/v3/libs/fusion/test/sequence/boost_tuple.cpp                  |     2                                         
   branches/proto/v3/libs/fusion/test/sequence/cons.cpp                         |     6                                         
   branches/proto/v3/libs/fusion/test/sequence/deque_copy.cpp                   |     4                                         
   branches/proto/v3/libs/fusion/test/sequence/deque_make.cpp                   |     2                                         
   branches/proto/v3/libs/fusion/test/sequence/deque_tie.cpp                    |     6                                         
   branches/proto/v3/libs/fusion/test/sequence/ext_/iterator_range_s.cpp        |     2                                         
   branches/proto/v3/libs/fusion/test/sequence/filter_view.cpp                  |     2                                         
   branches/proto/v3/libs/fusion/test/sequence/front_extended_deque.cpp         |     2                                         
   branches/proto/v3/libs/fusion/test/sequence/io.cpp                           |     2                                         
   branches/proto/v3/libs/fusion/test/sequence/iterator_range.cpp               |     2                                         
   branches/proto/v3/libs/fusion/test/sequence/joint_view.cpp                   |     2                                         
   branches/proto/v3/libs/fusion/test/sequence/list_copy.cpp                    |     4                                         
   branches/proto/v3/libs/fusion/test/sequence/list_make.cpp                    |     2                                         
   branches/proto/v3/libs/fusion/test/sequence/list_tie.cpp                     |     6                                         
   branches/proto/v3/libs/fusion/test/sequence/make_list.cpp                    |     2                                         
   branches/proto/v3/libs/fusion/test/sequence/make_vector.cpp                  |     2                                         
   branches/proto/v3/libs/fusion/test/sequence/map.cpp                          |     2                                         
   branches/proto/v3/libs/fusion/test/sequence/map_tie.cpp                      |     2                                         
   branches/proto/v3/libs/fusion/test/sequence/reverse_view.cpp                 |     2                                         
   branches/proto/v3/libs/fusion/test/sequence/set.cpp                          |     2                                         
   branches/proto/v3/libs/fusion/test/sequence/std_pair.cpp                     |     2                                         
   branches/proto/v3/libs/fusion/test/sequence/swap.cpp                         |     2                                         
   branches/proto/v3/libs/fusion/test/sequence/transform_view.cpp               |     2                                         
   branches/proto/v3/libs/fusion/test/sequence/vector_copy.cpp                  |     4                                         
   branches/proto/v3/libs/fusion/test/sequence/vector_make.cpp                  |     2                                         
   branches/proto/v3/libs/fusion/test/sequence/vector_tie.cpp                   |     6                                         
   branches/proto/v3/libs/fusion/test/sequence/zip_view.cpp                     |     2                                         
   branches/proto/v3/libs/fusion/test/sequence/zip_view2.cpp                    |     2                                         
   branches/proto/v3/libs/fusion/todo.txt                                       |    12                                         
   branches/proto/v3/libs/integer/cstdint.htm                                   |    11                                         
   branches/proto/v3/libs/integer/index.html                                    |     9                                         
   branches/proto/v3/libs/integer/integer_traits.html                           |     9                                         
   branches/proto/v3/libs/libraries.htm                                         |     5                                         
   branches/proto/v3/libs/maintainers.txt                                       |     4                                         
   branches/proto/v3/libs/math/test/test_bessel_j.cpp                           |    22 +-                                      
   branches/proto/v3/libs/math/test/test_bessel_y.cpp                           |     2                                         
   branches/proto/v3/libs/multi_index/doc/compiler_specifics.html               |    28 +-                                      
   branches/proto/v3/libs/platform_maintainers.txt                              |     4                                         
   branches/proto/v3/libs/system/test/error_code_test.cpp                       |    29 ++                                      
   branches/proto/v3/libs/thread/test/test_shared_mutex.cpp                     |    94 ++++++++-                               
   branches/proto/v3/more/generic_programming.html                              |    59 +----                                   
   branches/proto/v3/more/regression.html                                       |    11 +                                       
   branches/proto/v3/status/explicit-failures-markup.xml                        |    19 +                                       
   branches/proto/v3/tools/build/v2/tools/pathscale.jam                         |     1                                         
   branches/proto/v3/tools/inspect/inspect.cpp                                  |    40 +++                                     
   branches/proto/v3/tools/regression/index.htm                                 |    13                                         
   branches/proto/v3/tools/regression/src/regression.py                         |     3                                         
   119 files changed, 869 insertions(+), 632 deletions(-)

Modified: branches/proto/v3/boost/fusion/container.hpp
==============================================================================
--- branches/proto/v3/boost/fusion/container.hpp	(original)
+++ branches/proto/v3/boost/fusion/container.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -1,7 +1,7 @@
 /*=============================================================================
     Copyright (c) 2001-2006 Joel de Guzman
 
-    Distributed under the Boost Software License, Version 1.0. (See accompanying 
+    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)
 ==============================================================================*/
 #if !defined(FUSION_SEQUENCE_CLASS_10022005_0614)
@@ -12,5 +12,6 @@
 #include <boost/fusion/container/map.hpp>
 #include <boost/fusion/container/set.hpp>
 #include <boost/fusion/container/deque.hpp>
+#include <boost/fusion/container/generation.hpp>
 
 #endif

Modified: branches/proto/v3/boost/fusion/include/cons_tie.hpp
==============================================================================
--- branches/proto/v3/boost/fusion/include/cons_tie.hpp	(original)
+++ branches/proto/v3/boost/fusion/include/cons_tie.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,6 +7,6 @@
 #if !defined(FUSION_INCLUDE_CONS_TIE)
 #define FUSION_INCLUDE_CONS_TIE
 
-#include <boost/fusion/sequence/generation/cons_tie.hpp>
+#include <boost/fusion/container/generation/cons_tie.hpp>
 
 #endif

Modified: branches/proto/v3/boost/fusion/include/deque_tie.hpp
==============================================================================
--- branches/proto/v3/boost/fusion/include/deque_tie.hpp	(original)
+++ branches/proto/v3/boost/fusion/include/deque_tie.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,7 +7,7 @@
 #if !defined(FUSION_INCLUDE_GENERATION)
 #define FUSION_INCLUDE_GENERATION
 
-#include <boost/fusion/sequence/generation.hpp>
+#include <boost/fusion/container/generation.hpp>
 #include <boost/fusion/functional/generation.hpp>
 
 #endif

Modified: branches/proto/v3/boost/fusion/include/generation.hpp
==============================================================================
--- branches/proto/v3/boost/fusion/include/generation.hpp	(original)
+++ branches/proto/v3/boost/fusion/include/generation.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,7 +7,7 @@
 #if !defined(FUSION_INCLUDE_GENERATION)
 #define FUSION_INCLUDE_GENERATION
 
-#include <boost/fusion/sequence/generation.hpp>
+#include <boost/fusion/container/generation.hpp>
 #include <boost/fusion/functional/generation.hpp>
 
 #endif

Modified: branches/proto/v3/boost/fusion/include/ignore.hpp
==============================================================================
--- branches/proto/v3/boost/fusion/include/ignore.hpp	(original)
+++ branches/proto/v3/boost/fusion/include/ignore.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,7 +7,7 @@
 #if !defined(FUSION_INCLUDE_GENERATION)
 #define FUSION_INCLUDE_GENERATION
 
-#include <boost/fusion/sequence/generation.hpp>
+#include <boost/fusion/container/generation.hpp>
 #include <boost/fusion/functional/generation.hpp>
 
 #endif

Modified: branches/proto/v3/boost/fusion/include/list_tie.hpp
==============================================================================
--- branches/proto/v3/boost/fusion/include/list_tie.hpp	(original)
+++ branches/proto/v3/boost/fusion/include/list_tie.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,7 +7,7 @@
 #if !defined(FUSION_INCLUDE_GENERATION)
 #define FUSION_INCLUDE_GENERATION
 
-#include <boost/fusion/sequence/generation.hpp>
+#include <boost/fusion/container/generation.hpp>
 #include <boost/fusion/functional/generation.hpp>
 
 #endif

Modified: branches/proto/v3/boost/fusion/include/make_cons.hpp
==============================================================================
--- branches/proto/v3/boost/fusion/include/make_cons.hpp	(original)
+++ branches/proto/v3/boost/fusion/include/make_cons.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,6 +7,6 @@
 #if !defined(FUSION_INCLUDE_MAKE_CONS)
 #define FUSION_INCLUDE_MAKE_CONS
 
-#include <boost/fusion/sequence/generation/make_cons.hpp>
+#include <boost/fusion/container/generation/make_cons.hpp>
 
 #endif

Modified: branches/proto/v3/boost/fusion/include/make_deque.hpp
==============================================================================
--- branches/proto/v3/boost/fusion/include/make_deque.hpp	(original)
+++ branches/proto/v3/boost/fusion/include/make_deque.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,6 +7,6 @@
 #if !defined(FUSION_INCLUDE_MAKE_DEQUE)
 #define FUSION_INCLUDE_MAKE_DEQUE
 
-#include <boost/fusion/sequence/generation/make_deque.hpp>
+#include <boost/fusion/container/generation/make_deque.hpp>
 
 #endif

Modified: branches/proto/v3/boost/fusion/include/make_list.hpp
==============================================================================
--- branches/proto/v3/boost/fusion/include/make_list.hpp	(original)
+++ branches/proto/v3/boost/fusion/include/make_list.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,6 +7,6 @@
 #if !defined(FUSION_INCLUDE_MAKE_LIST)
 #define FUSION_INCLUDE_MAKE_LIST
 
-#include <boost/fusion/sequence/generation/make_list.hpp>
+#include <boost/fusion/container/generation/make_list.hpp>
 
 #endif

Modified: branches/proto/v3/boost/fusion/include/make_map.hpp
==============================================================================
--- branches/proto/v3/boost/fusion/include/make_map.hpp	(original)
+++ branches/proto/v3/boost/fusion/include/make_map.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,6 +7,6 @@
 #if !defined(FUSION_INCLUDE_MAKE_MAP)
 #define FUSION_INCLUDE_MAKE_MAP
 
-#include <boost/fusion/sequence/generation/make_map.hpp>
+#include <boost/fusion/container/generation/make_map.hpp>
 
 #endif

Modified: branches/proto/v3/boost/fusion/include/make_set.hpp
==============================================================================
--- branches/proto/v3/boost/fusion/include/make_set.hpp	(original)
+++ branches/proto/v3/boost/fusion/include/make_set.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,6 +7,6 @@
 #if !defined(FUSION_INCLUDE_MAKE_SET)
 #define FUSION_INCLUDE_MAKE_SET
 
-#include <boost/fusion/sequence/generation/make_set.hpp>
+#include <boost/fusion/container/generation/make_set.hpp>
 
 #endif

Modified: branches/proto/v3/boost/fusion/include/make_vector.hpp
==============================================================================
--- branches/proto/v3/boost/fusion/include/make_vector.hpp	(original)
+++ branches/proto/v3/boost/fusion/include/make_vector.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,6 +7,6 @@
 #if !defined(FUSION_INCLUDE_MAKE_VECTOR)
 #define FUSION_INCLUDE_MAKE_VECTOR
 
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 
 #endif

Modified: branches/proto/v3/boost/fusion/include/map_tie.hpp
==============================================================================
--- branches/proto/v3/boost/fusion/include/map_tie.hpp	(original)
+++ branches/proto/v3/boost/fusion/include/map_tie.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,6 +7,6 @@
 #if !defined(FUSION_INCLUDE_MAP_TIE)
 #define FUSION_INCLUDE_MAP_TIE
 
-#include <boost/fusion/sequence/generation/map_tie.hpp>
+#include <boost/fusion/container/generation/map_tie.hpp>
 
 #endif

Modified: branches/proto/v3/boost/fusion/include/pair_tie.hpp
==============================================================================
--- branches/proto/v3/boost/fusion/include/pair_tie.hpp	(original)
+++ branches/proto/v3/boost/fusion/include/pair_tie.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,6 +7,6 @@
 #if !defined(FUSION_INCLUDE_PAIR_TIE)
 #define FUSION_INCLUDE_PAIR_TIE
 
-#include <boost/fusion/sequence/generation/pair_tie.hpp>
+#include <boost/fusion/container/generation/pair_tie.hpp>
 
 #endif

Modified: branches/proto/v3/boost/fusion/include/vector_tie.hpp
==============================================================================
--- branches/proto/v3/boost/fusion/include/vector_tie.hpp	(original)
+++ branches/proto/v3/boost/fusion/include/vector_tie.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,6 +7,6 @@
 #if !defined(FUSION_INCLUDE_VECTOR_TIE)
 #define FUSION_INCLUDE_VECTOR_TIE
 
-#include <boost/fusion/sequence/generation/vector_tie.hpp>
+#include <boost/fusion/container/generation/vector_tie.hpp>
 
 #endif

Modified: branches/proto/v3/boost/fusion/sequence.hpp
==============================================================================
--- branches/proto/v3/boost/fusion/sequence.hpp	(original)
+++ branches/proto/v3/boost/fusion/sequence.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -9,7 +9,6 @@
 
 #include <boost/fusion/sequence/sequence_facade.hpp>
 #include <boost/fusion/sequence/comparison.hpp>
-#include <boost/fusion/sequence/generation.hpp>
 #include <boost/fusion/sequence/intrinsic.hpp>
 #include <boost/fusion/sequence/io.hpp>
 #include <boost/fusion/sequence/convert.hpp>

Deleted: branches/proto/v3/boost/fusion/sequence/generation.hpp
==============================================================================
--- branches/proto/v3/boost/fusion/sequence/generation.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
+++ (empty file)
@@ -1,20 +0,0 @@
-/*=============================================================================
-    Copyright (c) 2001-2006 Joel de Guzman
-
-    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)
-==============================================================================*/
-#if !defined(FUSION_SEQUENCE_GENERATION_10022005_0615)
-#define FUSION_SEQUENCE_GENERATION_10022005_0615
-
-#include <boost/fusion/sequence/generation/cons_tie.hpp>
-#include <boost/fusion/sequence/generation/ignore.hpp>
-#include <boost/fusion/sequence/generation/list_tie.hpp>
-#include <boost/fusion/sequence/generation/make_cons.hpp>
-#include <boost/fusion/sequence/generation/make_list.hpp>
-#include <boost/fusion/sequence/generation/make_map.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
-#include <boost/fusion/sequence/generation/vector_tie.hpp>
-#include <boost/fusion/sequence/generation/make_set.hpp>
-
-#endif

Modified: branches/proto/v3/boost/fusion/tuple.hpp
==============================================================================
--- branches/proto/v3/boost/fusion/tuple.hpp	(original)
+++ branches/proto/v3/boost/fusion/tuple.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -10,6 +10,6 @@
 #include <boost/fusion/tuple/tuple.hpp>
 #include <boost/fusion/tuple/make_tuple.hpp>
 #include <boost/fusion/tuple/tuple_tie.hpp>
-#include <boost/fusion/sequence/generation/ignore.hpp>
+#include <boost/fusion/container/generation/ignore.hpp>
 
 #endif

Modified: branches/proto/v3/boost/fusion/view/ext_/segmented_iterator.hpp
==============================================================================
--- branches/proto/v3/boost/fusion/view/ext_/segmented_iterator.hpp	(original)
+++ branches/proto/v3/boost/fusion/view/ext_/segmented_iterator.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -19,7 +19,7 @@
 #include <boost/fusion/support/is_sequence.hpp>
 #include <boost/fusion/view/filter_view.hpp>
 #include <boost/fusion/container/list/cons.hpp> // for nil
-#include <boost/fusion/sequence/generation/make_cons.hpp>
+#include <boost/fusion/container/generation/make_cons.hpp>
 #include <boost/fusion/iterator/distance.hpp>
 #include <boost/fusion/sequence/intrinsic/ext_/segments.hpp>
 #include <boost/fusion/support/ext_/is_segmented.hpp>

Modified: branches/proto/v3/boost/gil/extension/dynamic_image/apply_operation_base.hpp
==============================================================================
--- branches/proto/v3/boost/gil/extension/dynamic_image/apply_operation_base.hpp	(original)
+++ branches/proto/v3/boost/gil/extension/dynamic_image/apply_operation_base.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -27,7 +27,7 @@
 ///        casts the object to its appropriate type and applies the operation
 /// \author Lubomir Bourdev and Hailin Jin \n
 ///         Adobe Systems Incorporated
-/// \date 2005-2006 \n Last updated on May 4, 2006
+/// \date 2005-2007 \n Last updated on November 6, 2007
 ///
 ////////////////////////////////////////////////////////////////////////////////////////
 
@@ -96,11 +96,11 @@
 #define GIL_GENERATE_APPLY_FWD_OPS(N) BOOST_PP_REPEAT(N, GIL_APPLY_FWD_OP, BOOST_PP_EMPTY)
 
 namespace detail {
-    template <std::size_t N> struct apply_operation_fwd_fn {};
+template <std::size_t N> struct apply_operation_fwd_fn {};
 
-    // Create specializations of apply_operation_fn for each N 0..100
-    GIL_GENERATE_APPLY_FWD_OPS(99)
-}
+// Create specializations of apply_operation_fn for each N 0..100
+GIL_GENERATE_APPLY_FWD_OPS(99)
+} // namespace detail
 
 // unary application
 template <typename Types, typename Bits, typename Op> 
@@ -141,7 +141,7 @@
             return apply_operation_basec<Types1>(_bits1, _index1, reduce_bind1<T2,Op>(t2, _op));
         }
     };
-}
+} // namespace detail
 
 // Binary application by applying on each dimension separately
 template <typename Types1, typename Types2, typename Bits1, typename Bits2, typename Op>

Modified: branches/proto/v3/boost/gil/image_view_factory.hpp
==============================================================================
--- branches/proto/v3/boost/gil/image_view_factory.hpp	(original)
+++ branches/proto/v3/boost/gil/image_view_factory.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -93,7 +93,7 @@
 
     template <typename View> struct channel_pointer_type
         : public channel_pointer_type_impl<View, view_is_mutable<View>::value> {};
-};
+} // namespace detail
 
 /// \ingroup ImageViewConstructors
 /// \brief Returns C pointer to the the channels of an interleaved homogeneous view.
@@ -379,7 +379,7 @@
             return AD::make(src, deref_t(n));
         }
     };
-}
+} // namespace detail
 
 /// \brief Given a source image view type View, returns the type of an image view over a single channel of View
 /// \ingroup ImageViewTransformationsNthChannel
@@ -508,7 +508,7 @@
             return AD::make(src, deref_t());
         }
     };
-}
+} // namespace detail
 
 /// \brief Given a source image view type View, returns the type of an image view over a given channel of View.
 /// \ingroup ImageViewTransformationsKthChannel

Modified: branches/proto/v3/boost/interprocess/detail/config_begin.hpp
==============================================================================
--- branches/proto/v3/boost/interprocess/detail/config_begin.hpp	(original)
+++ branches/proto/v3/boost/interprocess/detail/config_begin.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -4,7 +4,7 @@
 #endif
 
 #ifdef BOOST_MSVC
-   #ifdef _CRT_SECURE_NO_DEPRECATE
+   #ifndef _CRT_SECURE_NO_DEPRECATE
    #define  BOOST_INTERPROCESS_CRT_SECURE_NO_DEPRECATE
    #define _CRT_SECURE_NO_DEPRECATE
    #endif

Modified: branches/proto/v3/boost/interprocess/mapped_region.hpp
==============================================================================
--- branches/proto/v3/boost/interprocess/mapped_region.hpp	(original)
+++ branches/proto/v3/boost/interprocess/mapped_region.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -207,7 +207,7 @@
    ,  m_file_mapping_hnd(detail::invalid_file())
 {
    mapping_handle_t mhandle = mapping.get_mapping_handle();
-   file_handle_t native_mapping_handle;
+   file_handle_t native_mapping_handle = 0;
 
    //Set accesses
    unsigned long file_map_access = 0;

Modified: branches/proto/v3/boost/lexical_cast.hpp
==============================================================================
--- branches/proto/v3/boost/lexical_cast.hpp	(original)
+++ branches/proto/v3/boost/lexical_cast.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -52,9 +52,9 @@
         {
         }
         bad_lexical_cast(
-            const std::type_info &source_type,
-            const std::type_info &target_type) :
-            source(&source_type), target(&target_type)
+            const std::type_info &source_type_arg,
+            const std::type_info &target_type_arg) :
+            source(&source_type_arg), target(&target_type_arg)
         {
         }
         const std::type_info &source_type() const

Modified: branches/proto/v3/boost/math/distributions/find_scale.hpp
==============================================================================
--- branches/proto/v3/boost/math/distributions/find_scale.hpp	(original)
+++ branches/proto/v3/boost/math/distributions/find_scale.hpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -109,8 +109,10 @@
       //  << quantile(Dist(), c.param1) //q
       //  << endl;
 
+#if !defined(BOOST_NO_SFINAE) && !BOOST_WORKAROUND(__SUNPRO_CC, BOOST_TESTED_AT(0x590))
       BOOST_STATIC_ASSERT(::boost::math::tools::is_distribution<Dist>::value); 
       BOOST_STATIC_ASSERT(::boost::math::tools::is_scaled_distribution<Dist>::value); 
+#endif
       static const char* function = "boost::math::find_scale<Dist, Policy>(complement(%1%, %1%, %1%, Policy))";
 
       // Checks on arguments, as not complemented version,
@@ -161,8 +163,10 @@
       //  << quantile(Dist(), c.param1) //q
       //  << endl;
 
+#if !defined(BOOST_NO_SFINAE) && !BOOST_WORKAROUND(__SUNPRO_CC, BOOST_TESTED_AT(0x590))
       BOOST_STATIC_ASSERT(::boost::math::tools::is_distribution<Dist>::value); 
       BOOST_STATIC_ASSERT(::boost::math::tools::is_scaled_distribution<Dist>::value); 
+#endif
       static const char* function = "boost::math::find_scale<Dist, Policy>(complement(%1%, %1%, %1%, Policy))";
 
       // Checks on arguments, as not complemented version,

Modified: branches/proto/v3/boost/spirit/core/primitives/impl/numerics.ipp
==============================================================================
--- branches/proto/v3/boost/spirit/core/primitives/impl/numerics.ipp	(original)
+++ branches/proto/v3/boost/spirit/core/primitives/impl/numerics.ipp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -46,7 +46,7 @@
         //  Traits class for radix specific number conversion
         //
         //      Convert a digit from character representation, ch, to binary
-        //      representation, returned in val. 
+        //      representation, returned in val.
         //      Returns whether the conversion was successful.
         //
         //        template<typename CharT> static bool digit(CharT ch, T& val);
@@ -62,7 +62,7 @@
             template<typename CharT, typename T>
             static bool digit(CharT ch, T& val)
             {
-                val = ch - '0'; 
+                val = ch - '0';
                 return ('0' == ch || '1' == ch);
             }
         };
@@ -130,6 +130,9 @@
         //          numeric type can hold it. Accumulate is either
         //          positive_accumulate<Radix> (default) for parsing positive
         //          numbers or negative_accumulate<Radix> otherwise.
+        //          Checking is only performed when std::numeric_limits<T>::
+        //          is_specialized is true. Otherwise, there's no way to
+        //          do the check.
         //
         //          scan.first and scan.last are iterators as usual (i.e.
         //          first is mutable and is moved forward when a match is
@@ -152,57 +155,75 @@
             //  Use this accumulator if number is positive
             static bool add(T& n, T digit)
             {
-                static T const max = (std::numeric_limits<T>::max)();
-                static T const max_div_radix = max/Radix;
-                
-                if (n > max_div_radix)
-                    return false;
-                n *= Radix;
-                
-                if (n > max - digit)
-                    return false;
-                n += digit;
-                
-                return true;
+                if (std::numeric_limits<T>::is_specialized)
+                {
+                    static T const max = (std::numeric_limits<T>::max)();
+                    static T const max_div_radix = max/Radix;
+
+                    if (n > max_div_radix)
+                        return false;
+                    n *= Radix;
+
+                    if (n > max - digit)
+                        return false;
+                    n += digit;
+
+                    return true;
+                }
+                else
+                {
+                    n *= Radix;
+                    n += digit;
+                    return true;
+                }
             }
         };
-        
+
         template <typename T, int Radix>
         struct negative_accumulate
         {
             //  Use this accumulator if number is negative
             static bool add(T& n, T digit)
             {
-                typedef std::numeric_limits<T> num_limits;
-                static T const min = 
-                    (!num_limits::is_integer && num_limits::is_signed && num_limits::has_denorm) ?
-                    -(num_limits::max)() : (num_limits::min)();
-                static T const min_div_radix = min/Radix;
-            
-                if (n < min_div_radix)
-                    return false;
-                n *= Radix;
-                
-                if (n < min + digit)
-                    return false;
-                n -= digit;
+                if (std::numeric_limits<T>::is_specialized)
+                {
+                    typedef std::numeric_limits<T> num_limits;
+                    static T const min =
+                        (!num_limits::is_integer && num_limits::is_signed && num_limits::has_denorm) ?
+                        -(num_limits::max)() : (num_limits::min)();
+                    static T const min_div_radix = min/Radix;
+
+                    if (n < min_div_radix)
+                        return false;
+                    n *= Radix;
+
+                    if (n < min + digit)
+                        return false;
+                    n -= digit;
 
-                return true;
+                    return true;
+                }
+                else
+                {
+                    n *= Radix;
+                    n -= digit;
+                    return true;
+                }
             }
         };
 
-        template <int MaxDigits> 
-        inline bool allow_more_digits(std::size_t i) 
-        { 
-            return i < MaxDigits; 
+        template <int MaxDigits>
+        inline bool allow_more_digits(std::size_t i)
+        {
+            return i < MaxDigits;
         }
-        
+
         template <>
         inline bool allow_more_digits<-1>(std::size_t)
         {
             return true;
         }
-        
+
         //////////////////////////////////
         template <
             int Radix, unsigned MinDigits, int MaxDigits,
@@ -258,7 +279,7 @@
                     T n = 0;
                     std::size_t count = 0;
                     typename ScannerT::iterator_t save = scan.first;
-                    if (extract_int<Radix, MinDigits, MaxDigits, 
+                    if (extract_int<Radix, MinDigits, MaxDigits,
                         positive_accumulate<T, Radix> >::f(scan, n, count))
                     {
                         return scan.create_match(count, n, save, scan.first);
@@ -297,7 +318,7 @@
             {
                 typedef extract_int<Radix, MinDigits, MaxDigits,
                     negative_accumulate<T, Radix> > extract_int_neg_t;
-                typedef extract_int<Radix, MinDigits, MaxDigits, 
+                typedef extract_int<Radix, MinDigits, MaxDigits,
                     positive_accumulate<T, Radix> > extract_int_pos_t;
 
                 if (!scan.at_end())

Modified: branches/proto/v3/doc/Jamfile.v2
==============================================================================
--- branches/proto/v3/doc/Jamfile.v2	(original)
+++ branches/proto/v3/doc/Jamfile.v2	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -1,3 +1,8 @@
+# Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+#
+# 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)
 project boost/doc ;
 import boostbook : boostbook ;
 

Modified: branches/proto/v3/libs/config/test/link/test/Jamfile.v2
==============================================================================
--- branches/proto/v3/libs/config/test/link/test/Jamfile.v2	(original)
+++ branches/proto/v3/libs/config/test/link/test/Jamfile.v2	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2006
+# Use, modification and distribution are subject to 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 type ;
 

Modified: branches/proto/v3/libs/disjoint_sets/Jamfile
==============================================================================
--- branches/proto/v3/libs/disjoint_sets/Jamfile	(original)
+++ branches/proto/v3/libs/disjoint_sets/Jamfile	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -1,3 +1,7 @@
+# Copyright Jeremy Siek 2002
+# Use, modification and distribution are subject to 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)
 
 test-suite disjoint_sets : 
     [ run  disjoint_set_test.cpp ]

Modified: branches/proto/v3/libs/dynamic_bitset/Jamfile.v2
==============================================================================
--- branches/proto/v3/libs/dynamic_bitset/Jamfile.v2	(original)
+++ branches/proto/v3/libs/dynamic_bitset/Jamfile.v2	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -1,3 +1,9 @@
+#
+#              Copyright Vladimir Prus 2004
+#
+# 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)
 
 test-suite dynamic_bitset :
 

Modified: branches/proto/v3/libs/format/benchmark/Jamfile
==============================================================================
--- branches/proto/v3/libs/format/benchmark/Jamfile	(original)
+++ branches/proto/v3/libs/format/benchmark/Jamfile	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -2,10 +2,8 @@
 #
 #  Copyright (c) 2003 Samuel Krempp
 #
-#  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 www.boost.org/LICENSE_1_0.txt
 
 exe bench_format_no_locale
     : bench_format.cpp

Deleted: branches/proto/v3/libs/fusion/doc/algorithms.qbk
==============================================================================
--- branches/proto/v3/libs/fusion/doc/algorithms.qbk	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
+++ (empty file)
@@ -1,2402 +0,0 @@
-[section Algorithms]
-[heading Lazy Evaluation]
-
-Unlike __mpl__, Fusion algorithms are lazy and non sequence-type 
-preserving. What does that mean? It means that when you operate on a 
-sequence through a Fusion algorithm that returns a sequence, the sequence 
-returned may not be of the same class as the original. This is by design. 
-Runtime efficiency is given a high priority. Like __mpl__, and unlike 
-__stl__, fusion algorithms are functional in nature such that algorithms 
-are non mutating (no side effects). However, due to the high cost of 
-returning full sequences such as vectors and lists, /Views/ are returned 
-from Fusion algorithms instead. For example, the __transform__ algorithm 
-does not actually return a transformed version of the original sequence. 
-__transform__ returns a __transform_view__. This view holds a reference to 
-the original sequence plus the transform function. Iteration over the 
-__transform_view__ will apply the transform function over the sequence 
-elements on demand. This /lazy/ evaluation scheme allows us to chain as 
-many algorithms as we want without incurring a high runtime penalty.
-
-[heading Sequence Extension]
-
-The /lazy/ evaluation scheme where __algorithms__ return __views__ also 
-allows operations such as __push_back__ to be totally generic. In Fusion, 
-__push_back__ is actually a generic algorithm that works on all sequences. 
-Given an input sequence `s` and a value `x`, Fusion's __push_back__ 
-algorithm simply returns a __joint_view__: a view that holds a reference to 
-the original sequence `s` and the value `x`. Functions that were once 
-sequence specific and need to be implemented N times over N different 
-sequences are now implemented only once. That is to say that Fusion 
-sequences are cheaply extensible. However, an important caveat is that the 
-result of a sequence extending operation like __push_back__ does not retain 
-the properties of the original sequence such as associativity of __set__s. 
-To regain the original sequence, __conversion__ functions are provided. You 
-may use one of the __conversion__ functions to convert back to the original 
-sequence type.
-
-[heading Header]
-    #include <boost/fusion/algorithm.hpp>
-
-[section Iteration]
-
-The iteration algorithms provide the fundamental algorithms for traversing 
-a sequence repeatedly applying an operation to its elements.
-
-[heading Header]
-    #include <boost/fusion/algorithm/iteration.hpp>
-
-[section Functions]
-
-[section fold]
-
-[heading Description]
-For a sequence `Seq`, initial state, and binary function object or function pointer `f`, fold repeatedly applies binary `f` to each element of `Seq` and the previous state.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename State,
-        typename F
-        >
-    typename __result_of_fold__<Sequence, State, F>::type fold(
-        Sequence& seq, State const& initial_state, F const& f);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__,`f(e,s)` must be a valid expression for each element `e` in `seq`, and current state `s`][Operation's argument]]
-    [[`initial_state`][Any type][Initial state]]
-    [[`f`][`__boost_result_of_call__<F(E,S)>::type` is the return type of `f(e,s)` for each element `e` of type `E` in `seq`, and current state `s` of type `S`][Operation's argument]]
-]
-
-[heading Expression Semantics]
-    fold(seq, initial_state, f);
-
-[*Return type]: Any type
-
-[*Semantics]: Equivalent to `f(eN ....f(e2,f(e1,initial_state)))` where `e1 ...eN` are the elements of `seq`.
-
-[heading Complexity]
-Linear, exactly `__result_of_size__<Sequence>::value` applications of `f`.
-
-[heading Header]
-    #include <boost/fusion/algorithm/iteration/fold.hpp>
-
-[heading Example]
-    struct make_string
-    {
-        typedef std::string result_type;
-
-        template<typename T>
-        std::string operator()(const T& t, const std::string& str) const
-        {
-            return str + boost::lexical_cast<std::string>(t);
-        }
-    };
-    ...
-    const __vector__<int,int> vec(1,2);
-    assert(__fold__(vec,std::string(""), make_string()) == "12");
-
-[endsect]
-
-[section accumulate]
-
-[heading Description]
-For a sequence `Seq`, initial state, and binary function object or function pointer `f`, accumulate repeatedly applies binary `f` to each element of `Seq` and the previous state.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename State,
-        typename F
-        >
-    typename __result_of_accumulate__<Sequence, State, F>::type accumulate(
-        Sequence& seq, State const& initial_state, F const& f);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__, `f(eN ....f(e2,f(e1,initial_state)))` must be a valid expression for each element `e1` to `eN` in `seq`][Operation's argument]]
-    [[`initial_state`][Any type][Initial state]]
-    [[`f`][`__boost_result_of_call__<F(E,S)>::type` is the return type of `f(e,s)` for each element `e` of type `E` in `seq`, and current state `s` of type `S`][Operation's argument]]
-]
-
-[heading Expression Semantics]
-    accumulate(seq, initial_state, f);
-
-[*Return type]: Any type
-
-[*Semantics]: Equivalent to `f(eN ....f(e2,f(e1,initial_state)))` where `e1 ...eN` are the elements of `seq`.
-
-[heading Complexity]
-Linear, exactly `__result_of_size__<Sequence>::value` applications of `f`.
-
-[heading Header]
-    #include <boost/fusion/algorithm/iteration/accumulate.hpp>
-
-[heading Example]
-    struct make_string
-    {
-        typedef std::string result_type;
-
-        template<typename T>
-        std::string operator()(const T& t, const std::string& str) const
-        {
-            return str + boost::lexical_cast<std::string>(t);
-        }
-    };
-    ...
-    const __vector__<int,int> vec(1,2);
-    assert(__accumulate__(vec,std::string(""), make_string()) == "12");
-
-[endsect]
-
-[section for_each]
-
-[heading Description]
-Applies a unary function object to each element of a sequence.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename F
-        >
-    typename __result_of_for_each__<Sequence, F>::type for_each(
-        Sequence& seq, F const& f);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__, `f(e)` must be a valid expression for each element `e` in `seq`][Operation's argument]]
-    [[`f`][A unary __reg_callable_obj__][Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __for_each__(seq, f);
-
-[*Return type]: `void`
-
-[*Semantics]: Calls `f(e)` for each element `e` in `seq`.
-
-[heading Complexity]
-Linear, exactly `__result_of_size__<Sequence>::value` applications of `f`.
-
-[heading Header]
-    #include <boost/fusion/algorithm/iteration/for_each.hpp>
-
-[heading Example]
-    struct increment
-    {
-        template<typename T>
-        void operator()(T& t) const
-        {
-            ++t;
-        }
-    };
-    ...
-    __vector__<int,int> vec(1,2);
-    __for_each__(vec, increment());
-    assert(vec == __make_vector__(2,3));
-
-[endsect]
-
-[endsect]
-
-[section Metafunctions]
-
-[section fold]
-
-[heading Description]
-Returns the result type of __fold__.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename State,
-        typename F>
-    struct fold
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter] [Requirement] [Description]]
-    [[`Sequence`] [A model of __forward_sequence__] [The sequence to iterate]]
-    [[`State`]    [Any type]                        [The initial state for the first application of `F`]]
-    [[`F`]    [`__boost_result_of_call__<F(E,S)>::type` is the return type of `f(e,s)` for each element `e` of type `E` in `seq`, and current state `s` of type `S`] [The operation to be applied on forward traversal]]
-]
-
-[heading Expression Semantics]
-    __result_of_fold__<Sequence, State, F>::type
-
-[*Return type]: Any type
-
-[*Semantics]: Returns the result of applying `fold` to a sequence of type `Sequence`, with an initial state of
-type `State` and binary function object or function pointer of type `F`.
-
-[heading Complexity]
-Linear, exactly `__result_of_size__<Sequence>::value` applications of `F`.
-
-[heading Header]
-    #include <boost/fusion/algorithm/iteration/fold.hpp>
-
-[endsect]
-
-[section accumulate]
-
-[heading Description]
-Returns the result type of __accumulate__.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename State,
-        typename F>
-    struct accumulate
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter] [Requirement] [Description]]
-    [[`Sequence`] [A model of __forward_sequence__] [The sequence to iterate]]
-    [[`State`]    [Any type]                                 [The initial state for the first application of `F`]]
-    [[`F`]    [`__boost_result_of_call__<F(E,S)>::type` is the return type of `f(e,s)` for each element `e` of type `E` in `seq`, and current state `s` of type `S`] [The operation to be applied on forward traversal]]
-]
-
-[heading Expression Semantics]
-    __result_of_accumulate__<Sequence, State, F>::type
-
-[*Return type]: Any type
-
-[*Semantics]: Returns the result of applying `accumulate` to a sequence of type `Sequence`, with an initial state of
-type `State` and binary function object or function pointer of type `F`.
-
-[heading Complexity]
-Linear, exactly `__result_of_size__<Sequence>::value` applications of `F`.
-
-[heading Header]
-    #include <boost/fusion/algorithm/iteration/accumulate.hpp>
-
-[endsect]
-
-[section for_each]
-A metafunction returning the result type of applying __for_each__ to a sequence. The
-return type of __for_each__ is always `void`.
-
-[heading Description]
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename F
-    >
-    struct for_each
-    {
-        typedef void type;
-    };
-
-[table Parameters
-    [[Parameter] [Requirement] [Description]]
-    [[`Sequence`] [A model of __forward_sequence__] [Operation's argument]]
-    [[`F`]    [Any type] [Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __result_of_for_each__<Sequence, F>::type
-
-[*Return type]: `void`.
-
-[*Semantics]: Returns the return type of __for_each__ for a sequence of type `Sequence` and a unary function object `F`.
-The return type is always `void`.
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/iteration/for_each.hpp>
-
-[endsect]
-
-[endsect]
-
-[endsect]
-
-[section Query]
-The query algorithms provide support for searching and analyzing sequences.
-
-[heading Header]
-    #include <boost/fusion/algorithm/query.hpp>
-
-[section Functions]
-
-[section any]
-
-[heading Description]
-For a sequence `seq` and unary function object `f`, `any` returns true if `f` returns true for at least one element of `seq`.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename F
-        >
-    typename __result_of_any__<Sequence,F>::type any(
-        Sequence const& seq, F f);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__, `f(e)` must be a valid expression, convertible to `bool`, for each element `e` in `seq`][The sequence to search]]
-    [[`f`][A unary function object][The search predicate]]
-]
-
-[heading Expression semantics]
-    __any__(seq, f);
-
-[*Return type]: `bool`
-
-[*Semantics]: Returns true if and only if `f(e)` evaluates to `true` for some element `e` in `seq`.
-
-[heading Complexity]
-Linear. At most `__result_of_size__<Sequence>::value` comparisons.
-
-[heading Header]
-    #include <boost/fusion/algorithm/query/any.hpp>
-
-[heading Example]
-    struct odd
-    {
-        template<typename T>
-        bool operator()(T t) const
-        {
-            return t % 2;
-        }
-    };
-    ...
-    assert(__any__(__make_vector__(1,2), odd()));
-    assert(!__any__(__make_vector__(2,4), odd()));
-
-[endsect]
-
-[section all]
-
-[heading Description]
-For a sequence `seq` and unary function object `f`, `all` returns true if `f` returns true for every element of `seq`.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename F
-        >
-    typename __result_of_all__<Sequence,F>::type all(
-        Sequence const& seq, F f);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__, `f(e)` is a valid expression, convertible to `bool`, for every element `e` in `seq`][The sequence to search]]
-    [[`f`][A unary function object][The search predicate]]
-]
-
-[heading Expression Semantics]
-    __all__(seq, f);
-
-[*Return type]: `bool`
-
-[*Semantics]: Returns true if and only if `f(e)` evaluates to `true` for every element `e` in `seq`.
-
-[heading Complexity]
-Linear. At most `__result_of_size__<Sequence>::value` comparisons.
-
-[heading Header]
-    #include <boost/fusion/algorithm/query/all.hpp>
-
-[heading Example]
-    struct odd
-    {
-        template<typename T>
-        bool operator()(T t) const
-        {
-            return t % 2;
-        }
-    };
-    ...
-    assert(__all__(__make_vector__(1,3), odd()));
-    assert(!__all__(__make_vector__(1,2), odd()));
-
-[endsect]
-
-[section none]
-
-[heading Description]
-For a sequence `seq` and unary function object `f`, `none` returns true if `f` returns false for every element of `seq`.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename F
-        >
-    typename __result_of_none__<Sequence,F>::type none(
-        Sequence const& seq, F f);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__, `f(e)` is a valid expression, convertible to `bool`, for every element `e` in `seq`][The sequence to search]]
-    [[`f`][A unary function object][The search predicate]]
-]
-
-[heading Expression Semantics]
-    __none__(seq, f);
-
-[*Return type]: `bool`
-
-[*Semantics]: Returns true if and only if `f(e)` evaluates to `false` for every element `e` in `seq`. Result equivalent to `!any(seq, f)`.
-
-[heading Complexity]
-Linear. At most `__result_of_size__<Sequence>::value` comparisons.
-
-[heading Header]
-    #include <boost/fusion/algorithm/query/none.hpp>
-
-[heading Example]
-    struct odd
-    {
-        template<typename T>
-        bool operator()(T t) const
-        {
-            return t % 2;
-        }
-    };
-    ...
-    assert(__none__(__make_vector__(2,4), odd()));
-    assert(!__none__(__make_vector__(1,2), odd()));
-
-[endsect]
-
-[section find]
-
-[heading Description]
-Finds the first element of a given type within a sequence. 
-
-[heading Synopsis]
-    template<
-        typename T,
-        typename Sequence
-        >
-    __unspecified__ find(Sequence const& seq);
-
-    template<
-        typename T,
-        typename Sequence
-        >
-    __unspecified__ find(Sequence& seq);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__][The sequence to search]]
-    [[`T`][Any type][The type to search for]]
-]
-
-[heading Expression Semantics]
-    __find__<T>(seq)
-
-[*Return type]: A model of the same iterator category as the iterators of `seq`.
-
-[*Semantics]: Returns an iterator to the first element of `seq` of type `T`, or `__end__(seq)` if there is no such element.
-Equivalent to `__find_if__<boost::is_same<_, T> >(seq)`
-
-[heading Complexity]
-Linear. At most `__result_of_size__<Sequence>::value` comparisons.
-
-[heading Header]
-    #include <boost/fusion/algorithm/query/find.hpp>
-
-[heading Example]
-    const __vector__<char,int> vec('a','0');
-    assert(*__find__<int>(vec) == '0');
-    assert(__find__<double>(vec) == __end__(vec));
-
-[endsect]
-
-[section find_if]
-Finds the first element within a sequence with a type for which a given __mpl_lambda_expression__ evaluates to 
-`boost::mpl::true_`.
-
-[heading Description]
-
-[heading Synopsis]
-    template<
-        typename F,
-        typename Sequence
-        >
-    __unspecified__ find_if(Sequence const& seq);
-
-    template<
-        typename F,
-        typename Sequence
-        >
-    __unspecified__ find_if(Sequence& seq);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__][The sequence to search]]
-    [[`F`][A unary __mpl_lambda_expression__][The search predicate]]
-]
-
-[heading Expression Semantics]
-    __find_if__<F>(seq)
-
-[*Return type]: An iterator of the same iterator category as the iterators of `seq`.
-
-[*Semantics]: Returns the first element of `seq` for which __mpl_lambda_expression__ `F` evaluates to `boost::mpl::true_`, 
-or `__end__(seq)` if there is no such element.
-
-[heading Complexity]
-Linear. At most `__result_of_size__<Sequence>::value` comparisons.
-
-[heading Header]
-    #include <boost/fusion/algorithm/query/find_if.hpp>
-
-[heading Example]
-    const __vector__<double,int> vec(1.0,2);
-    assert(*__find_if__<is_integral<mpl::_> >(vec) == 2);
-    assert(__find_if__<is_class<mpl::_> >(vec) == __end__(vec));
-
-[endsect]
-
-[section count]
-
-[heading Description]
-Returns the number of elements of a given type within a sequence.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename T
-        >
-    typename __result_of_count__<Sequence, T>::type count(
-        Sequence const& seq, T const& t);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__, `e == t` must be a valid expression, convertible to `bool`, for each element `e` in `seq`][The sequence to search]]
-    [[`T`][Any type][The type to count]]
-]
-
-[heading Expression Semantics]
-    __count__(seq, t);
-
-[*Return type]: `int`
-
-[*Semantics]: Returns the number of elements of type `T` and equal to `t` in `seq`.
-
-[heading Complexity]
-Linear. At most `__result_of_size__<Sequence>::value` comparisons.
-
-[heading Header]
-    #include <boost/fusion/algorithm/query/count.hpp>
-
-[heading Example]
-    const __vector__<double,int,int> vec(1.0,2,3);
-    assert(__count__(vec,2) == 1);
-
-[endsect]
-
-[section count_if]
-
-[heading Description]
-Returns the number of elements within a sequence with a type for which a given unary function object evaluates to 
-`true`.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename F
-        >
-    typename __result_of_count_if__<Sequence, F>::type count_if(
-        Sequence const& seq, F f);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__, `f(e)` is a valid expression, convertible to `bool`, for each element `e` in `seq`][The sequence to search]]
-    [[`f`][A unary function object][The search predicate]]
-]
-
-[heading Expression Semantics]
-    __count_if__(seq, f)
-
-[*Return type]: `int`
-
-[*Semantics]: Returns the number of elements in `seq` where `f` evaluates to `true`.
-
-[heading Complexity]
-Linear. At most `__result_of_size__<Sequence>::value` comparisons.
-
-[heading Header]
-    #include <boost/fusion/algorithm/query/count_if.hpp>
-
-[heading Example]
-    const __vector__<int,int,int> vec(1,2,3);
-    assert(__count_if__(vec,odd()) == 2);
-
-[endsect]
-
-[endsect]
-
-[section Metafunctions]
-
-[section any]
-
-[heading Description]
-A metafunction returning the result type of __any__.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename F
-        >
-    struct any
-    {
-        typedef bool type;
-    };
-
-[table Parameters
-    [[Parameter] [Requirement] [Description]]
-    [[`Sequence`] [A model of __forward_sequence__] [Operation's argument]]
-    [[`F`]       [A model of unary __poly_func_obj__] [Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __result_of_any__<Sequence, F>::type
-
-[*Return type]: `bool`.
-
-[*Semantics]: Returns the return type of __any__ given a sequence of type `Sequence` and a unary __poly_func_obj__ of type `F`. The return type is always `bool`.
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/query/any.hpp>
-
-[endsect]
-
-[section all]
-
-[heading Description]
-A metafunction returning the result type of __all__.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename F
-        >
-    struct all
-    {
-        typedef bool type;
-    };
-
-[table Parameters
-    [[Parameter] [Requirement] [Description]]
-    [[`Sequence`] [A model of __forward_sequence__] [Operation's argument]]
-    [[`F`]        [A model of unary __poly_func_obj__] [Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __result_of_all__<Sequence, F>::type
-
-[*Return type]: `bool`.
-
-[*Semantics]: Returns the return type of __all__ given a sequence of type `Sequence` and a unary __poly_func_obj__ of type `F`. The return type is always `bool`.
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/query/all.hpp>
-
-[endsect]
-
-[section none]
-
-[heading Description]
-A metafunction returning the result type of __none__.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename F
-        >
-    struct none
-    {
-        typedef bool type;
-    };
-
-[table Parameters
-    [[Parameter] [Requirement] [Description]]
-    [[`Sequence`] [A model of __forward_sequence__] [Operation's argument]]
-    [[`F`]        [A model of unary __poly_func_obj__] [Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __result_of_none__<Sequence, F>::type
-
-[*Return type]: `bool`.
-
-[*Semantics]: Returns the return type of __none__ given a sequence of type `Sequence` and a unary __poly_func_obj__ of type `F`. The return type is always `bool`.
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/query/none.hpp>
-
-[endsect]
-
-[section find]
-
-[heading Description]
-Returns the result type of `find`, given the sequence and search types.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename T
-        >
-    struct find
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter] [Requirement] [Description]]
-    [[`Sequence`] [Model of __forward_sequence__] [Operation's argument]]
-    [[`T`]        [Any type] [Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __result_of_find__<Sequence, T>::type
-
-[*Return type]: A model of the same iterator category as the iterators of `Sequence`.
-
-[*Semantics]: Returns an iterator to the first element of type `T` in `Sequence`, or `__result_of_end__<Sequence>::type` if there is no such element.
-
-[heading Complexity]
-Linear, at most `__result_of_size__<Sequence>::value` comparisons.
-
-[heading Header]
-    #include <boost/fusion/algorithm/query/find.hpp>
-
-[endsect]
-
-[section find_if]
-
-[heading Description]
-Returns the result type of `find_if` given the sequence and predicate types.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename Pred
-        >
-    struct find_if
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter] [Requirement] [Description]]
-    [[`Sequence`] [A model of __forward_sequence__] [Operation's argument]]
-    [[`Pred`]     [A model of __mpl_lambda_expression__] [Operation's arguments]]
-]
-
-[heading Expression Semantics]
-    __result_of_find_if__<Sequence, Pred>::type
-
-[*Return type]: A model of the same iterator category as the iterators of `Sequence`.
-
-[*Semantics]: Returns an iterator to the first element in `Sequence` for which `Pred` evaluates to true. Returns `__result_of_end__<Sequence>::type` if there is no such element.
-
-[heading Complexity]
-Linear. At most `__result_of_size__<Sequence>::value` comparisons.
-
-[heading Header]
-    #include <boost/fusion/algorithm/query/find_if.hpp>
-
-[endsect]
-
-[section count]
-
-[heading Description]
-A metafunction that returns the result type of `count` given the sequence and search types.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename T
-        >
-    struct count
-    {
-        typedef int type;
-    };
-
-[table Parameters
-    [[Parameter] [Requirement] [heading Description]]
-    [[`Sequence`] [A model of __forward_sequence__] [Operation's argument]]
-    [[`T`] [Any type] [Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __result_of_count__<T>::type
-
-[*Return type]: `int`.
-
-[*Semantics]: Returns the return type of __count__. The return type is always `int`.
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/query/count.hpp>
-
-[endsect]
-
-[section count_if]
-
-[heading Description]
-A metafunction that returns the result type of `count_if` given the sequence and predicate types.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename Pred
-        >
-    struct count_if
-    {
-        typedef int type;
-    };
-
-[table Parameters
-    [[Parameter] [Requirement] [Description]]
-    [[`Sequence`] [A model of __forward_sequence__] [Operation's argument]]
-    [[`Pred`]     [A unary function object] [Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __result_of_count_if__<Sequence, Pred>::type
-
-[*Return type]: `int`.
-
-[*Semantics]: Returns the return type of __count_if__. The return type is always `int`.
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/query/count_if.hpp>
-
-[endsect]
-
-[endsect]
-
-[endsect]
-
-[section Transformation]
-The transformation algorithms create new sequences out of existing sequences by performing some sort of transformation. In reality the new sequences are views onto the data in the original sequences.
-
-[note As the transformation algorithms return views onto their input arguments,
-it is important that the lifetime of the input arguments is greater than the
-period during which you wish to use the results.]
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation.hpp>
-
-[section Functions]
-
-[section filter]
-
-[heading Description]
-For a given sequence, filter returns a new sequences containing only the elements of a specified type.
-
-[heading Synopsis]
-    template<
-        typename T,
-        typename Sequence
-        >
-    typename __result_of_filter__<Sequence const, T>::type filter(Sequence const& seq);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__][Operation's argument]]
-    [[`T`][Any type][The type to retain]]
-]
-
-[heading Expression Semantics]
-    __filter__<T>(seq);
-
-[*Return type]: A model of __forward_sequence__. 
-
-[*Semantics]: Returns a sequence containing all the elements of `seq` of type `T`.
-Equivalent to `__filter_if__<boost::same_type<_, T> >(seq)`.
-
-[heading Complexity]
-Constant. Returns a view which is lazily evaluated.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/filter.hpp>
-
-[heading Example]
-    const __vector__<int,int,long,long> vec(1,2,3,4);
-    assert(__filter__<int>(vec) == __make_vector__(1,2));
-
-[endsect]
-
-[section filter_if]
-
-[heading Description]
-For a given sequence, __filter_if__ returns a new sequences containing
-only the elements with types for which a given __mpl_lambda_expression__ evaluates to `boost::mpl::true_`.
-
-[heading Synopsis]
-    template<
-        typename Pred,
-        typename Sequence
-        >
-    typename __result_of_filter_if__<Sequence const, Pred>::type filter_if(Sequence const& seq);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__][Operation's argument]]
-    [[`Pred`][A unary __mpl_lambda_expression__][The predicate to filter by]]
-]
-
-[heading Expression Semantics]
-    __filter_if__<Pred>(seq);
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a sequence containing all the elements of `seq` with types for which `Pred` evaluates
-to `boost::mpl::true_`. The order of the retained elements is the same as in the original sequence.
-
-[heading Complexity]
-Constant. Returns a view which is lazily evaluated.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/filter_if.hpp>
-
-[heading Example]
-    const __vector__<int,int,double,double> vec(1,2,3.0,4.0);
-    assert(__filter_if__<is_integral<mpl::_> >(vec) == __make_vector__(1,2));
-
-[endsect]
-
-[section transform]
-
-[heading Description]
-For a sequence `seq` and function object or function pointer `f`, `transform` returns a new sequence
-with elements created by applying `f(e)` to each element of `e` of `seq`.
-
-[heading Unary version synopsis]
-    template<
-        typename Sequence,
-        typename F
-        >
-    typename __result_of_transform__<Sequence const, F>::type transform(
-        Sequence const& seq, F f);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__][Operation's argument]]
-    [[`f`][`f(e)` is a valid expression for each element `e` of `seq`. `__boost_result_of_call__<F(E)>::type` is the return type of `f` when called with a value of each element type `E`.][Transformation function]]
-]
-
-[heading Expression Semantics]
-    __transform__(seq, f);
-
-[*Return type]: A model of __forward_sequence__
-
-[*Semantics]: Returns a new sequence, containing the return values of `f(e)` for each element `e` within `seq`.
-
-[heading Binary version synopsis]
-    template<
-        typename Sequence1,
-        typename Sequence2,
-        typename F
-        >
-    typename __result_of_transform__<Sequence1 const, Sequence2 const, F>::type transform(
-        Sequence1 const& seq1, Sequence2 const& seq2, F f);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq1`][A model of __forward_sequence__][Operation's argument]]
-    [[`seq2`][A model of __forward_sequence__][Operation's argument]]
-    [[`f`][`f(e1,e2)` is a valid expression for each pair of elements `e1` of `seq1` and `e2` of `seq2`. `__boost_result_of_call__<F(E1,E2)>::type` is the return type of `f` when called with elements of type `E1` and `E2`][Transformation function]]
-]
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a new sequence, containing the return values of `f(e1, e2)` for each pair of elements `e1` and `e2` within `seq1` and `seq2` respectively.
-
-[heading Complexity]
-Constant. Returns a view which is lazily evaluated.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/transform.hpp>
-
-[heading Example]
-    struct triple
-    {
-        typedef int result_type;
-
-        int operator()(int t) const
-        {
-            return t * 3;
-        };
-    };
-    ...
-    assert(__transform__(__make_vector__(1,2,3), triple()) == __make_vector__(3,6,9));
-
-[endsect]
-
-[section replace]
-
-[heading Description]
-Replaces each value within a sequence of a given type and value with a new value.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename T
-        >
-    typename __result_of_replace__<Sequence const, T>::type replace(
-        Sequence const& seq, T const& old_value, T const& new_value);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__, `e == old_value` is a valid expression, convertible to `bool`, for each element `e` in `seq` with type convertible to `T`][Operation's argument]]
-    [[`old_value`][Any type][Value to replace]]
-    [[`new_value`][Any type][Replacement value]]
-]
-
-[heading Expression Semantics]
-    __replace__(seq, old_value, new_value);
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a new sequence with all the values of `seq` with `new_value` assigned to elements with the same type and equal to `old_value`.
-
-[heading Complexity]
-Constant. Returns a view which is lazily evaluated.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/replace.hpp>
-
-[heading Example]
-    assert(__replace__(__make_vector__(1,2), 2, 3) == __make_vector__(1,3));
-
-[endsect]
-
-[section replace_if]
-
-[heading Description]
-Replaces each element of a given sequence for which an unary function object evaluates to `true` replaced with
-a new value.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename F,
-        typename T>
-    typename __result_of_replace_if__<Sequence const, F, T>::type replace_if(
-        Sequence const& seq, F f, T const& new_value);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__][Operation's argument]]
-    [[`f`][A function object for which `f(e)` is a valid expression, convertible to `bool`, for each element `e` in `seq`][Operation's argument]]
-    [[`new_value`][Any type][Replacement value]]
-]
-
-[heading Expression Semantics]
-    __replace_if__(seq, f, new_value);
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a new sequence with all the elements of `seq`, 
-with `new_value` assigned to each element for which `f` evaluates to `true`.
-
-[heading Complexity]
-Constant. Returns a view which is lazily evaluated.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/replace_if.hpp>
-
-[heading Example]
-    struct odd
-    {
-        template<typename T>
-        bool operator()(T t) const
-        {
-            return t % 2;
-        }
-    };
-    ...
-    assert(__replace_if__(__make_vector__(1,2), odd(), 3) == __make_vector__(3,2));
-
-[endsect]
-
-[section remove]
-
-[heading Description]
-Returns a new sequence, with all the elements of the original sequence, except those of a given type.
-
-[heading Synopsis]
-    template<
-        typename T,
-        typename Sequence
-        >
-    typename __result_of_remove__<Sequence const, T>::type replace(Sequence const& seq);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__][Operation's argument]]
-    [[`T`][Any type][Type to remove]]
-]
-
-[heading Expression Semantics]
-    __remove__<T>(seq);
-
-[*Return type]: A model of __forward_sequence__. 
-
-[*Semantics]: Returns a new sequence, containing all the elements of `seq`, in their original order, except
-those of type `T`. Equivalent to `__remove_if__<boost::is_same<_,T> >(seq)`.
-
-[heading Complexity]
-Constant. Returns a view which is lazily evaluated.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/remove.hpp>
-
-[heading Example]
-    const __vector__<int,double> vec(1,2.0);
-    assert(__remove__<double>(vec) == __make_vector__(1));
-
-[endsect]
-
-[section remove_if]
-
-[heading Description]
-Returns a new sequence, containing all the elements of the original except those where a given unary
-function object evaluates to `true`.
-
-[heading Synopsis]
-    template<
-        typename Pred,
-        typename Sequence
-        >
-    typename __result_of_remove_if__<Sequence const, Pred>::type remove_if(Sequence const& seq);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__][Operation's argument]]
-    [[`Pred`][A model of unary __mpl_lambda_expression__][Removal predicate]]
-]
-
-[heading Expression Semantics]
-    __remove_if__<Pred>(seq);
-
-[*Return type]: A model of __forward_sequence__. 
-
-[*Semantics]: Returns a new sequence, containing all the elements of `seq`, in their original order, except
-those elements with types for which `Pred` evaluates to `boost::mpl::true_`. 
-Equivalent to `__filter__<boost::mpl::not_<Pred> >(seq)`.
-
-[heading Complexity]
-Constant. Returns a view which is lazily evaluated.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/remove_if.hpp>
-
-[heading Example]
-    const __vector__<int,double> vec(1,2.0);
-    assert(__remove_if__<is_floating_point<mpl::_> >(vec) == __make_vector__(1));
-
-[endsect]
-
-[section reverse]
-
-[heading Description]
-Returns a new sequence with the elements of the original in reverse order.
-
-[heading Synposis]
-    template<
-        typename Sequence
-        >
-    typename __result_of_reverse__<Sequence const>::type reverse(Sequence const& seq);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __bidirectional_sequence__][Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __reverse__(seq);
-
-[*Return type]: A model of __bidirectional_sequence__.
-
-[*Semantics]: Returns a new sequence containing all the elements of `seq` in reverse order.
-
-[heading Complexity]
-Constant. Returns a view which is lazily evaluated.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/reverse.hpp>
-
-[heading Example]
-    assert(__reverse__(__make_vector__(1,2,3)) == __make_vector__(3,2,1));
-
-[endsect]
-
-[section clear]
-
-[heading Description]
-__clear__ returns an empty sequence.
-
-[heading Synposis]
-    template<
-        typename Sequence
-        >
-    typename __result_of_clear__<Sequence const>::type clear(Sequence const& seq);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__][Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __clear__(seq);
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Expression Semantics]: Returns a sequence with no elements.
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/clear.hpp>
-
-[heading Example]
-    assert(__clear__(__make_vector__(1,2,3)) == __make_vector__());
-
-[endsect]
-
-[section erase]
-
-[heading Description]
-Returns a new sequence, containing all the elements of the original except those at a specified iterator, or
-between two iterators.
-
-[heading Synposis]
-    template<
-        typename Sequence,
-        typename First
-        >
-    typename __result_of_erase__<Sequence const, First>::type erase(
-        Sequence const& seq, First const& it1);
-
-    template<
-        typename Sequence,
-        typename First,
-        typename Last
-        >
-    typename __result_of_erase__<Sequence const, First, Last>::type erase(
-        Sequence const& seq, First const& it1, Last const& it2);
-
-[table Parameters
-    [[Parameters][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__][Operation's argument]]
-    [[`it1`][A model of __forward_iterator__][Iterator into `seq`]]
-    [[`it2`][A model of __forward_iterator__][Iterator into `seq` after `it1`]]
-]
-
-[heading Expression Semantics]
-    __erase__(seq, pos);
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a new sequence, containing all the elements of `seq` except the element at `pos`.
-
-    __erase__(seq, first, last);
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a new sequence, with all the elements of `seq`, in their original order, except those
-in the range [`first`,`last`).
-
-[heading Complexity]
-Constant. Returns a view which is lazily evaluated.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/erase.hpp>
-
-[heading Example]
-    const __vector__<int, double, char> vec(1, 2.0, 'c');
-    assert(__erase__(vec, __next__(__begin__(vec))) == __make_vector__(1, 'c'));
-    assert(__erase__(vec, __next__(__begin__(vec)), __end__(vec)) == __make_vector__(1));
-
-[endsect]
-
-[section erase_key]
-
-[heading Description]
-For an __associative_sequence__ `seq`, returns a __forward_sequence__ containing all the
-elements of the original except those with a given key.
-
-[heading Synposis]
-    template<
-        typename Key,
-        typename Sequence
-        >
-    typename result_of::erase_key<Sequence const, Key>::type erase_key(Sequence const& seq);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __associative_sequence__][Operation's argument]]
-    [[`Key`][Any type][Key to erase]]
-]
-
-[heading Expression Semantics]
-    __erase_key__<Key>(seq);
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a new sequence, containing all the elements of `seq`, except those with key `Key`.
-
-[heading Complexity]
-Constant. Returns a view which is lazily evaluated.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/erase_key.hpp>
-
-[heading Example]
-    assert(__erase_key__<int>(__make_map__<int, long>('a', 'b')) == __make_map__<long>('b'));
-
-[endsect]
-
-[section insert]
-
-[heading Description]
-Returns a new sequence with all the elements of the original, an a new element inserted the
-position described by a given iterator.
-
-[heading Synposis]
-    template<
-        typename Sequence,
-        typename Pos,
-        typename T
-        >
-    __unspecified__ insert(Sequence const& seq, Pos const& pos, T const& t);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__][Operation's argument]]
-    [[`pos`][A model of __forward_iterator__][The position to insert at]]
-    [[`t`][Any type][The value to insert]]
-]
-
-[heading Expression Semantics]
-    __insert__(seq, p, t);
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a new sequence, containing all the elements of `seq`, in their original order, and a new element with the
-type and value of `t` inserted at iterator `pos`.
-
-[heading Complexity]
-Constant. Returns a view which is lazily evaluated.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/insert.hpp>
-
-[heading Example]
-    const __vector__<int,int> vec(1,2);
-    assert(__insert__(vec, __next__(__begin__(vec)), 3) == __make_vector__(1,3,2));
-
-[endsect]
-
-[section insert_range]
-
-[heading Description]
-Returns a new sequence with another sequence inserted at a specified iterator.
-
-[heading Synposis]
-    template<
-        typename Sequence,
-        typename Pos,
-        typename Range
-        >
-    typename __result_of_insert_range__<Sequence const, Pos, Range>::type insert_range(
-        Sequence const& seq, Pos const& pos, Range const& range);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__][Operation's argument]]
-    [[`pos`][A model of __forward_iterator__][The position to insert at]]
-    [[`range`][A model of __forward_sequence__][Range to insert]]
-]
-
-[heading Expression Semantics]
-    __insert__(seq, pos, range);
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a new sequence, containing all the elements of `seq`, and the elements of
-`range` inserted at iterator `pos`. All elements retaining their ordering from the orignal sequences.
-
-[heading Complexity]
-Constant. Returns a view which is lazily evaluated.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/insert_range.hpp>
-
-[heading Example]
-    const __vector__<int,int> vec(1,2);
-    assert(__insert_range__(vec, __next__(__begin__(vec)), __make_vector__(3,4)) == __make_vector__(1,3,4,2));
-
-[endsect]
-
-[section join]
-
-[heading Description]
-Takes 2 sequences and returns a sequence containing the elements of the first followed by the elements of the second.
-
-[heading Synopsis]
-    template<
-        typename LhSequence,
-        typename RhSequence>
-    typename __result_of_join__<LhSequence, RhSequence>::type join(LhSequence const& lhs, RhSequence const& rhs);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`lhs`][A model of __forward_sequence__][Operation's argument]]
-    [[`rhs`][A model of __forward_sequence__][Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __join__(lhs, rhs);
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a sequence containing all the elements of `lhs` followed by all the elements of `rhs`. The order of th elements is preserved.
-
-[heading Complexity]
-Constant. Returns a view which is lazily evaluated.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/join.hpp>
-
-[heading Example]
-    __vector__<int,char> v1(1, 'a');
-    __vector__<int,char> v2(2, 'b');
-    assert(__join__(v1, v2) == __make_vector__(1,'a',2,'b'));
-
-[endsect]
-
-[section zip]
-
-[heading Description]
-Zips sequences together to form a single sequence, whos members are tuples of the members of the component sequences.
-
-[heading Synopsis]
-    template<
-        typename Sequence1,
-        typename Sequence2,
-        ...
-        typename SequenceN
-        >
-    typename __result_of_zip__<Sequence1, Sequence2, ... SequenceN>::type 
-    zip(Sequence1 const& seq1, Sequence2 const& seq2, ... SequenceN const& seqN);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq1` to `seqN`][Each sequence is a model of __forward_sequence__.][Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __zip__(seq1, seq2, ... seqN);
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a sequence containing tuples of elements from sequences `seq1` to `seqN`. For example, applying zip to tuples `(1, 2, 3)` and `('a', 'b', 'c')` would return `((1, 'a'),(2, 'b'),(3, 'c'))`
-
-[heading Complexity]
-Constant. Returns a view which is lazily evaluated.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/zip.hpp>
-
-[heading Example]
-    __vector__<int,char> v1(1, 'a');
-    __vector__<int,char> v2(2, 'b');
-    assert(__zip__(v1, v2) == __make_vector__(__make_vector__(1, 2),__make_vector__('a', 'b'));
-
-[endsect]
-
-[section pop_back]
-
-[heading Description]
-Returns a new sequence, with the last element of the original removed. 
-
-[heading Synopsis]
-    template<
-        typename Sequence
-        >
-    typename __result_of_pop_back__<Sequence const>::type pop_back(Sequence const& seq);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__][Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __pop_back__(seq);
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a new sequence containing all the elements of `seq`, except the last element. The elements in the new sequence are in the same order as they were in `seq`.
-
-[heading Complexity]
-Constant. Returns a view which is lazily evaluated.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/pop_back.hpp>
-
-[heading Example]
-    assert(___pop_back__(__make_vector__(1,2,3)) == __make_vector__(1,2));
-
-[endsect]
-
-[section pop_front]
-
-[heading Description]
-Returns a new sequence, with the first element of the original removed.
-
-[heading Synopsis]
-    template<
-        typename Sequence
-        >
-    typename __result_of_pop_front__<Sequence const>::type pop_front(Sequence const& seq);
-
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__][Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __pop_front__(seq);
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a new sequence containing all the elements of `seq`, except the first element. The elements in the new sequence are in the same order as they were in `seq`.
-
-[heading Complexity]
-Constant. Returns a view which is lazily evaluated.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/pop_front.hpp>
-
-[heading Example]
-    assert(__pop_front__(__make_vector__(1,2,3)) == __make_vector__(2,3));
-
-[endsect]
-
-[section push_back]
-
-[heading Description]
-Returns a new sequence with an element added at the end.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename T
-        >
-    typename __result_of_push_back__<Sequence, T>::type push_back(
-        Sequence const& seq, T const& t);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__][Operation's argument]]
-    [[`t`][Any type][The value to add to the end]]
-]
-
-[heading Expression Semantics]
-    __push_back__(seq, t);
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a new sequence, containing all the elements of `seq`, and new element `t` appended to the end. The elements are in the same order as they were in `seq`.
-
-[heading Complexity]
-Constant. Returns a view which is lazily evaluated.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/push_back.hpp>
-
-[heading Example]
-    assert(__push_back__(__make_vector__(1,2,3),4) == __make_vector__(1,2,3,4));
-
-[endsect]
-
-[section push_front]
-
-[heading Description]
-Returns a new sequence with an element added at the beginning.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename T
-        >
-    typename __result_of_push_front__<Sequence, T>::type push_front(
-        Sequence const& seq, T const& t);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__][Operation's argument]]
-    [[`t`][Any type][The value to add to the beginning]]
-]
-
-[heading Expression Semantics]
-    __push_back__(seq, t);
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a new sequence, containing all the elements of `seq`, and new element `t` appended to the beginning. The elements are in the same order as they were in `seq`.
-
-[heading Complexity]
-Constant. Returns a view which is lazily evaluated.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/push_front.hpp>
-
-[heading Example]
-    assert(__push_front__(__make_vector__(1,2,3),0) == __make_vector__(0,1,2,3));
-
-[endsect]
-
-[endsect]
-
-[section Metafunctions]
-
-[section filter]
-
-[heading Description]
-Returns the result type of __filter__ given the sequence type and type to retain.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename T
-        >
-    struct filter
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameter
-    [[Parameter] [Requirement] [Description]]
-    [[`Sequence`][A model of __forward_sequence__] [Operation's argument]]
-    [[`T`][Any type][Type to retain]]
-]
-
-[heading Expression Semantics]
-    __result_of_filter__<Sequence, T>::type
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a sequence containing the elements of `Sequence` that are of type `T`. Equivalent to `__result_of_filter_if__<Sequence, boost::is_same<mpl::_, T> >::type`.
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/filter.hpp>
-
-[endsect]
-
-[section filter_if]
-
-[heading Description]
-Returns the result type of __filter_if__ given the sequence and unary __mpl_lambda_expression__ predicate type.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename Pred
-        >
-    struct filter_if
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameter
-    [[Parameter] [Requirement] [Description]]
-    [[`Sequence`][A model of __forward_sequence__] [Operation's argument]]
-    [[`Pred`][A unary __mpl_lambda_expression__][Type to retain]]
-]
-
-[heading Expression Semantics]
-    __result_of_filter_if__<Sequence, Pred>::type
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a sequence containing the elements of `Sequence` for which `Pred` evaluates to `boost::mpl::true_`.
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/filter_if.hpp>
-
-[endsect]
-
-[section transform]
-
-[heading Description]
-For a sequence `seq` and function object or function pointer `f`, `transform` returns a new sequence
-with elements created by applying `f(e)` to each element of `e` of `seq`.
-
-[heading Unary version synopsis]
-    template<
-        typename Sequence,
-        typename F
-        >
-    typename __result_of_transform__<Sequence const, F>::type transform(
-        Sequence const& seq, F f);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq`][A model of __forward_sequence__][Operation's argument]]
-    [[`f`][`f(e)` is a valid expression for each element `e` of `seq`. `__boost_result_of_call__<F(E)>::type` is the return type of `f` when called with a value of each element type `E`.][Transformation function]]
-]
-
-[heading Expression Semantics]
-    __transform__(seq, f);
-
-[*Return type]: A model of __forward_sequence__
-
-[*Semantics]: Returns a new sequence, containing the return values of `f(e)` for each element `e` within `seq`.
-
-[heading Binary version synopsis]
-    template<
-        typename Sequence1,
-        typename Sequence2,
-        typename F
-        >
-    typename __result_of_transform__<Sequence1 const, Sequence2 const, F>::type transform(
-        Sequence1 const& seq1, Sequence2 const& seq2, F f);
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`seq1`][A model of __forward_sequence__][Operation's argument]]
-    [[`seq2`][A model of __forward_sequence__][Operation's argument]]
-    [[`f`][`f(e1,e2)` is a valid expression for each pair of elements `e1` of `seq1` and `e2` of `seq2`. `__boost_result_of_call__<F(E1,E2)>::type` is the return type of `f` when called with elements of type `E1` and `E2`][Transformation function]]
-]
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a new sequence, containing the return values of `f(e1, e2)` for each pair of elements `e1` and `e2` within `seq1` and `seq2` respectively.
-
-[heading Complexity]
-Constant. Returns a view which is lazily evaluated.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/transform.hpp>
-
-[heading Example]
-    struct triple
-    {
-        typedef int result_type;
-
-        int operator()(int t) const
-        {
-            return t * 3;
-        };
-    };
-    ...
-    assert(__transform__(__make_vector__(1,2,3), triple()) == __make_vector__(3,6,9));
-
-[endsect]
-
-[section replace]
-
-[heading Description]
-Returns the result type of __replace__, given the types of the input sequence and element to replace.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename T
-        >
-    struct replace
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`Sequence`][A model of __forward_sequence__][Operation's argument]]
-    [[`T`][Any type][The type of the search and replacement objects]]    
-]
-
-[heading Expression Semantics]
-    __result_of_replace__<Sequence,T>::type
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns the return type of __replace__.
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/replace.hpp>
-
-[endsect]
-
-[section replace_if]
-
-[heading Description]
-Returns the result type of __replace_if__, given the types of the sequence, __poly_func_obj__ predicate and replacement object.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename F,
-        typename T>
-    struct replace_if
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`Sequence`][A model of __forward_sequence__][Operation's argument]]
-    [[`F`][A model of unary __poly_func_obj__][Replacement predicate]]
-    [[`T`][Any type][The type of the replacement object]]
-]
-
-[heading Expression Semantics]
-    __result_of_replace_if__<Sequence,F,T>::type
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns the return type of __replace_if__.
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/replace_if.hpp>
-
-[endsect]
-
-[section remove]
-
-[heading Description]
-Returns the result type of __remove__, given the sequence and removal types.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename T
-        >
-    struct remove
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`Sequence`][A model of __forward_sequence__][Operation's argument]]
-    [[`T`][Any type][Remove elements of this type]]
-]
-
-[heading Expression Semantics]
-    __result_of_remove__<Sequence, T>::type
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a sequence containing the elements of `Sequence` not of type `T`. Equivalent to `__result_of_replace_if__<Sequence, boost::is_same<mpl::_, T> >::type`.
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/remove.hpp>
-
-[endsect]
-
-[section remove_if]
-
-[heading Description]
-Returns the result type of __remove_if__, given the input sequence and unary __mpl_lambda_expression__ predicate types.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename Pred
-        >
-    struct remove_if
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`Sequence`][A model of __forward_sequence__][Operation's argument]]
-    [[`Pred`][A model of unary __mpl_lambda_expression__][Remove elements which evaluate to `boost::mpl::true_`]]
-]
-
-[heading Expression Semantics]
-    __result_of_remove_if__<Sequence, Pred>::type
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a sequence containing the elements of `Sequence` for which `Pred` evaluates to `boost::mpl::false_`.
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/remove_if.hpp>
-
-[endsect]
-
-[section reverse]
-
-[heading Description]
-Returns the result type of __reverse__, given the input sequence type.
-
-[heading Synopsis]
-    template<
-        typename Sequence
-        >
-    struct reverse
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`Sequence`][A model of __bidirectional_sequence__][Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __result_of_reverse__<Sequence>::type
-
-[*Return type]: A model of __bidirectional_sequence__.
-
-[*Semantics]: Returns a sequence with the elements in the reverse order to `Sequence`.
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/reverse.hpp>
-
-[endsect]
-
-[section clear]
-
-[heading Description]
-Returns the result type of __clear__, given the input sequence type.
-
-[heading Synopsis]
-    template<
-        typename Sequence
-        >
-    struct clear
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`Sequence`][Any type][Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __result_of_clear__<Sequence>::type
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns an empty sequence.
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/clear.hpp>
-
-[endsect]
-
-[section erase]
-Returns the result type of __erase__, given the input sequence and range delimiting iterator types.
-
-[heading Description]
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename It1,
-        typename It2 = __unspecified__>
-    struct erase
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`Sequence`][A model of __forward_sequence__][Operation's argument]]
-    [[`It1`][A model of __forward_iterator__][Operation's argument]]
-    [[`It2`][A model of __forward_iterator__][Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __result_of_erase__<Sequence, It1>::type
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a new sequence with the element at `It1` removed.
-
-    __result_of_erase__<Sequence, It1, It2>::type
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a new sequence with the elements between `It1` and `It2` removed.
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/erase.hpp>
-
-[endsect]
-
-[section erase_key]
-
-[heading Description]
-Returns the result type of __erase_key__, given the sequence and key types.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename Key
-        >
-    struct erase_key
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`Sequence`][A model of __associative_sequence__][Operation's argument]]
-    [[`Key`][Any type][Key type]]
-]
-
-[heading Expression Semantics]
-    __result_of_erase_key__<Sequence, Key>::type
-
-[*Return type]: A model of __associative_sequence__.
-
-[*Semantics]: Returns a sequence with the elements of `Sequence`, except those with key `Key`.
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/erase_key.hpp>
-
-[endsect]
-
-[section insert]
-
-[heading Description]
-Returns the result type of __insert__, given the sequence, position iterator and insertion types.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename Position,
-        typename T
-        >
-    struct insert
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`Sequence`][A model of __forward_sequence__][Operation's argument]]
-    [[`Position`][A model of __forward_iterator__][Operation's argument]]
-    [[`T`][Any type][Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __result_of_insert__<Sequence, Position, T>::type
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a sequence with an element of type `T` inserted at position `Position` in `Sequence`.
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/insert.hpp>
-
-[endsect]
-
-[section insert_range]
-
-[heading Description]
-Returns the result type of __insert_range__, given the input sequence, position iterator and insertion range types.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename Position,
-        typename Range
-        >
-    struct insert_range
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`Sequence`][A model of __forward_sequence__][Operation's argument]]
-    [[`Position`][A model of __forward_iterator__][Operation's argument]]
-    [[`Range`][A model of __forward_sequence__][Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __result_of_insert_range__<Sequence, Position, Range>::type
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a sequence with the elements of `Range` inserted at position `Position` into `Sequence`.
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/insert_range.hpp>
-
-[endsect]
-
-[section join]
-
-[heading Description]
-Returns the result of joining 2 sequences, given the sequence types.
-
-[heading Synopsis]
-    template<
-        typename LhSequence,
-        typename RhSequence
-        >
-    struct join
-    {
-        typedef __unspecified__ type;
-    };
-
-[heading Expression Semantics]
-    __result_of_join__<LhSequence, RhSequence>::type
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a sequence containing the elements of `LhSequence` followed by the elements of `RhSequence`. The order of the elements in the 2 sequences is preserved.
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/join.hpp>
-
-[endsect]
-
-[section zip]
-
-[heading Description]
-Zips sequences together to form a single sequence, whos members are tuples of the members of the component sequences.
-
-[heading Synopsis]
-    template<
-        typename Sequence1,
-        typename Sequence2,
-        ...
-        typename SequenceN
-        >
-    struct zip
-    {
-        typedef __unspecified__ type;
-    };
-
-[heading Expression Semantics]
-    __result_of_zip__<Sequence1, Sequence2, ... SequenceN>::type
-
-[*Return type]: A model of the most restrictive traversal category of sequences `Sequence1` to `SequenceN`.
-
-[*Semantics]: Return a sequence containing tuples of elements from each sequence. For example, applying zip to tuples `(1, 2, 3)` and `('a', 'b', 'c')` would return `((1, 'a'),(2, 'b'),(3, 'c'))`
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/zip.hpp>
-
-[endsect]
-
-[section pop_back]
-
-[heading Description]
-Returns the result type of __pop_back__, given the input sequence type.
-
-[heading Synopsis]
-    template<
-        typename Sequence
-        >
-    struct pop_back
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`Sequence`][A model of __forward_sequence__][Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __result_of_pop_back__<Sequence>::type
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a sequence with all the elements of `Sequence` except the last element.
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/tranformation/pop_back.hpp>
-
-[endsect]
-
-[section pop_front]
-
-[heading Description]
-Returns the result type of __pop_front__, given the input sequence type.
-
-[heading Synopsis]
-    template<
-        typename Sequence
-        >
-    struct pop_front
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`Sequence`][A model of __forward_sequence__][Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __result_of_pop_front__<Sequence>::type
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a sequence with all the elements of `Sequence` except the first element.
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/pop_front.hpp>
-
-[endsect]
-
-[section push_back]
-
-[heading Description]
-Returns the result type of __push_back__, given the types of the input sequence and element to push.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename T
-        >
-    struct push_back
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`Sequence`][A model of __forward_sequence__][Operation's argument]]
-    [[`T`][Any type][Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __result_of_push_back__<Sequence, T>::type
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a sequence with the elements of `Sequence` and an element of type `T` added to the end.
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/push_back.hpp>
-
-[endsect]
-
-[section push_front]
-
-[heading Description]
-Returns the result type of __push_front__, given the types of the input sequence and element to push.
-
-[heading Synopsis]
-    template<
-        typename Sequence,
-        typename T
-        >
-    struct push_front
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter][Requirement][Description]]
-    [[`Sequence`][A model of __forward_sequence__][Operation's argument]]
-    [[`T`][Any type][Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __result_of_push_front__<Sequence, T>::type
-
-[*Return type]: A model of __forward_sequence__.
-
-[*Semantics]: Returns a sequence with the elements of `Sequence` and an element of type `T` added to the beginning.
-
-[heading Complexity]
-Constant.
-
-[heading Header]
-    #include <boost/fusion/algorithm/transformation/push_front.hpp>
-
-[endsect]
-
-[endsect]
-
-[endsect]
-
-[endsect]

Modified: branches/proto/v3/libs/fusion/doc/extension.qbk
==============================================================================
--- branches/proto/v3/libs/fusion/doc/extension.qbk	(original)
+++ branches/proto/v3/libs/fusion/doc/extension.qbk	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -1,9 +1,9 @@
 [section Extension]
 
-[section The Full Extension Mechanism]
+[section:ext_full The Full Extension Mechanism]
 
 The Fusion library is designed to be extensible, new sequences types can easily
-be added. In fact, the library support for `std::pair`, `boost::array` and __mpl__ 
+be added. In fact, the library support for `std::pair`, `boost::array` and __mpl__
 sequences is entirely provided using the extension mechanism.
 
 The process for adding a new sequence type to Fusion is:
@@ -30,7 +30,7 @@
             {}
         };
     }
-    
+
 We are going to pretend that this type has been provided by a 3rd party
 library, and therefore cannot be modified. We shall work through all the
 necessary steps to enable `example_struct` to serve as an __associative_sequence__
@@ -52,8 +52,9 @@
 `traits::tag_of` for our sequence type.
 
     #include <boost/fusion/support/tag_of_fwd.hpp>
+    #include <boost/fusion/include/tag_of_fwd.hpp>
 
-    namespace boost { namespace fusion { namespace traits {        
+    namespace boost { namespace fusion { namespace traits {
         template<>
         struct tag_of<example_struct>
         {
@@ -61,12 +62,13 @@
         };
     }}}
 
-`traits::tag_of` also has a second template argument, 
-that can be used in conjuction with `boost::enable_if` to provide tag 
+`traits::tag_of` also has a second template argument,
+that can be used in conjuction with `boost::enable_if` to provide tag
 support for groups of related types. This feature is not necessary
 for our sequence, but for an example see the code in:
 
-    #include <boost/fusion/sequence/adapted/mpl/tag_of.hpp>
+    #include <boost/fusion/adapted/array/tag_of.hpp>
+    #include <boost/fusion/include/tag_of.hpp>
 
 [heading Designing a suitable iterator]
 
@@ -98,7 +100,7 @@
 # The iterator is parameterized by the type it is iterating over, and the index of the current element.
 # The typedefs `struct_type` and `index` provide convenient access to information we will need later in
   the implementation.
-# The typedef `category` allows the `traits::__category_of__` metafunction to establish 
+# The typedef `category` allows the `traits::__category_of__` metafunction to establish
   the traversal category of the iterator.
 # The constructor stores a reference to the `example_struct` being iterated over.
 
@@ -111,7 +113,7 @@
 [heading A first couple of instructive features]
 
 To start with, we will get the __result_of_value_of__ metafunction working. To
-do this, we provide a specialization of the `boost::fusion::extension::value_of_impl` template for 
+do this, we provide a specialization of the `boost::fusion::extension::value_of_impl` template for
 our iterator's tag type.
 
     template<>
@@ -186,7 +188,7 @@
     }
 
 The use of `deref_impl` is very similar to that of `value_of_impl`, but it also
-provides some runtime functionality this time via the `call` static member function. 
+provides some runtime functionality this time via the `call` static member function.
 To see how `deref_impl` is used, lets have a look at the implementation of __deref__:
 
     namespace result_of
@@ -211,7 +213,7 @@
 by __deref__ is provided by the `call` static function of the selected
 __mpl_metafunction_class__.
 
-The actual implementation of `deref_impl` is slightly more complex than that of  `value_of_impl`. 
+The actual implementation of `deref_impl` is slightly more complex than that of  `value_of_impl`.
 We also need to implement the `call` function, which returns a reference
 to the appropriate member of the underlying sequence. We also require a little
 bit of metaprogramming to return `const` references if the underlying sequence
@@ -259,7 +261,7 @@
 in order to satisfy the necessary complexity guarantees. As our iterator is
 a __random_access_iterator__ we will have to implement all of these functions.
 
-Full implementations of `prior_impl`, `advance_impl`, `distance_impl` and `equal_to_impl` are 
+Full implementations of `prior_impl`, `advance_impl`, `distance_impl` and `equal_to_impl` are
 provided in the example code.
 
 [heading Implementing the intrinsic functions of the sequence]
@@ -277,7 +279,7 @@
 
 We've some similar formalities to complete, providing `category_of_impl` so Fusion
 can correctly identify our sequence type, and `is_view_impl` so Fusion can correctly
-identify our sequence as not being a __view__ type. Implementations are 
+identify our sequence as not being a __view__ type. Implementations are
 provide in the example code.
 
 Now we've completed some formalities, on to more interesting features. Lets get
@@ -302,7 +304,7 @@
 
 The implementation uses the same ideas we have applied throughout, in this case
 we are just creating one of the iterators we developed earlier, pointing to the
-first element in the sequence. The implementation of __end__ is very similar, and 
+first element in the sequence. The implementation of __end__ is very similar, and
 is provided in the example code.
 
 For our __random_access_sequence__ we will also need to implement `size_impl`,
@@ -310,10 +312,10 @@
 
 [heading Enabling our type as an associative container]
 
-In order for `example_struct` to serve as an associative container, 
+In order for `example_struct` to serve as an associative container,
 we need to enable 3 lookup features, __at_key__, __value_at_key__ and __has_key__.
 We also need to provide an implementation of the `is_associative` trait
-so that our sequence can be correctly identified as an associative container. 
+so that our sequence can be correctly identified as an associative container.
 
 To implement `at_key_impl` we need to associate the `fields::age` and `fields::age`
 types described in the __quick_start__ guide with the appropriate members of `example_struct`.
@@ -377,24 +379,24 @@
 
 [endsect]
 
-[section Sequence Fascade]
+[section Sequence Facade]
 
 [heading Description]
-The __sequence_fascade__ template provides an intrusive mechanism for
+The __sequence_facade__ template provides an intrusive mechanism for
 producing a conforming Fusion iterator.
 
 [heading Synopsis]
     template<typename Derived, typename TravesalTag, typename IsView = mpl::false_>
-    struct sequence_fascade;
+    struct sequence_facade;
 
 [heading Usage]
-The user of __sequence_fascade__ derives his sequence type from a specialization of __sequence_fascade__ and passes the derived sequence type as the first template parameter. The second template parameter should be the traversal category of the sequence being implemented. The 3rd parameter should be set to `mpl::true_` if the sequence is a view.
+The user of __sequence_facade__ derives his sequence type from a specialization of __sequence_facade__ and passes the derived sequence type as the first template parameter. The second template parameter should be the traversal category of the sequence being implemented. The 3rd parameter should be set to `mpl::true_` if the sequence is a view.
 
 The user must the implement the key expressions required by their sequence type.
 
 [table Parameters
 [[Name][Description]]
-[[`sequence`, `Seq`][A type derived from __sequence_fascade__]]
+[[`sequence`, `Seq`][A type derived from __sequence_facade__]]
 [[`N`][An __mpl_integral_constant__]]
 ]
 
@@ -411,21 +413,20 @@
 [[`sequence::template value_at<Sequence, N>::type`][The type of the `N`th element in a sequence of type `Seq`]]
 ]
 
-[heading Header]
-    #include <boost/fusion/sequence/sequence_facade.hpp>
+/sequence/sequence_facade.hpp>
 
 [endsect]
 
-[section Iterator Fascade]
+[section Iterator Facade]
 
 [heading Description]
-The __iterator_fascade__ template provides an intrusive mechanism for
+The __iterator_facade__ template provides an intrusive mechanism for
 producing a conforming Fusion iterator.
 
 [heading Synopsis]
 
     template<typename Derived, typename TravesalTag>
-    struct iterator_fascade;
+    struct iterator_facade;
 
 [heading Usage]
 The user of iterator_facade derives his iterator type from a specialization of iterator_facade and passes the derived iterator type as the first template parameter. The second template parameter should be the traversal category of the iterator being implemented.
@@ -434,7 +435,7 @@
 
 [table Parameters
 [[Name][Description]]
-[[`iterator`, `It`, `It1`, `It2`][A type derived from __iterator_fascade__]]
+[[`iterator`, `It`, `It1`, `It2`][A type derived from __iterator_facade__]]
 [[`N`][An __mpl_integral_constant__]]
 ]
 
@@ -458,12 +459,13 @@
 [heading Header]
 
     #include <boost/fusion/iterator/iterator_facade.hpp>
+    #include <boost/fusion/include/iterator_facade.hpp>
 
 [endsect]
 
 [section Macros]
 
-[section BOOST_FUSION_ADAPT_STRUCT]
+[section:adapt_struct BOOST_FUSION_ADAPT_STRUCT]
 
 [heading Description]
 BOOST_FUSION_ADAPT_STRUCT is a macro that can be used to generate all the
@@ -493,8 +495,7 @@
 The macro should be used at global scope, and `struct_name` should be the fully
 namespace qualified name of the struct to be converted.
 
-[heading Header]
-    #include <boost/fusion/adapted/struct/adapt_struct.hpp>
+/adapted/struct/adapt_struct.hpp>
 
 [heading Example]
     namespace demo
@@ -514,7 +515,7 @@
 
 [endsect]
 
-[section BOOST_FUSION_ADAPT_ASSOC_STRUCT]
+[section:adapt_assoc BOOST_FUSION_ADAPT_ASSOC_STRUCT]
 
 [heading Description]
 BOOST_FUSION_ADAPT_ASSOC_STRUCT is a macro that can be used to generate all the
@@ -538,16 +539,15 @@
         )
 
 The above macro generates the necessary code to adapt `struct_name`
-as a model of __random_access_sequence__ and __associative_sequence__. 
+as a model of __random_access_sequence__ and __associative_sequence__.
 The sequence of `(member_typeN, member_nameN, key_typeN)`
-triples declare the type, name and key type of each of the struct members 
+triples declare the type, name and key type of each of the struct members
 that will be part of the sequence.
 
 The macro should be used at global scope, and `struct_name` should be the fully
 namespace qualified name of the struct to be converted.
 
-[heading Header]
-    #include <boost/fusion/adapted/struct/adapt_assoc_struct.hpp>
+/adapted/struct/adapt_assoc_struct.hpp>
 
 [heading Example]
     namespace demo

Modified: branches/proto/v3/libs/fusion/doc/functional.qbk
==============================================================================
--- branches/proto/v3/libs/fusion/doc/functional.qbk	(original)
+++ branches/proto/v3/libs/fusion/doc/functional.qbk	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -3,8 +3,7 @@
 Components to call functions and function objects and to make Fusion code
 callable through a function object interface.
 
-[heading Header]
-    #include <boost/fusion/functional.hpp>
+/functional.hpp>
 
 [heading Fused and unfused forms]
 
@@ -283,8 +282,7 @@
 [*Semantics]: Invokes `f` with the elements in `s` as arguments and returns 
 the result of the call expression.
 
-[heading Header]
-    #include <boost/fusion/functional/invocation/invoke.hpp>
+/functional/invocation/invoke.hpp>
 
 [heading Example]
     __std_plus_doc__<int> add;
@@ -347,8 +345,7 @@
 
 [*Semantics]: Invokes `f` with the elements in `s` as arguments.
 
-[heading Header]
-    #include <boost/fusion/functional/invocation/invoke_procedure.hpp>
+/functional/invocation/invoke_procedure.hpp>
 
 [heading Example]
     __vector__<int,int> v(1,2);
@@ -405,8 +402,7 @@
 [*Semantics]: Invokes `f` with the elements in `s` as arguments and returns the
 result of the call expression.
 
-[heading Header]
-    #include <boost/fusion/functional/invocation/invoke_function_object.hpp>
+/functional/invocation/invoke_function_object.hpp>
 
 [heading Example]
     struct sub
@@ -548,8 +544,7 @@
 defined (Boost provides this function for [^std::auto_ptr] and 
 __boost_shared_ptr_call__).
 
-[heading Header]
-    #include <boost/fusion/functional/adapter/fused.hpp>
+/functional/adapter/fused.hpp>
 
 [heading Synopsis]
     template <typename Function>
@@ -625,8 +620,7 @@
 such a pointer without returning anything does not make sense, so this case
 is not implemented).
 
-[heading Header]
-    #include <boost/fusion/functional/adapter/fused_procedure.hpp>
+/functional/adapter/fused_procedure.hpp>
 
 [heading Synopsis]
     template <typename Function>
@@ -699,8 +693,7 @@
 target function object that is const or, if the target function object
 is held by value, the adapter is const).
 
-[heading Header]
-    #include <boost/fusion/functional/adapter/fused_function_object.hpp>
+/functional/adapter/fused_function_object.hpp>
 
 [heading Synopsis]
     template <class Function>
@@ -799,8 +792,7 @@
 the target function object is const - or, in case the target function 
 object is held by value, the adapter is const).
 
-[heading Header]
-    #include <boost/fusion/functional/adapter/unfused_generic.hpp>
+/functional/adapter/unfused_generic.hpp>
 
 [heading Synopsis]
     template <class Function>
@@ -907,8 +899,7 @@
 the target function object is const - or, in case the target function 
 object is held by value, the adapter is const).
 
-[heading Header]
-    #include <boost/fusion/functional/adapter/unfused_lvalue_args.hpp>
+/functional/adapter/unfused_lvalue_args.hpp>
 
 [heading Synopsis]
     template <class Function>
@@ -989,8 +980,7 @@
 the target function object is const - or, in case the target function object
 is held by value, the adapter is const).
 
-[heading Header]
-    #include <boost/fusion/functional/adapter/unfused_rvalue_args.hpp>
+/functional/adapter/unfused_rvalue_args.hpp>
 
 [heading Synopsis]
     template <class Function>
@@ -1081,8 +1071,7 @@
 non-reference elements, the element is copied only once - the call operator's 
 signature is optimized automatically to avoid by-value parameters.]
 
-[heading Header]
-    #include <boost/fusion/functional/adapter/unfused_typed.hpp>
+/functional/adapter/unfused_typed.hpp>
 
 [heading Synopsis]
     template <class Function, class Sequence>
@@ -1231,6 +1220,7 @@
 [heading Header]
 
     #include <boost/fusion/functional/generation/make_fused.hpp>
+    #include <boost/fusion/include/make_fused.hpp>
 
 [heading Example]
     float sub(float a, float b) { return a - b; }
@@ -1279,6 +1269,7 @@
 [heading Header]
 
     #include <boost/fusion/functional/generation/make_fused_procedure.hpp>
+    #include <boost/fusion/include/make_fused_procedure.hpp>
 
 [heading Example]
     __vector__<int,int,int> v(1,2,3);
@@ -1321,6 +1312,7 @@
 [heading Header]
 
     #include <boost/fusion/functional/generation/make_fused_function_object.hpp>
+    #include <boost/fusion/include/make_fused_function_object.hpp>
 
 [heading Example]
     struct sub
@@ -1382,6 +1374,7 @@
 [heading Header]
 
     #include <boost/fusion/functional/generation/make_unfused_generic.hpp>
+    #include <boost/fusion/include/make_unfused_generic.hpp>
 
 [heading Example]
     struct bottles_song
@@ -1450,6 +1443,7 @@
 [heading Header]
 
     #include <boost/fusion/functional/generation/make_unfused_lvalue_args.hpp>
+    #include <boost/fusion/include/make_unfused_lvalue_args.hpp>
 
 [heading Example]
     struct fused_incrementer
@@ -1509,6 +1503,7 @@
 [heading Header]
 
     #include <boost/fusion/functional/generation/make_unfused_rvalue_args.hpp>
+    #include <boost/fusion/include/make_unfused_rvalue_args.hpp>
 
 [heading Example]
     struct sequence_printer
@@ -1551,6 +1546,7 @@
 [heading Header]
 
     #include <boost/fusion/functional/generation/make_fused.hpp>
+    #include <boost/fusion/include/make_fused.hpp>
 
 [heading Synopsis]
     namespace result_of
@@ -1575,6 +1571,7 @@
 [heading Header]
 
     #include <boost/fusion/functional/generation/make_fused_procedure.hpp>
+    #include <boost/fusion/include/make_fused_procedure.hpp>
 
 [heading Synopsis]
     namespace result_of
@@ -1599,6 +1596,7 @@
 [heading Header]
 
     #include <boost/fusion/functional/generation/make_fused_function_object.hpp>
+    #include <boost/fusion/include/make_fused_function_object.hpp>
 
 [heading Synopsis]
     namespace result_of
@@ -1623,6 +1621,7 @@
 [heading Header]
 
     #include <boost/fusion/functional/generation/make_unfused_generic.hpp>
+    #include <boost/fusion/include/make_unfused_generic.hpp>
 
 [heading Synopsis]
     namespace result_of
@@ -1647,6 +1646,7 @@
 [heading Header]
 
     #include <boost/fusion/functional/generation/make_unfused_lvalue_args.hpp>
+    #include <boost/fusion/include/make_unfused_lvalue_args.hpp>
 
 [heading Synopsis]
     namespace result_of
@@ -1671,6 +1671,7 @@
 [heading Header]
 
     #include <boost/fusion/functional/generation/make_unfused_rvalue_args.hpp>
+    #include <boost/fusion/include/make_unfused_rvalue_args.hpp>
 
 [heading Synopsis]
     namespace result_of

Modified: branches/proto/v3/libs/fusion/doc/fusion.qbk
==============================================================================
--- branches/proto/v3/libs/fusion/doc/fusion.qbk	(original)
+++ branches/proto/v3/libs/fusion/doc/fusion.qbk	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -65,189 +65,189 @@
 [def __pair__                   [link fusion.support.pair `pair`]]
 [def __fusion_make_pair__       [link fusion.support.pair `make_pair`]]
 
-[def __iterator__               [link fusion.iterators Iterator]]
-[def __iterator_concepts__      [link fusion.iterators.concepts Iterator Concepts]]
-[def __forward_iterator__       [link fusion.iterators.concepts.forward_iterator Forward Iterator]]
-[def __bidirectional_iterator__ [link fusion.iterators.concepts.bidirectional_iterator Bidirectional Iterator]]
-[def __random_access_iterator__ [link fusion.iterators.concepts.random_access_iterator Random Access Iterator]]
-
-[def __next__                   [link fusion.iterators.functions.next `next`]]
-[def __prior__                  [link fusion.iterators.functions.prior `prior`]]
-[def __advance__                [link fusion.iterators.functions.advance `advance`]]
-[def __advance_c__              [link fusion.iterators.functions.advance_c `advance_c`]]
-[def __distance__               [link fusion.iterators.functions.distance `distance`]]
-[def __deref__                  [link fusion.iterators.functions.deref `deref`]]
-
-[def __result_of_next__         [link fusion.iterators.metafunctions.next `result_of::next`]]
-[def __result_of_prior__        [link fusion.iterators.metafunctions.prior `result_of::prior`]]
-[def __result_of_equal_to__     [link fusion.iterators.metafunctions.equal_to `result_of::equal_to`]]
-[def __result_of_advance__      [link fusion.iterators.metafunctions.advance `result_of::advance`]]
-[def __result_of_advance_c__    [link fusion.iterators.metafunctions.advance_c `result_of::advance_c`]]
-[def __result_of_distance__     [link fusion.iterators.metafunctions.distance `result_of::distance`]]
-[def __result_of_deref__        [link fusion.iterators.metafunctions.deref `result_of::deref`]]
-[def __result_of_value_of__     [link fusion.iterators.metafunctions.value_of `result_of::value_of`]]
-[def __value_of__               [link fusion.iterators.metafunctions.value_of `value_of`]]
-
-[def __sequence__               [link fusion.sequences Sequence]]
-[def __sequence_concepts__      [link fusion.sequences.concepts Sequence Concepts]]
-[def __traversal_concept__      [link fusion.sequences.concepts.traversal Sequence Traversal Concept]]
-[def __associativity_concept__  [link fusion.sequences.concepts.associativity Sequence Associativity Concept]]
-[def __forward_sequence__       [link fusion.sequences.concepts.forward_sequence Forward Sequence]]
-[def __bidirectional_sequence__ [link fusion.sequences.concepts.bidirectional_sequence Bidirectional Sequence]]
-[def __random_access_sequence__ [link fusion.sequences.concepts.random_access_sequence Random Access Sequence]]
-[def __associative_sequence__   [link fusion.sequences.concepts.associative_sequence Associative Sequence]]
-
-[def __containers__             [link fusion.sequences.containers Containers]]
-[def __vector__                 [link fusion.sequences.containers.vector `vector`]]
-[def __cons__                   [link fusion.sequences.containers.cons `cons`]]
-[def __list__                   [link fusion.sequences.containers.list `list`]]
-[def __set__                    [link fusion.sequences.containers.set `set`]]
-[def __map__                    [link fusion.sequences.containers.map `map`]]
-
-[def __view__                  [link fusion.sequences.views View]]
-[def __views__                  [link fusion.sequences.views Views]]
-[def __single_view__            [link fusion.sequences.views.single_view `single_view`]]
-[def __filter_view__            [link fusion.sequences.views.filter_view `filter_view`]]
-[def __iterator_range__         [link fusion.sequences.views.iterator_range `iterator_range`]]
-[def __joint_view__             [link fusion.sequences.views.joint_view `joint_view`]]
-[def __transform_view__         [link fusion.sequences.views.transform_view `transform_view`]]
-[def __reverse_view__           [link fusion.sequences.views.reverse_view `reverse_view`]]
-[def __zip_view__               [link fusion.sequences.views.zip_view `zip_view`]]
-
-[def __std_pair__               [link fusion.sequences.adapted.std__pair `std::pair`]]
-[def __boost_array__            [link fusion.sequences.adapted.boost__array `boost::array`]]
-[def __mpl_sequence__           [link fusion.sequences.adapted.mpl_sequence mpl sequence]]
-
-[def __intrinsic__              [link fusion.sequences.intrinsics Intrinsic]]
-[def __intrinsics__             [link fusion.sequences.intrinsics Intrinsics]]
-[def __begin__                  [link fusion.sequences.intrinsics.functions.begin `begin`]]
-[def __result_of_begin__        [link fusion.sequences.intrinsics.metafunctions.begin `result_of::begin`]]
-[def __end__                    [link fusion.sequences.intrinsics.functions.end `end`]]
-[def __result_of_end__          [link fusion.sequences.intrinsics.metafunctions.end `result_of::end`]]
-[def __size__                   [link fusion.sequences.intrinsics.functions.size `size`]]
-[def __result_of_size__         [link fusion.sequences.intrinsics.metafunctions.size `result_of::size`]]
-[def __empty__                  [link fusion.sequences.intrinsics.functions.empty `empty`]]
-[def __result_of_empty__        [link fusion.sequences.intrinsics.metafunctions.empty `result_of::empty`]]
-[def __front__                  [link fusion.sequences.intrinsics.functions.front `front`]]
-[def __result_of_front__        [link fusion.sequences.intrinsics.metafunctions.front `result_of::front`]]
-[def __back__                   [link fusion.sequences.intrinsics.functions.back `back`]]
-[def __result_of_back__         [link fusion.sequences.intrinsics.metafunctions.back `result_of::back`]]
-[def __at__                     [link fusion.sequences.intrinsics.functions.at `at`]]
-[def __result_of_at__           [link fusion.sequences.intrinsics.metafunctions.at `result_of::at`]]
-[def __at_c__                   [link fusion.sequences.intrinsics.functions.at_c `at_c`]]
-[def __result_of_at_c__         [link fusion.sequences.intrinsics.metafunctions.at_c `result_of::at_c`]]
-[def __at_key__                 [link fusion.sequences.intrinsics.functions.at_key `at_key`]]
-[def __result_of_at_key__       [link fusion.sequences.intrinsics.metafunctions.at_key `result_of::at_key`]]
-[def __has_key__                [link fusion.sequences.intrinsics.functions.has_key `has_key`]]
-[def __result_of_has_key__      [link fusion.sequences.intrinsics.metafunctions.has_key `result_of::has_key`]]
-[def __value_at_key__           [link fusion.sequences.intrinsics.metafunctions.value_at_key `value_at_key`]]
-[def __result_of_value_at__     [link fusion.sequences.intrinsics.metafunctions.value_at `result_of::value_at`]]
-[def __result_of_value_at_c__   [link fusion.sequences.intrinsics.metafunctions.value_at_c `result_of::value_at_c`]]
-[def __result_of_value_at_key__ [link fusion.sequences.intrinsics.metafunctions.value_at_key `result_of::value_at_key`]]
-
-[def __conversion__             [link fusion.sequences.conversion.functions Conversion]]
-[def __result_of_conversion__   [link fusion.sequences.conversion.metafunctions Conversion Metafunctions]]
-[def __as_vector__              [link fusion.sequences.conversion.functions.as_vector `as_vector`]]
-[def __result_of_as_vector__    [link fusion.sequences.conversion.metafunctions.as_vector `result_of::as_vector`]]
-[def __as_list__                [link fusion.sequences.conversion.functions.as_list `as_list`]]
-[def __result_of_as_list__      [link fusion.sequences.conversion.metafunctions.as_list `result_of::as_list`]]
-[def __as_set__                 [link fusion.sequences.conversion.functions.as_set `as_set`]]
-[def __result_of_as_set__       [link fusion.sequences.conversion.metafunctions.as_set `result_of::as_set`]]
-[def __as_map__                 [link fusion.sequences.conversion.functions.as_map `as_map`]]
-[def __result_of_as_map__       [link fusion.sequences.conversion.metafunctions.as_map `result_of::as_map`]]
-
-[def __generation__             [link fusion.sequences.generation.functions Generation]]
-[def __result_of_generation__   [link fusion.sequences.generation.metafunctions Generation Metafunctions]]
-[def __make_vector__            [link fusion.sequences.generation.functions.make_vector `make_vector`]]
-[def __result_of_make_vector__  [link fusion.sequences.generation.metafunctions.make_vector `result_of::make_vector`]]
-[def __vector_tie__             [link fusion.sequences.generation.functions.vector_tie `vector_tie`]]
-[def __map_tie__             [link fusion.sequences.generation.functions.vector_tie `map_tie`]]
-[def __result_of_vector_tie__   [link fusion.sequences.generation.metafunctions.vector_tie `result_of::vector_tie`]]
-[def __make_vector__            [link fusion.sequences.generation.functions.make_vector `make_vector`]]
-[def __result_of_make_vector__  [link fusion.sequences.generation.metafunctions.make_vector `result_of::make_vector`]]
-[def __make_cons__              [link fusion.sequences.generation.functions.make_cons `make_cons`]]
-[def __result_of_make_cons__    [link fusion.sequences.generation.metafunctions.make_cons `result_of::make_cons`]]
-[def __make_list__              [link fusion.sequences.generation.functions.make_list `make_list`]]
-[def __result_of_make_list__    [link fusion.sequences.generation.metafunctions.make_list `result_of::make_list`]]
-[def __make_set__               [link fusion.sequences.generation.functions.make_set `make_set`]]
-[def __result_of_make_set__     [link fusion.sequences.generation.metafunctions.make_set `result_of::make_set`]]
-[def __make_map__               [link fusion.sequences.generation.functions.make_map `make_map`]]
-[def __result_of_make_map__     [link fusion.sequences.generation.metafunctions.make_map `result_of::make_map`]]
-[def __list_tie__               [link fusion.sequences.generation.functions.list_tie `list_tie`]]
-[def __result_of_list_tie__     [link fusion.sequences.generation.metafunctions.list_tie `result_of::list_tie`]]
-
-[def __out__                    [link fusion.sequences.operators.i_o.out out]]
-[def __in__                     [link fusion.sequences.operators.i_o.in in]]
-[def __eq__                     [link fusion.sequences.operators.comparison.equal equal]]
-[def __neq__                    [link fusion.sequences.operators.comparison.not_equal not equal]]
-[def __lt__                     [link fusion.sequences.operators.comparison.less_than less than]]
-[def __lte__                    [link fusion.sequences.operators.comparison.less_than_equal less than equal]]
-[def __gt__                     [link fusion.sequences.operators.comparison.greater_than greater than]]
-[def __gte__                    [link fusion.sequences.operators.comparison.greater_than_equal greater than equal]]
-
-[def __algorithm__              [link fusion.algorithms Algorithm]]
-[def __algorithms__             [link fusion.algorithms Algorithms]]
-[def __fold__                   [link fusion.algorithms.iteration.functions.fold `fold`]]
-[def __result_of_fold__         [link fusion.algorithms.iteration.metafunctions.fold `result_of::fold`]]
-[def __accumulate__             [link fusion.algorithms.iteration.functions.accumulate `accumulate`]]
-[def __result_of_accumulate__   [link fusion.algorithms.iteration.metafunctions.accumulate `result_of::accumulate`]]
-[def __for_each__               [link fusion.algorithms.iteration.functions.for_each `for_each`]]
-[def __result_of_for_each__     [link fusion.algorithms.iteration.metafunctions.for_each `result_of::for_each`]]
-[def __any__                    [link fusion.algorithms.query.functions.any `any`]]
-[def __result_of_any__          [link fusion.algorithms.query.metafunctions.any `result_of::any`]]
-[def __all__                    [link fusion.algorithms.query.functions.all `all`]]
-[def __result_of_all__          [link fusion.algorithms.query.metafunctions.all `result_of::all`]]
-[def __none__                   [link fusion.algorithms.query.functions.none `none`]]
-[def __result_of_none__         [link fusion.algorithms.query.metafunctions.none `result_of::none`]]
-[def __find__                   [link fusion.algorithms.query.functions.find `find`]]
-[def __result_of_find__         [link fusion.algorithms.query.metafunctions.find `result_of::find`]]
-[def __find_if__                [link fusion.algorithms.query.functions.find_if `find_if`]]
-[def __result_of_find_if__      [link fusion.algorithms.query.metafunctions.find_if `result_of::find_if`]]
-[def __count__                  [link fusion.algorithms.query.functions.count `count`]]
-[def __result_of_count__        [link fusion.algorithms.query.metafunctions.count `result_of::count`]]
-[def __count_if__               [link fusion.algorithms.query.functions.count_if `count_if`]]
-[def __result_of_count_if__     [link fusion.algorithms.query.metafunctions.count_if `result_of::count_if`]]
-[def __filter__                 [link fusion.algorithms.transformation.functions.filter `filter`]]
-[def __result_of_filter__       [link fusion.algorithms.transformation.metafunctions.filter `result_of::filter`]]
-[def __filter_if__              [link fusion.algorithms.transformation.functions.filter_if `filter_if`]]
-[def __result_of_filter_if__    [link fusion.algorithms.transformation.metafunctions.filter_if `result_of::filter_if`]]
-[def __transform__              [link fusion.algorithms.transformation.functions.transform `transform`]]
-[def __result_of_transform__    [link fusion.algorithms.transformation.metafunctions.transform `result_of::transform`]]
-[def __replace__                [link fusion.algorithms.transformation.functions.replace `replace`]]
-[def __result_of_replace__      [link fusion.algorithms.transformation.metafunctions.replace `result_of::replace`]]
-[def __replace_if__             [link fusion.algorithms.transformation.functions.replace_if `replace_if`]]
-[def __result_of_replace_if__   [link fusion.algorithms.transformation.metafunctions.replace_if `result_of::replace_if`]]
-[def __remove__                 [link fusion.algorithms.transformation.functions.remove `remove`]]
-[def __result_of_remove__       [link fusion.algorithms.transformation.metafunctions.remove `result_of::remove`]]
-[def __remove_if__              [link fusion.algorithms.transformation.functions.remove_if `remove_if`]]
-[def __result_of_remove_if__    [link fusion.algorithms.transformation.metafunctions.remove_if `result_of::remove_if`]]
-[def __reverse__                [link fusion.algorithms.transformation.functions.reverse `reverse`]]
-[def __result_of_reverse__      [link fusion.algorithms.transformation.metafunctions.reverse `result_of::reverse`]]
-[def __clear__                  [link fusion.algorithms.transformation.functions.clear `clear`]]
-[def __result_of_clear__        [link fusion.algorithms.transformation.metafunctions.clear `result_of::clear`]]
-[def __erase__                  [link fusion.algorithms.transformation.functions.erase `erase`]]
-[def __result_of_erase__        [link fusion.algorithms.transformation.metafunctions.erase `result_of::erase`]]
-[def __erase_key__              [link fusion.algorithms.transformation.functions.erase_key `erase_key`]]
-[def __result_of_erase_key__    [link fusion.algorithms.transformation.metafunctions.erase_key `result_of::erase_key`]]
-[def __insert__                 [link fusion.algorithms.transformation.functions.insert `insert`]]
-[def __result_of_insert__       [link fusion.algorithms.transformation.metafunctions.insert `result_of::insert`]]
-[def __insert_range__           [link fusion.algorithms.transformation.functions.insert_range `insert_range`]]
-[def __result_of_insert_range__ [link fusion.algorithms.transformation.metafunctions.insert_range `result_of::insert_range`]]
-[def __join__                   [link fusion.algorithms.transformation.functions.join `join`]]
-[def __result_of_join__         [link fusion.algorithms.transformation.metafunctions.join `result_of::join`]]
-[def __zip__                    [link fusion.algorithms.transformation.functions.zip `zip`]]
-[def __result_of_zip__          [link fusion.algorithms.transformation.metafunctions.zip `result_of::zip`]]
-[def __pop_back__               [link fusion.algorithms.transformation.functions.pop_back `pop_back`]]
-[def __result_of_pop_back__     [link fusion.algorithms.transformation.metafunctions.pop_back `result_of::pop_back`]]
-[def __pop_front__              [link fusion.algorithms.transformation.functions.pop_front `pop_front`]]
-[def __result_of_pop_front__    [link fusion.algorithms.transformation.metafunctions.pop_front `result_of::pop_front`]]
-[def __push_back__              [link fusion.algorithms.transformation.functions.push_back `push_back`]]
-[def __result_of_push_back__    [link fusion.algorithms.transformation.metafunctions.push_back `result_of::push_back`]]
-[def __push_front__             [link fusion.algorithms.transformation.functions.push_front `push_front`]]
-[def __result_of_push_front__   [link fusion.algorithms.transformation.metafunctions.push_front `result_of::push_front`]]
+[def __iterator__               [link fusion.iterator Iterator]]
+[def __iterator_concepts__      [link fusion.iterator.concepts Iterator Concepts]]
+[def __forward_iterator__       [link fusion.iterator.concepts.forward_iterator Forward Iterator]]
+[def __bidirectional_iterator__ [link fusion.iterator.concepts.bidirectional_iterator Bidirectional Iterator]]
+[def __random_access_iterator__ [link fusion.iterator.concepts.random_access_iterator Random Access Iterator]]
+
+[def __next__                   [link fusion.iterator.functions.next `next`]]
+[def __prior__                  [link fusion.iterator.functions.prior `prior`]]
+[def __advance__                [link fusion.iterator.functions.advance `advance`]]
+[def __advance_c__              [link fusion.iterator.functions.advance_c `advance_c`]]
+[def __distance__               [link fusion.iterator.functions.distance `distance`]]
+[def __deref__                  [link fusion.iterator.functions.deref `deref`]]
+
+[def __result_of_next__         [link fusion.iterator.metafunctions.next `result_of::next`]]
+[def __result_of_prior__        [link fusion.iterator.metafunctions.prior `result_of::prior`]]
+[def __result_of_equal_to__     [link fusion.iterator.metafunctions.equal_to `result_of::equal_to`]]
+[def __result_of_advance__      [link fusion.iterator.metafunctions.advance `result_of::advance`]]
+[def __result_of_advance_c__    [link fusion.iterator.metafunctions.advance_c `result_of::advance_c`]]
+[def __result_of_distance__     [link fusion.iterator.metafunctions.distance `result_of::distance`]]
+[def __result_of_deref__        [link fusion.iterator.metafunctions.deref `result_of::deref`]]
+[def __result_of_value_of__     [link fusion.iterator.metafunctions.value_of `result_of::value_of`]]
+[def __value_of__               [link fusion.iterator.metafunctions.value_of `value_of`]]
+
+[def __sequence__               [link fusion.sequence Sequence]]
+[def __sequence_concepts__      [link fusion.sequence.concepts Sequence Concepts]]
+[def __traversal_concept__      [link fusion.sequence.concepts.traversal Sequence Traversal Concept]]
+[def __associativity_concept__  [link fusion.sequence.concepts.associativity Sequence Associativity Concept]]
+[def __forward_sequence__       [link fusion.sequence.concepts.forward_sequence Forward Sequence]]
+[def __bidirectional_sequence__ [link fusion.sequence.concepts.bidirectional_sequence Bidirectional Sequence]]
+[def __random_access_sequence__ [link fusion.sequence.concepts.random_access_sequence Random Access Sequence]]
+[def __associative_sequence__   [link fusion.sequence.concepts.associative_sequence Associative Sequence]]
+
+[def __containers__             [link fusion.container Container]]
+[def __vector__                 [link fusion.container.vector `vector`]]
+[def __cons__                   [link fusion.container.cons `cons`]]
+[def __list__                   [link fusion.container.list `list`]]
+[def __set__                    [link fusion.container.set `set`]]
+[def __map__                    [link fusion.container.map `map`]]
+
+[def __view__                   [link fusion.view View]]
+[def __views__                  [link fusion.view Views]]
+[def __single_view__            [link fusion.view.single_view `single_view`]]
+[def __filter_view__            [link fusion.view.filter_view `filter_view`]]
+[def __iterator_range__         [link fusion.view.iterator_range `iterator_range`]]
+[def __joint_view__             [link fusion.view.joint_view `joint_view`]]
+[def __transform_view__         [link fusion.view.transform_view `transform_view`]]
+[def __reverse_view__           [link fusion.view.reverse_view `reverse_view`]]
+[def __zip_view__               [link fusion.view.zip_view `zip_view`]]
+
+[def __std_pair__               [link fusion.adapted.std__pair `std::pair`]]
+[def __boost_array__            [link fusion.adapted.boost__array `boost::array`]]
+[def __mpl_sequence__           [link fusion.adapted.mpl_sequence mpl sequence]]
+
+[def __intrinsic__              [link fusion.sequence.intrinsic Intrinsic]]
+[def __intrinsics__             [link fusion.sequence.intrinsic Intrinsics]]
+[def __begin__                  [link fusion.sequence.intrinsic.functions.begin `begin`]]
+[def __result_of_begin__        [link fusion.sequence.intrinsic.metafunctions.begin `result_of::begin`]]
+[def __end__                    [link fusion.sequence.intrinsic.functions.end `end`]]
+[def __result_of_end__          [link fusion.sequence.intrinsic.metafunctions.end `result_of::end`]]
+[def __size__                   [link fusion.sequence.intrinsic.functions.size `size`]]
+[def __result_of_size__         [link fusion.sequence.intrinsic.metafunctions.size `result_of::size`]]
+[def __empty__                  [link fusion.sequence.intrinsic.functions.empty `empty`]]
+[def __result_of_empty__        [link fusion.sequence.intrinsic.metafunctions.empty `result_of::empty`]]
+[def __front__                  [link fusion.sequence.intrinsic.functions.front `front`]]
+[def __result_of_front__        [link fusion.sequence.intrinsic.metafunctions.front `result_of::front`]]
+[def __back__                   [link fusion.sequence.intrinsic.functions.back `back`]]
+[def __result_of_back__         [link fusion.sequence.intrinsic.metafunctions.back `result_of::back`]]
+[def __at__                     [link fusion.sequence.intrinsic.functions.at `at`]]
+[def __result_of_at__           [link fusion.sequence.intrinsic.metafunctions.at `result_of::at`]]
+[def __at_c__                   [link fusion.sequence.intrinsic.functions.at_c `at_c`]]
+[def __result_of_at_c__         [link fusion.sequence.intrinsic.metafunctions.at_c `result_of::at_c`]]
+[def __at_key__                 [link fusion.sequence.intrinsic.functions.at_key `at_key`]]
+[def __result_of_at_key__       [link fusion.sequence.intrinsic.metafunctions.at_key `result_of::at_key`]]
+[def __has_key__                [link fusion.sequence.intrinsic.functions.has_key `has_key`]]
+[def __result_of_has_key__      [link fusion.sequence.intrinsic.metafunctions.has_key `result_of::has_key`]]
+[def __value_at_key__           [link fusion.sequence.intrinsic.metafunctions.value_at_key `value_at_key`]]
+[def __result_of_value_at__     [link fusion.sequence.intrinsic.metafunctions.value_at `result_of::value_at`]]
+[def __result_of_value_at_c__   [link fusion.sequence.intrinsic.metafunctions.value_at_c `result_of::value_at_c`]]
+[def __result_of_value_at_key__ [link fusion.sequence.intrinsic.metafunctions.value_at_key `result_of::value_at_key`]]
+
+[def __conversion__             [link fusion.container.conversion.functions Conversion]]
+[def __result_of_conversion__   [link fusion.container.conversion.metafunctions Conversion Metafunctions]]
+[def __as_vector__              [link fusion.container.conversion.functions.as_vector `as_vector`]]
+[def __result_of_as_vector__    [link fusion.container.conversion.metafunctions.as_vector `result_of::as_vector`]]
+[def __as_list__                [link fusion.container.conversion.functions.as_list `as_list`]]
+[def __result_of_as_list__      [link fusion.container.conversion.metafunctions.as_list `result_of::as_list`]]
+[def __as_set__                 [link fusion.container.conversion.functions.as_set `as_set`]]
+[def __result_of_as_set__       [link fusion.container.conversion.metafunctions.as_set `result_of::as_set`]]
+[def __as_map__                 [link fusion.container.conversion.functions.as_map `as_map`]]
+[def __result_of_as_map__       [link fusion.container.conversion.metafunctions.as_map `result_of::as_map`]]
+
+[def __generation__             [link fusion.container.generation.functions Generation]]
+[def __result_of_generation__   [link fusion.container.generation.metafunctions Generation Metafunctions]]
+[def __make_vector__            [link fusion.container.generation.functions.make_vector `make_vector`]]
+[def __result_of_make_vector__  [link fusion.container.generation.metafunctions.make_vector `result_of::make_vector`]]
+[def __vector_tie__             [link fusion.container.generation.functions.vector_tie `vector_tie`]]
+[def __map_tie__                [link fusion.container.generation.functions.vector_tie `map_tie`]]
+[def __result_of_vector_tie__   [link fusion.container.generation.metafunctions.vector_tie `result_of::vector_tie`]]
+[def __make_vector__            [link fusion.container.generation.functions.make_vector `make_vector`]]
+[def __result_of_make_vector__  [link fusion.container.generation.metafunctions.make_vector `result_of::make_vector`]]
+[def __make_cons__              [link fusion.container.generation.functions.make_cons `make_cons`]]
+[def __result_of_make_cons__    [link fusion.container.generation.metafunctions.make_cons `result_of::make_cons`]]
+[def __make_list__              [link fusion.container.generation.functions.make_list `make_list`]]
+[def __result_of_make_list__    [link fusion.container.generation.metafunctions.make_list `result_of::make_list`]]
+[def __make_set__               [link fusion.container.generation.functions.make_set `make_set`]]
+[def __result_of_make_set__     [link fusion.container.generation.metafunctions.make_set `result_of::make_set`]]
+[def __make_map__               [link fusion.container.generation.functions.make_map `make_map`]]
+[def __result_of_make_map__     [link fusion.container.generation.metafunctions.make_map `result_of::make_map`]]
+[def __list_tie__               [link fusion.container.generation.functions.list_tie `list_tie`]]
+[def __result_of_list_tie__     [link fusion.container.generation.metafunctions.list_tie `result_of::list_tie`]]
+
+[def __out__                    [link fusion.sequence.operator.i_o.out out]]
+[def __in__                     [link fusion.sequence.operator.i_o.in in]]
+[def __eq__                     [link fusion.sequence.operator.comparison.equal equal]]
+[def __neq__                    [link fusion.sequence.operator.comparison.not_equal not equal]]
+[def __lt__                     [link fusion.sequence.operator.comparison.less_than less than]]
+[def __lte__                    [link fusion.sequence.operator.comparison.less_than_equal less than equal]]
+[def __gt__                     [link fusion.sequence.operator.comparison.greater_than greater than]]
+[def __gte__                    [link fusion.sequence.operator.comparison.greater_than_equal greater than equal]]
+
+[def __algorithm__              [link fusion.algorithm Algorithm]]
+[def __algorithms__             [link fusion.algorithm Algorithms]]
+[def __fold__                   [link fusion.algorithm.iteration.functions.fold `fold`]]
+[def __result_of_fold__         [link fusion.algorithm.iteration.metafunctions.fold `result_of::fold`]]
+[def __accumulate__             [link fusion.algorithm.iteration.functions.accumulate `accumulate`]]
+[def __result_of_accumulate__   [link fusion.algorithm.iteration.metafunctions.accumulate `result_of::accumulate`]]
+[def __for_each__               [link fusion.algorithm.iteration.functions.for_each `for_each`]]
+[def __result_of_for_each__     [link fusion.algorithm.iteration.metafunctions.for_each `result_of::for_each`]]
+[def __any__                    [link fusion.algorithm.query.functions.any `any`]]
+[def __result_of_any__          [link fusion.algorithm.query.metafunctions.any `result_of::any`]]
+[def __all__                    [link fusion.algorithm.query.functions.all `all`]]
+[def __result_of_all__          [link fusion.algorithm.query.metafunctions.all `result_of::all`]]
+[def __none__                   [link fusion.algorithm.query.functions.none `none`]]
+[def __result_of_none__         [link fusion.algorithm.query.metafunctions.none `result_of::none`]]
+[def __find__                   [link fusion.algorithm.query.functions.find `find`]]
+[def __result_of_find__         [link fusion.algorithm.query.metafunctions.find `result_of::find`]]
+[def __find_if__                [link fusion.algorithm.query.functions.find_if `find_if`]]
+[def __result_of_find_if__      [link fusion.algorithm.query.metafunctions.find_if `result_of::find_if`]]
+[def __count__                  [link fusion.algorithm.query.functions.count `count`]]
+[def __result_of_count__        [link fusion.algorithm.query.metafunctions.count `result_of::count`]]
+[def __count_if__               [link fusion.algorithm.query.functions.count_if `count_if`]]
+[def __result_of_count_if__     [link fusion.algorithm.query.metafunctions.count_if `result_of::count_if`]]
+[def __filter__                 [link fusion.algorithm.transformation.functions.filter `filter`]]
+[def __result_of_filter__       [link fusion.algorithm.transformation.metafunctions.filter `result_of::filter`]]
+[def __filter_if__              [link fusion.algorithm.transformation.functions.filter_if `filter_if`]]
+[def __result_of_filter_if__    [link fusion.algorithm.transformation.metafunctions.filter_if `result_of::filter_if`]]
+[def __transform__              [link fusion.algorithm.transformation.functions.transform `transform`]]
+[def __result_of_transform__    [link fusion.algorithm.transformation.metafunctions.transform `result_of::transform`]]
+[def __replace__                [link fusion.algorithm.transformation.functions.replace `replace`]]
+[def __result_of_replace__      [link fusion.algorithm.transformation.metafunctions.replace `result_of::replace`]]
+[def __replace_if__             [link fusion.algorithm.transformation.functions.replace_if `replace_if`]]
+[def __result_of_replace_if__   [link fusion.algorithm.transformation.metafunctions.replace_if `result_of::replace_if`]]
+[def __remove__                 [link fusion.algorithm.transformation.functions.remove `remove`]]
+[def __result_of_remove__       [link fusion.algorithm.transformation.metafunctions.remove `result_of::remove`]]
+[def __remove_if__              [link fusion.algorithm.transformation.functions.remove_if `remove_if`]]
+[def __result_of_remove_if__    [link fusion.algorithm.transformation.metafunctions.remove_if `result_of::remove_if`]]
+[def __reverse__                [link fusion.algorithm.transformation.functions.reverse `reverse`]]
+[def __result_of_reverse__      [link fusion.algorithm.transformation.metafunctions.reverse `result_of::reverse`]]
+[def __clear__                  [link fusion.algorithm.transformation.functions.clear `clear`]]
+[def __result_of_clear__        [link fusion.algorithm.transformation.metafunctions.clear `result_of::clear`]]
+[def __erase__                  [link fusion.algorithm.transformation.functions.erase `erase`]]
+[def __result_of_erase__        [link fusion.algorithm.transformation.metafunctions.erase `result_of::erase`]]
+[def __erase_key__              [link fusion.algorithm.transformation.functions.erase_key `erase_key`]]
+[def __result_of_erase_key__    [link fusion.algorithm.transformation.metafunctions.erase_key `result_of::erase_key`]]
+[def __insert__                 [link fusion.algorithm.transformation.functions.insert `insert`]]
+[def __result_of_insert__       [link fusion.algorithm.transformation.metafunctions.insert `result_of::insert`]]
+[def __insert_range__           [link fusion.algorithm.transformation.functions.insert_range `insert_range`]]
+[def __result_of_insert_range__ [link fusion.algorithm.transformation.metafunctions.insert_range `result_of::insert_range`]]
+[def __join__                   [link fusion.algorithm.transformation.functions.join `join`]]
+[def __result_of_join__         [link fusion.algorithm.transformation.metafunctions.join `result_of::join`]]
+[def __zip__                    [link fusion.algorithm.transformation.functions.zip `zip`]]
+[def __result_of_zip__          [link fusion.algorithm.transformation.metafunctions.zip `result_of::zip`]]
+[def __pop_back__               [link fusion.algorithm.transformation.functions.pop_back `pop_back`]]
+[def __result_of_pop_back__     [link fusion.algorithm.transformation.metafunctions.pop_back `result_of::pop_back`]]
+[def __pop_front__              [link fusion.algorithm.transformation.functions.pop_front `pop_front`]]
+[def __result_of_pop_front__    [link fusion.algorithm.transformation.metafunctions.pop_front `result_of::pop_front`]]
+[def __push_back__              [link fusion.algorithm.transformation.functions.push_back `push_back`]]
+[def __result_of_push_back__    [link fusion.algorithm.transformation.metafunctions.push_back `result_of::push_back`]]
+[def __push_front__             [link fusion.algorithm.transformation.functions.push_front `push_front`]]
+[def __result_of_push_front__   [link fusion.algorithm.transformation.metafunctions.push_front `result_of::push_front`]]
 
-[def __tr1_tuple_pair__         [link fusion.tuples.pairs `TR1 and std::pair`]]
-[def __tuple_get__              [link fusion.tuples.class_template_tuple.element_access `get`]]
+[def __tr1_tuple_pair__         [link fusion.tuple.pairs `TR1 and std::pair`]]
+[def __tuple_get__              [link fusion.tuple.class_template_tuple.element_access `get`]]
 
 [def __callable_obj__           [link fusion.functional.concepts.callable Callable Object]]
 [def __def_callable_obj__       [link fusion.functional.concepts.def_callable Deferred Callable Object]]
@@ -290,18 +290,21 @@
 [def __quick_start__            [link fusion.quick_start Quick Start]]
 [def __organization__           [link fusion.organization Orgainization]]
 [def __extension__              [link fusion.extension Extension]]
-[def __sequence_fascade__       [link fusion.extension.sequence_fascade `sequence_fascade`]]
-[def __iterator_fascade__       [link fusion.extension.iterator_fascade `iterator_fascade`]]
+[def __sequence_facade__       [link fusion.extension.sequence_facade `sequence_facade`]]
+[def __iterator_facade__       [link fusion.extension.iterator_facade `iterator_facade`]]
 
 [include preface.qbk]
 [include introduction.qbk]
 [include quick_start.qbk]
 [include organization.qbk]
 [include support.qbk]
-[include iterators.qbk]
-[include sequences.qbk]
-[include algorithms.qbk]
-[include tuples.qbk]
+[include iterator.qbk]
+[include sequence.qbk]
+[include container.qbk]
+[include view.qbk]
+[include adapted.qbk]
+[include algorithm.qbk]
+[include tuple.qbk]
 [include extension.qbk]
 [include functional.qbk]
 [include notes.qbk]

Modified: branches/proto/v3/libs/fusion/doc/html/index.html
==============================================================================
--- branches/proto/v3/libs/fusion/doc/html/index.html	(original)
+++ branches/proto/v3/libs/fusion/doc/html/index.html	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -22,10 +22,19 @@
 <div class="titlepage"><div>
 <div><h2 class="title">
 <a name="fusion"></a>Chapter 1. Fusion 2.0</h2></div>
+<div><div class="author"><h3 class="author">
+<span class="firstname">Joel</span> <span class="surname">de Guzman</span>
+</h3></div></div>
+<div><div class="author"><h3 class="author">
+<span class="firstname">Dan</span> <span class="surname">Marsden</span>
+</h3></div></div>
+<div><div class="author"><h3 class="author">
+<span class="firstname">Tobias</span> <span class="surname">Schwinger</span>
+</h3></div></div>
 <div><p class="copyright">Copyright © 2001-2007 Joel de Guzman, Dan Marsden, Tobias
       Schwinger</p></div>
 <div><div class="legalnotice">
-<a name="id385503"></a><p>
+<a name="id455875"></a><p>
         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)
       </p>
@@ -48,142 +57,152 @@
 <dt><span class="section">deduce_sequence</span></dt>
 <dt><span class="section">pair</span></dt>
 </dl></dd>
-<dt><span class="section">Iterators</span></dt>
+<dt><span class="section">Iterator</span></dt>
 <dd><dl>
-<dt><span class="section">Concepts</span></dt>
+<dt><span class="section">Concepts</span></dt>
 <dd><dl>
-<dt><span class="section"><a href="fusion/iterators/concepts/forward_iterator.html">Forward
+<dt><span class="section"><a href="fusion/iterator/concepts/forward_iterator.html">Forward
         Iterator</a></span></dt>
-<dt><span class="section"><a href="fusion/iterators/concepts/bidirectional_iterator.html">Bidirectional
+<dt><span class="section"><a href="fusion/iterator/concepts/bidirectional_iterator.html">Bidirectional
         Iterator</a></span></dt>
-<dt><span class="section"><a href="fusion/iterators/concepts/random_access_iterator.html">Random
+<dt><span class="section"><a href="fusion/iterator/concepts/random_access_iterator.html">Random
         Access Iterator</a></span></dt>
 </dl></dd>
-<dt><span class="section">Functions</span></dt>
+<dt><span class="section">Functions</span></dt>
 <dd><dl>
-<dt><span class="section">deref</span></dt>
-<dt><span class="section">next</span></dt>
-<dt><span class="section">prior</span></dt>
-<dt><span class="section">distance</span></dt>
-<dt><span class="section">advance</span></dt>
-<dt><span class="section">advance_c</span></dt>
+<dt><span class="section">deref</span></dt>
+<dt><span class="section">next</span></dt>
+<dt><span class="section">prior</span></dt>
+<dt><span class="section">distance</span></dt>
+<dt><span class="section">advance</span></dt>
+<dt><span class="section">advance_c</span></dt>
 </dl></dd>
-<dt><span class="section">Operators</span></dt>
+<dt><span class="section">Operator</span></dt>
 <dd><dl>
-<dt><span class="section"><a href="fusion/iterators/operators/operator_unary_star.html"> Operator
+<dt><span class="section"><a href="fusion/iterator/operator/operator_unary_star.html"> Operator
         *</a></span></dt>
-<dt><span class="section"><a href="fusion/iterators/operators/operator_equality.html"> Operator
+<dt><span class="section"><a href="fusion/iterator/operator/operator_equality.html"> Operator
         ==</a></span></dt>
-<dt><span class="section"><a href="fusion/iterators/operators/operator_inequality.html"> Operator
+<dt><span class="section"><a href="fusion/iterator/operator/operator_inequality.html"> Operator
         !=</a></span></dt>
 </dl></dd>
-<dt><span class="section">Metafunctions</span></dt>
+<dt><span class="section">Metafunctions</span></dt>
 <dd><dl>
-<dt><span class="section">value_of</span></dt>
-<dt><span class="section">deref</span></dt>
-<dt><span class="section">next</span></dt>
-<dt><span class="section">prior</span></dt>
-<dt><span class="section">equal_to</span></dt>
-<dt><span class="section">distance</span></dt>
-<dt><span class="section">advance</span></dt>
-<dt><span class="section">advance_c</span></dt>
+<dt><span class="section">value_of</span></dt>
+<dt><span class="section">deref</span></dt>
+<dt><span class="section">next</span></dt>
+<dt><span class="section">prior</span></dt>
+<dt><span class="section">equal_to</span></dt>
+<dt><span class="section">distance</span></dt>
+<dt><span class="section">advance</span></dt>
+<dt><span class="section">advance_c</span></dt>
 </dl></dd>
 </dl></dd>
-<dt><span class="section">Sequences</span></dt>
+<dt><span class="section">Sequence</span></dt>
 <dd><dl>
-<dt><span class="section">Concepts</span></dt>
+<dt><span class="section">Concepts</span></dt>
 <dd><dl>
-<dt><span class="section"><a href="fusion/sequences/concepts/forward_sequence.html">Forward
+<dt><span class="section"><a href="fusion/sequence/concepts/forward_sequence.html">Forward
         Sequence</a></span></dt>
-<dt><span class="section"><a href="fusion/sequences/concepts/bidirectional_sequence.html">Bidirectional
+<dt><span class="section"><a href="fusion/sequence/concepts/bidirectional_sequence.html">Bidirectional
         Sequence</a></span></dt>
-<dt><span class="section"><a href="fusion/sequences/concepts/random_access_sequence.html">Random
+<dt><span class="section"><a href="fusion/sequence/concepts/random_access_sequence.html">Random
         Access Sequence</a></span></dt>
-<dt><span class="section"><a href="fusion/sequences/concepts/associative_sequence.html">Associative
+<dt><span class="section"><a href="fusion/sequence/concepts/associative_sequence.html">Associative
         Sequence</a></span></dt>
 </dl></dd>
-<dt><span class="section">Containers</span></dt>
+<dt><span class="section">Intrinsic</span></dt>
 <dd><dl>
-<dt><span class="section">vector</span></dt>
-<dt><span class="section">cons</span></dt>
-<dt><span class="section">list</span></dt>
-<dt><span class="section">set</span></dt>
-<dt><span class="section">map</span></dt>
+<dt><span class="section">Functions</span></dt>
+<dt><span class="section">Metafunctions</span></dt>
 </dl></dd>
-<dt><span class="section">Views</span></dt>
+<dt><span class="section">Operator</span></dt>
 <dd><dl>
-<dt><span class="section">single_view</span></dt>
-<dt><span class="section">filter_view</span></dt>
-<dt><span class="section">iterator_range</span></dt>
-<dt><span class="section">joint_view</span></dt>
-<dt><span class="section">zip_view</span></dt>
-<dt><span class="section">transform_view</span></dt>
-<dt><span class="section">reverse_view</span></dt>
+<dt><span class="section">I/O</span></dt>
+<dt><span class="section">Comparison</span></dt>
 </dl></dd>
-<dt><span class="section">Adapted</span></dt>
-<dd><dl>
-<dt><span class="section">std::pair</span></dt>
-<dt><span class="section">mpl sequence</span></dt>
-<dt><span class="section">boost::array</span></dt>
-<dt><span class="section">boost::tuple</span></dt>
-<dt><span class="section">boost::variant</span></dt>
 </dl></dd>
-<dt><span class="section">Intrinsics</span></dt>
+<dt><span class="section">Container</span></dt>
 <dd><dl>
-<dt><span class="section">Functions</span></dt>
-<dt><span class="section">Metafunctions</span></dt>
-</dl></dd>
-<dt><span class="section">Generation</span></dt>
+<dt><span class="section">vector</span></dt>
+<dt><span class="section">cons</span></dt>
+<dt><span class="section">list</span></dt>
+<dt><span class="section">set</span></dt>
+<dt><span class="section">map</span></dt>
+<dt><span class="section">Generation</span></dt>
 <dd><dl>
-<dt><span class="section">Functions</span></dt>
-<dt><span class="section">MetaFunctions</span></dt>
+<dt><span class="section">Functions</span></dt>
+<dt><span class="section">MetaFunctions</span></dt>
 </dl></dd>
-<dt><span class="section">Conversion</span></dt>
+<dt><span class="section">Conversion</span></dt>
 <dd><dl>
-<dt><span class="section">Functions</span></dt>
-<dt><span class="section">Metafunctions</span></dt>
+<dt><span class="section">Functions</span></dt>
+<dt><span class="section">Metafunctions</span></dt>
 </dl></dd>
-<dt><span class="section">Operators</span></dt>
+</dl></dd>
+<dt><span class="section">View</span></dt>
 <dd><dl>
-<dt><span class="section">I/O</span></dt>
-<dt><span class="section">Comparison</span></dt>
+<dt><span class="section">single_view</span></dt>
+<dt><span class="section">filter_view</span></dt>
+<dt><span class="section">iterator_range</span></dt>
+<dt><span class="section">joint_view</span></dt>
+<dt><span class="section">zip_view</span></dt>
+<dt><span class="section">transform_view</span></dt>
+<dt><span class="section">reverse_view</span></dt>
 </dl></dd>
+<dt><span class="section">Adapted</span></dt>
+<dd><dl>
+<dt><span class="section">std::pair</span></dt>
+<dt><span class="section">mpl sequence</span></dt>
+<dt><span class="section">boost::array</span></dt>
+<dt><span class="section">boost::tuple</span></dt>
+<dt><span class="section">boost::variant</span></dt>
 </dl></dd>
-<dt><span class="section">Algorithms</span></dt>
+<dt><span class="section">Algorithm</span></dt>
 <dd><dl>
-<dt><span class="section">Iteration</span></dt>
+<dt><span class="section">Iteration</span></dt>
 <dd><dl>
-<dt><span class="section">Functions</span></dt>
-<dt><span class="section">Metafunctions</span></dt>
+<dt><span class="section">Functions</span></dt>
+<dt><span class="section">Metafunctions</span></dt>
 </dl></dd>
-<dt><span class="section">Query</span></dt>
+<dt><span class="section">Query</span></dt>
 <dd><dl>
-<dt><span class="section">Functions</span></dt>
-<dt><span class="section">Metafunctions</span></dt>
+<dt><span class="section">Functions</span></dt>
+<dt><span class="section">Metafunctions</span></dt>
 </dl></dd>
-<dt><span class="section">Transformation</span></dt>
+<dt><span class="section">Transformation</span></dt>
 <dd><dl>
-<dt><span class="section">Functions</span></dt>
-<dt><span class="section">Metafunctions</span></dt>
+<dt><span class="section">Functions</span></dt>
+<dt><span class="section">Metafunctions</span></dt>
 </dl></dd>
 </dl></dd>
-<dt><span class="section">Tuples</span></dt>
+<dt><span class="section">Tuple</span></dt>
 <dd><dl>
-<dt><span class="section">Class template tuple</span></dt>
+<dt><span class="section">Class template tuple</span></dt>
 <dd><dl>
-<dt><span class="section">Construction</span></dt>
-<dt><span class="section"><a href="fusion/tuples/class_template_tuple/tuple_creation_functions.html">Tuple
+<dt><span class="section">Construction</span></dt>
+<dt><span class="section"><a href="fusion/tuple/class_template_tuple/tuple_creation_functions.html">Tuple
         creation functions</a></span></dt>
-<dt><span class="section"><a href="fusion/tuples/class_template_tuple/tuple_helper_classes.html">Tuple
+<dt><span class="section"><a href="fusion/tuple/class_template_tuple/tuple_helper_classes.html">Tuple
         helper classes</a></span></dt>
-<dt><span class="section"><a href="fusion/tuples/class_template_tuple/element_access.html">Element
+<dt><span class="section"><a href="fusion/tuple/class_template_tuple/element_access.html">Element
         access</a></span></dt>
-<dt><span class="section"><a href="fusion/tuples/class_template_tuple/relational_operators.html">Relational
+<dt><span class="section"><a href="fusion/tuple/class_template_tuple/relational_operators.html">Relational
         operators</a></span></dt>
 </dl></dd>
-<dt><span class="section">Pairs</span></dt>
+<dt><span class="section">Pairs</span></dt>
 </dl></dd>
 <dt><span class="section">Extension</span></dt>
+<dd><dl>
+<dt><span class="section"> The Full Extension Mechanism</span></dt>
+<dt><span class="section">Sequence Facade</span></dt>
+<dt><span class="section">Iterator Facade</span></dt>
+<dt><span class="section">Macros</span></dt>
+<dd><dl>
+<dt><span class="section"> BOOST_FUSION_ADAPT_STRUCT</span></dt>
+<dt><span class="section"> BOOST_FUSION_ADAPT_ASSOC_STRUCT</span></dt>
+</dl></dd>
+</dl></dd>
 <dt><span class="section">Functional</span></dt>
 <dd><dl>
 <dt><span class="section">Concepts</span></dt>
@@ -225,7 +244,7 @@
 </div>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: September 22, 2007 at 01:00:16 GMT</small></p></td>
+<td align="left"><p><small>Last revised: November 06, 2007 at 12:07:46 GMT</small></p></td>
 <td align="right"><small></small></td>
 </tr></table>
 <hr>

Deleted: branches/proto/v3/libs/fusion/doc/iterators.qbk
==============================================================================
--- branches/proto/v3/libs/fusion/doc/iterators.qbk	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
+++ (empty file)
@@ -1,855 +0,0 @@
-[section Iterators]
-Like __mpl__ and __stl__, iterators are a fundamental concept in Fusion. 
-As with __mpl__ and __stl__ iterators describe positions, and
-provide access to data within an underlying __sequence__.
-
-[heading Header]
-    #include <boost/fusion/iterator.hpp>
-
-[section Concepts]
-
-Fusion iterators are divided into different traversal categories.
-__forward_iterator__ is the most basic concept. __bidirectional_iterator__ 
-is a refinement of __forward_iterator__. __random_access_iterator__ is a 
-refinement of __bidirectional_iterator__.
-
-[section Forward Iterator]
-
-[heading Description]
-A Forward Iterator traverses a __sequence__ allowing movement in only one direction through
-it's elements, one element at a time.
-
-[variablelist Notation
-    [[`i`, `j`]         [Forward Iterators]]
-    [[`I`, `J`]         [Forward Iterator types]]
-    [[`M`]              [An __mpl__ integral constant]]
-    [[`N`]              [An integral constant]]
-]
-
-[heading Expression requirements]
-A type models Forward Iterator if, in addition to being CopyConstructable,
-the following expressions are valid:
-
-[table
-    [[Expression]        [Return type]                [Runtime Complexity]]
-    [[`__next__(i)`]         [__forward_iterator__]       [Constant]]
-    [[`i == j`]          [Convertible to bool]        [Constant]]
-    [[`i != j`]          [Convertible to bool]        [Constant]]
-    [[`__advance_c__<N>(i)`] [__forward_iterator__]       [Constant]]
-    [[`__advance__<M>(i)`] [__forward_iterator__]       [Constant]]
-    [[`__distance__(i, j)`]  [`__result_of_distance__<I, J>::type`][Constant]]
-    [[`__deref__(i)`]        [`__result_of_deref__<I>::type`] [Constant]]
-    [[`*i`]              [`__result_of_deref__<I>::type`] [Constant]]
-]
-
-[heading Meta Expressions]
-[table
-    [[Expression]                       [Compile Time Complexity]]
-    [[`__result_of_next__<I>::type`]            [Amortized constant time]]
-    [[`__result_of_equal_to__<I, J>::type`]      [Amortized constant time]]
-    [[`__result_of_advance_c__<I, N>::type`]     [Linear]]
-    [[`__result_of_advance__<I ,M>::type`]       [Linear]]
-    [[`__result_of_distance__<I ,J>::type`]      [Linear]]
-    [[`__result_of_deref__<I>::type`]       [Amortized constant time]]
-    [[`__result_of_value_of__<I>::type`]    [Amortized constant time]]
-]
-
-[heading Expression Semantics]
-[
-table
-    [[Expression]              [Semantics]]
-    [[`__next__(i)`]               [An iterator to the element following `i`]]
-    [[`i == j`]                [Iterator equality comparison]]
-    [[`i != j`]                [Iterator inequality comparison]]
-    [[`__advance_c__<N>(i)`]       [An iterator n elements after `i` in the sequence]]
-    [[`__advance__<M>(i)`]         [Equivalent to `advance_c<M::value>(i)`]]
-    [[`__distance__(i, j)`]        [The number of elements between `i` and `j`]]
-    [[`__deref__(i)`]    [The element at position`i`]]
-    [[`*i`]          [Equivalent to `deref(i)`]]
-]
-
-[heading Invariants]
-The following invariants always hold:
-
-* `!(i == j) == (i != j)`
-* `__next__(i) == __advance_c__<1>(i)`
-* `__distance__(i, __advance_c__<N>(i)) == N`
-* Using `__next__` to traverse the sequence will never return to a previously seen position
-* `__deref__(i)` is equivalent to `*i`
-* If `i == j` then `*i` is equivalent to `*j`
-
-[heading Models]
-* __std_pair__ iterator
-* __boost_array__ iterator
-* __vector__ iterator
-* __cons__ iterator
-* __list__ iterator
-* __set__ iterator
-* __map__ iterator
-* __single_view__ iterator
-* __filter_view__ iterator
-* __iterator_range__ iterator
-* __joint_view__ iterator
-* __transform_view__ iterator
-* __reverse_view__ iterator
-
-[endsect]
-
-[section Bidirectional Iterator]
-[heading Description]
-A Bidirectional Iterator traverses a __sequence__ allowing movement in either direction one
-element at a time.
-
-[variablelist Notation
-    [[`i`]         [A Bidirectional Iterator]]
-    [[`I`]         [A Bidirectional Iterator type]]
-    [[`M`]         [An __mpl__ integral constant]]
-    [[`N`]         [An integral constant]]
-]
-
-[heading Refinement of]
-__forward_iterator__
-
-[heading Expression requirements]
-In addition to the requirements defined in __forward_iterator__, 
-the following expressions must be valid:
-
-[table
-    [[Expression]        [Return type]                [Runtime Complexity]]
-    [[`__next__(i)`]         [__bidirectional_iterator__] [Constant]]
-    [[`__prior__(i)`]        [__bidirectional_iterator__] [Constant]]
-    [[`__advance_c__<N>(i)`] [__bidirectional_iterator__] [Constant]]
-    [[`__advance__<M>(i)`]   [__bidirectional_iterator__] [Constant]]
-]
-
-[heading Meta Expressions]
-[table
-    [[Expression]              [Compile Time Complexity]]
-    [[`__result_of_prior__<I>::type`]  [Amortized constant time]]
-]
-
-[heading Expression Semantics]
-The semantics of an expression are defined only where they differ from, or are not defined
-in __forward_iterator__
-
-[table
-    [[Expression]    [Semantics]]
-    [[`__prior__(i)`]     [An iterator to the element preceding `i`]]
-]
-
-[heading Invariants]
-In addition to the invariants of __forward_iterator__, 
-the following invariants always hold:
-
-* `__prior__(__next__(i)) == i && __prior__(__next__(i)) == __next__(__prior__(i))`
-* `__prior__(i) == __advance_c__<-1>(i)`
-* Using `__prior__` to traverse a sequence will never return a previously seen position
-
-[heading Models]
-* __std_pair__ iterator
-* __boost_array__ iterator
-* __vector__ iterator
-* __iterator_range__ (where adapted sequence is a __bidirectional_sequence__)
-* __transform_view__ (where adapted sequence is a __bidirectional_sequence__)
-* __reverse_view__
-
-[endsect]
-
-[section Random Access Iterator]
-[heading Description]
-A Random Access Iterator traverses a __sequence__ moving in either direction,
-permitting efficient arbitrary distance movements back and forward through the
-sequence.
-
-[variablelist Notation
-    [[`i`, `j`]         [Random Access Iterators]]
-    [[`I`, `J`]         [Random Access Iterator types]]
-    [[`M`]              [An __mpl__ integral constant]]
-    [[`N`]              [An integral constant]]
-]
-
-[heading Refinement of]
-__bidirectional_iterator__
-
-[heading Expression requirements]
-In addition to the requirements defined in __bidirectional_iterator__, 
-the following expressions must be valid:
-
-[table
-    [[Expression]        [Return type]                [Runtime Complexity]]
-    [[`__next__(i)`]         [__random_access_iterator__]       [Constant]]
-    [[`__prior__(i)`]        [__random_access_iterator__]       [Constant]]
-    [[`__advance_c__<N>(i)`] [__random_access_iterator__]       [Constant]]
-    [[`__advance__<M>(i)`]   [__random_access_iterator__]       [Constant]]
-]
-
-[heading Meta Expressions]
-[table
-    [[Expression]                       [Compile Time Complexity]]
-    [[`__result_of_advance_c__<I, N>::type`]  [Amortized constant time]]
-    [[`__result_of_advance__<I, M>::type`]    [Amortized constant time]]
-    [[`__result_of_distance__<I ,J>::type`]   [Amortized constant time]]
-]
-
-[heading Models]
-* __vector__ iterator
-* __std_pair__ iterator
-* __boost_array__ iterator
-* __iterator_range__ iterator (where adapted sequence is a __random_access_sequence__)
-* __transform_view__ iterator (where adapted sequence is a __random_access_sequence__)
-* __reverse_view__ iterator (where adapted sequence is a __random_access_sequence__)
-
-[endsect]
-
-[endsect]
-
-[section Functions]
-Fusion provides functions for manipulating iterators, analogous to the similar functions 
-from the __mpl__ library.
-
-[section deref]
-
-[heading Description]
-Deferences an iterator.
-
-[heading Synopsis]
-    template<
-        typename I
-        >
-    typename __result_of_deref__<I>::type deref(I const& i);
-
-[table Parameters
-    [[Parameter]      [Requirement]    [Description]]
-    [[`i`]            [Model of __forward_iterator__] [Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __deref__(i);
-
-[*Return type]: `__result_of_deref__<I>::type`
-
-[*Semantics]: Dereferences the iterator `i`.
-
-[heading Header]
-    #include <boost/fusion/iterator/deref.hpp>
-
-[heading Example]
-    typedef __vector__<int,int&> vec;
-    
-    int i(0);
-    vec v(1,i);
-    assert(__deref__(__begin__(v)) == 1);
-    assert(__deref__(__next__(__begin__(v))) == 0);
-    assert(&(__deref__(__next__(__begin__(v)))) == &i);
-
-[endsect]
-
-[section next]
-
-[heading Description]
-Moves an iterator 1 position forwards.
-
-[heading Synopsis]
-    template<
-        typename I
-        >
-    typename __result_of_next__<I>::type next(I const& i);
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`i`]          [Model of __forward_iterator__] [Operation's argument]]
-]
-
-[heading Expression Semantics]
-    next(i);
-
-[*Return type]: A model of the same iterator concept as `i`.
-
-[*Semantics]: Returns an iterator to the next element after `i`.
-
-[heading Header]
-    #include <boost/fusion/iterator/next.hpp>
-
-[heading Example]
-    typedef __vector__<int,int,int> vec;
-
-    vec v(1,2,3);
-    assert(__deref__(__begin__(v)) == 1);
-    assert(__deref__(__next__(__begin__(v))) == 2);
-    assert(__deref__(__next__(__next__(__begin__(v)))) == 3);
-
-[endsect]
-
-[section prior]
-
-[heading Description]
-Moves an iterator 1 position backwards.
-
-[heading Synopsis]
-    template<
-        typename I
-        >
-    typename __result_of_prior__<I>::type prior(I const& i);
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`i`]          [Model of __bidirectional_iterator__] [Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __prior__(i);
-
-[*Return type]: A model of the same iterator concept as `i`.
-
-[*Semantics]: Returns an iterator to the element prior to `i`.
-
-[heading Header]
-    #include <boost/fusion/iterator/prior.hpp>
-
-[heading Example]
-    typedef __vector__<int,int> vec;
-
-    vec v(1,2);
-    assert(__deref__(__next__(__begin__(v))) == 2);
-    assert(__deref__(__prior__(__next__(__begin__(v)))) == 1);
-
-[endsect]
-
-[section distance]
-
-[heading Description]
-Returns the distance between 2 iterators.
-
-[heading Synopsis]
-    template<
-        typename I,
-        typename J
-        >
-    typename __result_of_distance__<I, J>::type distance(I const& i, J const& j);
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`i`, `j`]          [Models of __forward_iterator__ into the same sequence] [The start and end points of the distance to be measured]]
-]
-
-[heading Expression Semantics]
-    __distance__(i,j);
-
-[*Return type]: `int`
-
-[*Semantics]: Returns the distance between iterators `i` and `j`.
-
-[heading Header]
-    #include <boost/fusion/iterator/distance.hpp>
-
-[heading Example]
-    typedef __vector__<int,int,int> vec;
-
-    vec v(1,2,3);
-    assert(__distance__(__begin__(v), __next__(__next__(__begin__(v)))) == 2);
-
-[endsect]
-
-[section advance]
-
-[heading Description]
-Moves an iterator by a specified distance.
-
-[heading Synopsis]
-    template<
-        typename I,
-        typename M
-        >
-    typename __result_of_advance__<I, M>::type advance(I const& i); 
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`i`]          [Model of __forward_iterator__] [Iterator to move relative to]]
-    [[`N`]          [An __mpl_integral_constant__] [Number of positions to move]]
-]
-
-[heading Expression Semantics]
-    __advance__<M>(i);
-
-[*Return type]: A model of the same iterator concept as `i`.
-
-[*Semantics]: Returns an iterator to the element `M` positions from `i`. If `i` is a __bidirectional_iterator__ then `M` may be negative.
-
-[heading Header]
-    #include <boost/fusion/iterator/advance.hpp>
-
-[heading Example]
-    typedef __vector__<int,int,int> vec;
-
-    vec v(1,2,3);
-    assert(__deref__(__advance__<mpl::int_<2> >(__begin__(v))) == 3);
-
-[endsect]
-
-[section advance_c]
-
-[heading Description]
-Moves an iterator by a specified distance.
-
-[heading Synopsis]
-    template<
-        typename I,
-        int N
-        >
-    typename __result_of_advance_c__<I, N>::type advance_c(I const& i); 
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`i`]          [Model of __forward_iterator__] [Iterator to move relative to]]
-    [[`N`]          [Integer constant] [Number of positions to move]]
-]
-
-[heading Expression Semantics]
-    __advance_c__<N>(i);
-
-[*Return type]: A model of the same iterator concept as `i`.
-
-[*Semantics]: Returns an iterator to the element `N` positions from `i`. If `i` is a __bidirectional_iterator__ then `N` may be negative.
-
-[heading Header]
-    #include <boost/fusion/iterator/advance.hpp>
-
-[heading Example]
-    typedef __vector__<int,int,int> vec;
-
-    vec v(1,2,3);
-    assert(__deref__(__advance_c__<2>(__begin__(v))) == 3);
-
-[endsect]
-
-[endsect]
-
-[section Operators]
-Overloaded operators are provided to provide a more natural syntax for dereferencing iterators, and comparing them for equality.
-
-[section:operator_unary_star Operator *]
-
-[heading Description]
-Dereferences an iterator.
-
-[heading Synopsis]
-    template<
-        typename I
-        >
-    typename __result_of_deref__<I>::type operator*(__unspecified__<I> const& i);
-
-[table Parameters
-    [[Parameter]      [Requirement]    [Description]]
-    [[`i`]            [Model of __forward_iterator__] [Operation's argument]]
-]
-
-[heading Expression Semantics]
-    *i
-
-[*Return type]: Equivalent to the return type of `__deref__(i)`.
-
-[*Semantics]: Equivalent to `__deref__(i)`.
-
-[heading Header]
-    #include <boost/fusion/iterator/deref.hpp>
-
-[heading Example]
-    typedef __vector__<int,int&> vec;
-    
-    int i(0);
-    vec v(1,i);
-    assert(*__begin__(v) == 1);
-    assert(*__next__(__begin__(v)) == 0);
-    assert(&(*__next__(__begin__(v))) == &i);
-
-[endsect]
-
-[section:operator_equality Operator ==]
-
-[heading Description]
-Compares 2 iterators for equality.
-
-[heading Synopsis]
-    template<
-        typename I,
-        typename J
-        >
-    __unspecified__ operator==(I const& i, J const& i);
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`i`, `j`]     [Any fusion iterators] [Operation's arguments]]
-]
-
-[heading Expression Semantics]
-    i == j
-
-[*Return type]: Convertible to `bool`.
-
-[*Semantics]: Equivalent to `__result_of_equal_to__<I,J>::value` where `I` and `J` are the types of `i` and `j` respectively.
-
-[heading Header]
-    #include <boost/fusion/iterator/equal_to.hpp>
-
-[endsect]
-
-[section:operator_inequality Operator !=]
-
-[heading Description]
-Compares 2 iterators for inequality.
-
-[heading Synopsis]
-    template<
-        typename I,
-        typename J
-        >
-    __unspecified__ operator==(I const& i, J const& i);
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`i`, `j`]     [Any fusion iterators] [Operation's arguments]]
-]
-
-[heading Expression Semantics]
-
-[*Return type]: Convertible to `bool`.
-
-[*Semantics]: Equivalent to `!__result_of_equal_to__<I,J>::value` where `I` and `J` are the types of `i` and `j` respectively.
-
-[heading Header]
-    #include <boost/fusion/iterator/equal_to.hpp>
-
-[endsect]
-
-[endsect]
-
-[section Metafunctions]
-
-[section value_of]
-
-[heading Description]
-
-Returns the type stored at the position of an iterator.
-
-[heading Synopsis]
-    template<
-        typename I
-        >
-    struct value_of
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`I`]          [Model of __forward_iterator__] [Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __result_of_value_of__<I>::type
-
-[*Return type]: Any type
-
-[*Semantics]: Returns the type stored in a sequence at iterator position `I`.
-
-[heading Header]
-    #include <boost/fusion/iterator/value_of.hpp>
-
-[heading Example]
-    typedef __vector__<int,int&,const int&> vec;
-    typedef __result_of_begin__<vec>::type first;
-    typedef __result_of_next__<first>::type second;
-    typedef __result_of_next__<second>::type third;
-
-    BOOST_MPL_ASSERT((boost::is_same<__result_of_value_of__<first>::type, int>));
-    BOOST_MPL_ASSERT((boost::is_same<__result_of_value_of__<second>::type, int&>));
-    BOOST_MPL_ASSERT((boost::is_same<__result_of_value_of__<third>::type, const int&>));
-
-[endsect]
-
-[section deref]
-
-[heading Description]
-Returns the type that will be returned by dereferencing an iterator.
-
-[heading Synposis]
-    template<
-        typename I
-        >
-    struct deref
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter] [Requirement]                   [Description]]
-    [[`I`]       [Model of __forward_iterator__] [Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __result_of_deref__<I>::type
-
-[*Return type]: Any type
-
-[*Semantics]: Returns the result of dereferencing an iterator of type `I`.
-
-[heading Header]
-    #include <boost/fusion/iterator/deref.hpp>
-
-[heading Example]
-    typedef __vector__<int,int&> vec;
-    typedef const vec const_vec;
-    typedef __result_of_begin__<vec>::type first;
-    typedef __result_of_next__<first>::type second;
-
-    typedef __result_of_begin__<const_vec>::type const_first;
-    typedef __result_of_next__<const_first>::type const_second;
-
-    BOOST_MPL_ASSERT((boost::is_same<__result_of_deref__<first>::type, int&>));
-    BOOST_MPL_ASSERT((boost::is_same<__result_of_deref__<second>::type, int&>));
-
-[endsect]
-
-[section next]
-
-[heading Description]
-Returns the type of the next iterator in a sequence.
-
-[heading Synposis]
-    template<
-        typename I
-        >
-    struct next
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`I`]          [Model of __forward_iterator__] [Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __result_of_next__<I>::type
-
-[*Return type]: A model of the same iterator concept as `I`.
-
-[*Semantics]: Returns an iterator to the next element in the sequence after `I`.
-
-[heading Header]
-    #include <boost/fusion/iterator/next.hpp>
-
-[heading Example]
-    typedef __vector__<int,double> vec;
-    typedef __result_of_next__<__result_of_begin__<vec>::type>::type second;
-
-    BOOST_MPL_ASSERT((boost::is_same<__result_of_value_of__<second>::type, double>));
-
-[endsect]
-
-[section prior]
-
-[heading Description]
-Returns the type of the previous iterator in a sequence.
-
-[heading Synopsis]
-    template<
-        typename I
-        >
-    struct prior
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`I`]          [Model of __bidirectional_iterator__] [Operation's argument]]
-]
-
-[heading Expression Semantics]
-    __result_of_prior__<I>::type
-
-[*Return type]: A model of the same iterator concept as `I`.
-
-[*Semantics]: Returns an iterator to the previous element in the sequence before `I`.
-
-[heading Header]
-    #include <boost/fusion/iterator/prior.hpp>
-
-[heading Example]
-    typedef __vector__<int,double> vec;
-    typedef __result_of_next__<__result_of_begin__<vec>::type>::type second;
-
-    BOOST_MPL_ASSERT((boost::is_same<__result_of_value_of__<second>::type, double>));
-
-    typedef __result_of_prior__<second>::type first;
-    BOOST_MPL_ASSERT((boost::is_same<__result_of_value_of__<first>::type, int>));
-
-[endsect]
-
-[section equal_to]
-
-[heading Description]
-Returns a true-valued __mpl_integral_constant__ if `I` and `J` are equal.
-
-[heading Synopsis]
-    template<
-        typename I,
-        typename J
-        >
-    struct equal_to
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`I`, `J`]     [Any fusion iterators] [Operation's arguments]]
-]
-
-[heading Expression Semantics]
-    __result_of_equal_to__<I, J>::type
-
-[*Return type]: A model of __mpl_integral_constant__.
-
-[*Semantics]: Returns `boost::mpl::true_` if `I` and `J` are iterators to the same position. Returns `boost::mpl::false_` otherwise.
-
-[heading Header]
-    #include <boost/fusion/iterator/equal_to.hpp>
-
-[heading Example]
-    typedef __vector__<int,double> vec;
-    typedef __result_of_begin__<vec>::type first;
-    typedef __result_of_end__<vec>::type last;
-    BOOST_MPL_ASSERT((__result_of_equal_to__<first, first>));
-    BOOST_MPL_ASSERT_NOT((__result_of_equal_to__<first,last>));
-
-[endsect]
-
-[section distance]
-
-[heading Description]
-Returns the distance between two iterators.
-
-[heading Synopsis]
-    template<
-        typename I,
-        typename J
-        >
-    struct distance
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`I`, `J`]          [Models of __forward_iterator__ into the same sequence] [The start and end points of the distance to be measured]]
-]
-
-[heading Expression Semantics]
-    __result_of_distance__<I, J>::type
-
-[*Return type]: A model of __mpl_integral_constant__.
-
-[*Semantics]: Returns the distance between iterators of types `I` and `J`.
-
-[heading Header]
-    #include <boost/fusion/iterator/distance.hpp>
-
-[heading Example]
-    typedef __vector__<int,double,char> vec;
-    typedef __result_of_begin__<vec>::type first;
-    typedef __result_of_next__<first>::type second;
-    typedef __result_of_next__<second>::type third;
-    typedef __result_of_distance__<first,third>::type dist;
-
-    BOOST_MPL_ASSERT_RELATION(dist::value, ==, 2);
-
-[endsect]
-
-[section advance]
-
-[heading Description]
-Moves an iterator a specified distance.
-
-[heading Synopsis]
-    template<
-        typename I,
-        typename M
-        >
-    struct advance
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`I`]          [Model of __forward_iterator__] [Iterator to move relative to]]
-    [[`M`]          [Model of __mpl_integral_constant__] [Number of positions to move]]
-]
-
-[heading Expression Semantics]
-    __result_of_advance__<I,M>::type
-
-[*Return type]: A model of the same iterator concept as `I`.
-
-[*Semantics]: Returns an iterator a distance `M` from `I`. If `I` is a __bidirectional_iterator__ then `M` may be negative.
-
-[heading Header]
-    #include <boost/fusion/iterator/advance.hpp>
-
-[heading Example]
-    typedef __vector__<int,double,char> vec;
-    typedef __result_of_begin__<vec>::type first;
-    typedef __result_of_next__<first>::type second;
-    typedef __result_of_next__<second>::type third;
-
-    BOOST_MPL_ASSERT((__result_of_equal_to__<__result_of_advance__<first, boost::mpl::int_<2> >::type, third>));
-
-[endsect]
-
-[section advance_c]
-
-[heading Description]
-Moves an iterator by a specified distance.
-
-[heading Synopsis]
-    template<
-        typename I,
-        int N
-        >
-    struct advance_c
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`I`]          [Model of __forward_iterator__] [Iterator to move relative to]]
-    [[`N`]          [Integer constant] [Number of positions to move]]
-]
-
-[heading Expression Semantics]
-    __result_of_advance_c__<I, N>::type
-
-[*Return type]: A model of the same iterator concept as `I`.
-
-[*Semantics]: Returns an iterator a distance `N` from `I`. If `I` is a __bidirectional_iterator__ then `N` may be negative. Equivalent to `__result_of_advance__<I, boost::mpl::int_<N> >::type`.
-
-[heading Header]
-    #include <boost/fusion/iterator/advance.hpp>
-
-[heading Example]
-    typedef __vector__<int,double,char> vec;
-    typedef __result_of_begin__<vec>::type first;
-    typedef __result_of_next__<first>::type second;
-    typedef __result_of_next__<second>::type third;
-
-    BOOST_MPL_ASSERT((__result_of_equal_to__<__result_of_advance_c__<first, 2>::type, third>));
-
-[endsect]
-
-[endsect]
-
-[endsect]
-

Modified: branches/proto/v3/libs/fusion/doc/organization.qbk
==============================================================================
--- branches/proto/v3/libs/fusion/doc/organization.qbk	(original)
+++ branches/proto/v3/libs/fusion/doc/organization.qbk	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -9,13 +9,20 @@
 
 [:[$images/fusion_org.png]]
 
-The entire library is found in the "boost/fusion" directory. Modules are 
-organized in directories. Each module has its own header file placed in the 
-same directory with the actual module-directory. For example, there exists 
-"boost/fusion/support.hpp" in the same directory as "boost/fusion/support". 
-Everything, except those found inside "detail" directories, is public. The 
-library is header-only. There is no need to build object files to link 
-against.
+The entire library is found in the "boost/fusion" directory. Modules are
+organized in directories. Each module has its own header file placed in
+the same directory with the actual module-directory. For example, there
+exists "boost/fusion/support.hpp" in the same directory as
+"boost/fusion/support". Everything, except those found inside "detail"
+directories, is public.
+
+There is also a "boost/fusion/include/" directory that contains all the
+headers to all the components and modules. If you are unsure where to
+find a specific component or module, or don't want to fuss with
+hierarchy and nesting, use this.
+
+The library is header-only. There is no need to build object files to
+link against.
 
 [heading Directory]
 
@@ -24,45 +31,50 @@
     * iteration
     * query
     * transformation
+* adapted
+    * array
+    * mpl
+    * boost::tuple
+    * std_pair
+    * struct
+    * variant
+* view
+    * filter_view
+    * iterator_range
+    * joint_view
+    * reverse_view
+    * single_view
+    * transform_view
+    * zip_view
+* container
+    * deque
+    * list
+    * map
+    * set
+    * vector
+    * generation
+* mpl
+* functional
 * sequence
-    * adapted
-        * array
-        * mpl
-        * std_pair
     * comparison
-    * container
-        * list
-        * map
-        * set
-        * vector
-    * conversion
-    * generation
     * intrinsic
     * io
-    * utility
-    * view
-        * filter_view
-        * iterator_range
-        * joint_view
-        * reverse_view
-        * single_view
-        * transform_view
-        * zip_view
 * iterator
 * support
 
 [heading Example]
 
-If, for example, you want to use `list`, depending on the granularity that 
+If, for example, you want to use `list`, depending on the granularity that
 you desire, you may do so by including one of
 
-    #include <boost/fusion/sequence.hpp>
-    #include <boost/fusion/sequence/container.hpp>
-    #include <boost/fusion/sequence/container/list.hpp>
-    
-The first includes all sequences. The second includes all of sequence 
-containers. The third includes only `list` [footnote Modules may contain 
-smaller components. Header file information for each component will be 
-provided as part of the component's documentation.].
+    #include <boost/fusion/container.hpp>
+    #include <boost/fusion/include/container.hpp>
+    #include <boost/fusion/container/list.hpp>
+    #include <boost/fusion/include/list.hpp>
+
+The first includes all containers The second includes only `list`
+[footnote Modules may contain smaller components. Header file
+information for each component will be provided as part of the
+component's documentation.].
 
 [endsect]

Modified: branches/proto/v3/libs/fusion/doc/quick_start.qbk
==============================================================================
--- branches/proto/v3/libs/fusion/doc/quick_start.qbk	(original)
+++ branches/proto/v3/libs/fusion/doc/quick_start.qbk	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -5,12 +5,13 @@
 multiple heterogeneous elements (triples, quadruples, etc.). The tuple is 
 more or less a synonym for fusion's `__vector__`. 
 
-For starters, we shall include all of Fusion's __sequence__s [footnote There 
+For starters, we shall include all of Fusion's __sequence__(s) [footnote There 
 are finer grained header files available if you wish to have more control 
 over which components to include (see section __organization__ for 
 details).]:
 
     #include <boost/fusion/sequence.hpp>
+    #include <boost/fusion/include/sequence.hpp>
 
 Let's begin with a `__vector__` [footnote Unless otherwise noted, components are 
 in namespace `boost::fusion`. For the sake of simplicity, code in this 
@@ -32,6 +33,7 @@
 First, let's include the algorithms:
 
     #include <boost/fusion/algorithm.hpp>
+    #include <boost/fusion/include/algorithm.hpp>
     
 Now, let's write a function object that prints XML of the form <type>data</type> 
 for each member in the tuple. 

Deleted: branches/proto/v3/libs/fusion/doc/sequences.qbk
==============================================================================
--- branches/proto/v3/libs/fusion/doc/sequences.qbk	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
+++ (empty file)
@@ -1,4036 +0,0 @@
-[section Sequences]
-
-Like __mpl__, the Sequence is a fundamental concept in Fusion. A Sequence
-may or may not actually store or contain data. __containers__ are sequences
-that hold data. __views__, on the other hand, are sequences that do not
-store any data. Instead, they are proxies that impart an alternative
-presentation over another sequence. All models of Sequence have an
-associated __iterator__ type that can be used to iterate through the
-Sequence's elements.
-
-[heading Header]
-
-    #include <boost/fusion/sequence.hpp>
-
-[section Concepts]
-
-Fusion Sequences are organized into a hierarchy of concepts.
-
-[heading Traversal]
-
-Fusion's sequence traversal related concepts parallel Fusion's
-__iterator_concepts__. __forward_sequence__ is the most basic concept.
-__bidirectional_sequence__ is a refinement of __forward_sequence__.
-__random_access_sequence__ is a refinement of __bidirectional_sequence__.
-These concepts pertain to sequence traversal.
-
-[heading Associativity]
-
-The __associative_sequence__ concept is orthogonal to traversal. An Associative
-Sequence allows efficient retrieval of elements based on keys.
-
-[section Forward Sequence]
-
-[heading Description]
-
-A Forward Sequence is a Sequence whose elements are arranged in a definite
-order. The ordering is guaranteed not to change from iteration to
-iteration. The requirement of a definite ordering allows the definition of
-element-by-element equality (if the container's element type is Equality
-Comparable) and of lexicographical ordering (if the container's element
-type is LessThan Comparable).
-
-[variablelist Notation
-    [[`s`]       [A Forward Sequence]]
-    [[`S`]       [A Forward Sequence type]]
-    [[`o`]       [An arbitrary object]]
-    [[`e`]       [A Sequence element]]
-]
-
-[heading Valid Expressions]
-
-For any Forward Sequence the following expressions must be valid:
-
-[table
-    [[Expression]       [Return type]               [Type Requirements]     [Runtime Complexity]]
-    [[`__begin__(s)`]       [__forward_iterator__]      []                      [Constant]]
-    [[`__end__(s)`]         [__forward_iterator__]      []                      [Constant]]
-    [[`__size__(s)`]        [__mpl_integral_constant__.
-                        Convertible to int.]        []                      [Constant]]
-    [[`__empty__(s)`]       [__mpl_boolean_constant__.
-                        Convertible to bool.]       []                      [Constant]]
-    [[`__front__(s)`]       [Any type]                  []                      [Constant]]
-    [[`__front__(s) = o`]   [Any type]                  [`s` is mutable and
-                                                    `e = o`, where `e`
-                                                    is the first element
-                                                    in the sequence, is
-                                                    a valid expression.]    [Constant]]
-]
-
-[heading Result Type Expressions]
-
-[table
-    [[Expression]                   [Compile Time Complexity]]
-    [[`__result_of_begin__<S>::type`]  [Amortized constant time]]
-    [[`__result_of_end__<S>::type`]    [Amortized constant time]]
-    [[`__result_of_size__<S>::type`]   [Unspecified]]
-    [[`__result_of_empty__<S>::type`]  [Constant time]]
-    [[`__result_of_front__<S>::type`]  [Amortized constant time]]
-]
-
-[heading Expression Semantics]
-
-[table
-    [[Expression]       [Semantics]]
-    [[`__begin__(s)`]       [An iterator to the first element of the sequence; see __begin__.]]
-    [[`__end__(s)`]         [A past-the-end iterator to the sequence; see __end__.]]
-    [[`__size__(s)`]        [The size of the sequence; see __size__.]]
-    [[`__empty__(s)`]       [A boolean Integral Constant `c` such that
-                        `c::value == true` if and only if the sequence
-                        is empty; see __empty__.]]
-    [[`__front__(s)`]       [The first element in the sequence; see __front__.]]
-]
-
-[heading Invariants]
-
-For any Forward Sequence s the following invariants always hold:
-
-* `[__begin__(s), __end__(s))` is always a valid range.
-* An __algorithm__ that iterates through the range `[__begin__(s), __end__(s))`
-  will pass through every element of `s` exactly once.
-* `__begin__(s)` is identical to `__end__(s))` if and only if `s` is empty.
-* Two different iterations through `s` will access its elements in
-  the same order.
-
-[heading Models]
-
-* __std_pair__
-* __boost_array__
-* __vector__
-* __cons__
-* __list__
-* __set__
-* __map__
-* __single_view__
-* __filter_view__
-* __iterator_range__
-* __joint_view__
-* __transform_view__
-* __reverse_view__
-* __zip_view__
-
-[endsect]
-
-[section Bidirectional Sequence]
-
-[heading Description]
-
-A Bidirectional Sequence is a __forward_sequence__ whose iterators model
-__bidirectional_iterator__.
-
-[heading Refinement of]
-
-__forward_sequence__
-
-[variablelist Notation
-    [[`s`]       [A Forward Sequence]]
-    [[`S`]       [A Forward Sequence type]]
-    [[`o`]       [An arbitrary object]]
-    [[`e`]       [A Sequence element]]
-]
-
-[heading Valid Expressions]
-
-In addition to the requirements defined in __forward_sequence__, for any
-Bidirectional Sequence the following must be met:
-
-[table
-    [[Expression]       [Return type]                   [Type Requirements]     [Runtime Complexity]]
-    [[`__begin__(s)`]       [__bidirectional_iterator__]    []                      [Constant]]
-    [[`__end__(s)`]         [__bidirectional_iterator__]    []                      [Constant]]
-    [[`__back__(s)`]        [Any type]                      []                      [Constant]]
-    [[`__back__(s) = o`]    [Any type]                      [`s` is mutable and
-                                                        `e = o`, where `e`
-                                                        is the first element
-                                                        in the sequence, is
-                                                        a valid expression.]    [Constant]]
-]
-
-[heading Result Type Expressions]
-
-[table
-    [[Expression]                   [Compile Time Complexity]]
-    [[`__result_of_begin__<S>::type`]  [Amortized constant time]]
-    [[`__result_of_end__<S>::type`]    [Amortized constant time]]
-    [[`__result_of_back__<S>::type`]   [Amortized constant time]]
-]
-
-[heading Expression Semantics]
-
-The semantics of an expression are defined only where they differ from, or
-are not defined in __forward_sequence__.
-
-[table
-    [[Expression]       [Semantics]]
-    [[`__back__(s)`]        [The last element in the sequence; see __back__.]]
-]
-
-[heading Models]
-
-* __std_pair__
-* __boost_array__
-* __vector__
-* __reverse_view__
-* __iterator_range__ (where adapted sequence is a Bidirectional Sequence)
-* __transform_view__ (where adapted sequence is a Bidirectional Sequence)
-* __zip_view__       (where adapted sequences are models Bidirectional Sequence)
-
-[endsect]
-
-[section Random Access Sequence]
-
-[heading Description]
-
-A Random Access Sequence is a __bidirectional_sequence__ whose iterators
-model __random_access_iterator__. It guarantees constant time access to
-arbitrary sequence elements.
-
-[heading Refinement of]
-
-__bidirectional_sequence__
-
-[variablelist Notation
-    [[`s`]       [A Random Access Sequence]]
-    [[`S`]       [A Random Access Sequence type]]
-    [[`N`]       [An __mpl_integral_constant__]]
-    [[`o`]       [An arbitrary object]]
-    [[`e`]       [A Sequence element]]
-]
-
-[heading Valid Expressions]
-
-In addition to the requirements defined in __bidirectional_sequence__, for
-any Random Access Sequence the following must be met:
-
-[table
-    [[Expression]       [Return type]                   [Type Requirements]     [Runtime Complexity]]
-    [[`__begin__(s)`]       [__random_access_iterator__]    []                      [Constant]]
-    [[`__end__(s)`]         [__random_access_iterator__]    []                      [Constant]]
-    [[`__at__<N>(s)`]       [Any type]                      []                      [Constant]]
-    [[`__at__<N>(s) = o`]   [Any type]                      [`s` is mutable and
-                                                        `e = o`, where `e`
-                                                        is the first element
-                                                        in the sequence, is
-                                                        a valid expression.]    [Constant]]
-]
-
-[heading Result Type Expressions]
-
-[table
-    [[Expression]                           [Compile Time Complexity]]
-    [[`__result_of_begin__<S>::type`]          [Amortized constant time]]
-    [[`__result_of_end__<S>::type`]            [Amortized constant time]]
-    [[`__result_of_at__<S, N>::type`]          [Amortized constant time]]
-    [[`__result_of_value_at__<S, N>::type`]    [Amortized constant time]]
-]
-
-[blurb __note__ `__result_of_at__<S, N>` returns the actual type returned by
-`__at__<N>(s)`. In most cases, this is a reference. Hence, there is no way to
-know the exact element type using `__result_of_at__<S, N>`.The element at `N`
-may actually be a reference to begin with. For this purpose, you can use
-`__result_of_value_at__<S, N>`.]
-
-[heading Expression Semantics]
-
-The semantics of an expression are defined only where they differ from, or
-are not defined in __bidirectional_sequence__.
-
-[table
-    [[Expression]       [Semantics]]
-    [[`__at__<N>(s)`]       [The Nth element from the beginning of the sequence; see __at__.]]
-]
-
-[heading Models]
-
-* __std_pair__
-* __boost_array__
-* __vector__
-* __reverse_view__
-* __iterator_range__ (where adapted sequence is a Random Access Sequence)
-* __transform_view__ (where adapted sequence is a Random Access Sequence)
-* __zip_view__       (where adapted sequences are models Random Access Sequence)
-
-[endsect]
-
-[section Associative Sequence]
-
-[heading Description]
-
-An Associative Sequence allows efficient retrieval of elements based on keys.
-Like associative sequences in __mpl__, and unlike associative containers in
-__stl__, Fusion associative sequences have no implied ordering relation.
-Instead, type identity is used to impose an equivalence relation on keys, and
-the order in which sequence elements are traversed during iteration is left
-unspecified. In addition, unlike __stl__, Associative Sequences have mutable
-iterators. This is due to the fact that there is no associated ordering relation
-and the runtime value of the keys themselves do not have any effect on the
-associativity of the sequence.
-
-
-[variablelist Notation
-    [[`s`]       [An Associative Sequence]]
-    [[`S`]       [An Associative Sequence type]]
-    [[`K`]       [An arbitrary /key/ type]]
-    [[`o`]       [An arbitrary object]]
-    [[`e`]       [A Sequence element]]
-]
-
-[heading Valid Expressions]
-
-For any Associative Sequence the following expressions must be valid:
-
-[table
-    [[Expression]           [Return type]               [Type Requirements]     [Runtime Complexity]]
-    [[`__has_key__<K>(s)`]      [__mpl_boolean_constant__.
-                            Convertible to bool.]       []                      [Constant]]
-    [[`__at_key__<K>(s)`]       [Any type]                  []                      [Constant]]
-    [[`__at_key__<K>(s) = o`]   [Any type]                  [`s` is mutable and
-                                                        `e = o`, where `e`
-                                                        is the first element
-                                                        in the sequence, is
-                                                        a valid expression.]    [Constant]]
-]
-
-[heading Result Type Expressions]
-
-[table
-    [[Expression]                               [Compile Time Complexity]]
-    [[`__result_of_has_key__<S, K>::type`]         [Amortized constant time]]
-    [[`__result_of_at_key__<S, K>::type`]          [Amortized constant time]]
-    [[`__result_of_value_at_key__<S, K>::type`]    [Amortized constant time]]
-]
-
-[blurb __note__ `__result_of_at_key__<S, K>` returns the actual type returned
-by `__at_key__<K>(s)`. In most cases, this is a reference. Hence, there is no
-way to know the exact element type using `__result_of_at_key__<S, K>`.The
-element at `K` may actually be a reference to begin with. For this purpose,
-you can use `__result_of_value_at_key__<S, N>`.]
-
-[heading Expression Semantics]
-
-[table
-    [[Expression]       [Semantics]]
-    [[`__has_key__<K>(s)`]  [A boolean Integral Constant `c` such that
-                        `c::value == true` if and only if there is
-                        one or more elements with the key `k` in `s`;
-                        see __has_key__.]]
-    [[`__at_key__<K>(s)`]   [The element associated with the key
-                        `K` in the sequence `s`; see __at__.]]
-]
-
-[heading Models]
-
-* __set__
-* __map__
-
-[endsect]
-
-[endsect]
-
-[section Containers]
-
-Fusion provides a few predefined sequences out of the box. These
-/containers/ actually hold heterogenously typed data; unlike
-__views__. These containers are more or less counterparts of those in __stl__.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/container.hpp>
-
-[section vector]
-
-[heading Description]
-
-`vector` is a __random_access_sequence__ of heterogenous typed
-data structured as a simple `struct` where each element is held
-as a member variable. `vector` is the simplest of the Fusion
-sequence container, and in many cases the most efficient.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/container/vector.hpp>
-    #include <boost/fusion/sequence/container/vector/vector_fwd.hpp>
-
-    // numbered forms
-    #include <boost/fusion/sequence/container/vector/vector10.hpp>
-    #include <boost/fusion/sequence/container/vector/vector20.hpp>
-    #include <boost/fusion/sequence/container/vector/vector30.hpp>
-    #include <boost/fusion/sequence/container/vector/vector40.hpp>
-    #include <boost/fusion/sequence/container/vector/vector50.hpp>
-
-[heading Synopsis]
-
-[*Numbered forms]
-
-    template <>
-    struct vector0;
-
-    template <typename T0>
-    struct vector1;
-
-    template <typename T0, typename T1>
-    struct vector2;
-
-    template <typename T0, typename T1, typename T2>
-    struct vector3;
-
-    ...
-
-    template <typename T0, typename T1, typename T2..., typename TN>
-    struct vectorN;
-
-[*Variadic form]
-
-    template <
-        typename T0 = __unspecified__
-      , typename T1 = __unspecified__
-      , typename T2 = __unspecified__
-        ...
-      , typename TN = __unspecified__
-    >
-    struct vector;
-
-The numbered form accepts the exact number of elements. Example:
-
-    vector3<int, char, double>
-
-The variadic form accepts `0` to `FUSION_MAX_VECTOR_SIZE` elements, where
-`FUSION_MAX_VECTOR_SIZE` is a user definable predefined maximum that
-defaults to `10`. Example:
-
-    vector<int, char, double>
-
-You may define the preprocessor constant `FUSION_MAX_VECTOR_SIZE` before
-including any Fusion header to change the default. Example:
-
-    #define FUSION_MAX_VECTOR_SIZE 20
-
-[heading Template parameters]
-
-[table
-    [[Parameter]            [Description]               [Default]]
-    [[`T0`...`TN`]          [Element types]             [['unspecified]]]
-]
-
-[heading Model of]
-
-* __random_access_sequence__
-
-[variablelist Notation
-    [[`v`]              [Instance of `vector`]]
-    [[`V`]              [A `vector` type]]
-    [[`e0`...`en`]      [Heterogeneous values]]
-    [[`s`]              [A __forward_sequence__]]
-]
-
-[heading Expression Semantics]
-
-Semantics of an expression is defined only where it differs from, or is not
-defined in __random_access_sequence__.
-
-[table
-    [[Expression]           [Semantics]]
-    [[`V()`]                [Creates a vector with default constructed elements.]]
-    [[`V(e0, e1,... en)`]   [Creates a vector with elements `e0`...`en`.]]
-    [[`V(s)`]               [Copy constructs a vector from a __forward_sequence__, `s`.]]
-    [[`v = s`]              [Assigns to a vector, `v`, from a __forward_sequence__, `s`.]]
-]
-
-[heading Example]
-
-    vector<int, float> v(12, 5.5f);
-    std::cout << __at_c__<0>(v) << std::endl;
-    std::cout << __at_c__<1>(v) << std::endl;
-
-[endsect]
-
-[section cons]
-
-[heading Description]
-
-`cons` is a simple __forward_sequence__. It is a lisp style recursive list
-structure where `car` is the /head/ and `cdr` is the /tail/: usually
-another cons structure or `nil`: the empty list. Fusion's __list__ is built
-on top of this more primitive data structure. It is more efficient than
-__vector__ when the target sequence is constructed piecemeal (a data at a
-time). The runtime cost of access to each element is peculiarly constant
-(see __recursive_inline__).
-
-[heading Header]
-
-    #include <boost/fusion/sequence/container/list/cons.hpp>
-
-[heading Synopsis]
-
-    template <typename Car, typename Cdr = nil>
-    struct cons;
-
-[heading Template parameters]
-
-[table
-    [[Parameter]            [Description]               [Default]]
-    [[`Car`]                [Head type]                 []]
-    [[`Cdr`]                [Tail type]                 [`nil`]]
-]
-
-[heading Model of]
-
-* __forward_sequence__
-
-[variablelist Notation
-    [[`nil`]            [An empty `cons`]]
-    [[`C`]              [A `cons` type]]
-    [[`l`, `l2`]        [Instances of `cons`]]
-    [[`car`]            [An arbitrary data]]
-    [[`cdr`]            [Another `cons` list]]
-    [[`s`]              [A __forward_sequence__]]
-    [[`N`]              [An __mpl_integral_constant__]]
-]
-
-[heading Expression Semantics]
-
-Semantics of an expression is defined only where it differs from, or is not
-defined in __forward_sequence__.
-
-[table
-    [[Expression]           [Semantics]]
-    [[`nil()`]              [Creates an empty list.]]
-    [[`C()`]                [Creates a cons with default constructed elements.]]
-    [[`C(car)`]             [Creates a cons with `car` head and default constructed tail.]]
-    [[`C(car, cdr)`]        [Creates a cons with `car` head and `cdr` tail.]]
-    [[`C(s)`]               [Copy constructs a cons from a __forward_sequence__, `s`.]]
-    [[`l = s`]              [Assigns to a cons, `l`, from a __forward_sequence__, `s`.]]
-    [[`__at__<N>(l)`]           [The Nth element from the beginning of the sequence; see __at__.]]
-]
-
-[blurb __note__ `__at__<N>(l)` is provided for convenience and compatibility
-with the original __tuple__ library, despite `cons` being a
-__forward_sequence__ only (`at` is supposed to be a
-__random_access_sequence__ requirement). The runtime complexity of __at__ is
-constant (see __recursive_inline__).]
-
-[heading Example]
-
-    cons<int, cons<float> > l(12, cons<float>(5.5f));
-    std::cout << __at_c__<0>(l) << std::endl;
-    std::cout << __at_c__<1>(l) << std::endl;
-
-[endsect]
-
-[section list]
-
-[heading Description]
-
-`list` is a __forward_sequence__ of heterogenous typed data built on top of
-__cons__. It is more efficient than __vector__ when the target sequence is
-constructed piecemeal (a data at a time). The runtime cost of access to
-each element is peculiarly constant (see __recursive_inline__).
-
-[heading Header]
-
-    #include <boost/fusion/sequence/container/list.hpp>
-    #include <boost/fusion/sequence/container/list/list_forward.hpp>
-
-[heading Synopsis]
-
-    template <
-        typename T0 = __unspecified__
-      , typename T1 = __unspecified__
-      , typename T2 = __unspecified__
-        ...
-      , typename TN = __unspecified__
-    >
-    struct list;
-
-The variadic class interface accepts `0` to `FUSION_MAX_LIST_SIZE`
-elements, where `FUSION_MAX_LIST_SIZE` is a user definable predefined
-maximum that defaults to `10`. Example:
-
-    list<int, char, double>
-
-You may define the preprocessor constant `FUSION_MAX_LIST_SIZE` before
-including any Fusion header to change the default. Example:
-
-    #define FUSION_MAX_LIST_SIZE 20
-
-[heading Template parameters]
-
-[table
-    [[Parameter]            [Description]               [Default]]
-    [[`T0`...`TN`]          [Element types]             [['unspecified-type]]]
-]
-
-[heading Model of]
-
-* __forward_sequence__
-
-[variablelist Notation
-    [[`L`]              [A `list` type]]
-    [[`l`]              [An instance of `list`]]
-    [[`e0`...`en`]      [Heterogeneous values]]
-    [[`s`]              [A __forward_sequence__]]
-    [[`N`]              [An __mpl_integral_constant__]]
-]
-
-[heading Expression Semantics]
-
-Semantics of an expression is defined only where it differs from, or is not
-defined in __forward_sequence__.
-
-[table
-    [[Expression]           [Semantics]]
-    [[`L()`]                [Creates a list with default constructed elements.]]
-    [[`L(e0, e1,... en)`]   [Creates a list with elements `e0`...`en`.]]
-    [[`L(s)`]               [Copy constructs a list from a __forward_sequence__, `s`.]]
-    [[`l = s`]              [Assigns to a list, `l`, from a __forward_sequence__, `s`.]]
-    [[`__at__<N>(l)`]           [The Nth element from the beginning of the sequence; see __at__.]]
-]
-
-[blurb __note__ `__at__<n>(l)` is provided for convenience and compatibility
-with the original __tuple__ library, despite `list` being a
-__forward_sequence__ only (__at__ is supposed to be a
-__random_access_sequence__ requirement). The runtime complexity of __at__ is
-constant (see __recursive_inline__).]
-
-[heading Example]
-
-    list<int, float> l(12, 5.5f);
-    std::cout << __at_c__<0>(l) << std::endl;
-    std::cout << __at_c__<1>(l) << std::endl;
-
-[endsect]
-
-[section set]
-
-[heading Description]
-
-set is an __associative_sequence__ of heteregenous typed data elements.
-Type identity is used to impose an equivalence relation on keys. The
-element's type is its key. A set may contain at most one element for each
-key. Membership testing and element key lookup has constant runtime
-complexity (see __overloaded_functions__).
-
-[heading Header]
-
-    #include <boost/fusion/sequence/container/set.hpp>
-
-[heading Synopsis]
-
-    template <
-        typename T0 = __unspecified__
-      , typename T1 = __unspecified__
-      , typename T2 = __unspecified__
-        ...
-      , typename TN = __unspecified__
-    >
-    struct set;
-
-The variadic class interface accepts `0` to `FUSION_MAX_SET_SIZE` elements,
-where `FUSION_MAX_SET_SIZE` is a user definable predefined maximum that
-defaults to `10`. Example:
-
-    set<int, char, double>
-
-You may define the preprocessor constant `FUSION_MAX_SET_SIZE` before
-including any Fusion header to change the default. Example:
-
-    #define FUSION_MAX_SET_SIZE 20
-
-[heading Template parameters]
-
-[table
-    [[Parameter]            [Description]               [Default]]
-    [[`T0`...`TN`]          [Element types]             [['unspecified-type]]]
-]
-
-[heading Model of]
-
-* __associative_sequence__
-* __forward_sequence__
-
-[variablelist Notation
-    [[`S`]              [A `set` type]]
-    [[`s`]              [An instance of `set`]]
-    [[`e0`...`en`]      [Heterogeneous values]]
-    [[`fs`]             [A __forward_sequence__]]
-]
-
-[heading Expression Semantics]
-
-Semantics of an expression is defined only where it differs from, or is not
-defined in __random_access_sequence__ and __associative_sequence__.
-
-[table
-    [[Expression]           [Semantics]]
-    [[`S()`]                [Creates a set with default constructed elements.]]
-    [[`S(e0, e1,... en)`]   [Creates a set with elements `e0`...`en`.]]
-    [[`S(fs)`]              [Copy constructs a set from a __forward_sequence__ `fs`.]]
-    [[`s = fs`]             [Assigns to a set, `s`, from a __forward_sequence__ `fs`.]]
-]
-
-[heading Example]
-
-    typedef set<int, float> S;
-    S s(12, 5.5f);
-    std::cout << __at_key__<int>(s) << std::endl;
-    std::cout << __at_key__<float>(s) << std::endl;
-    std::cout << __result_of_has_key__<S, double>::value << std::endl;
-
-[endsect]
-
-[section map]
-
-[heading Description]
-
-map is an __associative_sequence__ of heteregenous typed data elements.
-Each element is a key/data pair (see __fusion_pair__) where the key has no
-data (type only). Type identity is used to impose an equivalence relation
-on keys. A map may contain at most one element for each key. Membership
-testing and element key lookup has constant runtime complexity (see
-__overloaded_functions__).
-
-[heading Header]
-
-    #include <boost/fusion/sequence/container/map.hpp>
-
-[heading Synopsis]
-
-    template <
-        typename T0 = __unspecified__
-      , typename T1 = __unspecified__
-      , typename T2 = __unspecified__
-        ...
-      , typename TN = __unspecified__
-    >
-    struct map;
-
-The variadic class interface accepts `0` to `FUSION_MAX_MAP_SIZE` elements,
-where `FUSION_MAX_MAP_SIZE` is a user definable predefined maximum that
-defaults to `10`. Example:
-
-    map<__pair__<int, char>, __pair__<char, char>, __pair__<double, char> >
-
-You may define the preprocessor constant `FUSION_MAX_MAP_SIZE` before
-including any Fusion header to change the default. Example:
-
-    #define FUSION_MAX_MAP_SIZE 20
-
-[heading Template parameters]
-
-[table
-    [[Parameter]            [Description]               [Default]]
-    [[`T0`...`TN`]          [Element types]             [['unspecified-type]]]
-]
-
-[heading Model of]
-
-* __associative_sequence__
-* __forward_sequence__
-
-[variablelist Notation
-    [[`M`]              [A `map` type]]
-    [[`m`]              [An instance of `map`]]
-    [[`e0`...`en`]      [Heterogeneous key/value pairs (see __fusion_pair__)]]
-    [[`s`]              [A __forward_sequence__]]
-]
-
-[heading Expression Semantics]
-
-Semantics of an expression is defined only where it differs from, or is not
-defined in __random_access_sequence__ and __associative_sequence__.
-
-[table
-    [[Expression]           [Semantics]]
-    [[`M()`]                [Creates a map with default constructed elements.]]
-    [[`M(e0, e1,... en)`]   [Creates a map with element pairs `e0`...`en`.]]
-    [[`M(s)`]               [Copy constructs a map from a __forward_sequence__ `s`.]]
-    [[`m = s`]              [Assigns to a map, `m`, from a __forward_sequence__ `s`.]]
-]
-
-[heading Example]
-
-    typedef map<
-        __pair__<int, char>
-      , __pair__<double, std::string> >
-    map_type;
-
-    map_type m(
-        __fusion_make_pair__<int>('X')
-      , __fusion_make_pair__<double>("Men"));
-
-    std::cout << __at_key__<int>(m) << std::endl;
-    std::cout << __at_key__<double>(m) << std::endl;
-
-[endsect]
-
-[endsect]
-
-[section Views]
-
-Views are sequences that do not actually contain data, but instead impart
-an alternative presentation over the data from one or more underlying
-sequences. Views are proxies. They provide an efficient yet purely
-functional way to work on potentially expensive sequence operations. Views
-are inherently lazy. Their elements are only computed on demand only when
-the elements of the underlying sequence(s) are actually accessed. Views'
-lazy nature make them very cheap to copy and be passed around by value.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/view.hpp>
-
-[section single_view]
-
-`single_view` is a view into a value as a single element sequence.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/view/single_view.hpp>
-
-[heading Synopsis]
-
-    template <typename T>
-    struct single_view;
-
-[heading Template parameters]
-
-[table
-    [[Parameter]            [Description]               [Default]]
-    [[`T`]                  [Any type]                  []]
-]
-
-[heading Model of]
-
-* __forward_sequence__
-
-[variablelist Notation
-    [[`S`]              [A `single_view` type]]
-    [[`s`, `s2`]        [Instances of `single_view`]]
-    [[`x`]              [An instance of `T`]]
-]
-
-[heading Expression Semantics]
-
-Semantics of an expression is defined only where it differs from, or is not
-defined in __forward_sequence__.
-
-[table
-    [[Expression]           [Semantics]]
-    [[`S(x)`]               [Creates a `single_view` from `x`.]]
-    [[`S(s)`]               [Copy constructs a `single_view` from another `single_view`, `s`.]]
-    [[`s = s2`]             [Assigns to a `single_view`, `s`, from another `single_view`, `s2`.]]
-]
-
-[heading Example]
-
-    single_view<int> view(3);
-    std::cout << view << std::endl;
-
-[endsect]
-
-[section filter_view]
-
-[heading Description]
-
-`filter_view` is a view into a subset of its underlying sequence's elements
-satisfying a given predicate (an __mpl__ metafunction). The `filter_view`
-presents only those elements for which its predicate evaluates to
-`mpl::true_`.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/view/filter_view.hpp>
-
-[heading Synopsis]
-
-    template <typename Sequence, typename Pred>
-    struct filter_view;
-
-[heading Template parameters]
-
-[table
-    [[Parameter]            [Description]               [Default]]
-    [[`Sequence`]           [A __forward_sequence__]    []]
-    [[`Pred`]               [Unary Metafunction
-                             returning an `mpl::bool_`] []]
-]
-
-[heading Model of]
-
-* __forward_sequence__
-
-[variablelist Notation
-    [[`F`]              [A `filter_view` type]]
-    [[`f`, `f2`]        [Instances of `filter_view`]]
-    [[`s`]              [A __forward_sequence__]]
-]
-
-[heading Expression Semantics]
-
-Semantics of an expression is defined only where it differs from, or is not
-defined in __forward_sequence__.
-
-[table
-    [[Expression]           [Semantics]]
-    [[`F(s)`]               [Creates a `filter_view` given a sequence, `s`.]]
-    [[`F(f)`]               [Copy constructs a `filter_view` from another `filter_view`, `f`.]]
-    [[`f = f2`]             [Assigns to a `filter_view`, `f`, from another `filter_view`, `f2`.]]
-]
-
-[heading Example]
-
-    using boost::mpl::_;
-    using boost::mpl::not_;
-    using boost::is_class;
-
-    typedef __vector__<std::string, char, long, bool, double> vector_type;
-
-    vector_type v("a-string", '@', 987654, true, 6.6);
-    filter_view<vector_type const, not_<is_class<_> > > view(v);
-    std::cout << view << std::endl;
-
-[endsect]
-
-[section iterator_range]
-
-[heading Description]
-
-`iterator_range` presents a sub-range of its underlying sequence delimited
-by a pair of iterators.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/view/iterator_range.hpp>
-
-[heading Synopsis]
-
-    template <typename First, typename Last>
-    struct iterator_range;
-
-[heading Template parameters]
-
-[table
-    [[Parameter]            [Description]               [Default]]
-    [[`First`]              [A fusion __iterator__]     []]
-    [[`Last`]               [A fusion __iterator__]     []]
-]
-
-[heading Model of]
-
-* __forward_sequence__, __bidirectional_sequence__ or
-__random_access_sequence__ depending on the traversal characteristics (see
-__traversal_concept__) of its underlying sequence.
-
-[variablelist Notation
-    [[`IR`]             [An `iterator_range` type]]
-    [[`f`]              [An instance of `First`]]
-    [[`l`]              [An instance of `Last`]]
-    [[`ir`, `ir2`]      [Instances of `iterator_range`]]
-]
-
-[heading Expression Semantics]
-
-Semantics of an expression is defined only where it differs from, or is not
-defined in __forward_sequence__.
-
-[table
-    [[Expression]           [Semantics]]
-    [[`IR(f, l)`]           [Creates an `iterator_range` given iterators, `f` and `l`.]]
-    [[`IR(ir)`]             [Copy constructs an `iterator_range` from another `iterator_range`, `ir`.]]
-    [[`ir = ir2`]           [Assigns to a `iterator_range`, `ir`, from another `iterator_range`, `ir2`.]]
-]
-
-[heading Example]
-
-    char const* s = "Ruby";
-    typedef __vector__<int, char, double, char const*> vector_type;
-    vector_type vec(1, 'x', 3.3, s);
-
-    typedef __result_of_begin__<vector_type>::type A;
-    typedef __result_of_end__<vector_type>::type B;
-    typedef __result_of_next__<A>::type C;
-    typedef __result_of_prior__<B>::type D;
-
-    C c(vec);
-    D d(vec);
-
-    iterator_range<C, D> range(c, d);
-    std::cout << range << std::endl;
-
-[endsect]
-
-[section joint_view]
-
-[heading Description]
-
-`joint_view` presents a view which is a concatenation of two sequences.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/view/joint_view.hpp>
-
-[heading Synopsis]
-
-    template <typename Sequence1, typename Sequence2>
-    struct joint_view;
-
-[heading Template parameters]
-
-[table
-    [[Parameter]            [Description]                   [Default]]
-    [[`Sequence1`]          [A __forward_sequence__]        []]
-    [[`Sequence2`]          [A __forward_sequence__]        []]
-]
-
-[heading Model of]
-
-* __forward_sequence__
-
-[variablelist Notation
-    [[`JV`]             [A `joint_view` type]]
-    [[`s1`]             [An instance of `Sequence1`]]
-    [[`s2`]             [An instance of `Sequence2`]]
-    [[`jv`, `jv2`]      [Instances of `joint_view`]]
-]
-
-[heading Expression Semantics]
-
-Semantics of an expression is defined only where it differs from, or is not
-defined in __forward_sequence__.
-
-[table
-    [[Expression]           [Semantics]]
-    [[`JV(s1, s2)`]         [Creates a `joint_view` given sequences, `s1` and `s2`.]]
-    [[`JV(jv)`]             [Copy constructs a `joint_view` from another `joint_view`, `jv`.]]
-    [[`jv = jv2`]           [Assigns to a `joint_view`, `jv`, from another `joint_view`, `jv2`.]]
-]
-
-[heading Example]
-
-    __vector__<int, char> v1(3, 'x');
-    __vector__<std::string, int> v2("hello", 123);
-    joint_view<
-        __vector__<int, char>
-      , __vector__<std::string, int>
-    > view(v1, v2);
-    std::cout << view << std::endl;
-
-[endsect]
-
-[section zip_view]
-
-[heading Description]
-
-`zip_view` presents a view which iterates over a collection of __sequence__s in parallel. A `zip_view`
-is constructed from a __sequence__ of references to the component __sequence__s.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/view/zip_view.hpp>
-
-[heading Synopsis]
-
-    template <typename Sequences>
-    struct zip_view;
-
-[heading Template parameters]
-
-[table
-    [[Parameter]            [Description]                   [Default]]
-    [[`Sequences`]          [A __forward_sequence__ of references to other Fusion __sequence__s]        []]
-]
-
-[heading Model of]
-
-* __forward_sequence__, __bidirectional_sequence__ or
-__random_access_sequence__ depending on the traversal characteristics (see
-__traversal_concept__) of its underlying sequence.
-
-[variablelist Notation
-    [[`ZV`]             [A `joint_view` type]]
-    [[`s`]             [An instance of `Sequences`]]
-    [[`zv1`, `zv2`]             [Instances of `ZV`]]
-]
-
-[heading Expression Semantics]
-
-Semantics of an expression is defined only where it differs from, or is not
-defined in __forward_sequence__.
-
-[table
-    [[Expression]           [Semantics]]
-    [[`ZV(s)`]              [Creates a `zip_view` given a sequence of references to the component __sequence__s.]]
-    [[`ZV(zv1)`]             [Copy constructs a `zip_view` from another `zip_view`, `zv`.]]
-    [[`zv1 = zv2`]           [Assigns to a `zip_view`, `zv`, from another `zip_view`, `zv2`.]]
-]
-
-[heading Example]
-    typedef __vector__<int,int> vec1;
-    typedef __vector__<char,char> vec2;
-    vec1 v1(1,2);
-    vec2 v2('a','b');
-    typedef __vector__<vec1&, vec2&> sequences;
-    std::cout << zip_view<sequences>(sequences(v1, v2)) << std::endl; // ((1 a) (2 b))
-
-[endsect]
-
-[section transform_view]
-
-The unary version of `transform_view` presents a view of its underlying
-sequence given a unary function object or function pointer. The binary
-version of `transform_view` presents a view of 2 underlying sequences,
-given a binary function object or function pointer. The `transform_view` 
-inherits the traversal characteristics (see __traversal_concept__)  of 
-its underlying sequence or sequences.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/view/transform_view.hpp>
-
-[heading Synopsis]
-
-[*Unary Version]
-
-    template <typename Sequence, typename F1>
-    struct transform_view;
-
-[*Binary Version]
-
-    template <typename Sequence1, typename Sequence2, typename F2>
-    struct transform_view;
-
-[heading Template parameters]
-
-[table
-    [[Parameter]            [Description]                           [Default]]
-    [[`Sequence`]           [A __forward_sequence__]                []]
-    [[`Sequence1`]          [A __forward_sequence__]                []]
-    [[`Sequence2`]          [A __forward_sequence__]                []]
-    [[`F1`]                  [A unary function object or function pointer. `__boost_result_of_call__<F1(E)>::type` is the return type of an instance of `F1` when called with a value of each element type `E` in the input sequence.]                   []]
-    [[`F2`]                  [A binary function object or function pointer. `__boost_result_of_call__<F2(E1, E2)>::type` is the return type of an instance of `F2` when called with a value of each corresponding pair of element type `E1` and `E2` in the input sequences.]                   []]
-]
-
-[heading Model of]
-
-* __forward_sequence__, __bidirectional_sequence__ or
-__random_access_sequence__ depending on the traversal characteristics (see
-__traversal_concept__) of its underlying sequence.
-
-[variablelist Notation
-    [[`TV`]             [A `transform_view` type]]
-    [[`BTV`]            [A binary `transform_view` type]]
-    [[`UTV`]            [A unary `transform_view` type]]
-    [[`f1`]              [An instance of `F1`]]
-    [[`f2`]              [An instance of `F2`]]
-    [[`s`]              [An instance of `Sequence`]]
-    [[`s1`]             [An instance of `Sequence1`]]
-    [[`s2`]             [An instance of `Sequence2`]]
-    [[`tv`, `tv2`]      [Instances of `transform_view`]]
-]
-
-[heading Expression Semantics]
-
-Semantics of an expression is defined only where it differs from, or is not
-defined in __forward_sequence__, __bidirectional_sequence__ or
-__random_access_sequence__ depending on the traversal characteristics (see
-__traversal_concept__) of its underlying sequence or sequences.
-
-[table
-    [[Expression]           [Semantics]]
-    [[`UTV(s, f1)`]          [Creates a unary `transform_view` given sequence,
-                             `s` and unary function object or function pointer, `f1`.]]
-    [[`BTV(s1, s2, f2)`]     [Creates a binary `transform_view` given sequences, `s1` and `s2`
-                             and binary function object or function pointer, `f2`.]]
-    [[`TV(tv)`]             [Copy constructs a `transform_view` from another `transform_view`, `tv`.]]
-    [[`tv = tv2`]           [Assigns to a `transform_view`, `tv`, from another `transform_view`, `tv2`.]]
-]
-
-[heading Example]
-
-    struct square
-    {
-        template<typename Sig>
-        struct result;
-
-        template<typename U>
-        struct result<square(U)>
-        : remove_reference<U>
-        {};
-
-        template <typename T>
-        T operator()(T x) const
-        {
-            return x * x;
-        }
-    };
-
-    typedef __vector__<int, short, double> vector_type;
-    vector_type vec(2, 5, 3.3);
-
-    transform_view<vector_type, square> transform(vec, square());
-    std::cout << transform << std::endl;
-
-[endsect]
-
-[section reverse_view]
-
-`reverse_view` presents a reversed view of underlying sequence. The first
-element will be its last and the last element will be its first.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/view/reverse_view.hpp>
-
-[heading Synopsis]
-
-    template <typename Sequence>
-    struct reverse_view;
-
-[heading Template parameters]
-
-[table
-    [[Parameter]            [Description]                           [Default]]
-    [[`Sequence`]           [A __bidirectional_sequence__]          []]
-]
-
-[heading Model of]
-
-* __bidirectional_sequence__
-
-[variablelist Notation
-    [[`RV`]             [A `reverse_view` type]]
-    [[`s`]              [An instance of `Sequence`]]
-    [[`rv`, `rv2`]      [Instances of `reverse_view`]]
-]
-
-[heading Expression Semantics]
-
-Semantics of an expression is defined only where it differs from, or is not
-defined in __bidirectional_sequence__.
-
-[table
-    [[Expression]           [Semantics]]
-    [[`RV(s)`]              [Creates a unary `reverse_view` given sequence, `s`.]]
-    [[`RV(rv)`]             [Copy constructs a `reverse_view` from another `reverse_view`, `rv`.]]
-    [[`rv = rv2`]           [Assigns to a `reverse_view`, `rv`, from another `reverse_view`, `rv2`.]]
-]
-
-[heading Example]
-
-    typedef __vector__<int, short, double> vector_type;
-    vector_type vec(2, 5, 3.3);
-
-    reverse_view<vector_type> reverse(vec);
-    std::cout << reverse << std::endl;
-
-[endsect]
-
-[endsect]
-
-[section Adapted]
-
-Fusion provides a couple of adapters for other sequences such as
-`std::pair`, __mpl__ sequences, and `boost::array`. These adapters are
-written using Fusion's non-intrusive __extension__ mechanism. If you wish
-to use these sequences with fusion, simply include the necessary files and
-they will be regarded as first-class, fully conforming fusion sequences
-[footnote Fusion sequences may also be adapted as fully conforming __mpl__
-sequences (see __intrinsics__). That way, we can have 2-way adaptation to
-and from __mpl__ and Fusion].
-
-[heading Header]
-
-    #include <boost/fusion/sequence/adapted.hpp>
-
-[section std::pair]
-
-This module provides adapters for `std::pair`. Including the module header
-makes `std::pair` a fully conforming __random_access_sequence__.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/adapted/std_pair.hpp>
-
-[heading Model of]
-
-* __random_access_sequence__
-
-[heading Example]
-
-    std::pair<int, std::string> p(123, "Hola!!!");
-    std::cout << __at_c__<0>(p) << std::endl;
-    std::cout << __at_c__<1>(p) << std::endl;
-    std::cout << p << std::endl;
-
-[heading See also]
-
-__std_pair_doc__, __tr1_tuple_pair__
-
-[endsect]
-
-[section mpl sequence]
-
-This module provides adapters for __mpl__ sequences. Including the module
-header makes all __mpl__ sequences fully conforming fusion sequences.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/adapted/mpl.hpp>
-
-[heading Model of]
-
-* __forward_sequence__ (If the __mpl__ sequence is a forward sequence.)
-* __bidirectional_sequence__ (If the __mpl__ sequence is a bidirectional sequence.)
-* __random_access_sequence__ (If the __mpl__ sequence is a random access sequence.)
-
-[heading Example]
-
-    mpl::vector_c<int, 123, 456> vec_c;
-    fusion::vector2<int, long> v(vec_c);
-    std::cout << __at_c__<0>(v) << std::endl;
-    std::cout << __at_c__<1>(v) << std::endl;
-
-    v = mpl::vector_c<int, 456, 789>();
-    std::cout << __at_c__<0>(v) << std::endl;
-    std::cout << __at_c__<1>(v) << std::endl;
-
-[heading See also]
-
-__mpl__
-
-[endsect]
-
-[section boost::array]
-
-This module provides adapters for `boost::array`. Including the module
-header makes `boost::array` a fully conforming __random_access_sequence__.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/adapted/array.hpp>
-
-[heading Model of]
-
-* __random_access_sequence__
-
-[heading Example]
-
-    boost::array<int,3> arr = {{1,2,3}};
-
-    std::cout << *__begin__(arr) << std::endl;
-    std::cout << *__next__(__begin__(arr)) << std::endl;
-    std::cout << *__advance_c__<2>(__begin__(arr)) << std::endl;
-    std::cout << *__prior__(__end__(arr)) << std::endl;
-    std::cout << __at_c__<2>(arr) << std::endl;
-
-[heading See also]
-
-__boost_array_library__
-
-[endsect]
-
-[section boost::tuple]
-This module provides adapters for `boost::tuple`. Including the module
-header makes `boost::tuple` a fully conforming __forward_sequence__.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/adapted/boost_tuple.hpp>
-
-[heading Model of]
-
-* __forward_sequence__
-
-[heading Example]
-
-    boost::tuple<int,std::string> example_tuple(101, "hello");
-    std::cout << *boost::fusion::begin(example_tuple) << '\n';
-    std::cout << *boost::fusion::next(boost::fusion::begin(example_tuple)) << '\n';
-
-[heading See also]
-
-__boost_tuple_library__
-
-[endsect]
-
-[section boost::variant]
-This module provides adapters for `boost::variant`. Including the module
-header makes `boost::variant` a fully conforming __forward_sequence__.
-The variant acts as a sequence of the types that can be contained in the variant.
-Accessing types not currently stored int the variant will lead to the variant
-being populated with a default constructed value of that type.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/adapted/variant.hpp>
-
-[heading Model of]
-
-* __forward_sequence__
-
-[heading Example]
-
-    boost::variant<int,std::string> example_variant = 101;
-    std::cout << example_variant << '\n';
-    *boost::fusion::find<std::string>(example_variant) = "hello";
-    std::cout << example_variant << '\n';
-
-[heading See also]
-
-__boost_variant_library__
-
-[endsect]
-
-[endsect]
-
-[section Intrinsics]
-
-Intrinsics form the essential interface of every Fusion __sequence__. __stl__
-counterparts of these functions are usually implemented as member
-functions. Intrinsic functions, unlike __algorithms__, are not generic
-across the full __sequence__ repertoire. They need to be implemented for
-each Fusion __sequence__[footnote In practice, many of intrinsic functions
-have default implementations that will work in majority of cases].
-
-[heading Header]
-
-    #include <boost/fusion/sequence/intrinsic.hpp>
-
-[section Functions]
-
-[section begin]
-
-[heading Description]
-
-Returns an iterator pointing to the first element in the sequence.
-
-[heading Synopsis]
-
-    template <typename Sequence>
-    typename __result_of_begin__<Sequence>::type
-    begin(Sequence& seq);
-
-    template <typename Sequence>
-    typename __result_of_begin__<Sequence const>::type
-    begin(Sequence const& seq);
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]                   [Description]]
-    [[`seq`]        [Model of __forward_sequence__] [The sequence we wish to get an iterator from.]]
-]
-
-[heading Expression Semantics]
-
-    begin(seq);
-
-[*Return type]: __forward_iterator__ if `seq` is a __forward_sequence__
-else, __bidirectional_iterator__ if `seq` is a __bidirectional_sequence__
-else, __random_access_iterator__ if `seq` is a __random_access_sequence__.
-
-[*Semantics]: Returns an iterator pointing to the first element in the sequence.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/intrinsic/begin.hpp>
-
-[heading Example]
-
-    __vector__<int, int, int> v(1, 2, 3);
-    assert(__deref__(begin(v)) == 1);
-
-[endsect]
-
-[section end]
-
-[heading Description]
-
-Returns an iterator pointing to one element past the end of the sequence.
-
-[heading Synopsis]
-
-    template <typename Sequence>
-    typename __result_of_end__<Sequence>::type
-    end(Sequence& seq);
-
-    template <typename Sequence>
-    typename __result_of_end__<Sequence const>::type
-    end(Sequence const& seq);
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]                   [Description]]
-    [[`seq`]        [Model of __forward_sequence__] [The sequence we wish to get an iterator from.]]
-]
-
-[heading Expression Semantics]
-
-    end(seq);
-
-[*Return type]: __forward_iterator__ if `seq` is a __forward_sequence__
-else, __bidirectional_iterator__ if `seq` is a __bidirectional_sequence__
-else, __random_access_iterator__ if `seq` is a __random_access_sequence__.
-
-[*Semantics]: Returns an iterator pointing to one element past the end of
-the sequence.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/intrinsic/end.hpp>
-
-[heading Example]
-
-    __vector__<int, int, int> v(1, 2, 3);
-    assert(__deref__(__prior__(end(v))) == 3);
-
-[endsect]
-
-[section empty]
-
-[heading Description]
-
-Returns a type convertible to `bool` that evaluates to `true` if the
-sequence is empty, else, evaluates to `false`.
-
-[heading Synopsis]
-
-    template <typename Sequence>
-    typename __result_of_empty__<Sequence>::type
-    empty(Sequence const& seq);
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]                   [Description]]
-    [[`seq`]        [Model of __forward_sequence__] [The sequence we wish to investigate.]]
-]
-
-[heading Expression Semantics]
-
-    empty(seq);
-
-[*Return type]: Convertible to `bool`.
-
-[*Semantics]: Evaluates to `true` if the sequence is empty, else, evaluates
-to `false`.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/intrinsic/empty.hpp>
-
-[heading Example]
-
-    __vector__<int, int, int> v(1, 2, 3);
-    assert(empty(v) == false);
-
-[endsect]
-
-[section front]
-
-[heading Description]
-
-Returns the first element in the sequence.
-
-[heading Synopsis]
-
-    template <typename Sequence>
-    typename __result_of_front__<Sequence>::type
-    front(Sequence& seq);
-
-    template <typename Sequence>
-    typename __result_of_front__<Sequence const>::type
-    front(Sequence const& seq);
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]                   [Description]]
-    [[`seq`]        [Model of __forward_sequence__] [The sequence we wish to investigate.]]
-]
-
-[heading Expression Semantics]
-
-    front(seq);
-
-[*Return type]: Returns a reference to the first element in the sequence
-`seq` if `seq` is mutable and `e = o`, where `e` is the first element in
-the sequence, is a valid expression. Else, returns a type convertable to
-the first element in the sequence.
-
-[*Precondition]: `__empty__(seq) == false`
-
-[*Semantics]: Returns the first element in the sequence.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/intrinsic/front.hpp>
-
-[heading Example]
-
-    __vector__<int, int, int> v(1, 2, 3);
-    assert(front(v) == 1);
-
-[endsect]
-
-[section back]
-
-[heading Description]
-
-Returns the last element in the sequence.
-
-[heading Synopsis]
-
-    template <typename Sequence>
-    typename __result_of_back__<Sequence>::type
-    back(Sequence& seq);
-
-    template <typename Sequence>
-    typename __result_of_back__<Sequence const>::type
-    back(Sequence const& seq);
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]                           [Description]]
-    [[`seq`]        [Model of __bidirectional_sequence__]   [The sequence we wish to investigate.]]
-]
-
-[heading Expression Semantics]
-
-    back(seq);
-
-[*Return type]: Returns a reference to the last element in the sequence
-`seq` if `seq` is mutable and `e = o`, where `e` is the last element in the
-sequence, is a valid expression. Else, returns a type convertable to the
-last element in the sequence.
-
-[*Precondition]: `__empty__(seq) == false`
-
-[*Semantics]: Returns the last element in the sequence.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/intrinsic/back.hpp>
-
-[heading Example]
-
-    __vector__<int, int, int> v(1, 2, 3);
-    assert(back(v) == 3);
-
-[endsect]
-
-[section size]
-
-[heading Description]
-
-Returns a type convertible to `int` that evaluates the number of elements
-in the sequence.
-
-[heading Synopsis]
-
-    template <typename Sequence>
-    typename __result_of_size__<Sequence>::type
-    size(Sequence const& seq);
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]                   [Description]]
-    [[`seq`]        [Model of __forward_sequence__] [The sequence we wish to investigate.]]
-]
-
-[heading Expression Semantics]
-
-    size(seq);
-
-[*Return type]: Convertible to `int`.
-
-[*Semantics]: Returns the number of elements in the sequence.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/intrinsic/size.hpp>
-
-[heading Example]
-
-    __vector__<int, int, int> v(1, 2, 3);
-    assert(size(v) == 3);
-
-[endsect]
-
-[section at]
-
-[heading Description]
-
-Returns the N-th element from the beginning of the sequence.
-
-[heading Synopsis]
-
-    template <typename N, typename Sequence>
-    typename __result_of_at__<Sequence, N>::type
-    at(Sequence& seq);
-
-    template <typename N, typename Sequence>
-    typename __result_of_at__<Sequence const, N>::type
-    at(Sequence const& seq);
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]                           [Description]]
-    [[`seq`]        [Model of __random_access_sequence__]   [The sequence we wish to investigate.]]
-    [[`N`]          [An __mpl_integral_constant__]          [An index from the beginning of the
-                                                             sequence.]]
-]
-
-[heading Expression Semantics]
-
-    at<N>(seq);
-
-[*Return type]: Returns a reference to the N-th element from the beginning
-of the sequence `seq` if `seq` is mutable and `e = o`, where `e` is the N-th
-element from the beginning of the sequence, is a valid expression. Else,
-returns a type convertable to the N-th element from the beginning of the
-sequence.
-
-[*Precondition]: `0 <= N::value < __size__(s)`
-
-[*Semantics]: Equivalent to
-
-    __deref__(__advance__<N>(__begin__(s)))
-
-[heading Header]
-
-    #include <boost/fusion/sequence/intrinsic/at.hpp>
-
-[heading Example]
-
-    __vector__<int, int, int> v(1, 2, 3);
-    assert(at<mpl::int_<1> >(v) == 2);
-
-[endsect]
-
-[section at_c]
-
-[heading Description]
-
-Returns the N-th element from the beginning of the sequence.
-
-[heading Synopsis]
-
-    template <int N, typename Sequence>
-    typename __result_of_at_c__<Sequence, N>::type
-    at_c(Sequence& seq);
-
-    template <int N, typename Sequence>
-    typename __result_of_at_c__<Sequence const, N>::type
-    at_c(Sequence const& seq);
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]                           [Description]]
-    [[`seq`]        [Model of __random_access_sequence__]   [The sequence we wish to investigate.]]
-    [[`N`]          [An integral constant]                  [An index from the beginning of the
-                                                             sequence.]]
-]
-
-[heading Expression Semantics]
-
-    at_c<N>(seq);
-
-[*Return type]: Returns a reference to the N-th element from the beginning
-of the sequence `seq` if `seq` is mutable and `e = o`, where `e` is the N-th
-element from the beginning of the sequence, is a valid expression. Else,
-returns a type convertable to the N-th element from the beginning of the
-sequence.
-
-[*Precondition]: `0 <= N < __size__(s)`
-
-[*Semantics]: Equivalent to
-
-    __deref__(__advance__<N>(__begin__(s)))
-
-[heading Header]
-
-    #include <boost/fusion/sequence/intrinsic/at_c.hpp>
-
-[heading Example]
-
-    __vector__<int, int, int> v(1, 2, 3);
-    assert(at_c<1>(v) == 2);
-
-[endsect]
-
-[section has_key]
-
-[heading Description]
-
-Returns a type convertible to `bool` that evaluates to `true` if the
-sequence contains an element associated with a Key, else, evaluates to
-`false`.
-
-[heading Synopsis]
-
-    template <typename Key, typename Sequence>
-    typename __result_of_has_key__<Sequence, Key>::type
-    has_key(Sequence const& seq);
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]                       [Description]]
-    [[`seq`]        [Model of __associative_sequence__] [The sequence we wish to investigate.]]
-    [[`Key`]        [Any type]                          [The queried key.]]
-]
-
-[heading Expression Semantics]
-
-    has_key<Key>(seq);
-
-[*Return type]: Convertible to `bool`.
-
-[*Semantics]: Evaluates to `true` if the sequence contains an element
-associated with Key, else, evaluates to `false`.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/intrinsic/has_key.hpp>
-
-[heading Example]
-
-    __set__<int, char, bool> s(1, 'x', true);
-    assert(has_key<char>(s) == true);
-
-[endsect]
-
-[section at_key]
-
-[heading Description]
-
-Returns the element associated with a Key from the sequence.
-
-[heading Synopsis]
-
-    template <typename Key, typename Sequence>
-    typename __result_of_at_key__<Sequence, Key>::type
-    at_key(Sequence& seq);
-
-    template <typename Key, typename Sequence>
-    typename __result_of_at_key__<Sequence const, Key>::type
-    at_key(Sequence const& seq);
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]                           [Description]]
-    [[`seq`]        [Model of __associative_sequence__]     [The sequence we wish to investigate.]]
-    [[`Key`]        [Any type]                              [The queried key.]]
-]
-
-[heading Expression Semantics]
-
-    at_key<Key>(seq);
-
-[*Return type]: Returns a reference to the element associated with Key from
-the sequence `seq` if `seq` is mutable and `e = o`, where `e` is the
-element associated with Key, is a valid expression. Else, returns a type
-convertable to the element associated with Key.
-
-[*Precondition]: `has_key<Key>(seq) == true`
-
-[*Semantics]: Returns the element associated with Key.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/intrinsic/at_key.hpp>
-
-[heading Example]
-
-    __set__<int, char, bool> s(1, 'x', true);
-    assert(at_key<char>(s) == 'x');
-
-[endsect]
-
-[section swap]
-
-[heading Description]
-
-Performs an element by element swap of the elements in 2 sequences.
-
-[heading Synopsis]
-    template<typename Seq1, typename Seq2>
-    void swap(Seq1& seq1, Seq2& seq2);
-
-[heading Parameters]
-
-[table
-    [[Parameters]    [Requirement]                           [Description]]
-    [[`seq1`, `seq2`]        [Models of __forward_sequence__][The sequences whos elements we wish to swap.]]
-]
-
-[heading Expression Semantics]
-
-    swap(seq1, seq2);
-
-[*Return type]: `void`
-
-[*Precondition]: `__size__(seq1) == __size__(seq2)`
-
-[*Semantics]: Calls `swap(a1, b1)` for corresponding elements in `seq1` and `seq2`.
-
-[heading Header]
-    #include <boost/fusion/sequence/intrinsic/swap.hpp>
-
-[heading Example]
-    __vector__<int, std::string> v1(1, "hello"), v2(2, "world");
-    swap(v1, v2);
-    assert(v1 == __make_vector__(2, "world"));
-    assert(v2 == __make_vector__(1, "hello"));
-
-[endsect]
-
-[endsect]
-
-[section Metafunctions]
-
-[section begin]
-
-[heading Description]
-Returns the result type of __begin__.
-
-[heading Synopsis]
-    template<typename Seq>
-    struct begin
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`Seq`][A model of __forward_sequence__][Argument sequence]]
-]
-
-[heading Expression Semantics]
-    result_of::begin<Seq>::type
-
-[*Return type]: An iterator modelling the same traversal concept as `Seq`.
-
-[*Semantics]: Returns the type of an iterator to the first element of `Seq`.
-
-[heading Header]
-    #include <boost/fusion/sequence/intrinsic/begin.hpp>
-
-[heading Example]
-    typedef __vector__<int> vec;
-    typedef __result_of_begin__<vec>::type it;
-    BOOST_MPL_ASSERT((boost::is_same<__result_of_deref__<it>::type, int&>))
-
-[endsect]
-
-[section end]
-
-[heading Description]
-Returns the result type of __end__.
-
-[heading Synopsis]
-    template<typename Seq>
-    struct end
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`Seq`][A model of __forward_sequence__][Argument sequence]]
-]
-
-[heading Expression Semantics]
-    result_of::end<Seq>::type
-
-[*Return type]: A model of the same traversal concept as `Seq`.
-
-[*Semantics]: Returns the type of an iterator one past the end of `Seq`.
-
-[heading Header]
-    #include <boost/fusion/sequence/intrinsic/end.hpp>
-
-[heading Example]
-    typedef __vector__<int> vec;
-    typedef __result_of_prior__<__result_of_end__<vec>::type>::type first;
-    BOOST_MPL_ASSERT((__result_of_equal_to__<first, __result_of_begin__<vec>::type>))
-
-[endsect]
-
-[section empty]
-
-[heading Description]
-Returns the result type of __empty__.
-
-[heading Synopsis]
-    template<typename Seq>
-    struct empty
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`Seq`][A model of __forward_sequence__][Argument sequence]]
-]
-
-[heading Expression Semantics]
-    result_of::empty<Seq>::type
-
-[*Return type]: An __mpl_integral_constant__
-
-[*Semantics]: Returns `mpl::true_` if `Seq` has zero elements, `mpl::false_` otherwise.
-
-[heading Header]
-    #include <boost/fusion/sequence/intrinsic/empty.hpp>
-
-[heading Example]
-    typedef __vector__<> empty_vec;
-    typedef __vector__<int,float,char> vec;
-
-    BOOST_MPL_ASSERT((__result_of_empty__<empty_vec>));
-    BOOST_MPL_ASSERT_NOT((__result_of_empty__<vec>));
-
-[endsect]
-
-[section front]
-
-[heading Description]
-Returns the result type of __front__.
-
-[heading Synopsis]
-    template<typename Seq>
-    struct front
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`Seq`][A model of __forward_sequence__][Argument sequence]]
-]
-
-[heading Expression Semantics]
-    result_of::front<Seq>::type
-
-[*Return type]: Any type
-
-[*Semantics]: The type returned by dereferencing an iterator to the first element in `Seq`. Equivalent to `__result_of_deref__<__result_of_begin__<Seq>::type>::type`.
-
-[heading Header]
-    #include <boost/fusion/sequence/intrinsic/front.hpp>
-
-[heading Example]
-    typedef __vector__<int,char> vec;
-    BOOST_MPL_ASSERT((boost::is_same<__result_of_front__<vec>::type, int&>));
-
-[endsect]
-
-[section back]
-
-[heading Description]
-Returns the result type of __back__.
-
-[heading Synopsis]
-    template<typename Seq>
-    struct back
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`Seq`][A model of __forward_sequence__][Argument sequence]]
-]
-
-[heading Expression Semantics]
-    result_of::back<Seq>::type
-
-[*Return type]:  Any type
-
-[*Semantics]: The type returned by dereferencing an iterator to the last element in the sequence. Equivalent to `__result_of_deref__<__result_of_prior__<__result_of_end__<Seq>::type>::type>::type`.
-
-[heading Header]
-    #include <boost/fusion/sequence/intrinsic/back.hpp>
-
-[heading Example]
-    typedef __vector__<int,char> vec;
-    BOOST_MPL_ASSERT((boost::is_same<__result_of_back__<vec>::type, char&>));
-
-[endsect]
-
-[section size]
-
-[heading Description]
-Returns the result type of __size__.
-
-[heading Synopsis]
-    template<typename Seq>
-    struct size
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`Seq`][A model of __forward_sequence__][Argument sequence]]
-]
-
-[heading Expression Semantics]
-    result_of::size<Seq>::type
-
-[*Return type]: An __mpl_integral_constant__.
-
-[*Semantics]: Returns the number of elements in `Seq`.
-
-[heading Header]
-    #include <boost/fusion/sequence/intrinsic/size.hpp>
-
-[heading Example]
-    typedef __vector__<int,float,char> vec;
-    typedef __result_of_size__<vec>::type size_mpl_integral_constant;
-    BOOST_MPL_ASSERT_RELATION(size_mpl_integral_constant::value, ==, 3);
-
-[endsect]
-
-[section at]
-
-[heading Description]
-
-Returns the result type of __at__[footnote __result_of_at__ reflects the
-actual return type of the function __at__. __sequence__s typically return
-references to its elements via the __at__ function. If you want to get
-the actual element type, use __result_of_value_at__].
-
-[heading Synopsis]
-    template<
-        typename Seq,
-        typename N>
-    struct at
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`Seq`][A model of __forward_sequence__][Argument sequence]]
-    [[`N`][An __mpl_integral_constant__][Index of element]]
-]
-
-[heading Expression Semantics]
-    result_of::at<Seq, N>::type
-
-[*Return type]: Any type.
-
-[*Semantics]: Returns the result type of using __at__ to access the `N`th element of `Seq`.
-
-[heading Header]
-    #include <boost/fusion/sequence/intrinsic/at.hpp>
-
-[heading Example]
-    typedef __vector__<int,float,char> vec;
-    BOOST_MPL_ASSERT((boost::is_same<__result_of_at__<vec, boost::mpl::int_<1> >::type, float&>));
-
-[endsect]
-
-[section at_c]
-
-[heading Description]
-
-Returns the result type of __at_c__[footnote __result_of_at_c__ reflects
-the actual return type of the function __at_c__. __sequence__s typically
-return references to its elements via the __at_c__ function. If you want to
-get the actual element type, use __result_of_value_at_c__].
-
-[heading Synopsis]
-    template<
-        typename Seq,
-        int M>
-    struct at_c
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`Seq`][A model of __forward_sequence__][Argument sequence]]
-    [[`M`][Positive integer index][Index of element]]
-]
-
-[heading Expression Semantics]
-    result_of::at_c<Seq, M>::type
-
-[*Return type]: Any type
-
-[*Semantics]: Returns the result type of using __at_c__ to access the `M`th element of `Seq`.
-
-[heading Header]
-    #include <boost/fusion/sequence/intrinsic/at.hpp>
-
-[heading Example]
-    typedef __vector__<int,float,char> vec;
-    BOOST_MPL_ASSERT((boost::is_same<__result_of_at_c__<vec, 1>::type, float&>));
-
-[endsect]
-
-[section value_at]
-
-[heading Description]
-
-Returns the actual type at a given index from the __sequence__.
-
-[heading Synopsis]
-    template<
-        typename Seq,
-        typename N>
-    struct value_at
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`Seq`][A model of __forward_sequence__][Argument sequence]]
-    [[`N`][An __mpl_integral_constant__][Index of element]]
-]
-
-[heading Expression Semantics]
-    result_of::value_at<Seq, N>::type
-
-[*Return type]: Any type.
-
-[*Semantics]: Returns the actual type at the `N`th element of `Seq`.
-
-[heading Header]
-    #include <boost/fusion/sequence/intrinsic/value_at.hpp>
-
-[heading Example]
-    typedef __vector__<int,float,char> vec;
-    BOOST_MPL_ASSERT((boost::is_same<__result_of_value_at__<vec, boost::mpl::int_<1> >::type, float>));
-
-[endsect]
-
-[section value_at_c]
-
-[heading Description]
-
-Returns the actual type at a given index from the __sequence__.
-
-[heading Synopsis]
-    template<
-        typename Seq,
-        int M>
-    struct value_at_c
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`Seq`][A model of __forward_sequence__][Argument sequence]]
-    [[`M`][Positive integer index][Index of element]]
-]
-
-[heading Expression Semantics]
-    result_of::value_at_c<Seq, M>::type
-
-[*Return type]: Any type
-
-[*Semantics]: Returns the actual type at the `M`th element of `Seq`.
-
-[heading Header]
-    #include <boost/fusion/sequence/intrinsic/value_at.hpp>
-
-[heading Example]
-    typedef __vector__<int,float,char> vec;
-    BOOST_MPL_ASSERT((boost::is_same<__result_of_value_at_c__<vec, 1>::type, float>));
-
-[endsect]
-
-[section has_key]
-
-[heading Description]
-Returns the result type of __has_key__.
-
-[heading Synopsis]
-    template<
-        typename Seq,
-        typename Key>
-    struct has_key
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`Seq`][A model of __forward_sequence__][Argument sequence]]
-    [[`Key`][Any type][Key type]]
-]
-
-[heading Expression Semantics]
-    result_of::has_key<Seq, Key>::type
-
-[*Return type]: An __mpl_integral_constant__.
-
-[*Semantics]: Returns `mpl::true_` if `Seq` contains an element with key type `Key`, returns `mpl::false_` otherwise.
-
-[heading Header]
-    #include <boost/fusion/sequence/intrinsic/has_key.hpp>
-
-[heading Example]
-    typedef __map__<__pair__<int, char>, __pair__<char, char>, __pair__<double, char> > mymap;
-    BOOST_MPL_ASSERT((__result_of_has_key__<mymap, int>));
-    BOOST_MPL_ASSERT_NOT((__result_of_has_key__<mymap, void*>));
-
-[endsect]
-
-[section at_key]
-
-[heading Description]
-
-Returns the result type of __at_key__[footnote __result_of_at_key__
-reflects the actual return type of the function __at_key__. __sequence__s
-typically return references to its elements via the __at_key__ function. If
-you want to get the actual element type, use __result_of_value_at_key__].
-
-[heading Synopsis]
-    template<
-        typename Seq,
-        typename Key>
-    struct at_key
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`Seq`][A model of __forward_sequence__][Argument sequence]]
-    [[`Key`][Any type][Key type]]
-]
-
-[heading Expression Semantics]
-    result_of::at_key<Seq, Key>::type
-
-[*Return type]: Any type.
-
-[*Semantics]: Returns the result of using __at_key__ to access the element with key type `Key` in `Seq`.
-
-[heading Header]
-    #include <boost/fusion/sequence/intrinsic/at_key.hpp>
-
-[heading Example]
-    typedef __map__<__pair__<int, char>, __pair__<char, char>, __pair__<double, char> > mymap;
-    BOOST_MPL_ASSERT((boost::is_same<__result_of_at_key__<mymap, int>::type, char&>));
-
-[endsect]
-
-[section value_at_key]
-
-[heading Description]
-Returns the actual element type associated with a Key from the __sequence__.
-
-[heading Synopsis]
-    template<
-        typename Seq,
-        typename Key>
-    struct value_at_key
-    {
-        typedef __unspecified__ type;
-    };
-
-[table Parameters
-    [[Parameter]    [Requirement]   [Description]]
-    [[`Seq`][A model of __forward_sequence__][Argument sequence]]
-    [[`Key`][Any type][Key type]]
-]
-
-[heading Expression Semantics]
-    result_of::value_at_key<Seq, Key>::type
-
-[*Return type]: Any type.
-
-[*Semantics]: Returns the actual element type associated with key type
-`Key` in `Seq`.
-
-[heading Header]
-    #include <boost/fusion/sequence/intrinsic/value_at_key.hpp>
-
-[heading Example]
-    typedef __map__<__pair__<int, char>, __pair__<char, char>, __pair__<double, char> > mymap;
-    BOOST_MPL_ASSERT((boost::is_same<__result_of_at_key__<mymap, int>::type, char>));
-
-[endsect]
-
-[section swap]
-
-[heading Description]
-Returns the return type of swap.
-
-[heading Synopsis]
-    template<typename Seq1, typename Seq2>
-    struct swap
-    {
-        typedef void type;
-    };
-
-[table Parameters
-    [[Parameters]    [Requirement]   [Description]]
-    [[`Seq1`, `Seq2`][Models of __forward_sequence__][The sequences being swapped]]
-]
-
-[heading Expression Semantics]
-    result_of::swap<Seq1, Seq2>::type
-
-[*Return type]: `void`.
-
-[*Semantics]: Always returns `void`.
-
-[heading Header]
-    #include <boost/fusion/sequence/intrinsic/swap.hpp>
-
-[endsect]
-
-[endsect]
-
-[endsect]
-
-[section Generation]
-
-These are the functions that you can use to generate various forms of
-__containers__ from elemental values.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/generation.hpp>
-
-[section Functions]
-
-[section make_list]
-
-[heading Description]
-
-Create a __list__ from one or more values.
-
-[heading Synopsis]
-
-    template <typename T0, typename T1,... typename TN>
-    typename __result_of_make_list__<T0, T1,... TN>::type
-    make_list(T0 const& x0, T1 const& x1... TN const& xN);
-
-The variadic function accepts `0` to `FUSION_MAX_LIST_SIZE` elements, where
-`FUSION_MAX_LIST_SIZE` is a user definable predefined maximum that defaults
-to `10`. You may define the preprocessor constant `FUSION_MAX_LIST_SIZE`
-before including any Fusion header to change the default. Example:
-
-    #define FUSION_MAX_LIST_SIZE 20
-
-[heading Parameters]
-
-[table
-    [[Parameter]        [Requirement]                   [Description]]
-    [[`x0, x1,... xN`]  [Instances of `T0, T1,... TN`]  [The arguments to `make_list`]]
-]
-
-[heading Expression Semantics]
-
-    make_list(x0, x1,... xN);
-
-[*Return type]: __result_of_make_list__`<T0, T1,... TN>::type`
-
-[*Semantics]: Create a __list__ from `x0, x1,... xN`.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/generation/make_list.hpp>
-
-[heading Example]
-
-    make_list(123, "hello", 12.5)
-
-[heading See also]
-
-__note_boost_ref__
-
-[endsect]
-
-[section make_cons]
-
-[heading Description]
-
-Create a __cons__ from `car` (/head/) and optional `cdr` (/tail/).
-
-[heading Synopsis]
-
-    template <typename Car>
-    typename __result_of_make_cons__<Car>::type
-    make_cons(Car const& car);
-
-    template <typename Car, typename Cdr>
-    typename __result_of_make_cons__<Car, Cdr>::type
-    make_cons(Car const& car, Cdr const& cdr);
-
-[heading Parameters]
-
-[table
-    [[Parameter]        [Requirement]                   [Description]]
-    [[`car`]            [Instance of `Car`]             [The list's head]]
-    [[`cdr`]            [Instance of `Cdr`]             [The list's tail (optional)]]
-]
-
-[heading Expression Semantics]
-
-    make_cons(car, cdr);
-
-[*Return type]: __result_of_make_cons__`<Car, Cdr>::type` or
-__result_of_make_cons__`<Car>::type`
-
-[*Semantics]: Create a __cons__ from `car` (/head/) and optional `cdr` (/tail/).
-
-[heading Header]
-
-    #include <boost/fusion/sequence/generation/make_cons.hpp>
-
-[heading Example]
-
-    make_cons('x', make_cons(123))
-
-[heading See also]
-
-__note_boost_ref__
-
-[endsect]
-
-[section make_vector]
-
-[heading Description]
-
-Create a __vector__ from one or more values.
-
-[heading Synopsis]
-
-    template <typename T0, typename T1,... typename TN>
-    typename __result_of_make_vector__<T0, T1,... TN>::type
-    make_vector(T0 const& x0, T1 const& x1... TN const& xN);
-
-The variadic function accepts `0` to `FUSION_MAX_VECTOR_SIZE` elements,
-where `FUSION_MAX_VECTOR_SIZE` is a user definable predefined maximum that
-defaults to `10`. You may define the preprocessor constant
-`FUSION_MAX_VECTOR_SIZE` before including any Fusion header to change the
-default. Example:
-
-    #define FUSION_MAX_VECTOR_SIZE 20
-
-[heading Parameters]
-
-[table
-    [[Parameter]        [Requirement]                   [Description]]
-    [[`x0, x1,... xN`]  [Instances of `T0, T1,... TN`]  [The arguments to `make_vector`]]
-]
-
-[heading Expression Semantics]
-
-    make_vector(x0, x1,... xN);
-
-[*Return type]: __result_of_make_vector__`<T0, T1,... TN>::type`
-
-[*Semantics]: Create a __vector__ from `x0, x1,... xN`.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/generation/make_vector.hpp>
-
-[heading Example]
-
-    make_vector(123, "hello", 12.5)
-
-[heading See also]
-
-__note_boost_ref__
-
-[endsect]
-
-[section make_set]
-
-[heading Description]
-
-Create a __set__ from one or more values.
-
-[heading Synopsis]
-
-    template <typename T0, typename T1,... typename TN>
-    typename __result_of_make_set__<T0, T1,... TN>::type
-    make_set(T0 const& x0, T1 const& x1... TN const& xN);
-
-The variadic function accepts `0` to `FUSION_MAX_VECTOR_SIZE`[footnote
-`set` is implemented in terms of the vector. That is why we reuse
-`FUSION_MAX_VECTOR_SIZE`] elements, where `FUSION_MAX_VECTOR_SIZE` is a user
-definable predefined maximum that defaults to `10`. You may define the
-preprocessor constant `FUSION_MAX_VECTOR_SIZE` before including any Fusion
-header to change the default. Example:
-
-    #define FUSION_MAX_VECTOR_SIZE 20
-
-[heading Parameters]
-
-[table
-    [[Parameter]        [Requirement]                   [Description]]
-    [[`x0, x1,... xN`]  [Instances of `T0, T1,... TN`]  [The arguments to `make_set`]]
-]
-
-[heading Expression Semantics]
-
-    make_set(x0, x1,... xN);
-
-[*Return type]: __result_of_make_set__`<T0, T1,... TN>::type`
-
-[*Semantics]: Create a __set__ from `x0, x1,... xN`.
-
-[*Precondition]: There may be no duplicate key types.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/generation/make_set.hpp>
-
-[heading Example]
-
-    make_set(123, "hello", 12.5)
-
-[heading See also]
-
-__note_boost_ref__
-
-[endsect]
-
-[section make_map]
-
-[heading Description]
-
-Create a __map__ from one or more key/data pairs.
-
-[heading Synopsis]
-
-    template <
-        typename K0, typename K1,... typename KN
-      , typename T0, typename T1,... typename TN>
-    typename __result_of_make_map__<K0, K0,... KN, T0, T1,... TN>::type
-    make_map(T0 const& x0, T1 const& x1... TN const& xN);
-
-The variadic function accepts `0` to `FUSION_MAX_VECTOR_SIZE`[footnote
-`map` is implemented in terms of the vector. That is why we reuse
-`FUSION_MAX_VECTOR_SIZE`] elements, where `FUSION_MAX_VECTOR_SIZE` is a user
-definable predefined maximum that defaults to `10`. You may define the
-preprocessor constant `FUSION_MAX_VECTOR_SIZE` before including any Fusion
-header to change the default. Example:
-
-    #define FUSION_MAX_VECTOR_SIZE 20
-
-[heading Parameters]
-
-[table
-    [[Parameter]        [Requirement]                   [Description]]
-    [[`K0, K1,... KN`]  [The key types]                 [Keys associated with `x0, x1,... xN`]]
-    [[`x0, x1,... xN`]  [Instances of `T0, T1,... TN`]  [The arguments to `make_map`]]
-]
-
-[heading Expression Semantics]
-
-    make_map<K0, K1,... KN>(x0, x1,... xN);
-
-[*Return type]: __result_of_make_map__`<K0, K0,... KN, T0, T1,... TN>::type`
-
-[*Semantics]: Create a __map__ from `K0, K1,... KN` keys and
-`x0, x1,... xN` data.
-
-[*Precondition]: There may be no duplicate key types.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/generation/make_map.hpp>
-
-[heading Example]
-
-    make_map(
-        __fusion_make_pair__<int>('X')
-      , __fusion_make_pair__<double>("Men"))
-
-[heading See also]
-
-__note_boost_ref__, __fusion_pair__
-
-[endsect]
-
-[section Tiers]
-
-Tiers are sequences, where all elements are non-const reference types. They
-are constructed with a call to a couple of /tie/ function templates. The
-succeeding sections document the various /tier/ flavors.
-
-* __list_tie__
-* __vector_tie__
-* __map_tie__
-
-Example:
-
-    int i; char c; double d;
-      ...
-    __vector_tie__(i, c, a);
-
-The __vector_tie__ function creates a __vector__ of type
-`__vector__<int&, char&, double&>`. The same result could be achieved with the call
-__make_vector__(__boost_ref_call__(i), __boost_ref_call__(c), __boost_ref_call__(a))
-[footnote see __boost_ref__ for details about `ref`].
-
-A /tie/ can be used to 'unpack' another tuple into variables. E.g.:
-
-    int i; char c; double d;
-    __vector_tie__(i, c, d) = __make_vector__(1,'a', 5.5);
-    std::cout << i << " " <<  c << " " << d;
-
-This code prints 1 a 5.5 to the standard output stream. A sequence
-unpacking operation like this is found for example in ML and Python. It is
-convenient when calling functions which return sequences.
-
-[heading Ignore]
-
-There is also an object called /ignore/ which allows you to ignore an
-element assigned by a sequence. The idea is that a function may return a
-sequence, only part of which you are interested in. For example:
-
-    char c;
-    __vector_tie__(ignore, c) = __make_vector__(1, 'a');
-
-[endsect]
-
-[section list_tie]
-
-[heading Description]
-
-Constructs a tie using a __list__ sequence.
-
-[heading Synopsis]
-
-    template <typename T0, typename T1,... typename TN>
-    __list__<T0&, T1&,... TN&>
-    list_tie(T0& x0, T1& x1... TN& xN);
-
-The variadic function accepts `0` to `FUSION_MAX_LIST_SIZE` elements, where
-`FUSION_MAX_LIST_SIZE` is a user definable predefined maximum that defaults
-to `10`. You may define the preprocessor constant `FUSION_MAX_LIST_SIZE`
-before including any Fusion header to change the default. Example:
-
-    #define FUSION_MAX_LIST_SIZE 20
-
-[heading Parameters]
-
-[table
-    [[Parameter]        [Requirement]                       [Description]]
-    [[`x0, x1,... xN`]  [Instances of `T0, T1,... TN`]      [The arguments to `list_tie`]]
-]
-
-[heading Expression Semantics]
-
-    list_tie(x0, x1,... xN);
-
-[*Return type]: __list__<T0&, T1&,... TN&>
-
-[*Semantics]: Create a __list__ of references from `x0, x1,... xN`.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/generation/list_tie.hpp>
-
-[heading Example]
-
-    int i = 123;
-    double d = 123.456;
-    list_tie(i, d)
-
-[endsect]
-
-[section vector_tie]
-
-[heading Description]
-
-Constructs a tie using a __vector__ sequence.
-
-[heading Synopsis]
-
-    template <typename T0, typename T1,... typename TN>
-    __vector__<T0&, T1&,... TN&>
-    vector_tie(T0& x0, T1& x1... TN& xN);
-
-The variadic function accepts `0` to `FUSION_MAX_VECTOR_SIZE` elements,
-where `FUSION_MAX_VECTOR_SIZE` is a user definable predefined maximum that
-defaults to `10`. You may define the preprocessor constant
-`FUSION_MAX_VECTOR_SIZE` before including any Fusion header to change the
-default. Example:
-
-    #define FUSION_MAX_VECTOR_SIZE 20
-
-[heading Parameters]
-
-[table
-    [[Parameter]        [Requirement]                       [Description]]
-    [[`x0, x1,... xN`]  [Instances of `T0, T1,... TN`]      [The arguments to `vector_tie`]]
-]
-
-[heading Expression Semantics]
-
-    vector_tie(x0, x1,... xN);
-
-[*Return type]: __vector__<T0&, T1&,... TN&>
-
-[*Semantics]: Create a __vector__ of references from `x0, x1,... xN`.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/generation/vector_tie.hpp>
-
-[heading Example]
-
-    int i = 123;
-    double d = 123.456;
-    vector_tie(i, d)
-
-[endsect]
-
-[section map_tie]
-
-[heading Description]
-
-Constructs a tie using a __map__ sequence.
-
-[heading Synopsis]
-
-    template <typename K0, typename K1,... typename KN, typename D0, typename D1,... typename DN>
-    __map__<__pair__<K0, D0&>, __pair__<K1, D1&>,... __pair__<KN, DN&> >
-    map_tie(D0& d0, D1& d1... DN& dN);
-
-The variadic function accepts `0` to `FUSION_MAX_MAP_SIZE` elements,
-where `FUSION_MAX_MAP_SIZE` is a user definable predefined maximum that
-defaults to `10`, and a corresponding number of key types.
-You may define the preprocessor constant  `FUSION_MAX_MAP_SIZE` before
-including any Fusion header to change the default. Example:
-
-    #define FUSION_MAX_MAP_SIZE 20
-
-[heading Parameters]
-
-[table
-    [[Parameter]        [Requirement]                       [Description]]
-    [[`K0, K1,... KN`]  [Any type][The key types associated with each of the `x1,x2,...,xN` values]]
-    [[`x0, x1,... xN`]  [Instances of `T0, T1,... TN`]                      [The arguments to `map_tie`]]
-]
-
-[heading Expression Semantics]
-
-    map_tie<K0, K1,... KN>(x0, x1,... xN);
-
-[*Return type]: __map__<__pair__<K0, D0&>, __pair__<K1, D1&>,... __pair__<KN, DN&> >
-
-[*Semantics]: Create a __map__ of references from `x0, x1,... xN` with keys `K0, K1,... KN`
-
-[heading Header]
-
-    #include <boost/fusion/sequence/generation/map_tie.hpp>
-
-[heading Example]
-
-    struct int_key;
-    struct double_key;
-    ...
-    int i = 123;
-    double d = 123.456;
-    map_tie<int_key, double_key>(i, d)
-
-[endsect]
-
-[endsect]
-
-[section MetaFunctions]
-
-[section make_list]
-
-[heading Description]
-
-Returns the result type of __make_list__.
-
-[heading Synopsis]
-
-    template <typename T0, typename T1,... typename TN>
-    struct make_list;
-
-The variadic function accepts `0` to `FUSION_MAX_LIST_SIZE` elements, where
-`FUSION_MAX_LIST_SIZE` is a user definable predefined maximum that defaults
-to `10`. You may define the preprocessor constant `FUSION_MAX_LIST_SIZE`
-before including any Fusion header to change the default. Example:
-
-    #define FUSION_MAX_LIST_SIZE 20
-
-[heading Parameters]
-
-[table
-    [[Parameter]        [Requirement]       [Description]]
-    [[`T0, T1,... TN`]  [Any type]          [Template arguments to `make_list`]]
-]
-
-[heading Expression Semantics]
-
-    result_of::make_list<T0, T1,... TN>::type
-
-[*Return type]: A __list__ with elements of types converted following the
-rules for __element_conversion__.
-
-[*Semantics]: Create a __list__ from `T0, T1,... TN`.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/generation/make_list.hpp>
-
-[heading Example]
-
-    result_of::make_list<int, const char(&)[7], double>::type
-
-[endsect]
-
-[section make_cons]
-
-[heading Description]
-
-Returns the result type of __make_cons__.
-
-[heading Synopsis]
-
-    template <typename Car, typename Cdr = nil>
-    struct make_cons;
-
-[heading Parameters]
-
-[table
-    [[Parameter]        [Requirement]               [Description]]
-    [[`Car`]            [Any type]                  [The list's head type]]
-    [[`Cdr`]            [A `cons`]                  [The list's tail type (optional)]]
-]
-
-[heading Expression Semantics]
-
-    result_of::make_cons<Car, Cdr>::type
-
-[*Return type]: A __cons__ with head element, `Car`, of type converted
-following the rules for __element_conversion__, and tail, `Cdr`.
-
-[*Semantics]: Create a __cons__ from `Car` (/head/) and optional `Cdr` (/tail/).
-
-[heading Header]
-
-    #include <boost/fusion/sequence/generation/make_cons.hpp>
-
-[heading Example]
-
-    result_of::make_cons<char, result_of::make_cons<int>::type>::type
-
-[endsect]
-
-[section make_vector]
-
-[heading Description]
-
-Returns the result type of __make_vector__.
-
-[heading Synopsis]
-
-    template <typename T0, typename T1,... typename TN>
-    struct make_vector;
-
-The variadic function accepts `0` to `FUSION_MAX_VECTOR_SIZE` elements,
-where `FUSION_MAX_VECTOR_SIZE` is a user definable predefined maximum that
-defaults to `10`. You may define the preprocessor constant
-`FUSION_MAX_VECTOR_SIZE` before including any Fusion header to change the
-default. Example:
-
-    #define FUSION_MAX_VECTOR_SIZE 20
-
-[heading Parameters]
-
-[table
-    [[Parameter]        [Requirement]       [Description]]
-    [[`T0, T1,... TN`]  [Any type]          [Template arguments to `make_vector`]]
-]
-
-[heading Expression Semantics]
-
-    result_of::make_vector<T0, T1,... TN>::type
-
-[*Return type]: A __vector__ with elements of types converted following the
-rules for __element_conversion__.
-
-[*Semantics]: Create a __vector__ from `T0, T1,... TN`.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/generation/make_list.hpp>
-
-[heading Example]
-
-    result_of::make_vector<int, const char(&)[7], double>::type
-
-[endsect]
-
-[section make_set]
-
-[heading Description]
-
-Returns the result type of __make_set__.
-
-[heading Synopsis]
-
-    template <typename T0, typename T1,... typename TN>
-    struct make_set;
-
-The variadic function accepts `0` to `FUSION_MAX_VECTOR_SIZE`[footnote
-`set` is implemented in terms of the vector. That is why we reuse
-`FUSION_MAX_VECTOR_SIZE`] elements, where `FUSION_MAX_VECTOR_SIZE` is a user
-definable predefined maximum that defaults to `10`. You may define the
-preprocessor constant `FUSION_MAX_VECTOR_SIZE` before including any Fusion
-header to change the default. Example:
-
-    #define FUSION_MAX_VECTOR_SIZE 20
-
-[heading Parameters]
-
-[table
-    [[Parameter]        [Requirement]       [Description]]
-    [[`T0, T1,... TN`]  [Any type]          [The arguments to `make_set`]]
-]
-
-[heading Expression Semantics]
-
-    result_of::make_set<T0, T1,... TN>::type
-
-[*Return type]: A __set__ with elements of types converted following the
-rules for __element_conversion__.
-
-[*Semantics]: Create a __set__ from `T0, T1,... TN`.
-
-[*Precondition]: There may be no duplicate key types.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/generation/make_set.hpp>
-
-[heading Example]
-
-    result_of::make_set<int, char, double>::type
-
-[endsect]
-
-[section make_map]
-
-[heading Description]
-
-Returns the result type of __make_map__.
-
-[heading Synopsis]
-
-    template <
-        typename K0, typename K1,... typename KN
-      , typename T0, typename T1,... typename TN>
-    struct make_map;
-
-The variadic function accepts `0` to `FUSION_MAX_VECTOR_SIZE`[footnote
-`map` is implemented in terms of the vector. That is why we reuse
-`FUSION_MAX_VECTOR_SIZE`] elements, where `FUSION_MAX_VECTOR_SIZE` is a user
-definable predefined maximum that defaults to `10`. You may define the
-preprocessor constant `FUSION_MAX_VECTOR_SIZE` before including any Fusion
-header to change the default. Example:
-
-    #define FUSION_MAX_VECTOR_SIZE 20
-
-[heading Parameters]
-
-[table
-    [[Parameter]        [Requirement]           [Description]]
-    [[`K0, K1,... KN`]  [Any type]              [Keys associated with `T0, T1,... TN`]]
-    [[`T0, T1,... TN`]  [Any type]              [Data associated with keys `K0, K1,... KN`]]
-]
-
-[heading Expression Semantics]
-
-    resulf_of::make_map<K0, K1,... KN, T0, T1,... TN>::type;
-
-[*Return type]: __result_of_make_map__`<K0, K0,... KN, T0, T1,... TN>::type`
-
-[*Semantics]: A __map__ with __fusion_pair__ elements where the
-`second_type` is converted following the rules for __element_conversion__.
-
-[*Precondition]: There may be no duplicate key types.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/generation/make_map.hpp>
-
-[heading Example]
-
-    result_of::make_map<int, double, char, double>::type
-
-[heading See also]
-
-__fusion_pair__
-
-[endsect]
-
-[section list_tie]
-
-[heading Description]
-
-Returns the result type of __list_tie__.
-
-[heading Synopsis]
-
-    template <typename T0, typename T1,... typename TN>
-    struct list_tie;
-
-The variadic function accepts `0` to `FUSION_MAX_LIST_SIZE` elements, where
-`FUSION_MAX_LIST_SIZE` is a user definable predefined maximum that defaults
-to `10`. You may define the preprocessor constant `FUSION_MAX_LIST_SIZE`
-before including any Fusion header to change the default. Example:
-
-    #define FUSION_MAX_LIST_SIZE 20
-
-[heading Parameters]
-
-[table
-    [[Parameter]        [Requirement]       [Description]]
-    [[`T0, T1,... TN`]  [Any type]          [The arguments to `list_tie`]]
-]
-
-[heading Expression Semantics]
-
-    result_of::list_tie<T0, T1,... TN>::type;
-
-[*Return type]: __list__<T0&, T1&,... TN&>
-
-[*Semantics]: Create a __list__ of references from `T0, T1,... TN`.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/generation/list_tie.hpp>
-
-[heading Example]
-
-    result_of::list_tie<int, double>::type
-
-[endsect]
-
-[section vector_tie]
-
-[heading Description]
-
-Returns the result type of __vector_tie__.
-
-[heading Synopsis]
-
-    template <typename T0, typename T1,... typename TN>
-    struct vector_tie;
-
-The variadic function accepts `0` to `FUSION_MAX_VECTOR_SIZE` elements,
-where `FUSION_MAX_VECTOR_SIZE` is a user definable predefined maximum that
-defaults to `10`. You may define the preprocessor constant
-`FUSION_MAX_VECTOR_SIZE` before including any Fusion header to change the
-default. Example:
-
-    #define FUSION_MAX_VECTOR_SIZE 20
-
-[heading Parameters]
-
-[table
-    [[Parameter]        [Requirement]       [Description]]
-    [[`T0, T1,... TN`]  [Any type]          [The arguments to `vector_tie`]]
-]
-
-[heading Expression Semantics]
-
-    result_of::vector_tie<T0, T1,... TN>::type;
-
-[*Return type]: __vector__<T0&, T1&,... TN&>
-
-[*Semantics]: Create a __vector__ of references from `T0, T1,... TN`.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/generation/vector_tie.hpp>
-
-[heading Example]
-
-    result_of::vector_tie<int, double>::type
-
-[endsect]
-
-[section map_tie]
-
-[heading Description]
-
-Returns the result type of __map_tie__.
-
-[heading Synopsis]
-
-    template <typename K0, typename K1,... typename KN, typename D0, typename D1,... typename DN>
-    struct map_tie;
-
-The variadic function accepts `0` to `FUSION_MAX_MAP_SIZE` elements,
-where `FUSION_MAX_MAP_SIZE` is a user definable predefined maximum that
-defaults to `10`. You may define the preprocessor constant
-`FUSION_MAX_MAP_SIZE` before including any Fusion header to change the
-default. Example:
-
-    #define FUSION_MAX_MAP_SIZE 20
-
-[heading Parameters]
-
-[table
-    [[Parameter]        [Requirement]       [Description]]
-    [[`K0, K1,... KN`]  [Any type]          [The key types for `map_tie`]]
-    [[`D0, D1,... DN`]  [Any type]          [The arguments types for `map_tie`]]
-]
-
-[heading Expression Semantics]
-
-    result_of::map_tie<K0, K1,... KN, D0, D1,... DN>::type;
-
-[*Return type]: __map__<__pair__<K0, D0&>, __pair__<K1, D1&>,... __pair__<KN, DN&> >
-
-[*Semantics]: Create a __map__ of references from `D0, D1,... DN` with keys `K0, K1,... KN`
-
-[heading Header]
-
-    #include <boost/fusion/sequence/generation/map_tie.hpp>
-
-[heading Example]
-
-    struct int_key;
-    struct double_key;
-    ...
-    result_of::map_tie<int_key, double_key, int, double>::type
-
-[endsect]
-
-[endsect]
-
-[endsect]
-
-[section Conversion]
-
-All fusion sequences can be converted to one of the __containers__ types
-using one of these conversion functions.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/conversion.hpp>
-
-[section Functions]
-
-[section as_list]
-
-[heading Description]
-
-Convert a fusion sequence to a __list__.
-
-[heading Synopsis]
-
-    template <typename Sequence>
-    typename result_of::as_list<Sequence>::type
-    as_list(Sequence& seq);
-
-    template <typename Sequence>
-    typename result_of::as_list<Sequence const>::type
-    as_list(Sequence const& seq);
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]               [Description]]
-    [[`seq`]        [An instance of Sequence]   [The sequence to convert.]]
-]
-
-[heading Expression Semantics]
-
-    as_list(seq);
-
-[*Return type]: __result_of_as_list__`<Sequence>::type`
-
-[*Semantics]: Convert a fusion sequence, `seq`, to a __list__.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/conversion/as_list.hpp>
-
-[heading Example]
-
-    as_list(__make_vector__('x', 123, "hello"))
-
-[endsect]
-
-[section as_vector]
-
-[heading Description]
-
-Convert a fusion sequence to a __vector__.
-
-[heading Synopsis]
-
-    template <typename Sequence>
-    typename result_of::as_vector<Sequence>::type
-    as_vector(Sequence& seq);
-
-    template <typename Sequence>
-    typename result_of::as_vector<Sequence const>::type
-    as_vector(Sequence const& seq);
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]               [Description]]
-    [[`seq`]        [An instance of Sequence]   [The sequence to convert.]]
-]
-
-[heading Expression Semantics]
-
-    as_vector(seq);
-
-[*Return type]: __result_of_as_vector__`<Sequence>::type`
-
-[*Semantics]: Convert a fusion sequence, `seq`, to a __vector__.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/conversion/as_vector.hpp>
-
-[heading Example]
-
-    as_vector(__make_list__('x', 123, "hello"))
-
-[endsect]
-
-[section as_set]
-
-[heading Description]
-
-Convert a fusion sequence to a __set__.
-
-[heading Synopsis]
-
-    template <typename Sequence>
-    typename result_of::as_set<Sequence>::type
-    as_set(Sequence& seq);
-
-    template <typename Sequence>
-    typename result_of::as_set<Sequence const>::type
-    as_set(Sequence const& seq);
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]               [Description]]
-    [[`seq`]        [An instance of Sequence]   [The sequence to convert.]]
-]
-
-[heading Expression Semantics]
-
-    as_set(seq);
-
-[*Return type]: __result_of_as_set__`<Sequence>::type`
-
-[*Semantics]: Convert a fusion sequence, `seq`, to a __set__.
-
-[*Precondition]: There may be no duplicate key types.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/conversion/as_set.hpp>
-
-[heading Example]
-
-    as_set(__make_vector__('x', 123, "hello"))
-
-[endsect]
-
-[section as_map]
-
-[heading Description]
-
-Convert a fusion sequence to a __map__.
-
-[heading Synopsis]
-
-    template <typename Sequence>
-    typename result_of::as_map<Sequence>::type
-    as_map(Sequence& seq);
-
-    template <typename Sequence>
-    typename result_of::as_map<Sequence const>::type
-    as_map(Sequence const& seq);
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]               [Description]]
-    [[`seq`]        [An instance of Sequence]   [The sequence to convert.]]
-]
-
-[heading Expression Semantics]
-
-    as_map(seq);
-
-[*Return type]: __result_of_as_map__`<Sequence>::type`
-
-[*Semantics]: Convert a fusion sequence, `seq`, to a __map__.
-
-[*Precondition]: The elements of the sequence are assumed to be
-__fusion_pair__s. There may be no duplicate __fusion_pair__ key types.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/conversion/as_map.hpp>
-
-[heading Example]
-
-    as_map(__make_vector__(
-        __fusion_make_pair__<int>('X')
-      , __fusion_make_pair__<double>("Men")))
-
-[endsect]
-
-[endsect]
-
-[section Metafunctions]
-
-[section as_list]
-
-[heading Description]
-
-Returns the result type of __as_list__.
-
-[heading Synopsis]
-
-    template <typename Sequence>
-    struct as_list;
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]               [Description]]
-    [[`Sequence`]   [A fusion __sequence__]     [The sequence type to convert.]]
-]
-
-[heading Expression Semantics]
-
-    result_of::as_list<Sequence>::type;
-
-[*Return type]: A __list__ with same elements as the input sequence,
-`Sequence`.
-
-[*Semantics]: Convert a fusion sequence, `Sequence`, to a __list__.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/conversion/as_list.hpp>
-
-[heading Example]
-
-    result_of::as_list<__vector__<char, int> >::type
-
-[endsect]
-
-[section as_vector]
-
-[heading Description]
-
-Returns the result type of __as_vector__.
-
-[heading Synopsis]
-
-    template <typename Sequence>
-    struct as_vector;
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]               [Description]]
-    [[`Sequence`]   [A fusion __sequence__]     [The sequence to convert.]]
-]
-
-[heading Expression Semantics]
-
-    result_of::as_vector<Sequence>::type;
-
-[*Return type]: A __vector__ with same elements as the input sequence,
-`Sequence`.
-
-[*Semantics]: Convert a fusion sequence, `Sequence`, to a __vector__.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/conversion/as_vector.hpp>
-
-[heading Example]
-
-    result_of::as_vector<__list__<char, int> >::type
-
-[endsect]
-
-[section as_set]
-
-[heading Description]
-
-Returns the result type of __as_set__.
-
-[heading Synopsis]
-
-    template <typename Sequence>
-    struct as_set;
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]               [Description]]
-    [[`Sequence`]   [A fusion __sequence__]     [The sequence to convert.]]
-]
-
-[heading Expression Semantics]
-
-    result_of::as_set<Sequence>::type;
-
-[*Return type]: A __set__ with same elements as the input sequence,
-`Sequence`.
-
-[*Semantics]: Convert a fusion sequence, `Sequence`, to a __set__.
-
-[*Precondition]: There may be no duplicate key types.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/conversion/as_set.hpp>
-
-[heading Example]
-
-    result_of::as_set<__vector__<char, int> >::type
-
-[endsect]
-
-[section as_map]
-
-[heading Description]
-
-Returns the result type of __as_map__.
-
-[heading Synopsis]
-
-    template <typename Sequence>
-    struct as_map;
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]               [Description]]
-    [[`Sequence`]   [A fusion __sequence__]     [The sequence to convert.]]
-]
-
-[heading Expression Semantics]
-
-    result_of::as_map<Sequence>::type;
-
-[*Return type]: A __map__ with same elements as the input sequence,
-`Sequence`.
-
-[*Semantics]: Convert a fusion sequence, `Sequence`, to a __map__.
-
-[*Precondition]: The elements of the sequence are assumed to be
-__fusion_pair__s. There may be no duplicate __fusion_pair__ key types.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/conversion/as_map.hpp>
-
-[heading Example]
-
-    result_of::as_map<__vector__<
-        __fusion_pair__<int, char>
-      , __fusion_pair__<double, std::string> > >::type
-
-[endsect]
-
-[endsect]
-
-[endsect]
-
-[section Operators]
-
-These operators, like the __algorithms__, work generically on all Fusion
-sequences. All conforming Fusion sequences automatically get these
-operators for free.
-
-[section I/O]
-
-The I/O operators: `<<` and `>>` work generically on all Fusion sequences.
-The global `operator<<` has been overloaded for generic output streams such
-that __sequence__s are output by recursively calling `operator<<` for each
-element. Analogously, the global `operator>>` has been overloaded to
-extract __sequence__s from generic input streams by recursively calling
-`operator>>` for each element.
-
-The default delimiter between the elements is space, and the __sequence__
-is enclosed in parenthesis. For Example:
-
-    __vector__<float, int, std::string> a(1.0f, 2, std::string("Howdy folks!");
-    cout << a;
-
-outputs the __vector__ as: (1.0 2 Howdy folks!)
-
-The library defines three manipulators for changing the default behavior:
-
-[variablelist Manipulators
-    [[`tuple_open(arg)`]        [Defines the character that is output before the first element.]]
-    [[`tuple_close(arg)`]       [Defines the character that is output after the last element.]]
-    [[`tuple_delimiter(arg)`]   [Defines the delimiter character between elements.]]
-]
-
-The argument to `tuple_open`, `tuple_close` and `tuple_delimiter` may be a
-`char`, `wchar_t`, a C-string, or a wide C-string.
-
-Example:
-
-    std::cout << tuple_open('[') << tuple_close(']') << tuple_delimiter(", ") << a;
-
-outputs the same __vector__, `a` as: [1.0, 2, Howdy folks!]
-
-The same manipulators work with `operator>>` and `istream` as well. Suppose
-the `std::cin` stream contains the following data:
-
-    (1 2 3) [4:5]
-
-The code:
-
-    __vector__<int, int, int> i;
-    __vector__<int, int> j;
-
-    std::cin >> i;
-    std::cin >> set_open('[') >> set_close(']') >> set_delimiter(':');
-    std::cin >> j;
-
-reads the data into the __vector__s `i` and `j`.
-
-Note that extracting __sequence__s with `std::string` or C-style string
-elements does not generally work, since the streamed __sequence__
-representation may not be unambiguously parseable.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/io.hpp>
-
-[section in]
-
-[heading Description]
-
-Read a __sequence__ from an input stream.
-
-[heading Synopsis]
-
-    template <typename IStream, typename Sequence>
-    IStream&
-    operator>>(IStream& is, Sequence& seq);
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]           [Description]]
-    [[is]           [An input stream.]      [Stream to extract information from.]]
-    [[seq]          [A __sequence__.]       [The sequence to read.]]
-]
-
-[heading Expression Semantics]
-
-    is >> seq
-
-[*Return type]: IStream&
-
-[*Semantics]: For each element, `e`, in sequence, `seq`, call `is >> e`.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/io/in.hpp>
-
-[heading Example]
-
-    __vector__<int, std::string, char> v;
-    std::cin >> v;
-
-[endsect]
-
-[section out]
-
-[heading Description]
-
-Write a __sequence__ to an output stream.
-
-[heading Synopsis]
-
-    template <typename OStream, typename Sequence>
-    OStream&
-    operator<<(OStream& os, Sequence& seq);
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]           [Description]]
-    [[os]           [An output stream.]     [Stream to write information to.]]
-    [[seq]          [A __sequence__.]       [The sequence to write.]]
-]
-
-[heading Expression Semantics]
-
-    os << seq
-
-[*Return type]: OStream&
-
-[*Semantics]: For each element, `e`, in sequence, `seq`, call `os << e`.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/io/out.hpp>
-
-[heading Example]
-
-    std::cout << __make_vector__(123, "Hello", 'x') << std::endl;
-
-[endsect]
-
-[endsect]
-
-[section Comparison]
-
-The Comparison operators: `==`, `!=`, `<`, `<=`, `>=` and `>=` work
-generically on all Fusion sequences. Comparison operators are "short-
-circuited": elementary comparisons start from the first elements and are
-performed only until the result is clear.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/comparison.hpp>
-
-[section equal]
-
-[heading Description]
-
-Compare two sequences for equality.
-
-[heading Synopsis]
-
-    template <typename Seq1, typename Seq2>
-    bool
-    operator==(Seq1 const& a, Seq2 const& b);
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]                       [Description]]
-    [[`a, b`]       [Instances of __sequence__]         [__sequence__s to compare]]
-]
-
-[heading Expression Semantics]
-
-    a == b
-
-[*Return type]: `bool`
-
-[*Requirements]:
-
-For each element, `e1`, in  sequence `a`, and for each element, `e2`, in
-sequence `b`, `a == b` is a valid expression returning a type that is
-convertible to bool.
-
-An attempt to compare two Sequences of different lengths results in a
-compile time error.
-
-[*Semantics]:
-
-For each element, `e1`, in  sequence `a`, and for each element, `e2`, in
-sequence `b`, `e1 == e2` returns true. For any 2 zero length __sequence__s,
-e and f, e == f  returns true.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/comparison/equal_to.hpp>
-
-[heading Example]
-
-    __vector__<int, char> v1(5, 'a');
-    __vector__<int, char> v2(5, 'a');
-    assert(v1 == v2);
-
-[endsect]
-
-[section not equal]
-
-Compare two sequences for inequality.
-
-[heading Synopsis]
-
-    template <typename Seq1, typename Seq2>
-    bool
-    operator!=(Seq1 const& a, Seq2 const& b);
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]                       [Description]]
-    [[`a, b`]       [Instances of __sequence__]         [__sequence__s to compare]]
-]
-
-[heading Expression Semantics]
-
-    a != b
-
-[*Return type]: `bool`
-
-[*Requirements]:
-
-For each element, `e1`, in  sequence `a`, and for each element, `e2`, in
-sequence `b`, `a == b` is a valid expression returning a type that is
-convertible to bool.
-
-An attempt to compare two Sequences of different lengths results in a
-compile time error.
-
-[*Semantics]:
-
-Returns !(a == b).
-
-[heading Header]
-
-    #include <boost/fusion/sequence/comparison/not_equal_to.hpp>
-
-[heading Example]
-
-    __vector__<int, char> v3(5, 'b');
-    __vector__<int, char> t4(2, 'a');
-    assert(v1 != v3);
-    assert(v1 != t4);
-    assert(!(v1 != v2));
-
-[endsect]
-
-[section less than]
-
-Lexicographically compare two sequences.
-
-[heading Synopsis]
-
-    template <typename Seq1, typename Seq2>
-    bool
-    operator<(Seq1 const& a, Seq2 const& b);
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]                       [Description]]
-    [[`a, b`]       [Instances of __sequence__]         [__sequence__s to compare]]
-]
-
-[heading Expression Semantics]
-
-    a < b
-
-[*Return type]: `bool`
-
-[*Requirements]:
-
-For each element, `e1`, in  sequence `a`, and for each element, `e2`, in
-sequence `b`, `a < b` is a valid expression returning a type that is
-convertible to bool.
-
-An attempt to compare two Sequences of different lengths results in a
-compile time error.
-
-[*Semantics]: Returns the lexicographical comparison of between `a` and `b`.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/comparison/less.hpp>
-
-[heading Example]
-
-    __vector__<int, float> v1(4, 3.3f);
-    __vector__<short, float> v2(5, 3.3f);
-    __vector__<long, double> v3(5, 4.4);
-    assert(v1 < v2);
-    assert(v2 < v3);
-
-[endsect]
-
-[section less than equal]
-
-Lexicographically compare two sequences.
-
-[heading Synopsis]
-
-    template <typename Seq1, typename Seq2>
-    bool
-    operator<=(Seq1 const& a, Seq2 const& b);
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]                       [Description]]
-    [[`a, b`]       [Instances of __sequence__]         [__sequence__s to compare]]
-]
-
-[heading Expression Semantics]
-
-    a <= b
-
-[*Return type]: `bool`
-
-[*Requirements]:
-
-For each element, `e1`, in  sequence `a`, and for each element, `e2`, in
-sequence `b`, `a < b` is a valid expression returning a type that is
-convertible to bool.
-
-An attempt to compare two Sequences of different lengths results in a
-compile time error.
-
-[*Semantics]: Returns !(b < a).
-
-[heading Header]
-
-    #include <boost/fusion/sequence/comparison/less_equal.hpp>
-
-[heading Example]
-
-    __vector__<int, float> v1(4, 3.3f);
-    __vector__<short, float> v2(5, 3.3f);
-    __vector__<long, double> v3(5, 4.4);
-    assert(v1 <= v2);
-    assert(v2 <= v3);
-
-[endsect]
-
-[section greater than]
-
-Lexicographically compare two sequences.
-
-[heading Synopsis]
-
-    template <typename Seq1, typename Seq2>
-    bool
-    operator>(Seq1 const& a, Seq2 const& b);
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]                       [Description]]
-    [[`a, b`]       [Instances of __sequence__]         [__sequence__s to compare]]
-]
-
-[heading Expression Semantics]
-
-    a > b
-
-[*Return type]: `bool`
-
-[*Requirements]:
-
-For each element, `e1`, in  sequence `a`, and for each element, `e2`, in
-sequence `b`, `a < b` is a valid expression returning a type that is
-convertible to bool.
-
-An attempt to compare two Sequences of different lengths results in a
-compile time error.
-
-[*Semantics]: Returns b < a.
-
-[heading Header]
-
-    #include <boost/fusion/sequence/comparison/less_equal.hpp>
-
-[heading Example]
-
-    __vector__<int, float> v1(4, 3.3f);
-    __vector__<short, float> v2(5, 3.3f);
-    __vector__<long, double> v3(5, 4.4);
-    assert(v2 > v1);
-    assert(v3 > v2);
-
-[endsect]
-
-[section greater than equal]
-
-Lexicographically compare two sequences.
-
-[heading Synopsis]
-
-    template <typename Seq1, typename Seq2>
-    bool
-    operator>=(Seq1 const& a, Seq2 const& b);
-
-[heading Parameters]
-
-[table
-    [[Parameter]    [Requirement]                       [Description]]
-    [[`a, b`]       [Instances of __sequence__]         [__sequence__s to compare]]
-]
-
-[heading Expression Semantics]
-
-    a >= b
-
-[*Return type]: `bool`
-
-[*Requirements]:
-
-For each element, `e1`, in  sequence `a`, and for each element, `e2`, in
-sequence `b`, `a < b` is a valid expression returning a type that is
-convertible to bool.
-
-An attempt to compare two Sequences of different lengths results in a
-compile time error.
-
-[*Semantics]: Returns !(a < b).
-
-[heading Header]
-
-    #include <boost/fusion/sequence/comparison/greater_equal.hpp>
-
-[heading Example]
-
-    __vector__<int, float> v1(4, 3.3f);
-    __vector__<short, float> v2(5, 3.3f);
-    __vector__<long, double> v3(5, 4.4);
-    assert(v2 >= v1);
-    assert(v3 >= v2);
-
-[endsect]
-
-[endsect]
-
-[endsect]
-
-[endsect]
-

Modified: branches/proto/v3/libs/fusion/doc/support.qbk
==============================================================================
--- branches/proto/v3/libs/fusion/doc/support.qbk	(original)
+++ branches/proto/v3/libs/fusion/doc/support.qbk	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -40,6 +40,7 @@
 [heading Header]
 
     #include <boost/fusion/support/is_sequence.hpp>
+    #include <boost/fusion/include/is_sequence.hpp>
 
 [heading Example]
 
@@ -93,6 +94,7 @@
 [heading Header]
 
     #include <boost/fusion/support/is_view.hpp>
+    #include <boost/fusion/include/is_view.hpp>
 
 [heading Example]
 
@@ -147,6 +149,7 @@
 [heading Header]
 
     #include <boost/fusion/support/tag_of.hpp>
+    #include <boost/fusion/include/tag_of.hpp>
 
 [heading Example]
 
@@ -243,6 +246,7 @@
 [heading Header]
 
     #include <boost/fusion/support/category_of.hpp>
+    #include <boost/fusion/include/category_of.hpp>
 
 [heading Example]
 
@@ -266,6 +270,7 @@
 [heading Header]
 
     #include <boost/fusion/support/deduce.hpp>
+    #include <boost/fusion/include/deduce.hpp>
 
 [heading Synopsis]
     namespace traits
@@ -309,6 +314,7 @@
 [heading Header]
 
     #include <boost/fusion/support/deduce_sequence.hpp>
+    #include <boost/fusion/include/deduce_sequence.hpp>
 
 [heading Synopsis]
     namespace traits
@@ -413,6 +419,7 @@
 [heading Header]
 
     #include <boost/fusion/support/pair.hpp>
+    #include <boost/fusion/include/pair.hpp>
 
 [heading Example]
 

Deleted: branches/proto/v3/libs/fusion/doc/tuples.qbk
==============================================================================
--- branches/proto/v3/libs/fusion/doc/tuples.qbk	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
+++ (empty file)
@@ -1,264 +0,0 @@
-[section Tuples]
-The TR1 technical report describes extensions to the C++ standard library.
-Many of these extensions will be considered for the next
-iteration of the C++ standard. TR1 describes a tuple type, and 
-support for treating `std::pair` as a type of tuple.
-
-Fusion provides full support for the __tr1__tuple__ interface, and the extended
-uses of `std::pair` described in the TR1 document.
-
-[section Class template tuple]
-Fusion's implementation of the __tr1__tuple__ is also a fusion __forward_sequence__.
-As such the fusion tuple type provides a lot of functionality beyond that required by TR1.
-
-Currently tuple is basically a synonym for __vector__, although this may be changed
-in future releases of fusion.
-
-[heading Synopsis]
-    template<
-        typename T1 = __unspecified__,
-        typename T2 = __unspecified__,
-        ...
-        typename TN = __unspecified__>
-    class tuple;
-
-[heading Header]
-    #include <boost/fusion/tuple.hpp>
-
-[section Construction]
-
-[heading Description]
-The __tr1__tuple__ type provides a default constructor, a constructor that takes initializers for all of its elements, a copy constructor, and a converting copy constructor. The details of the various constructors are described in this section.
-
-[heading Specification]
-
-[variablelist Notation
-    [[`T1 ... TN`, `U1 ... UN`][Tuple element types]]
-    [[`P1 ... PN`]             [Parameter types]]
-    [[`Ti`, `Ui`]              [The type of the `i`th element of a tuple]]
-    [[`Pi`]                    [The type of the `i`th parameter]]
-]
-
-    tuple();
-
-[*Requirements]: Each `Ti` is default constructable.
-
-[*Semantics]: Default initializes each element of the tuple.
-
-    tuple(P1,P2,...,PN);
-
-[*Requirements]: Each `Pi` is `Ti` if `Ti` is a reference type, `const Ti&` otherwise.
-
-[*Semantics]: Copy initializes each element with the corresponding parameter.
-
-    tuple(const tuple& t);
-
-[*Requirements]: Each `Ti` should be copy constructable.
-
-[*Semantics]: Copy constructs each element of `*this` with the corresponding element of `t`.
-
-    template<typename U1, typename U2, ..., typename UN>
-    tuple(const tuple<U1, U2, ..., UN>& t);
-
-[*Requirements]: Each `Ti` shall be constructible from the corresponding `Ui`.
-
-[*Semantics]: Constructs each element of `*this` with the corresponding element of `t`.
-
-[endsect]
-
-[section Tuple creation functions]
-
-[heading Description]
-TR1 describes 2 utility functions for creating __tr1__tuple__s. `make_tuple` builds a tuple out of it's argument list, and `tie` builds a tuple of references to it's arguments. The details of these creation functions are described in this section.
-
-[heading Specification]
-
-    template<typename T1, typename T2, ..., typename TN>
-    tuple<V1, V2, ..., VN> make_tuple(const T1& t1, const T2& t2, ..., const TN& tn);
-
-Where `Vi` is `X&` if the cv-unqualified type `Ti` is `reference_wrapper<X>`, otherwise `Vi` is `Ti`.
-
-[*Returns]: `tuple<V1, V2, ..., VN>(t1, t2, ..., tN)`
-
-    template<typename T1, typename T2, ..., typename TN>
-    tuple<T1&, T2&, ..., TN&> tie(T1& t1, T2& t2, ..., TN& tn);
-
-[*Returns]: tuple<T1&, T2&, ..., TN&>(t1, t2, ..., tN). When argument `ti` is `ignore`, assigning any value to the corresponding tuple element has has no effect.
-
-[endsect]
-
-[section Tuple helper classes]
-
-[heading Description]
-The __tr1__tuple__ provides 2 helper traits, for compile time access to the tuple size, and the element types.
-
-[heading Specification]
-
-    tuple_size<T>::value
-
-[*Requires]: `T` is any fusion sequence type, including `tuple`.
-
-[*Type]: __mpl_integral_constant__
-
-[*Value]: The number of elements in the sequence. Equivalent to `__result_of_size__<T>::type`.
-
-    tuple_element<I, T>::type
-
-[*Requires]: `T` is any fusion sequence type, including `tuple`. `0 <= I < N` or the program is ill formed.
-
-[*Value]: The type of the `I`th element of `T`. Equivalent to `__result_of_value_at__<I,T>::type`.
-
-[endsect]
-
-[section Element access]
-
-[heading Description]
-The __tr1__tuple__ provides the `get` function to provide access to it's elements by zero based numeric index.
-
-[heading Specification]
-    template<int I, T>
-    RJ get(T& t);
-
-[*Requires]: `0 < I <= N`. The program is ill formed if `I` is out of bounds. 
-`T` is any fusion sequence type, including `tuple`.
-
-[*Return type]: `RJ` is equivalent to `__result_of_at_c__<I,T>::type`.
-
-[*Returns]: A reference to the `I`th element of `T`.
-
-    template<int I, typename T>
-    PJ get(T const& t);
-
-[*Requires]: `0 < I <= N`. The program is ill formed if `I` is out of bounds. 
-`T` is any fusion sequence type, including `tuple`.
-
-[*Return type]: `PJ` is equivalent to `__result_of_at_c__<I,T>::type`.
-
-[*Returns]: A const reference to the `I`th element of `T`.
-
-[endsect]
-
-[section Relational operators]
-
-[heading Description]
-The __tr1__tuple__ provides the standard boolean relational operators.
-
-[heading Specification]
-
-[variablelist Notation
-    [[`T1 ... TN`, `U1 ... UN`][Tuple element types]]
-    [[`P1 ... PN`]             [Parameter types]]
-    [[`Ti`, `Ui`]              [The type of the `i`th element of a tuple]]
-    [[`Pi`]                    [The type of the `i`th parameter]]
-]
-
-    template<typename T1, typename T2, ..., typename TN,
-             typename U1, typename U2, ..., typename UN>
-    bool operator==(
-        const tuple<T1, T2, ..., TN>& lhs,
-        const tuple<U1, U2, ..., UN>& rhs);
-
-[*Requirements]: For all `i`, `1 <= i < N`, `__tuple_get__<i>(lhs) == __tuple_get__<i>(rhs)` is a valid
-expression returning a type that is convertible to `bool`.
-
-[*Semantics]: Returns `true` if and only if `__tuple_get__<i>(lhs) == __tuple_get__<i>(rhs)` for all `i`.
-For any 2 zero length tuples `e` and `f`, `e == f` returns `true`.
-
-    template<typename T1, typename T2, ..., typename TN,
-             typename U1, typename U2, ..., typename UN>
-    bool operator<(
-        const tuple<T1, T2, ..., TN>& lhs,
-        const tuple<U1, U2, ..., UN>& rhs);
-
-[*Requirements]: For all `i`, `1 <= i < N`, `__tuple_get__<i>(lhs) < __tuple_get__<i>(rhs)` is a valid
-expression returning a type that is convertible to `bool`.
-
-[*Semantics]: Returns the lexicographical comparison of between `lhs` and `rhs`.
-
-    template<typename T1, typename T2, ..., typename TN,
-             typename U1, typename U2, ..., typename UN>
-    bool operator!=(
-        const tuple<T1, T2, ..., TN>& lhs,
-        const tuple<U1, U2, ..., UN>& rhs);
-
-[*Requirements]: For all `i`, `1 <= i < N`, `__tuple_get__<i>(lhs) == __tuple_get__<i>(rhs)` is a valid
-expression returning a type that is convertible to `bool`.
-
-[*Semantics]: Returns `!(lhs == rhs)`.
-
-    template<typename T1, typename T2, ..., typename TN,
-             typename U1, typename U2, ..., typename UN>
-    bool operator<=(
-        const tuple<T1, T2, ..., TN>& lhs,
-        const tuple<U1, U2, ..., UN>& rhs);
-
-[*Requirements]: For all `i`, `1 <= i < N`, `__tuple_get__<i>(rhs) < __tuple_get__<i>(lhs)` is a valid
-expression returning a type that is convertible to `bool`.
-
-[*Semantics]: Returns `!(rhs < lhs)`
-
-    template<typename T1, typename T2, ..., typename TN,
-             typename U1, typename U2, ..., typename UN>
-    bool operator>(
-        const tuple<T1, T2, ..., TN>& lhs,
-        const tuple<U1, U2, ..., UN>& rhs);
-
-[*Requirements]: For all `i`, `1 <= i < N`, `__tuple_get__<i>(rhs) < __tuple_get__<i>(lhs)` is a valid
-expression returning a type that is convertible to `bool`.
-
-[*Semantics]: Returns `rhs < lhs`.
-
-    template<typename T1, typename T2, ..., typename TN,
-             typename U1, typename U2, ..., typename UN>
-    bool operator>=(
-        const tuple<T1, T2, ..., TN>& lhs,
-        const tuple<U1, U2, ..., UN>& rhs);
-
-[*Requirements]: For all `i`, `1 <= i < N`, `__tuple_get__<i>(lhs) < __tuple_get__<i>(rhs)` is a valid
-expression returning a type that is convertible to `bool`.
-
-[*Semantics]: Returns `!(lhs < rhs)`.
-
-[endsect]
-
-[endsect]
-
-[section Pairs]
-
-[heading Description]
-The __tr1__tuple__ interface is specified to provide uniform access to `std::pair` as if it were a 2 element tuple.
-
-[heading Specification]
-
-    tuple_size<std::pair<T1, T2> >::value
-
-[*Type]: An __mpl_integral_constant__
-
-[*Value]: Returns 2, the number of elements in a pair.
-
-    tuple_element<0, std::pair<T1, T2> >::type
-
-[*Type]: `T1`
-
-[*Value]: Returns the type of the first element of the pair
-
-    tuple_element<1, std::pair<T1, T2> >::type
-
-[*Type]: `T2`
-
-[*Value]: Returns thetype of the second element of the pair
-
-    template<int I, typename T1, typename T2>
-    P& get(std::pair<T1, T2>& pr);
-
-    template<int I, typename T1, typename T2>
-    const P& get(const std::pair<T1, T2>& pr);
-
-[*Type]: If `I == 0` `P` is `T1`, else if `I == 1` `P` is `T2` else the program is ill-formed.
-
-[*Returns: `pr.first` if `I == 0` else `pr.second`.
-
-[endsect]
-
-[endsect]
-

Modified: branches/proto/v3/libs/fusion/test/algorithm/clear.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/algorithm/clear.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/algorithm/clear.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -8,7 +8,7 @@
 #include <boost/fusion/container/vector/vector.hpp>
 #include <boost/fusion/sequence/io/out.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/algorithm/transformation/clear.hpp>
 #include <boost/mpl/vector_c.hpp>
 

Modified: branches/proto/v3/libs/fusion/test/algorithm/erase.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/algorithm/erase.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/algorithm/erase.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -10,7 +10,7 @@
 #include <boost/fusion/adapted/mpl.hpp>
 #include <boost/fusion/sequence/io/out.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/algorithm/transformation/erase.hpp>
 #include <boost/mpl/vector_c.hpp>
 #include <boost/mpl/begin_end.hpp>

Modified: branches/proto/v3/libs/fusion/test/algorithm/erase_key.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/algorithm/erase_key.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/algorithm/erase_key.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -6,14 +6,14 @@
 ==============================================================================*/
 #include <boost/detail/lightweight_test.hpp>
 #include <boost/fusion/container/set/set.hpp>
-#include <boost/fusion/sequence/generation/make_set.hpp>
+#include <boost/fusion/container/generation/make_set.hpp>
 #include <boost/fusion/container/map/map.hpp>
-#include <boost/fusion/sequence/generation/make_map.hpp>
+#include <boost/fusion/container/generation/make_map.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
 #include <boost/fusion/container/vector/convert.hpp>
 #include <boost/fusion/container/set/convert.hpp>
 #include <boost/fusion/container/map/convert.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/sequence/intrinsic/size.hpp>
 #include <boost/fusion/iterator/deref.hpp>
 #include <boost/fusion/algorithm/transformation/erase_key.hpp>

Modified: branches/proto/v3/libs/fusion/test/algorithm/ext_/find_if_s.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/algorithm/ext_/find_if_s.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/algorithm/ext_/find_if_s.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -10,7 +10,7 @@
 #include <boost/fusion/sequence/io/out.hpp>
 #include <boost/fusion/algorithm/query/ext_/find_if_s.hpp>
 #include <boost/fusion/container/ext_/tree.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/mpl/vector.hpp>
 #include <boost/mpl/vector_c.hpp>
 #include <boost/mpl/less.hpp>

Modified: branches/proto/v3/libs/fusion/test/algorithm/ext_/for_each_s.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/algorithm/ext_/for_each_s.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/algorithm/ext_/for_each_s.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -10,7 +10,7 @@
 #include <boost/fusion/sequence/io/out.hpp>
 #include <boost/fusion/algorithm/iteration/ext_/for_each_s.hpp>
 #include <boost/mpl/vector_c.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/container/ext_/tree.hpp>
 
 struct print

Modified: branches/proto/v3/libs/fusion/test/algorithm/filter.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/algorithm/filter.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/algorithm/filter.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -9,7 +9,7 @@
 #include <boost/fusion/container/vector/vector.hpp>
 #include <boost/fusion/adapted/mpl.hpp>
 #include <boost/fusion/sequence/io/out.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
 #include <boost/fusion/algorithm/transformation/filter.hpp>
 #include <boost/mpl/vector.hpp>

Modified: branches/proto/v3/libs/fusion/test/algorithm/filter_if.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/algorithm/filter_if.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/algorithm/filter_if.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -8,7 +8,7 @@
 #include <boost/fusion/container/vector/vector.hpp>
 #include <boost/fusion/adapted/mpl.hpp>
 #include <boost/fusion/sequence/io/out.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
 #include <boost/fusion/algorithm/transformation/filter_if.hpp>
 #include <boost/type_traits/is_class.hpp>

Modified: branches/proto/v3/libs/fusion/test/algorithm/fold.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/algorithm/fold.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/algorithm/fold.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -10,7 +10,7 @@
 #include <boost/fusion/adapted/mpl.hpp>
 #include <boost/fusion/sequence/io/out.hpp>
 #include <boost/fusion/sequence/intrinsic/at.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/algorithm/iteration/fold.hpp>
 #include <boost/fusion/algorithm/iteration/accumulate.hpp>
 #include <boost/type_traits/is_same.hpp>

Modified: branches/proto/v3/libs/fusion/test/algorithm/insert.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/algorithm/insert.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/algorithm/insert.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -9,7 +9,7 @@
 #include <boost/fusion/adapted/mpl.hpp>
 #include <boost/fusion/sequence/io/out.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/algorithm/transformation/insert.hpp>
 #include <boost/mpl/vector_c.hpp>
 #include <boost/mpl/begin_end.hpp>

Modified: branches/proto/v3/libs/fusion/test/algorithm/insert_range.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/algorithm/insert_range.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/algorithm/insert_range.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -9,7 +9,7 @@
 #include <boost/fusion/adapted/mpl.hpp>
 #include <boost/fusion/sequence/io/out.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/algorithm/transformation/insert_range.hpp>
 #include <boost/mpl/vector_c.hpp>
 #include <boost/mpl/begin_end.hpp>

Modified: branches/proto/v3/libs/fusion/test/algorithm/join.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/algorithm/join.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/algorithm/join.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,7 +7,7 @@
 ==============================================================================*/
 #include <boost/detail/lightweight_test.hpp>
 #include <boost/fusion/algorithm/transformation/join.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
 #include <boost/fusion/adapted/mpl.hpp>
 #include <boost/mpl/vector/vector10_c.hpp>

Modified: branches/proto/v3/libs/fusion/test/algorithm/pop_back.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/algorithm/pop_back.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/algorithm/pop_back.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -9,7 +9,7 @@
 #include <boost/fusion/adapted/mpl.hpp>
 #include <boost/fusion/sequence/io/out.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/algorithm/transformation/pop_back.hpp>
 #include <boost/mpl/vector_c.hpp>
 

Modified: branches/proto/v3/libs/fusion/test/algorithm/pop_front.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/algorithm/pop_front.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/algorithm/pop_front.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -9,7 +9,7 @@
 #include <boost/fusion/adapted/mpl.hpp>
 #include <boost/fusion/sequence/io/out.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/algorithm/transformation/pop_front.hpp>
 #include <boost/mpl/vector_c.hpp>
 

Modified: branches/proto/v3/libs/fusion/test/algorithm/push_back.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/algorithm/push_back.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/algorithm/push_back.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -10,7 +10,7 @@
 #include <boost/fusion/sequence/io/out.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
 #include <boost/fusion/sequence/intrinsic/at.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/algorithm/transformation/push_back.hpp>
 #include <boost/fusion/algorithm/iteration/for_each.hpp>
 #include <boost/mpl/vector_c.hpp>

Modified: branches/proto/v3/libs/fusion/test/algorithm/push_front.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/algorithm/push_front.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/algorithm/push_front.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -9,7 +9,7 @@
 #include <boost/fusion/adapted/mpl.hpp>
 #include <boost/fusion/sequence/io/out.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/algorithm/transformation/push_front.hpp>
 #include <boost/mpl/vector_c.hpp>
 #include <string>

Modified: branches/proto/v3/libs/fusion/test/algorithm/remove.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/algorithm/remove.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/algorithm/remove.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -8,7 +8,7 @@
 #include <boost/fusion/container/vector/vector.hpp>
 #include <boost/fusion/adapted/mpl.hpp>
 #include <boost/fusion/sequence/io/out.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
 #include <boost/fusion/algorithm/transformation/remove.hpp>
 #include <boost/mpl/vector.hpp>

Modified: branches/proto/v3/libs/fusion/test/algorithm/remove_if.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/algorithm/remove_if.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/algorithm/remove_if.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -8,7 +8,7 @@
 #include <boost/fusion/container/vector/vector.hpp>
 #include <boost/fusion/adapted/mpl.hpp>
 #include <boost/fusion/sequence/io/out.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
 #include <boost/fusion/algorithm/transformation/remove_if.hpp>
 #include <boost/type_traits/is_class.hpp>

Modified: branches/proto/v3/libs/fusion/test/algorithm/replace.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/algorithm/replace.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/algorithm/replace.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -10,7 +10,7 @@
 #include <boost/fusion/sequence/io/out.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
 #include <boost/fusion/sequence/intrinsic/at.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/algorithm/transformation/replace.hpp>
 #include <string>
 

Modified: branches/proto/v3/libs/fusion/test/algorithm/replace_if.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/algorithm/replace_if.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/algorithm/replace_if.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -11,7 +11,7 @@
 #include <boost/fusion/sequence/io/out.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
 #include <boost/fusion/sequence/intrinsic/at.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/algorithm/transformation/replace_if.hpp>
 #include <string>
 

Modified: branches/proto/v3/libs/fusion/test/algorithm/reverse.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/algorithm/reverse.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/algorithm/reverse.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -8,7 +8,7 @@
 #include <boost/fusion/container/vector/vector.hpp>
 #include <boost/fusion/adapted/mpl.hpp>
 #include <boost/fusion/sequence/io/out.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
 #include <boost/fusion/algorithm/transformation/reverse.hpp>
 #include <boost/mpl/range_c.hpp>

Modified: branches/proto/v3/libs/fusion/test/algorithm/transform.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/algorithm/transform.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/algorithm/transform.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -9,7 +9,7 @@
 #include <boost/fusion/container/vector/vector.hpp>
 #include <boost/fusion/adapted/mpl.hpp>
 #include <boost/fusion/sequence/io/out.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
 #include <boost/fusion/algorithm/transformation/transform.hpp>
 #include <boost/type_traits/is_class.hpp>

Modified: branches/proto/v3/libs/fusion/test/algorithm/zip.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/algorithm/zip.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/algorithm/zip.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,7 +7,7 @@
 ==============================================================================*/
 #include <boost/detail/lightweight_test.hpp>
 #include <boost/fusion/algorithm/transformation/zip.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
 #include <boost/fusion/adapted/mpl.hpp>
 #include <boost/mpl/vector.hpp>

Modified: branches/proto/v3/libs/fusion/test/functional/fused.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/functional/fused.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/functional/fused.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -12,7 +12,7 @@
 #include <boost/noncopyable.hpp>
 #include <boost/blank.hpp>
 
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/container/vector.hpp>
 
 #include <boost/type_traits/is_same.hpp>

Modified: branches/proto/v3/libs/fusion/test/functional/fused_function_object.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/functional/fused_function_object.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/functional/fused_function_object.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -12,7 +12,7 @@
 #include <boost/noncopyable.hpp>
 #include <boost/blank.hpp>
 
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/container/vector.hpp>
 
 namespace fusion = boost::fusion;

Modified: branches/proto/v3/libs/fusion/test/functional/fused_procedure.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/functional/fused_procedure.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/functional/fused_procedure.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -12,7 +12,7 @@
 #include <boost/noncopyable.hpp>
 #include <boost/blank.hpp>
 
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/container/vector.hpp>
 
 namespace fusion = boost::fusion;

Modified: branches/proto/v3/libs/fusion/test/functional/make_fused.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/functional/make_fused.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/functional/make_fused.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -12,7 +12,7 @@
 #include <boost/noncopyable.hpp>
 #include <boost/blank.hpp>
 
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/container/vector.hpp>
 
 namespace fusion = boost::fusion;

Modified: branches/proto/v3/libs/fusion/test/functional/make_fused_function_object.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/functional/make_fused_function_object.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/functional/make_fused_function_object.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -12,7 +12,7 @@
 #include <boost/noncopyable.hpp>
 #include <boost/blank.hpp>
 
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/container/vector.hpp>
 
 namespace fusion = boost::fusion;

Modified: branches/proto/v3/libs/fusion/test/functional/make_fused_procedure.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/functional/make_fused_procedure.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/functional/make_fused_procedure.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -12,7 +12,7 @@
 #include <boost/noncopyable.hpp>
 #include <boost/blank.hpp>
 
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/container/vector.hpp>
 
 namespace fusion = boost::fusion;

Modified: branches/proto/v3/libs/fusion/test/sequence/adapt_assoc_struct.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/adapt_assoc_struct.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/adapt_assoc_struct.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -18,7 +18,7 @@
 #include <boost/fusion/sequence/io/out.hpp>
 #include <boost/fusion/container/vector/vector.hpp>
 #include <boost/fusion/container/list/list.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/container/vector/convert.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
 #include <boost/fusion/sequence/comparison/not_equal_to.hpp>

Modified: branches/proto/v3/libs/fusion/test/sequence/adapt_struct.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/adapt_struct.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/adapt_struct.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -14,7 +14,7 @@
 #include <boost/fusion/sequence/io/out.hpp>
 #include <boost/fusion/container/vector/vector.hpp>
 #include <boost/fusion/container/list/list.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/container/vector/convert.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
 #include <boost/fusion/sequence/comparison/not_equal_to.hpp>

Modified: branches/proto/v3/libs/fusion/test/sequence/as_list.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/as_list.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/as_list.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,8 +7,8 @@
 #include <boost/detail/lightweight_test.hpp>
 #include <boost/fusion/container/vector/vector.hpp>
 #include <boost/fusion/adapted/mpl.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
-#include <boost/fusion/sequence/generation/make_list.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_list.hpp>
 #include <boost/fusion/container/list/convert.hpp>
 #include <boost/fusion/algorithm/transformation/push_back.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>

Modified: branches/proto/v3/libs/fusion/test/sequence/as_map.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/as_map.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/as_map.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,8 +7,8 @@
 #include <boost/detail/lightweight_test.hpp>
 #include <boost/fusion/container/vector/vector.hpp>
 #include <boost/fusion/adapted/mpl.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
-#include <boost/fusion/sequence/generation/make_list.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_list.hpp>
 #include <boost/fusion/container/map/convert.hpp>
 #include <boost/fusion/container/vector/convert.hpp>
 #include <boost/fusion/algorithm/transformation/push_back.hpp>

Modified: branches/proto/v3/libs/fusion/test/sequence/as_set.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/as_set.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/as_set.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,8 +7,8 @@
 #include <boost/detail/lightweight_test.hpp>
 #include <boost/fusion/container/vector/vector.hpp>
 #include <boost/fusion/adapted/mpl.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
-#include <boost/fusion/sequence/generation/make_list.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_list.hpp>
 #include <boost/fusion/container/set/convert.hpp>
 #include <boost/fusion/container/list/convert.hpp>
 #include <boost/fusion/container/vector/convert.hpp>

Modified: branches/proto/v3/libs/fusion/test/sequence/as_vector.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/as_vector.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/as_vector.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,8 +7,8 @@
 #include <boost/detail/lightweight_test.hpp>
 #include <boost/fusion/container/vector/vector.hpp>
 #include <boost/fusion/adapted/mpl.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
-#include <boost/fusion/sequence/generation/make_list.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_list.hpp>
 #include <boost/fusion/container/vector/convert.hpp>
 #include <boost/fusion/algorithm/transformation/push_back.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>

Modified: branches/proto/v3/libs/fusion/test/sequence/back_extended_deque.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/back_extended_deque.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/back_extended_deque.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -11,7 +11,7 @@
 #include <boost/fusion/container/deque/deque.hpp>
 #include <boost/fusion/container/deque/back_extended_deque.hpp>
 #include <boost/fusion/sequence/comparison.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/mpl.hpp>
 
 #include <boost/fusion/sequence/intrinsic.hpp>

Modified: branches/proto/v3/libs/fusion/test/sequence/boost_tuple.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/boost_tuple.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/boost_tuple.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -14,7 +14,7 @@
 #include <boost/fusion/sequence/io/out.hpp>
 #include <boost/fusion/container/vector/vector.hpp>
 #include <boost/fusion/container/list/list.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/container/vector/convert.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
 #include <boost/fusion/sequence/comparison/not_equal_to.hpp>

Modified: branches/proto/v3/libs/fusion/test/sequence/cons.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/cons.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/cons.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -8,10 +8,10 @@
 #include <string>
 #include <boost/detail/lightweight_test.hpp>
 #include <boost/fusion/container/list/cons.hpp>
-#include <boost/fusion/sequence/generation/make_cons.hpp>
-#include <boost/fusion/sequence/generation/cons_tie.hpp>
+#include <boost/fusion/container/generation/make_cons.hpp>
+#include <boost/fusion/container/generation/cons_tie.hpp>
 #include <boost/fusion/container/vector/vector.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
 #include <boost/lambda/lambda.hpp>
 #include <boost/fusion/algorithm/iteration/for_each.hpp>

Modified: branches/proto/v3/libs/fusion/test/sequence/deque_copy.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/deque_copy.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/deque_copy.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,8 +7,8 @@
     file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 ==============================================================================*/
 #include <boost/fusion/container/deque/deque.hpp>
-#include <boost/fusion/sequence/generation/make_deque.hpp>
-#include <boost/fusion/sequence/generation/deque_tie.hpp>
+#include <boost/fusion/container/generation/make_deque.hpp>
+#include <boost/fusion/container/generation/deque_tie.hpp>
 
 #define FUSION_SEQUENCE deque
 #include "copy.hpp"

Modified: branches/proto/v3/libs/fusion/test/sequence/deque_make.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/deque_make.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/deque_make.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,7 +7,7 @@
     file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 ==============================================================================*/
 #include <boost/fusion/container/deque/deque.hpp>
-#include <boost/fusion/sequence/generation/make_deque.hpp>
+#include <boost/fusion/container/generation/make_deque.hpp>
 
 #define FUSION_SEQUENCE deque
 #include "make.hpp"

Modified: branches/proto/v3/libs/fusion/test/sequence/deque_tie.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/deque_tie.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/deque_tie.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,9 +7,9 @@
     file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 ==============================================================================*/
 #include <boost/fusion/container/deque/deque.hpp>
-#include <boost/fusion/sequence/generation/deque_tie.hpp>
-#include <boost/fusion/sequence/generation/ignore.hpp>
-#include <boost/fusion/sequence/generation/make_deque.hpp>
+#include <boost/fusion/container/generation/deque_tie.hpp>
+#include <boost/fusion/container/generation/ignore.hpp>
+#include <boost/fusion/container/generation/make_deque.hpp>
 
 #define FUSION_SEQUENCE deque
 #include "tie.hpp"

Modified: branches/proto/v3/libs/fusion/test/sequence/ext_/iterator_range_s.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/ext_/iterator_range_s.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/ext_/iterator_range_s.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -9,7 +9,7 @@
 #include <boost/fusion/algorithm/query/ext_/find_if_s.hpp>
 #include <boost/fusion/container/vector/vector.hpp>
 #include <boost/fusion/container/ext_/tree.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/view/iterator_range/iterator_range.hpp>
 #include <boost/fusion/view/ext_/segmented_iterator_range.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>

Modified: branches/proto/v3/libs/fusion/test/sequence/filter_view.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/filter_view.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/filter_view.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -11,7 +11,7 @@
 #include <boost/fusion/sequence/io/out.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
 #include <boost/fusion/view/filter_view/filter_view.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/sequence/intrinsic/size.hpp>
 #include <boost/type_traits/is_class.hpp>
 #include <boost/type_traits/is_same.hpp>

Modified: branches/proto/v3/libs/fusion/test/sequence/front_extended_deque.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/front_extended_deque.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/front_extended_deque.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -11,7 +11,7 @@
 #include <boost/fusion/container/deque/deque.hpp>
 #include <boost/fusion/container/deque/front_extended_deque.hpp>
 #include <boost/fusion/sequence/comparison.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/mpl.hpp>
 
 #include <boost/fusion/sequence/intrinsic.hpp>

Modified: branches/proto/v3/libs/fusion/test/sequence/io.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/io.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/io.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -6,7 +6,7 @@
 ==============================================================================*/
 #include <boost/detail/lightweight_test.hpp>
 #include <boost/fusion/container/vector/vector.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
 #include <boost/fusion/sequence/io/out.hpp>
 #include <boost/fusion/sequence/io/in.hpp>

Modified: branches/proto/v3/libs/fusion/test/sequence/iterator_range.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/iterator_range.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/iterator_range.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -6,7 +6,7 @@
 ==============================================================================*/
 #include <boost/detail/lightweight_test.hpp>
 #include <boost/fusion/container/vector/vector.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/view/iterator_range/iterator_range.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
 #include <boost/fusion/sequence/io/out.hpp>

Modified: branches/proto/v3/libs/fusion/test/sequence/joint_view.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/joint_view.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/joint_view.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -9,7 +9,7 @@
 #include <boost/fusion/view/joint_view/joint_view.hpp>
 #include <boost/fusion/sequence/io/out.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/sequence/intrinsic/at.hpp>
 #include <boost/mpl/vector_c.hpp>
 

Modified: branches/proto/v3/libs/fusion/test/sequence/list_copy.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/list_copy.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/list_copy.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -6,8 +6,8 @@
     file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 ==============================================================================*/
 #include <boost/fusion/container/list/list.hpp>
-#include <boost/fusion/sequence/generation/make_list.hpp>
-#include <boost/fusion/sequence/generation/list_tie.hpp>
+#include <boost/fusion/container/generation/make_list.hpp>
+#include <boost/fusion/container/generation/list_tie.hpp>
 
 #define FUSION_SEQUENCE list
 #include "copy.hpp"

Modified: branches/proto/v3/libs/fusion/test/sequence/list_make.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/list_make.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/list_make.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -6,7 +6,7 @@
     file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 ==============================================================================*/
 #include <boost/fusion/container/list/list.hpp>
-#include <boost/fusion/sequence/generation/make_list.hpp>
+#include <boost/fusion/container/generation/make_list.hpp>
 
 #define FUSION_SEQUENCE list
 #include "make.hpp"

Modified: branches/proto/v3/libs/fusion/test/sequence/list_tie.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/list_tie.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/list_tie.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -6,9 +6,9 @@
     file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 ==============================================================================*/
 #include <boost/fusion/container/list/list.hpp>
-#include <boost/fusion/sequence/generation/list_tie.hpp>
-#include <boost/fusion/sequence/generation/ignore.hpp>
-#include <boost/fusion/sequence/generation/make_list.hpp>
+#include <boost/fusion/container/generation/list_tie.hpp>
+#include <boost/fusion/container/generation/ignore.hpp>
+#include <boost/fusion/container/generation/make_list.hpp>
 
 #define FUSION_SEQUENCE list
 #include "tie.hpp"

Modified: branches/proto/v3/libs/fusion/test/sequence/make_list.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/make_list.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/make_list.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -6,7 +6,7 @@
     file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 ==============================================================================*/
 #include <boost/fusion/container/list/list.hpp>
-#include <boost/fusion/sequence/generation/make_list.hpp>
+#include <boost/fusion/container/generation/make_list.hpp>
 
 #define FUSION_SEQUENCE list
 #include "make.hpp"

Modified: branches/proto/v3/libs/fusion/test/sequence/make_vector.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/make_vector.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/make_vector.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -6,7 +6,7 @@
     file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 ==============================================================================*/
 #include <boost/fusion/container/vector/vector.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 
 #define FUSION_SEQUENCE vector
 #include "make.hpp"

Modified: branches/proto/v3/libs/fusion/test/sequence/map.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/map.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/map.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -6,7 +6,7 @@
 ==============================================================================*/
 #include <boost/detail/lightweight_test.hpp>
 #include <boost/fusion/container/map/map.hpp>
-#include <boost/fusion/sequence/generation/make_map.hpp>
+#include <boost/fusion/container/generation/make_map.hpp>
 #include <boost/fusion/sequence/intrinsic/at_key.hpp>
 #include <boost/fusion/sequence/intrinsic/value_at_key.hpp>
 #include <boost/fusion/sequence/intrinsic/has_key.hpp>

Modified: branches/proto/v3/libs/fusion/test/sequence/map_tie.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/map_tie.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/map_tie.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,7 +7,7 @@
 ==============================================================================*/
 #include <boost/detail/lightweight_test.hpp>
 
-#include <boost/fusion/sequence/generation/map_tie.hpp>
+#include <boost/fusion/container/generation/map_tie.hpp>
 #include <boost/fusion/sequence/intrinsic/at_key.hpp>
 
 struct key_zero;

Modified: branches/proto/v3/libs/fusion/test/sequence/reverse_view.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/reverse_view.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/reverse_view.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -8,7 +8,7 @@
 #include <boost/fusion/container/vector/vector.hpp>
 #include <boost/fusion/adapted/mpl.hpp>
 #include <boost/fusion/sequence/io/out.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
 #include <boost/fusion/view/reverse_view/reverse_view.hpp>
 #include <boost/fusion/sequence/intrinsic/begin.hpp>

Modified: branches/proto/v3/libs/fusion/test/sequence/set.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/set.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/set.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -6,7 +6,7 @@
 ==============================================================================*/
 #include <boost/detail/lightweight_test.hpp>
 #include <boost/fusion/container/set/set.hpp>
-#include <boost/fusion/sequence/generation/make_set.hpp>
+#include <boost/fusion/container/generation/make_set.hpp>
 #include <boost/fusion/sequence/intrinsic/at_key.hpp>
 #include <boost/fusion/sequence/intrinsic/value_at_key.hpp>
 #include <boost/fusion/sequence/intrinsic/has_key.hpp>

Modified: branches/proto/v3/libs/fusion/test/sequence/std_pair.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/std_pair.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/std_pair.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -14,7 +14,7 @@
 #include <boost/fusion/sequence/io/out.hpp>
 #include <boost/fusion/container/vector/vector.hpp>
 #include <boost/fusion/container/list/list.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/container/vector/convert.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
 #include <boost/fusion/sequence/comparison/not_equal_to.hpp>

Modified: branches/proto/v3/libs/fusion/test/sequence/swap.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/swap.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/swap.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -7,7 +7,7 @@
 ==============================================================================*/
 #include <boost/fusion/sequence/intrinsic/swap.hpp>
 #include <boost/fusion/container/vector.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
 #include <boost/detail/lightweight_test.hpp>
 

Modified: branches/proto/v3/libs/fusion/test/sequence/transform_view.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/transform_view.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/transform_view.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -8,7 +8,7 @@
 #include <boost/fusion/container/vector/vector.hpp>
 #include <boost/fusion/adapted/mpl.hpp>
 #include <boost/fusion/sequence/io/out.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
 #include <boost/fusion/view/transform_view/transform_view.hpp>
 #include <boost/fusion/sequence/intrinsic/begin.hpp>

Modified: branches/proto/v3/libs/fusion/test/sequence/vector_copy.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/vector_copy.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/vector_copy.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -6,8 +6,8 @@
     file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 ==============================================================================*/
 #include <boost/fusion/container/vector/vector.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
-#include <boost/fusion/sequence/generation/vector_tie.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/vector_tie.hpp>
 
 #define FUSION_SEQUENCE vector
 #include "copy.hpp"

Modified: branches/proto/v3/libs/fusion/test/sequence/vector_make.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/vector_make.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/vector_make.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -6,7 +6,7 @@
     file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 ==============================================================================*/
 #include <boost/fusion/container/vector/vector.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 
 #define FUSION_SEQUENCE vector
 #include "make.hpp"

Modified: branches/proto/v3/libs/fusion/test/sequence/vector_tie.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/vector_tie.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/vector_tie.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -6,9 +6,9 @@
     file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 ==============================================================================*/
 #include <boost/fusion/container/vector/vector.hpp>
-#include <boost/fusion/sequence/generation/vector_tie.hpp>
-#include <boost/fusion/sequence/generation/ignore.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/vector_tie.hpp>
+#include <boost/fusion/container/generation/ignore.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 
 #define FUSION_SEQUENCE vector
 #include "tie.hpp"

Modified: branches/proto/v3/libs/fusion/test/sequence/zip_view.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/zip_view.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/zip_view.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -19,7 +19,7 @@
 #include <boost/fusion/iterator/deref.hpp>
 #include <boost/fusion/iterator/advance.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/adapted/mpl.hpp>
 #include <boost/mpl/assert.hpp>
 #include <boost/mpl/equal_to.hpp>

Modified: branches/proto/v3/libs/fusion/test/sequence/zip_view2.cpp
==============================================================================
--- branches/proto/v3/libs/fusion/test/sequence/zip_view2.cpp	(original)
+++ branches/proto/v3/libs/fusion/test/sequence/zip_view2.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -21,7 +21,7 @@
 #include <boost/fusion/iterator/deref.hpp>
 #include <boost/fusion/iterator/advance.hpp>
 #include <boost/fusion/sequence/comparison/equal_to.hpp>
-#include <boost/fusion/sequence/generation/make_vector.hpp>
+#include <boost/fusion/container/generation/make_vector.hpp>
 #include <boost/fusion/adapted/mpl.hpp>
 #include <boost/mpl/assert.hpp>
 #include <boost/mpl/equal_to.hpp>

Modified: branches/proto/v3/libs/fusion/todo.txt
==============================================================================
--- branches/proto/v3/libs/fusion/todo.txt	(original)
+++ branches/proto/v3/libs/fusion/todo.txt	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -1,7 +1,11 @@
+* Improve extension docs
+
+* Document sequence/convert
+
 * Consider object equivalent of functions and algorithms (so you can do
   transform(iterators, deref()) with needing to put together a wrapper for deref).
 
-* Make algorithms work with mutable data 
+* Make algorithms work with mutable data
 
 * Consider segmented sequence / algorithm support
 
@@ -81,17 +85,17 @@
 * Provide infinity-aware default implementation for Incrementable Sequences
 
   Thoughts: It would probably be cleaner to have infinity conceptually
-  orthogonal so there can be infinite Bidi/RA/Assoc Sequences. 
+  orthogonal so there can be infinite Bidi/RA/Assoc Sequences.
   OTOH it complicates things in way that might not be worth it...
 
-* Implement always_view/always with repetitive_view<single_view<T> > 
+* Implement always_view/always with repetitive_view<single_view<T> >
   semantics - using repetitive_view will for this purpose will be way
   too much overhead.
 
 ? Functional wrappers for intrinsics/algorithms.
 
 * Rewrite functional benchmark
- 
+
 ==========================================================
 
 From the fusion review (please mark all done items):

Modified: branches/proto/v3/libs/integer/cstdint.htm
==============================================================================
--- branches/proto/v3/libs/integer/cstdint.htm	(original)
+++ branches/proto/v3/libs/integer/cstdint.htm	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -2,7 +2,7 @@
 
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
-<meta name="GENERATOR" content="Microsoft FrontPage 4.0">
+<meta name="GENERATOR" content="Microsoft FrontPage 5.0">
 <meta name="ProgId" content="FrontPage.Editor.Document">
 <title>Header boost/cstdint.hpp</title>
 </head>
@@ -69,10 +69,13 @@
 capable of representing any value of any unsigned integer type.</p>
 <p>These types are required.</p>
 <hr>
-<p>Revised <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %b %Y" startspan -->19 Aug 2001<!--webbot bot="Timestamp" endspan i-checksum="14767" -->
+<p>Revised <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %b %Y" startspan -->06 Nov 2007<!--webbot bot="Timestamp" endspan i-checksum="15272" -->
 </p>
-<p>&nbsp;</p>
+<p>© Copyright Beman Dawes 2000</p>
+
+<p>Distributed under the Boost Software License, Version 1.0. See
+www.boost.org/LICENSE_1_0.txt</p>
 
 </body>
 
-</html>
+</html>
\ No newline at end of file

Modified: branches/proto/v3/libs/integer/index.html
==============================================================================
--- branches/proto/v3/libs/integer/index.html	(original)
+++ branches/proto/v3/libs/integer/index.html	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -121,8 +121,13 @@
 
 <hr>
 
-<p>Revised: <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %b %Y" startspan -->03 Oct 2001<!--webbot bot="Timestamp" endspan i-checksum="14373" -->
+<p>Revised: <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %b %Y" startspan -->06 Nov 2007<!--webbot bot="Timestamp" endspan i-checksum="15272" -->
 </p>
 
+<p>© Copyright Beman Dawes 2003</p>
+
+<p>Distributed under the Boost Software License, Version 1.0. See
+www.boost.org/LICENSE_1_0.txt</p>
+
 </body>
-</html>
+</html>
\ No newline at end of file

Modified: branches/proto/v3/libs/integer/integer_traits.html
==============================================================================
--- branches/proto/v3/libs/integer/integer_traits.html	(original)
+++ branches/proto/v3/libs/integer/integer_traits.html	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -85,5 +85,10 @@
 Beman Dawes, Ed Brey, Steve Cleary, and Nathan Myers discussed the integer
 traits idea on the boost mailing list in August 1999.
 <hr>
-<a href="../../people/jens_maurer.htm">
-Jens Maurer</a>, 2000-02-20
\ No newline at end of file
+<p>Revised
+<!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B %Y" startspan -->06 November 2007<!--webbot bot="Timestamp" endspan i-checksum="40336" --></p>
+<p>© Copyright Beman Dawes 2000</p>
+
+<p>Distributed under the Boost Software License, Version 1.0. See
+www.boost.org/LICENSE_1_0.txt</p>
+

Modified: branches/proto/v3/libs/libraries.htm
==============================================================================
--- branches/proto/v3/libs/libraries.htm	(original)
+++ branches/proto/v3/libs/libraries.htm	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -239,7 +239,10 @@
     represents parsers directly as EBNF grammars in inlined C++, from Joel de
     Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
     <li>string_algo -
-    String algorithms library, from Pavol Droba</li>
+    String algorithms library, from Pavol Droba.</li>
+    <li>system - Operating system support, 
+    including the diagnostics support that will be part of the C++0x standard 
+    library, from Beman Dawes.</li>
     <li>system - Operating system support, 
     including the diagnostics support that will be part of the C++0x standard 
     library, from Beman Dawes.</li>

Modified: branches/proto/v3/libs/maintainers.txt
==============================================================================
--- branches/proto/v3/libs/maintainers.txt	(original)
+++ branches/proto/v3/libs/maintainers.txt	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -69,3 +69,7 @@
 wave                  Hartmut Kaiser <hartmut.kaiser -at- gmail.com>
 xpressive             Eric Niebler <eric -at- boost-consulting.com>
 
+© Copyright Douglas Gregor 2005
+Distributed under the Boost Software License, Version 1.0. See www.boost.org/LICENSE_1_0.txt
+
+

Modified: branches/proto/v3/libs/math/test/test_bessel_j.cpp
==============================================================================
--- branches/proto/v3/libs/math/test/test_bessel_j.cpp	(original)
+++ branches/proto/v3/libs/math/test/test_bessel_j.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -114,26 +114,26 @@
    // the approximations use, which bracket rather than preserve the root.
    //
    add_expected_result(
-      ".*",                          // compiler
-      ".*",                          // stdlib
+      ".*",                              // compiler
+      ".*",                              // stdlib
       "Sun Solaris",                     // platform
       largest_type,                      // test type(s)
       "Bessel J: Random Data.*Tricky.*", // test data group
-      ".*", 3000, 500);         // test function
+      ".*", 3000, 500);                  // test function
    add_expected_result(
       ".*",                          // compiler
       ".*",                          // stdlib
-      "Sun Solaris",                          // platform
+      "Sun Solaris",                 // platform
       "double",                      // test type(s)
-      ".*Tricky.*",              // test data group
-      ".*", 100000, 100000);         // test function
+      ".*Tricky.*",                  // test data group
+      ".*", 200000, 100000);         // test function
    add_expected_result(
       ".*",                          // compiler
       ".*",                          // stdlib
-      "Sun Solaris",                          // platform
-      largest_type,                      // test type(s)
-      ".*J.*tricky.*",              // test data group
-      ".*", 100, 50);         // test function
+      "Sun Solaris",                 // platform
+      largest_type,                  // test type(s)
+      ".*J.*tricky.*",               // test data group
+      ".*", 400000000, 50000000);    // test function
    //
    // Mac OS X:
    //
@@ -150,7 +150,7 @@
       "Mac OS",                          // platform
       largest_type,                  // test type(s)
       ".*J1.*Tricky.*",              // test data group
-      ".*", 3000000, 800000);       // test function
+      ".*", 3000000, 2000000);       // test function
    add_expected_result(
       ".*",                          // compiler
       ".*",                          // stdlib

Modified: branches/proto/v3/libs/math/test/test_bessel_y.cpp
==============================================================================
--- branches/proto/v3/libs/math/test/test_bessel_y.cpp	(original)
+++ branches/proto/v3/libs/math/test/test_bessel_y.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -74,7 +74,7 @@
       "HP-UX|Sun Solaris",                          // platform
       largest_type,                  // test type(s)
       ".*Y[01Nv].*",           // test data group
-      ".*", 400, 200);               // test function
+      ".*", 1300, 500);               // test function
    //
    // Tru64:
    //

Modified: branches/proto/v3/libs/multi_index/doc/compiler_specifics.html
==============================================================================
--- branches/proto/v3/libs/multi_index/doc/compiler_specifics.html	(original)
+++ branches/proto/v3/libs/multi_index/doc/compiler_specifics.html	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -49,7 +49,7 @@
   <li>HP aC++ A.06.12 for HP-UX and later</li>
   <li>IBM VisualAge C++ V6.0 for AIX</li>
   <li>IBM VisualAge C++ V9.0 for AIX</li>
-  <li>Intel C++ Compiler for Linux 9.0 and later</li>
+  <li>Intel C++ Compiler for Linux 8.1 and later</li>
   <li>Intel C++ Compiler for Windows 32-bit 7.0/7.1</li>
   <li>Intel C++ Compiler for Windows 32-bit 8.0 and later</li>
   <li>Intel C++ Compiler for Windows 64-bit 10.0</li>
@@ -80,6 +80,7 @@
     </ul>
   </li>
   <li>Microsoft Visual C++ 8.0 x64 cross-compiler</li>
+  <li>Microsoft Visual C++ 9.0</li>
   <li>Sun Studio 10 for Solaris and later</li>
   <li>Portability techniques
     <ul>
@@ -131,11 +132,14 @@
 starting from 3.2. The following versions have been explicitly tested:
 <ul>
   <li>GCC 3.2 20020927 (prerelease) under Cygwin 1.5.7,</li>
+  <li>GCC 3.3.6 under Linux,</li>
   <li>GCC 3.4.2 under HP-UX IA64,</li>
-  <li>GCC 3.4.4 (cygming special) under Cygwin 1.5.22,</li>
+  <li>GCC 3.4.3 under Linux x86-64,</li>
+  <li>GCC 3.4.4 under Linux, (cygming special) under Cygwin 1.5.22,</li>
   <li>GCC 3.4.5 (mingw special) under Win32,</li>
   <li>GCC 3.4.6 under Linux x86-64,</li>
-  <li>GCC 4.0.1 (Apple build 5367) under Mac OS,</li>
+  <li>GCC 4.0.1 under Linux x86-64, (Apple builds 5363 and 5367) under Mac OS,</li>
+  <li>GCC 4.1.1 under Linux x86-64,</li>
   <li>GCC 4.1.2 (OpenPKG-CURRENT) under Solaris,</li>
   <li>GCC 4.2.1 under HP-UX IA64 and Linux x86-64, (mingw32-2) under Win32,</li>
   <li>GCC 4.2.2 under Linux.</li>
@@ -234,14 +238,11 @@
 Other than this, Boost.MultiIndex works without problems.
 </p>
 
-<h2><a name="intel_90_lin">Intel C++ Compiler for Linux 9.0 and later</a></h2>
+<h2><a name="intel_81_lin">Intel C++ Compiler for Linux 8.1 and later</a></h2>
 
 <p>
-<b>Note:</b> Last tested in Boost 1.34.1. The information might be no longer accurate.
-</p>
-
-<p>
-No problems have been detected with this compilers from version 9.0.
+No problems have been detected with this compiler.
+Tested from version 8.1 to 9.1.
 </p>
 
 <h2><a name="intel_7x_win">Intel C++ Compiler for Windows 32-bit 7.0/7.1</a></h2>
@@ -670,6 +671,13 @@
 No problems have been detected with this compiler.
 </p>
 
+<h2><a name="msvc_90">Microsoft Visual C++ 9.0</a></h2>
+
+<p>
+No problems have been detected with this compiler.
+The Beta 2 version of this product was used for the testing. 
+</p>
+
 <h2><a name="sun_10">Sun Studio 10 for Solaris and later</a></h2>
 
 <p>
@@ -1105,7 +1113,7 @@
 
 <br>
 
-<p>Revised October 29th 2007</p>
+<p>Revised November 6th 2007</p>
 
 <p>&copy; Copyright 2003-2007 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 Distributed under the Boost Software 

Modified: branches/proto/v3/libs/platform_maintainers.txt
==============================================================================
--- branches/proto/v3/libs/platform_maintainers.txt	(original)
+++ branches/proto/v3/libs/platform_maintainers.txt	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -1,2 +1,6 @@
 gcc-3_3-darwin	Noel Belcourt <kbelco -at- sandia.gov>
 cw-9_5-darwin	Noel Belcourt <kbelco -at- sandia.gov>
+
+© Copyright Douglas Gregor 2005
+Distributed under the Boost Software License, Version 1.0. See www.boost.org/LICENSE_1_0.txt
+

Modified: branches/proto/v3/libs/system/test/error_code_test.cpp
==============================================================================
--- branches/proto/v3/libs/system/test/error_code_test.cpp	(original)
+++ branches/proto/v3/libs/system/test/error_code_test.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -144,17 +144,40 @@
   BOOST_CHECK( system_category == native_ecat );
   BOOST_CHECK( posix_category == errno_ecat );
 
-  // test error_code and error_condition message(),
+  // test error_code and error_condition message();
   // see Boost.Filesystem operations_test for code specific message() tests
   ec = error_code( -1, system_category );
   std::cout << "error_code message for -1 is \"" << ec.message() << "\"\n";
-  BOOST_CHECK( ec.message().substr( 0, 13) == "Unknown error" );
+#if defined(BOOST_WINDOWS_API)
+  BOOST_CHECK( ec.message() == "Unknown error" );
+#elif  defined(linux) || defined(__linux) || defined(__linux__)
+  BOOST_CHECK( ec.message() == "Unknown error 4294967295" );
+#elif defined(__hpux)
+  BOOST_CHECK( ec.message() == "" );
+#elif defined(__osf__)
+  BOOST_CHECK( ec.message() == "Error -1 occurred." );
+#elif defined(__vms)
+  BOOST_CHECK( ec.message() == "error -1" );
+#endif
+
   ec = error_code( BOOST_ACCESS_ERROR_MACRO, system_category );
   BOOST_CHECK( ec.message() != "" );
   BOOST_CHECK( ec.message().substr( 0, 13) != "Unknown error" );
+
   dec = error_condition( -1, posix_category );
   std::cout << "error_condition message for -1 is \"" << dec.message() << "\"\n";
-  BOOST_CHECK( dec.message().substr( 0, 13) == "Unknown error" );
+#if defined(BOOST_WINDOWS_API)
+  BOOST_CHECK( dec.message() == "Unknown error" );
+#elif  defined(linux) || defined(__linux) || defined(__linux__)
+  BOOST_CHECK( dec.message() == "Unknown error 4294967295" );
+#elif defined(__hpux)
+  BOOST_CHECK( dec.message() == "" );
+#elif defined(__osf__)
+  BOOST_CHECK( dec.message() == "Error -1 occurred." );
+#elif defined(__vms)
+  BOOST_CHECK( dec.message() == "error -1" );
+#endif
+
   dec = error_condition( BOOST_ACCESS_ERROR_MACRO, posix_category );
   BOOST_CHECK( dec.message() != "" );
   BOOST_CHECK( dec.message().substr( 0, 13) != "Unknown error" );

Modified: branches/proto/v3/libs/thread/test/test_shared_mutex.cpp
==============================================================================
--- branches/proto/v3/libs/thread/test/test_shared_mutex.cpp	(original)
+++ branches/proto/v3/libs/thread/test/test_shared_mutex.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -6,6 +6,7 @@
 #include <boost/test/unit_test.hpp>
 #include <boost/thread/thread.hpp>
 #include <boost/thread/mutex.hpp>
+#include <boost/thread/condition_variable.hpp>
 #include <boost/thread/shared_mutex.hpp>
 #include <boost/thread/xtime.hpp>
 #include "util.inl"
@@ -29,16 +30,19 @@
         unsigned& simultaneous_running_count;
         unsigned& max_simultaneous_running;
         boost::mutex& unblocked_count_mutex;
+        boost::condition_variable& unblocked_condition;
         boost::mutex& finish_mutex;
     public:
         locking_thread(boost::shared_mutex& rw_mutex_,
                        unsigned& unblocked_count_,
                        boost::mutex& unblocked_count_mutex_,
+                       boost::condition_variable& unblocked_condition_,
                        boost::mutex& finish_mutex_,
                        unsigned& simultaneous_running_count_,
                        unsigned& max_simultaneous_running_):
             rw_mutex(rw_mutex_),
             unblocked_count(unblocked_count_),
+            unblocked_condition(unblocked_condition_),
             simultaneous_running_count(simultaneous_running_count_),
             max_simultaneous_running(max_simultaneous_running_),
             unblocked_count_mutex(unblocked_count_mutex_),
@@ -54,6 +58,7 @@
             {
                 boost::mutex::scoped_lock ublock(unblocked_count_mutex);
                 ++unblocked_count;
+                unblocked_condition.notify_one();
                 ++simultaneous_running_count;
                 if(simultaneous_running_count>max_simultaneous_running)
                 {
@@ -84,15 +89,23 @@
     unsigned simultaneous_running_count=0;
     unsigned max_simultaneous_running=0;
     boost::mutex unblocked_count_mutex;
+    boost::condition_variable unblocked_condition;
     boost::mutex finish_mutex;
     boost::mutex::scoped_lock finish_lock(finish_mutex);
     
     for(unsigned i=0;i<number_of_threads;++i)
     {
-        pool.create_thread(locking_thread<boost::shared_lock<boost::shared_mutex> >(rw_mutex,unblocked_count,unblocked_count_mutex,finish_mutex,simultaneous_running_count,max_simultaneous_running));
+        pool.create_thread(locking_thread<boost::shared_lock<boost::shared_mutex> >(rw_mutex,unblocked_count,unblocked_count_mutex,unblocked_condition,
+                                                                                    finish_mutex,simultaneous_running_count,max_simultaneous_running));
     }
 
-    boost::thread::sleep(delay(1));
+    {
+        boost::mutex::scoped_lock lk(unblocked_count_mutex);
+        while(unblocked_count<number_of_threads)
+        {
+            unblocked_condition.wait(lk);
+        }
+    }
 
     CHECK_LOCKED_VALUE_EQUAL(unblocked_count_mutex,unblocked_count,number_of_threads);
 
@@ -114,15 +127,17 @@
     unsigned simultaneous_running_count=0;
     unsigned max_simultaneous_running=0;
     boost::mutex unblocked_count_mutex;
+    boost::condition_variable unblocked_condition;
     boost::mutex finish_mutex;
     boost::mutex::scoped_lock finish_lock(finish_mutex);
     
     for(unsigned i=0;i<number_of_threads;++i)
     {
-        pool.create_thread(locking_thread<boost::unique_lock<boost::shared_mutex> >(rw_mutex,unblocked_count,unblocked_count_mutex,finish_mutex,simultaneous_running_count,max_simultaneous_running));
+        pool.create_thread(locking_thread<boost::unique_lock<boost::shared_mutex> >(rw_mutex,unblocked_count,unblocked_count_mutex,unblocked_condition,
+                                                                                    finish_mutex,simultaneous_running_count,max_simultaneous_running));
     }
 
-    boost::thread::sleep(delay(1));
+    boost::thread::sleep(delay(2));
 
     CHECK_LOCKED_VALUE_EQUAL(unblocked_count_mutex,unblocked_count,1U);
 
@@ -143,13 +158,22 @@
     unsigned simultaneous_running_count=0;
     unsigned max_simultaneous_running=0;
     boost::mutex unblocked_count_mutex;
+    boost::condition_variable unblocked_condition;
     boost::mutex finish_mutex;
     boost::mutex::scoped_lock finish_lock(finish_mutex);
     
-    pool.create_thread(locking_thread<boost::shared_lock<boost::shared_mutex> >(rw_mutex,unblocked_count,unblocked_count_mutex,finish_mutex,simultaneous_running_count,max_simultaneous_running));
-    boost::thread::sleep(delay(1));
+    pool.create_thread(locking_thread<boost::shared_lock<boost::shared_mutex> >(rw_mutex,unblocked_count,unblocked_count_mutex,unblocked_condition,
+                                                                                finish_mutex,simultaneous_running_count,max_simultaneous_running));
+    {
+        boost::mutex::scoped_lock lk(unblocked_count_mutex);
+        while(unblocked_count<1)
+        {
+            unblocked_condition.wait(lk);
+        }
+    }
     CHECK_LOCKED_VALUE_EQUAL(unblocked_count_mutex,unblocked_count,1U);
-    pool.create_thread(locking_thread<boost::unique_lock<boost::shared_mutex> >(rw_mutex,unblocked_count,unblocked_count_mutex,finish_mutex,simultaneous_running_count,max_simultaneous_running));
+    pool.create_thread(locking_thread<boost::unique_lock<boost::shared_mutex> >(rw_mutex,unblocked_count,unblocked_count_mutex,unblocked_condition,
+                                                                                finish_mutex,simultaneous_running_count,max_simultaneous_running));
     boost::thread::sleep(delay(1));
     CHECK_LOCKED_VALUE_EQUAL(unblocked_count_mutex,unblocked_count,1U);
 
@@ -171,6 +195,7 @@
     unsigned simultaneous_running_count=0;
     unsigned max_simultaneous_running=0;
     boost::mutex unblocked_count_mutex;
+    boost::condition_variable unblocked_condition;
     boost::mutex finish_mutex;
     boost::mutex::scoped_lock finish_lock(finish_mutex);
 
@@ -178,14 +203,22 @@
 
     for(unsigned i=0;i<reader_count;++i)
     {
-        pool.create_thread(locking_thread<boost::shared_lock<boost::shared_mutex> >(rw_mutex,unblocked_count,unblocked_count_mutex,finish_mutex,simultaneous_running_count,max_simultaneous_running));
+        pool.create_thread(locking_thread<boost::shared_lock<boost::shared_mutex> >(rw_mutex,unblocked_count,unblocked_count_mutex,unblocked_condition,
+                                                                                    finish_mutex,simultaneous_running_count,max_simultaneous_running));
     }
     boost::thread::sleep(delay(1));
     CHECK_LOCKED_VALUE_EQUAL(unblocked_count_mutex,unblocked_count,0U);
 
     write_lock.unlock();
     
-    boost::thread::sleep(delay(1));
+    {
+        boost::mutex::scoped_lock lk(unblocked_count_mutex);
+        while(unblocked_count<reader_count)
+        {
+            unblocked_condition.wait(lk);
+        }
+    }
+
     CHECK_LOCKED_VALUE_EQUAL(unblocked_count_mutex,unblocked_count,reader_count);
 
     finish_lock.unlock();
@@ -204,6 +237,7 @@
     unsigned simultaneous_running_writers=0;
     unsigned max_simultaneous_writers=0;
     boost::mutex unblocked_count_mutex;
+    boost::condition_variable unblocked_condition;
     boost::mutex finish_reading_mutex;
     boost::mutex::scoped_lock finish_reading_lock(finish_reading_mutex);
     boost::mutex finish_writing_mutex;
@@ -214,18 +248,34 @@
 
     for(unsigned i=0;i<reader_count;++i)
     {
-        pool.create_thread(locking_thread<boost::shared_lock<boost::shared_mutex> >(rw_mutex,unblocked_count,unblocked_count_mutex,finish_reading_mutex,simultaneous_running_readers,max_simultaneous_readers));
+        pool.create_thread(locking_thread<boost::shared_lock<boost::shared_mutex> >(rw_mutex,unblocked_count,unblocked_count_mutex,unblocked_condition,
+                                                                                    finish_reading_mutex,simultaneous_running_readers,max_simultaneous_readers));
     }
+    boost::thread::sleep(delay(1));
     for(unsigned i=0;i<writer_count;++i)
     {
-        pool.create_thread(locking_thread<boost::unique_lock<boost::shared_mutex> >(rw_mutex,unblocked_count,unblocked_count_mutex,finish_writing_mutex,simultaneous_running_writers,max_simultaneous_writers));
+        pool.create_thread(locking_thread<boost::unique_lock<boost::shared_mutex> >(rw_mutex,unblocked_count,unblocked_count_mutex,unblocked_condition,
+                                                                                    finish_writing_mutex,simultaneous_running_writers,max_simultaneous_writers));
     }
-    boost::thread::sleep(delay(2));
+    {
+        boost::mutex::scoped_lock lk(unblocked_count_mutex);
+        while(unblocked_count<reader_count)
+        {
+            unblocked_condition.wait(lk);
+        }
+    }
+    boost::thread::sleep(delay(1));
     CHECK_LOCKED_VALUE_EQUAL(unblocked_count_mutex,unblocked_count,reader_count);
 
     finish_reading_lock.unlock();
 
-    boost::thread::sleep(delay(2));
+    {
+        boost::mutex::scoped_lock lk(unblocked_count_mutex);
+        while(unblocked_count<(reader_count+1))
+        {
+            unblocked_condition.wait(lk);
+        }
+    }
     CHECK_LOCKED_VALUE_EQUAL(unblocked_count_mutex,unblocked_count,reader_count+1);
 
     finish_writing_lock.unlock();
@@ -246,12 +296,14 @@
     unsigned simultaneous_running_count=0;
     unsigned max_simultaneous_running=0;
     boost::mutex unblocked_count_mutex;
+    boost::condition_variable unblocked_condition;
     boost::mutex finish_mutex;
     boost::mutex::scoped_lock finish_lock(finish_mutex);
     
     for(unsigned i=0;i<number_of_threads;++i)
     {
-        pool.create_thread(locking_thread<boost::upgrade_lock<boost::shared_mutex> >(rw_mutex,unblocked_count,unblocked_count_mutex,finish_mutex,simultaneous_running_count,max_simultaneous_running));
+        pool.create_thread(locking_thread<boost::upgrade_lock<boost::shared_mutex> >(rw_mutex,unblocked_count,unblocked_count_mutex,unblocked_condition,
+                                                                                     finish_mutex,simultaneous_running_count,max_simultaneous_running));
     }
 
     boost::thread::sleep(delay(1));
@@ -275,6 +327,7 @@
     unsigned simultaneous_running_count=0;
     unsigned max_simultaneous_running=0;
     boost::mutex unblocked_count_mutex;
+    boost::condition_variable unblocked_condition;
     boost::mutex finish_mutex;
     boost::mutex::scoped_lock finish_lock(finish_mutex);
 
@@ -282,10 +335,19 @@
 
     for(unsigned i=0;i<reader_count;++i)
     {
-        pool.create_thread(locking_thread<boost::shared_lock<boost::shared_mutex> >(rw_mutex,unblocked_count,unblocked_count_mutex,finish_mutex,simultaneous_running_count,max_simultaneous_running));
+        pool.create_thread(locking_thread<boost::shared_lock<boost::shared_mutex> >(rw_mutex,unblocked_count,unblocked_count_mutex,unblocked_condition,
+                                                                                    finish_mutex,simultaneous_running_count,max_simultaneous_running));
     }
-    pool.create_thread(locking_thread<boost::upgrade_lock<boost::shared_mutex> >(rw_mutex,unblocked_count,unblocked_count_mutex,finish_mutex,simultaneous_running_count,max_simultaneous_running));
     boost::thread::sleep(delay(1));
+    pool.create_thread(locking_thread<boost::upgrade_lock<boost::shared_mutex> >(rw_mutex,unblocked_count,unblocked_count_mutex,unblocked_condition,
+                                                                                 finish_mutex,simultaneous_running_count,max_simultaneous_running));
+    {
+        boost::mutex::scoped_lock lk(unblocked_count_mutex);
+        while(unblocked_count<(reader_count+1))
+        {
+            unblocked_condition.wait(lk);
+        }
+    }
     CHECK_LOCKED_VALUE_EQUAL(unblocked_count_mutex,unblocked_count,reader_count+1);
 
     finish_lock.unlock();

Modified: branches/proto/v3/more/generic_programming.html
==============================================================================
--- branches/proto/v3/more/generic_programming.html	(original)
+++ branches/proto/v3/more/generic_programming.html	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -3,7 +3,7 @@
 <html>
   <head>
     <meta name="generator" content=
-    "HTML Tidy for Cygwin (vers 1st April 2002), see www.w3.org">
+    "Microsoft FrontPage 5.0">
     <meta http-equiv="Content-Type" content=
     "text/html; charset=windows-1252">
     <meta name="GENERATOR" content="Microsoft FrontPage 4.0">
@@ -57,8 +57,7 @@
     </p>
 
     <blockquote>
-<pre>
-void* memcpy(void* region1, const void* region2, size_t n)
+<pre>void* memcpy(void* region1, const void* region2, size_t n)
 {
   const char* first = (const char*)region2;
   const char* last = ((const char*)region2) + n;
@@ -96,8 +95,7 @@
     </p>
 
     <blockquote>
-<pre>
-template &lt;typename InputIterator, typename OutputIterator&gt;
+<pre>template &lt;typename InputIterator, typename OutputIterator&gt;
 OutputIterator
 copy(InputIterator first, InputIterator last, OutputIterator result)
 {
@@ -116,8 +114,7 @@
     </p>
 
     <blockquote>
-<pre>
-#include &lt;list&gt;
+<pre>#include &lt;list&gt;
 #include &lt;vector&gt;
 #include &lt;iostream&gt;
 
@@ -183,8 +180,7 @@
     looks something like this:</p>
 
     <blockquote>
-<pre>
-template &lt;class Iterator&gt;
+<pre>template &lt;class Iterator&gt;
 struct iterator_traits {
   typedef ... iterator_category;
   typedef ... value_type;
@@ -251,8 +247,7 @@
     for a more detailed description of iterator tags.</p>
 
     <blockquote>
-<pre>
-namespace std {
+<pre>namespace std {
   struct input_iterator_tag { };
   struct bidirectional_iterator_tag { };
   struct random_access_iterator_tag { };
@@ -323,8 +318,7 @@
     itself and generators were a convenient way to produce those types.</p>
 
     <blockquote>
-<pre>
-template &lt;class Predicate, class Iterator, 
+<pre>template &lt;class Predicate, class Iterator, 
     class Value = <i>complicated default</i>,
     class Reference = <i>complicated default</i>,
     class Pointer = <i>complicated default</i>,
@@ -344,8 +338,7 @@
     using the generator is much easier. You can usually just write:</p>
 
     <blockquote>
-<pre>
-boost::filter_iterator_generator&lt;my_predicate,my_base_iterator&gt;::type
+<pre>boost::filter_iterator_generator&lt;my_predicate,my_base_iterator&gt;::type
 </pre>
     </blockquote>
 
@@ -364,8 +357,7 @@
     <p>For example, given:</p>
 
     <blockquote>
-<pre>
-struct widget {
+<pre>struct widget {
   void tweak(int);
 };
 std::vector&lt;widget *&gt; widget_ptrs;
@@ -378,8 +370,7 @@
     we can easily tweak all widgets: 
 
     <blockquote>
-<pre>
-void tweak_all_widgets1(int arg)
+<pre>void tweak_all_widgets1(int arg)
 {
    for_each(widget_ptrs.begin(), widget_ptrs.end(),
       <b>bind2nd</b>(std::<b>mem_fun</b>(&amp;widget::tweak), arg));
@@ -391,8 +382,7 @@
     this:</p>
 
     <blockquote>
-<pre>
-void tweak_all_widgets2(int arg)
+<pre>void tweak_all_widgets2(int arg)
 {
    for_each(struct_ptrs.begin(), struct_ptrs.end(),
       <b>std::binder2nd&lt;std::mem_fun1_t&lt;void, widget, int&gt; &gt;</b>(
@@ -449,26 +439,13 @@
     <hr>
 
     <p>Revised 
-    <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %b %Y" startspan -->18
-    August 2004<!--webbot bot="Timestamp" endspan i-checksum="14885" -->
+    <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %b %Y" startspan -->06 Nov 2007<!--webbot bot="Timestamp" endspan i-checksum="15272" -->
     </p>
 
-    <p>&copy; Copyright David Abrahams 2001. Permission to copy, use, modify,
-    sell and distribute this document is granted provided this copyright
-    notice appears in all copies. This document is provided "as is" without
-    express or implied warranty, and with no claim as to its suitability for
-    any purpose. 
-    <!--  LocalWords:  HTML html charset gif alt htm struct SGI namespace std libs
-                     -->
-     
-    <!--  LocalWords:  InputIterator BidirectionalIterator RandomAccessIterator pdf
-                     -->
-     
-    <!--  LocalWords:  typename Alexandrescu templated Andrei's Abrahams memcpy int
-                     -->
-     <!--  LocalWords:  const OutputIterator iostream pre cpl
-                     -->
-    </p>
-  </body>
-</html>
+    <p>© Copyright David Abrahams 2001.</p>
 
+<p>Distributed under the Boost Software License, Version 1.0. See
+www.boost.org/LICENSE_1_0.txt</p>
+
+  </body>
+</html>
\ No newline at end of file

Modified: branches/proto/v3/more/regression.html
==============================================================================
--- branches/proto/v3/more/regression.html	(original)
+++ branches/proto/v3/more/regression.html	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -5,5 +5,14 @@
 <body>
 Automatically loading index page... if nothing happens, please go to
 <a href="../tools/regression/index.htm">http://www.boost.org/tools/regression/index.htm>.
+<hr>
+
+<p>© Copyright Douglas Gregor, 2005</p>
+
+<p>Distributed under the Boost Software License, Version 1.0. See
+www.boost.org/LICENSE_1_0.txt</p>
+
+<p>&nbsp;</p>
+<p>&nbsp;</p>
 </body>
-</html>
+</html>
\ No newline at end of file

Modified: branches/proto/v3/status/explicit-failures-markup.xml
==============================================================================
--- branches/proto/v3/status/explicit-failures-markup.xml	(original)
+++ branches/proto/v3/status/explicit-failures-markup.xml	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -1687,7 +1687,6 @@
             <toolset name="gcc-3.3*"/>
             <toolset name="mipspro"/>
             <toolset name="acc*"/>
-            <toolset name="hp_cxx*"/>
             <note author="Ion Gazta&#241;aga">
                 The compiler does not support features that are essential for the library.
             </note>
@@ -1707,7 +1706,6 @@
             <toolset name="gcc-3.2*"/>
             <toolset name="gcc-3.3*"/>
             <toolset name="mipspro"/>
-            <toolset name="hp_cxx*"/>
             <note author="Ion Gazta&#241;aga">
                 The compiler does not support features that are essential for the library.
             </note>
@@ -4663,6 +4661,14 @@
           </note>
        </mark-expected-failures>
        <mark-expected-failures>
+          <test name="tky_partial_spec_test"/>
+          <toolset name="sun-5.9"/>
+          <note author="John Maddock">
+             This fails with an internal compiler error,
+             there is no workaround as yet.
+          </note>
+       </mark-expected-failures>
+       <mark-expected-failures>
             <test name="tricky_function_type_test"/>
             <test name="is_const_test"/>
             <test name="is_volatile_test"/>
@@ -5127,6 +5133,7 @@
           <test name="test_random"/>
           <test name="std_test_random"/>
           <toolset name="sun-5.8"/>
+          <toolset name="sun-5.9"/>
 
           <note author="John Maddock">
              These failures appear to represent a genuine issue with the
@@ -5144,6 +5151,14 @@
           </note>
        </mark-expected-failures>
        <mark-expected-failures>
+          <test name="tr1_tky_partial_spec_test"/>
+          <toolset name="sun-5.9"/>
+          <note author="John Maddock">
+             This fails with an internal compiler error: there's no
+             workaround as yet.
+          </note>
+       </mark-expected-failures>
+       <mark-expected-failures>
           <test name="test_boost"/>
           <test name="test_hash"/>
           <test name="test_random"/>

Modified: branches/proto/v3/tools/build/v2/tools/pathscale.jam
==============================================================================
--- branches/proto/v3/tools/build/v2/tools/pathscale.jam	(original)
+++ branches/proto/v3/tools/build/v2/tools/pathscale.jam	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -112,6 +112,7 @@
 flags pathscale.link FINDLIBS-ST <find-static-library> ;
 flags pathscale.link FINDLIBS-SA <find-shared-library> ;
 flags pathscale.link FINDLIBS-SA <threading>multi : pthread ;
+flags pathscale.link FINDLIBS-SA <threading>multi : rt ;
 flags pathscale.link LIBRARIES <library-file> ;
 flags pathscale.link LINK-RUNTIME <runtime-link>static : static ;
 flags pathscale.link LINK-RUNTIME <runtime-link>shared : dynamic ;

Modified: branches/proto/v3/tools/inspect/inspect.cpp
==============================================================================
--- branches/proto/v3/tools/inspect/inspect.cpp	(original)
+++ branches/proto/v3/tools/inspect/inspect.cpp	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -84,6 +84,25 @@
   typedef std::vector< error_msg > error_msg_vector;
   error_msg_vector msgs;
 
+//  get info (as a string) if inspect_root is svn working copy  --------------//
+
+  string info( const fs::path & inspect_root )
+  {
+    string rev;
+    string repos;
+    fs::path entries( inspect_root / ".svn" / "entries" );
+    fs::ifstream entries_file( entries );
+    if ( entries_file )
+    {
+      std::getline( entries_file, rev );
+      std::getline( entries_file, rev );
+      std::getline( entries_file, rev );
+      std::getline( entries_file, rev );    // revision number as a string
+      std::getline( entries_file, repos );  // repository as a string
+    }
+    return repos + " at revision " + rev;
+  }
+
 //  visit_predicate (determines which directories are visited)  --------------//
 
   typedef bool(*pred_type)(const path&);
@@ -629,6 +648,7 @@
 
   string inspector_keys;
   fs::initial_path();
+  
 
   {
 
@@ -681,8 +701,7 @@
         "\n"
         "An inspection program <http://www.boost.org/tools/inspect/index.html>\n"
         "checks each file in the current Boost CVS for various problems,\n"
-        "generating this as output. Problems detected include tabs in files,\n"
-        "missing copyrights, broken URL's, and similar misdemeanors.\n"
+        "generating an HTML page as output.\n"
         "\n"
       ;
 
@@ -709,21 +728,24 @@
       // we should not use a table, of course [gps]
       "<table>\n"
       "<tr>\n"
-      "<td><img src=\"../boost.png\" alt=\"Boost logo\" />"
+      "<td><img src=\"http://www.boost.org/boost.png\" alt=\"Boost logo\" />"
       "</td>\n"
       "<td>\n"
       "<h1>Boost Inspection Report</h1>\n"
       "<b>Run Date:</b> " << run_date  << "\n"
-      "&nbsp;&nbsp;/ " << validator_link( "validate me" ) << " /\n"
+      //"&nbsp;&nbsp;/ " << validator_link( "validate me" ) << " /\n"
       "</td>\n"
       "</tr>\n"
       "</table>\n"
 
-      "<p>An <a href=\"http://www.boost.org/tools/inspect/index.html\">inspection\n"
-      "program</a> checks each file in the current Boost CVS for various problems,\n"
-      "generating this web page as output. Problems detected include tabs in files,\n"
-      "missing copyrights, broken URL's, and similar misdemeanors.</p>\n"
+      "<p>This report is generated by an <a href=\"http://www.boost.org/tools/inspect/index.html\">inspection\n"
+      "program</a> that checks files for the problems noted below.</p>\n"
       ;
+    std::cout
+      << "<p>The files checked were from "
+      << info( fs::initial_path() )
+      << ".</p>\n";
+
 
     std::cout
       << "<h2>Totals</h2>\n<pre>"
@@ -736,7 +758,7 @@
         itr != inspectors.end(); ++itr )
   {
     const string line_break (
-        display_text == display_format? "\n" : "<br />\n"); // gps
+        display_text == display_format? "\n" : "<br>\n"); // gps
 
     inspector_keys += static_cast<string>("  ")
         + itr->inspector->name()

Modified: branches/proto/v3/tools/regression/index.htm
==============================================================================
--- branches/proto/v3/tools/regression/index.htm	(original)
+++ branches/proto/v3/tools/regression/index.htm	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -5,7 +5,7 @@
 <meta http-equiv="Content-Type"
 content="text/html; charset=iso-8859-1">
 <meta name="ProgId" content="FrontPage.Editor.Document">
-<meta name="GENERATOR" content="Microsoft FrontPage Express 2.0">
+<meta name="GENERATOR" content="Microsoft FrontPage 5.0">
 <title>Regression Test Reporting Tools</title>
 </head>
 
@@ -42,7 +42,12 @@
 <hr>
 
 <p>Revised <!--webbot bot="Timestamp" startspan s-type="EDITED"
-s-format="%d %B, %Y" -->09 January, 2003<!--webbot bot="Timestamp"
-i-checksum="38582" endspan --></p>
+s-format="%d %B, %Y" -->06 November, 2007<!--webbot bot="Timestamp"
+i-checksum="39367" endspan --></p>
+<p>© Copyright Beman Dawes 2003</p>
+
+<p>Distributed under the Boost Software License, Version 1.0. See
+www.boost.org/LICENSE_1_0.txt</p>
+
 </body>
-</html>
+</html>
\ No newline at end of file

Modified: branches/proto/v3/tools/regression/src/regression.py
==============================================================================
--- branches/proto/v3/tools/regression/src/regression.py	(original)
+++ branches/proto/v3/tools/regression/src/regression.py	2007-11-06 15:13:21 EST (Tue, 06 Nov 2007)
@@ -101,7 +101,8 @@
         opt.add_option( '--smtp-login',
             help="STMP server address/login information, in the following form: <user>:<password>@<host>[:<port>]" )
         opt.add_option( '--skip-tests',
-            help="do not run bjam; used for testing script changes" )
+            help="do not run bjam; used for testing script changes",
+            action='store_true' )
         
         #~ Defaults
         self.runner = None