- b -

• base : chapter7::zip_iterator< IteratorSeq, Category >, exercise_7_7::reverse_iterator< ForwardIt >

- c -

• category : chapter5::tiny_iterator< Tiny, Pos >, chapter7::permutation_iterator< CurIdxIter, SeqBegin >, chapter7::zip_iterator< IteratorSeq, Category >, exercise_5_10::inorder_view< T >, exercise_5_6::dimensions_iterator< S >, exercise_5_7::dimensions_b_iterator< S >, exercise_5_8::fibonacci_series_iterator< N, LastN >, exercise_6_1::binary< N >, exercise_7_7::reverse_iterator< ForwardIt >
• current_index_iter : chapter7::permutation_iterator< CurIdxIter, SeqBegin >
• current_tree : exercise_5_10::inorder_view_iterator< Cur, Parent, VisitCount >

- d -

• dist_to_begin : exercise_5_1::double_first_half_impl< S, Res, Cur >
• dist_to_end : exercise_5_1::double_first_half_impl< S, Res, Cur >

- e -

• end_iterator : boost::mpl::rend< Sequence >

- f -

• first_iterator : boost::mpl::rbegin< Sequence >
• func_type : exercise_2_1::cpp20::replace_type< Cr(*)(CArgs...), X, Y >

- i -

• indices : chapter7::permutation_view< Indices, Sequence >

- m -

• multiply_or_not : exercise_5_1::double_first_half_impl< S, Res, Cur >

- n -

• next : exercise_5_7::dimensions_b_impl< T, Next >, exercise_5_7::dimensions_b_impl< T[N], Next >
• non_bidirectional_iterators : chapter7::least_refined_iterator_category< S >
• non_random_access_iterators : chapter7::least_refined_iterator_category< S >

- o -

• operation : exercise_6_0::replace_with_smaller< State, Operation >, exercise_6_3::binary_tree_inserter< S, Op >
• orig_sequence : chapter7::permutation_view< Indices, Sequence >

- p -

• parent_iterator : exercise_5_10::inorder_view_iterator< Cur, Parent, VisitCount >
• prev : exercise_5_7::dimensions_b_impl< T, Next >, exercise_5_7::dimensions_b_impl< T[N], Next >

- r -

• ret_type : exercise_2_1::cpp20::replace_type< Cr(*)(CArgs...), X, Y >

- s -

• sequence_begin : chapter7::permutation_iterator< CurIdxIter, SeqBegin >
• state : exercise_6_0::replace_with_smaller< State, Operation >, exercise_6_3::binary_tree_inserter< S, Op >

- t -

• t0 : chapter5::tiny< T0, T1, T2 >
• t1 : chapter5::tiny< T0, T1, T2 >
• t2 : chapter5::tiny< T0, T1, T2 >
• tag : chapter5::tiny< T0, T1, T2 >, chapter5::tree< Cur, L, R >, chapter7::permutation_view< Indices, Sequence >, chapter7::zip_view< Sequences >, exercise_5_10::inorder_view< T >, exercise_5_6::dimensions< T[N]>, exercise_5_7::dimensions_b_impl< T, Next >, exercise_5_7::dimensions_b_impl< T[N], Next >, exercise_5_8::fibonacci_series, exercise_6_1::binary< N >
• tail : exercise_5_6::dimensions< T[N]>
• tree_root : exercise_5_10::inorder_view< T >
• type : boost::mpl::advance< chapter5::tiny_iterator< Tiny, Pos >, N >, boost::mpl::advance< chapter7::zip_iterator< IteratorSeq, random_access_iterator_tag >, N >, boost::mpl::at_impl< chapter7::zip_view_tag >::apply_impl< S, random_access_iterator_tag, N >, boost::mpl::begin_impl< chapter5::tiny_tag >::apply, boost::mpl::begin_impl< exercise_5_6::dimensions_tag >::apply, boost::mpl::begin_impl< exercise_5_7::dimensions_b_tag >::apply, boost::mpl::begin_impl< exercise_5_8::fibonacci_series_tag >::apply, boost::mpl::begin_impl< exercise_6_1::binary_tag >::apply< exercise_6_1::binary< N > >, boost::mpl::deref< exercise_5_10::inorder_view_iterator< chapter5::tree< Cur, L, R >, Parent, VisitCount > >, boost::mpl::deref< exercise_5_10::inorder_view_iterator< Cur, Parent, VisitCount > >, boost::mpl::deref< exercise_5_6::dimensions_iterator< S > >, boost::mpl::deref< exercise_6_1::binary< N > >, boost::mpl::end_impl< chapter5::tiny_tag >::apply, boost::mpl::end_impl< exercise_5_6::dimensions_tag >::apply, boost::mpl::end_impl< exercise_5_7::dimensions_b_tag >::apply, boost::mpl::end_impl< exercise_6_1::binary_tag >::apply< exercise_6_1::binary< N > >, boost::mpl::next< chapter5::tiny_iterator< Tiny, Pos > >, boost::mpl::next< chapter7::zip_iterator< IteratorSeq, Category > >, boost::mpl::next< exercise_5_6::dimensions_iterator< S > >, boost::mpl::next< exercise_5_7::dimensions_b_iterator< S > >, boost::mpl::next< exercise_5_8::fibonacci_series_iterator< N, LastN > >, boost::mpl::next< exercise_6_1::binary< N > >, boost::mpl::pop_back_impl< exercise_5_7::dimensions_b_tag >::apply< exercise_5_7::dimensions_b< T[N]> >, boost::mpl::prior< chapter5::tiny_iterator< Tiny, Pos > >, boost::mpl::prior< chapter7::zip_iterator< IteratorSeq, Category > >, boost::mpl::prior< exercise_5_7::dimensions_b_iterator< S > >, boost::mpl::prior< exercise_5_8::fibonacci_series_iterator< 1, 1 > >, boost::mpl::prior< exercise_5_8::fibonacci_series_iterator< N, LastN > >, boost::mpl::push_back_impl< chapter5::tree_tag >::apply< chapter5::tree<>, New >, boost::mpl::push_back_impl< chapter5::tree_tag >::apply< void_, New >, boost::mpl::push_back_impl< exercise_5_7::dimensions_b_tag >::apply_num< exercise_5_7::dimensions_b< T >, N >, boost::mpl::rbegin< Sequence >, boost::mpl::rend< Sequence >, chapter4::undefined_false< true >, chapter4::undefined_true< false >, chapter5::tiny< T0, T1, T2 >, chapter5::tiny_at< Tiny, 0 >, chapter5::tiny_at< Tiny, 1 >, chapter5::tiny_at< Tiny, 2 >, chapter5::tree< Cur, L, R >, chapter7::extract_iterator_category< S >, chapter7::least_refined_iterator_category< S >, chapter7::permutation_iterator< CurIdxIter, SeqBegin >, exercise_2_0::no_boost::add_const_ref_impl< T, IsRef >, exercise_2_0::no_boost::add_const_ref_impl< T, true >, exercise_2_0::with_boost::add_const_ref< T >, exercise_2_1::cpp20::replace_type< C &, X, Y >, exercise_2_1::cpp20::replace_type< C *, X, Y >, exercise_2_1::cpp20::replace_type< C[N], X, Y >, exercise_2_1::cpp20::replace_type< Cr(*)(CArgs...), X, Y >, exercise_2_1::cpp20::replace_type_dispatch< C, X, Y, false >, exercise_2_1::cpp20::replace_type_dispatch< C, X, Y, true >, exercise_2_1::replace_type< C &, X, Y >, exercise_2_1::replace_type< C *, X, Y >, exercise_2_1::replace_type< C[N], X, Y >, exercise_2_1::replace_type< Cr(*)(), X, Y >, exercise_2_1::replace_type< Cr(*)(C0), X, Y >, exercise_2_1::replace_type< Cr(*)(C0, C1), X, Y >, exercise_2_1::replace_type_dispatch< C, X, Y, false >, exercise_2_1::replace_type_dispatch< C, X, Y, true >, exercise_5_10::inorder_view_iterator< Cur, Parent, VisitCount >, exercise_5_1::double_first_half_impl< S, Res, Cur >, exercise_5_6::dimensions< T[N]>, exercise_5_7::begin_impl_traversal< S, boost::mpl::void_ >, exercise_6_0::find_smaller< no_type, T2 >, exercise_6_1::binary< N >::apply_binary_digit< T1, binary< N2 > >, exercise_6_1::binary< N >, exercise_6_4::tree_end, exercise_7_7::reverse_iterator< ForwardIt >