From 57fd7ea3a2030409c7127f73f781c7c02ddb46aa Mon Sep 17 00:00:00 2001 From: Aleksey Gurtovoy Date: Mon, 28 Aug 2006 07:40:23 +0000 Subject: [PATCH] Get rid of temporary files [SVN r34981] --- doc/src/refmanual/concepts.gen | 23 ---- doc/src/refmanual/index.gen | 150 ----------------------- doc/src/refmanual/transform.rst.~1.1.~ | 157 ------------------------- 3 files changed, 330 deletions(-) delete mode 100644 doc/src/refmanual/concepts.gen delete mode 100644 doc/src/refmanual/index.gen delete mode 100644 doc/src/refmanual/transform.rst.~1.1.~ diff --git a/doc/src/refmanual/concepts.gen b/doc/src/refmanual/concepts.gen deleted file mode 100644 index a58d094..0000000 --- a/doc/src/refmanual/concepts.gen +++ /dev/null @@ -1,23 +0,0 @@ -* |Associative Sequence| -* |Back Extensible Sequence| -* |Bidirectional Iterator| -* |Bidirectional Sequence| -* |Extensible Associative Sequence| -* |Extensible Sequence| -* |Forward Iterator| -* |Forward Sequence| -* |Front Extensible Sequence| -* |Inserter| -* |Integral Constant| -* |Integral Sequence Wrapper| -* |Lambda Expression| -* |Metafunction| -* |Metafunction Class| -* |Numeric Metafunction| -* |Placeholder Expression| -* |Random Access Iterator| -* |Random Access Sequence| -* |Reversible Algorithm| -* |Tag Dispatched Metafunction| -* |Trivial Metafunction| -* |Variadic Sequence| diff --git a/doc/src/refmanual/index.gen b/doc/src/refmanual/index.gen deleted file mode 100644 index 5021c72..0000000 --- a/doc/src/refmanual/index.gen +++ /dev/null @@ -1,150 +0,0 @@ -* |BOOST_MPL_ASSERT| -* |BOOST_MPL_ASSERT_MSG| -* |BOOST_MPL_ASSERT_NOT| -* |BOOST_MPL_ASSERT_RELATION| -* |BOOST_MPL_AUX_LAMBDA_SUPPORT| -* |BOOST_MPL_CFG_NO_HAS_XXX| -* |BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS| -* |BOOST_MPL_HAS_XXX_TRAIT_DEF| -* |BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF| -* |BOOST_MPL_LIMIT_LIST_SIZE| -* |BOOST_MPL_LIMIT_MAP_SIZE| -* |BOOST_MPL_LIMIT_METAFUNCTION_ARITY| -* |BOOST_MPL_LIMIT_SET_SIZE| -* |BOOST_MPL_LIMIT_UNROLLING| -* |BOOST_MPL_LIMIT_VECTOR_SIZE| -* |_1,_2,..._n| -* |accumulate| -* |advance| -* |always| -* |and_| -* |apply| -* |apply_wrap| -* |arg| -* |at| -* |at_c| -* |back| -* |back_inserter| -* |begin| -* |bind| -* |bitand_| -* |bitor_| -* |bitxor_| -* |bool_| -* |clear| -* |contains| -* |copy| -* |copy_if| -* |count| -* |count_if| -* |deque| -* |deref| -* |distance| -* |divides| -* |empty| -* |empty_base| -* |empty_sequence| -* |end| -* |equal| -* |equal_to| -* |erase| -* |erase_key| -* |eval_if| -* |eval_if_c| -* |filter_view| -* |find| -* |find_if| -* |fold| -* |for_each| -* |front| -* |front_inserter| -* |greater| -* |greater_equal| -* |has_key| -* |identity| -* |if_| -* |if_c| -* |inherit| -* |inherit_linearly| -* |insert| -* |insert_range| -* |inserter| -* |int_| -* |integral_c| -* |is_sequence| -* |iter_fold| -* |iterator_category| -* |iterator_range| -* |joint_view| -* |key_type| -* |lambda| -* |less| -* |less_equal| -* |list| -* |list_c| -* |long_| -* |lower_bound| -* |map| -* |max| -* |max_element| -* |min| -* |min_element| -* |minus| -* |modulus| -* |negate| -* |next| -* |not_| -* |not_equal_to| -* |numeric_cast| -* |or_| -* |order| -* |pair| -* |partition| -* |plus| -* |pop_back| -* |pop_front| -* |prior| -* |protect| -* |push_back| -* |push_front| -* |quote| -* |range_c| -* |remove| -* |remove_if| -* |replace| -* |replace_if| -* |reverse| -* |reverse_copy| -* |reverse_copy_if| -* |reverse_fold| -* |reverse_iter_fold| -* |reverse_partition| -* |reverse_remove| -* |reverse_remove_if| -* |reverse_replace| -* |reverse_replace_if| -* |reverse_stable_partition| -* |reverse_transform| -* |reverse_unique| -* |sequence_tag| -* |set| -* |set_c| -* |shift_left| -* |shift_right| -* |single_view| -* |size| -* |size_t| -* |sizeof_| -* |sort| -* |stable_partition| -* |times| -* |transform| -* |transform_view| -* |unique| -* |unpack_args| -* |upper_bound| -* |value_type| -* |vector| -* |vector_c| -* |void_| -* |zip_view| diff --git a/doc/src/refmanual/transform.rst.~1.1.~ b/doc/src/refmanual/transform.rst.~1.1.~ deleted file mode 100644 index 0912114..0000000 --- a/doc/src/refmanual/transform.rst.~1.1.~ +++ /dev/null @@ -1,157 +0,0 @@ -.. Algorithms/Transformation Algorithms//transform |30 - -transform -========= - -Synopsis --------- - -.. parsed-literal:: - - template< - typename Seq - , typename Op - , typename In = |unspecified| - > - struct transform - { - typedef |unspecified| type; - }; - - template< - typename Seq1 - , typename Seq2 - , typename BinaryOp - , typename In = |unspecified| - > - struct transform - { - typedef |unspecified| type; - }; - - -Description ------------ - -``transform`` is an |overloaded name|: - -* ``transform`` returns a transformed copy of the original sequence - produced by applying an unary transformation ``Op`` to every element - in the |begin/end| range. - -* ``transform`` returns a new sequence produced by applying a - binary transformation ``BinaryOp`` to a pair of elements (e\ :sub:`1`, e2\ :sub:`1`) - from the corresponding |begin/end| and |begin/end| ranges. - -|transformation algorithm disclaimer| - - -Header ------- - -.. parsed-literal:: - - #include - - -Model of --------- - -|Reversible Algorithm| - - -Parameters ----------- - -+-------------------+-----------------------------------+-----------------------------------+ -| Parameter | Requirement | Description | -+===================+===================================+===================================+ -| ``Sequence``, | |Forward Sequence| | Sequences to transform. | -| ``Seq1``, ``Seq2``| | | -+-------------------+-----------------------------------+-----------------------------------+ -| ``Op``, | |Lambda Expression| | A transformation. | -| ``BinaryOp`` | | | -+-------------------+-----------------------------------+-----------------------------------+ -| ``In`` | |Inserter| | An inserter. | -+-------------------+-----------------------------------+-----------------------------------+ - - -Expression semantics --------------------- - -|Semantics disclaimer...| |Reversible Algorithm|. - -For any |Forward Sequence|\ s ``s``, ``s1`` and ``s2``, |Lambda Expression|\ s ``op`` and ``op2``, -and an |Inserter| ``in``: - -.. parsed-literal:: - - typedef transform::type r; - -:Return type: - A type. - -:Postcondition: - Equivalent to - - .. parsed-literal:: - - typedef lambda::type f; - typedef lambda::type in_op; - - typedef fold< - s - , in::state - , bind< in_op, _1, bind > - >::type r; - - -.. parsed-literal:: - - typedef transform::type r; - -:Return type: - A type. - -:Postcondition: - Equivalent to - - .. parsed-literal:: - - typedef lambda::type f; - typedef lambda::type in_op; - - typedef fold< - pair_view - , in::state - , bind< - in_op - , _1 - , bind,_2>, bind,_2> > - > - >::type r; - - -Complexity ----------- - -Linear. Exactly ``size::value`` / ``size::value`` applications of -``op`` / ``op2`` and ``in::operation``. - - -Example -------- - -.. parsed-literal:: - - typedef vector types; - typedef vector pointers; - typedef transform< types,boost::add_pointer<_1> >::type result; - - BOOST_MPL_ASSERT(( equal )); - - -See also --------- - -|Transformation Algorithms|, |Reversible Algorithm|, |reverse_transform|, |copy|, |replace_if|