|
|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r66024 - sandbox/itl/libs/itl/doc
From: afojgo_at_[hidden]
Date: 2010-10-16 13:30:34
Author: jofaber
Date: 2010-10-16 13:30:30 EDT (Sat, 16 Oct 2010)
New Revision: 66024
URL: http://svn.boost.org/trac/boost/changeset/66024
Log:
Updated documentation: Section Interface. Modified table function synopsis. Renaming for 'icl'. Fixed links that were broken after renaming.
Text files modified:
sandbox/itl/libs/itl/doc/functions.qbk | 6
sandbox/itl/libs/itl/doc/functions_addition.qbk | 20 ++--
sandbox/itl/libs/itl/doc/functions_cons_copy_dest.qbk | 2
sandbox/itl/libs/itl/doc/functions_containedness.qbk | 2
sandbox/itl/libs/itl/doc/functions_element_iteration.qbk | 4
sandbox/itl/libs/itl/doc/functions_equivs_orderings.qbk | 4
sandbox/itl/libs/itl/doc/functions_erasure.qbk | 6
sandbox/itl/libs/itl/doc/functions_insertion.qbk | 6
sandbox/itl/libs/itl/doc/functions_intersection.qbk | 10 +-
sandbox/itl/libs/itl/doc/functions_iterator_related.qbk | 4
sandbox/itl/libs/itl/doc/functions_range.qbk | 2
sandbox/itl/libs/itl/doc/functions_selection.qbk | 4
sandbox/itl/libs/itl/doc/functions_size.qbk | 2
sandbox/itl/libs/itl/doc/functions_streaming.qbk | 2
sandbox/itl/libs/itl/doc/functions_subtraction.qbk | 10 +-
sandbox/itl/libs/itl/doc/functions_symmetric_difference.qbk | 8
sandbox/itl/libs/itl/doc/implementation.qbk | 12 +-
sandbox/itl/libs/itl/doc/interface.qbk | 161 +++++++++++++++++++--------------------
sandbox/itl/libs/itl/doc/introduction.qbk | 9 +
sandbox/itl/libs/itl/doc/itl.qbk | 41 +++++----
sandbox/itl/libs/itl/doc/projects.qbk | 2
sandbox/itl/libs/itl/doc/semantics.qbk | 4
22 files changed, 159 insertions(+), 162 deletions(-)
Modified: sandbox/itl/libs/itl/doc/functions.qbk
==============================================================================
--- sandbox/itl/libs/itl/doc/functions.qbk (original)
+++ sandbox/itl/libs/itl/doc/functions.qbk 2010-10-16 13:30:30 EDT (Sat, 16 Oct 2010)
@@ -9,7 +9,7 @@
[section Function Reference]
-Section [link boost_itl.interface.function_synopsis Function Synopsis]
+Section [link boost_icl.interface.function_synopsis Function Synopsis]
above gave an overview of the polymorphic functions of the itl.
This is what you will need to find the desired possibilities to combine itl
functions and objects most of the time.
@@ -28,7 +28,7 @@
[h5 Placeholders]
For a concise representation the same __eiS_phs__ will be used that have been
-introduced in section [link boost_itl.interface.function_synopsis Function Synopsis].
+introduced in section [link boost_icl.interface.function_synopsis Function Synopsis].
[h5 More specific function documentation]
@@ -76,7 +76,7 @@
The possible types that can be instantiated for `T` and `P`
are element, interval and container types abbreviated by
placeholders that are defined
-[link boost_itl.interface.function_synopsis here]
+[link boost_icl.interface.function_synopsis here]
and can be summarized as
__s : element set, __S : interval sets, __e : elements, __i : intervals\n
Modified: sandbox/itl/libs/itl/doc/functions_addition.qbk
==============================================================================
--- sandbox/itl/libs/itl/doc/functions_addition.qbk (original)
+++ sandbox/itl/libs/itl/doc/functions_addition.qbk 2010-10-16 13:30:30 EDT (Sat, 16 Oct 2010)
@@ -39,15 +39,15 @@
for element maps and /aggregate on overlap/ for interval maps.
Find more on
- [link boost_itl.concepts.addability__subtractability_and_aggregate_on_overlap ['addability of maps]]
+ [link boost_icl.concepts.addability__subtractability_and_aggregate_on_overlap ['addability of maps]]
and related
- [link boost_itl.semantics.maps ['semantic issues]]
+ [link boost_icl.semantics.maps ['semantic issues]]
following the links.
Examples, demonstrating Addition on interval containers are
- [link boost_itl.examples.overlap_counter ['overlap counter]],
- [link boost_itl.examples.party ['party]] and
- [link boost_itl.examples.partys_height_average ['party's height average.]]
+ [link boost_icl.examples.overlap_counter ['overlap counter]],
+ [link boost_icl.examples.party ['party]] and
+ [link boost_icl.examples.partys_height_average ['party's height average.]]
]]
]
@@ -142,7 +142,7 @@
Within each group all combinations of types are supported
for an operation, that are in line with the *itl's*
design and the sets of laws, that establish the *itl's*
-[link boost_itl.semantics semantics].
+[link boost_icl.semantics semantics].
Overloads between /element containers/ and /interval containers/
@@ -203,7 +203,7 @@
Since the implementation of
element and interval containers is based on the
-[link boost_itl.implementation link red-black tree implementation]
+[link boost_icl.implementation link red-black tree implementation]
of std::AssociativeContainers, we have a logarithmic complexity for
addition of elements.
Addition of intervals or interval value pairs is amortized logarithmic
@@ -243,15 +243,15 @@
['*See also . . .*]
[table
[]
-[[[link boost_itl.function_reference.subtraction ['*Subtraction*]] ]]
-[[[link boost_itl.function_reference.insertion ['*Insertion*]] ]]
+[[[link boost_icl.function_reference.subtraction ['*Subtraction*]] ]]
+[[[link boost_icl.function_reference.insertion ['*Insertion*]] ]]
]
['*Back to section . . .*]
[table
[]
[[[link function_synopsis_table ['*Function Synopsis*]] ]]
-[[[link boost_itl.interface ['*Interface*]] ]]
+[[[link boost_icl.interface ['*Interface*]] ]]
]
[endsect][/ Addition]
Modified: sandbox/itl/libs/itl/doc/functions_cons_copy_dest.qbk
==============================================================================
--- sandbox/itl/libs/itl/doc/functions_cons_copy_dest.qbk (original)
+++ sandbox/itl/libs/itl/doc/functions_cons_copy_dest.qbk 2010-10-16 13:30:30 EDT (Sat, 16 Oct 2010)
@@ -98,7 +98,7 @@
[table
[]
[[[link function_synopsis_table ['*Function Synopsis*]]]]
-[[[link boost_itl.interface ['*Interface*]] ]]
+[[[link boost_icl.interface ['*Interface*]] ]]
]
Modified: sandbox/itl/libs/itl/doc/functions_containedness.qbk
==============================================================================
--- sandbox/itl/libs/itl/doc/functions_containedness.qbk (original)
+++ sandbox/itl/libs/itl/doc/functions_containedness.qbk 2010-10-16 13:30:30 EDT (Sat, 16 Oct 2010)
@@ -122,7 +122,7 @@
[table
[]
[[[link function_synopsis_table ['*Function Synopsis*]]]]
-[[[link boost_itl.interface ['*Interface*]] ]]
+[[[link boost_icl.interface ['*Interface*]] ]]
]
[endsect][/ Containedness]
Modified: sandbox/itl/libs/itl/doc/functions_element_iteration.qbk
==============================================================================
--- sandbox/itl/libs/itl/doc/functions_element_iteration.qbk (original)
+++ sandbox/itl/libs/itl/doc/functions_element_iteration.qbk 2010-10-16 13:30:30 EDT (Sat, 16 Oct 2010)
@@ -78,14 +78,14 @@
['*See also . . .*]
[table
[]
-[[[link boost_itl.function_reference.iterator_related ['*Segment iteration*]] ]]
+[[[link boost_icl.function_reference.iterator_related ['*Segment iteration*]] ]]
]
['*Back to section . . .*]
[table
[]
[[[link function_synopsis_table ['*Function Synopsis*]]]]
-[[[link boost_itl.interface ['*Interface*]] ]]
+[[[link boost_icl.interface ['*Interface*]] ]]
]
[endsect][/ Element iteration]
Modified: sandbox/itl/libs/itl/doc/functions_equivs_orderings.qbk
==============================================================================
--- sandbox/itl/libs/itl/doc/functions_equivs_orderings.qbk (original)
+++ sandbox/itl/libs/itl/doc/functions_equivs_orderings.qbk 2010-10-16 13:30:30 EDT (Sat, 16 Oct 2010)
@@ -113,13 +113,13 @@
['*See also . . .*]
[table
[]
-[[[link boost_itl.semantics.orderings_and_equivalences ['*Semantics*]]]]
+[[[link boost_icl.semantics.orderings_and_equivalences ['*Semantics*]]]]
]
['*Back to section . . .*]
[table
[]
[[[link function_synopsis_table ['*Function Synopsis*]]]]
-[[[link boost_itl.interface ['*Interface*]] ]]
+[[[link boost_icl.interface ['*Interface*]] ]]
]
[endsect][/ Equivalences and Orderings]
Modified: sandbox/itl/libs/itl/doc/functions_erasure.qbk
==============================================================================
--- sandbox/itl/libs/itl/doc/functions_erasure.qbk (original)
+++ sandbox/itl/libs/itl/doc/functions_erasure.qbk 2010-10-16 13:30:30 EDT (Sat, 16 Oct 2010)
@@ -158,15 +158,15 @@
['*See also . . .*]
[table
[]
-[[[link boost_itl.function_reference.insertion ['*Insertion*]] ]]
-[[[link boost_itl.function_reference.subtraction ['*Subtraction*]] ]]
+[[[link boost_icl.function_reference.insertion ['*Insertion*]] ]]
+[[[link boost_icl.function_reference.subtraction ['*Subtraction*]] ]]
]
['*Back to section . . .*]
[table
[]
[[[link function_synopsis_table ['*Function Synopsis*]] ]]
-[[[link boost_itl.interface ['*Interface*]] ]]
+[[[link boost_icl.interface ['*Interface*]] ]]
]
[endsect][/ Erasure]
Modified: sandbox/itl/libs/itl/doc/functions_insertion.qbk
==============================================================================
--- sandbox/itl/libs/itl/doc/functions_insertion.qbk (original)
+++ sandbox/itl/libs/itl/doc/functions_insertion.qbk 2010-10-16 13:30:30 EDT (Sat, 16 Oct 2010)
@@ -146,15 +146,15 @@
['*See also . . .*]
[table
[]
-[[[link boost_itl.function_reference.addition ['*Erasure*]] ]]
-[[[link boost_itl.function_reference.addition ['*Addition*]] ]]
+[[[link boost_icl.function_reference.addition ['*Erasure*]] ]]
+[[[link boost_icl.function_reference.addition ['*Addition*]] ]]
]
['*Back to section . . .*]
[table
[]
[[[link function_synopsis_table ['*Function Synopsis*]]]]
-[[[link boost_itl.interface ['*Interface*]] ]]
+[[[link boost_icl.interface ['*Interface*]] ]]
]
[endsect][/ Insertion]
Modified: sandbox/itl/libs/itl/doc/functions_intersection.qbk
==============================================================================
--- sandbox/itl/libs/itl/doc/functions_intersection.qbk (original)
+++ sandbox/itl/libs/itl/doc/functions_intersection.qbk 2010-10-16 13:30:30 EDT (Sat, 16 Oct 2010)
@@ -39,7 +39,7 @@
addition are identical in this case.
See also
- [link boost_itl.semantics.quantifiers__maps_of_numbers.intersection_on_quantifiers ['intersection on Maps of numbers]].
+ [link boost_icl.semantics.quantifiers__maps_of_numbers.intersection_on_quantifiers ['intersection on Maps of numbers]].
A Map can be intersected with key types: an element
(an interval for interval_maps) and and a Set. This
@@ -246,15 +246,15 @@
['*See also . . .*]
[table
[]
-[[[link boost_itl.function_reference.symmetric_difference ['*Symmetric difference*]] ]]
-[[[link boost_itl.function_reference.subtraction ['*Subtraction*]] ]]
-[[[link boost_itl.function_reference.addition ['*Addition*]] ]]
+[[[link boost_icl.function_reference.symmetric_difference ['*Symmetric difference*]] ]]
+[[[link boost_icl.function_reference.subtraction ['*Subtraction*]] ]]
+[[[link boost_icl.function_reference.addition ['*Addition*]] ]]
]
['*Back to section . . .*]
[table
[]
[[[link function_synopsis_table ['*Function Synopsis*]] ]]
-[[[link boost_itl.interface ['*Interface*]] ]]
+[[[link boost_icl.interface ['*Interface*]] ]]
]
Modified: sandbox/itl/libs/itl/doc/functions_iterator_related.qbk
==============================================================================
--- sandbox/itl/libs/itl/doc/functions_iterator_related.qbk (original)
+++ sandbox/itl/libs/itl/doc/functions_iterator_related.qbk 2010-10-16 13:30:30 EDT (Sat, 16 Oct 2010)
@@ -62,13 +62,13 @@
['*See also . . .*]
[table
[]
-[[[link boost_itl.function_reference.element_iteration ['*Element iteration*]] ]]
+[[[link boost_icl.function_reference.element_iteration ['*Element iteration*]] ]]
]
['*Back to section . . .*]
[table
[]
[[[link function_synopsis_table ['*Function Synopsis*]] ]]
-[[[link boost_itl.interface ['*Interface*]] ]]
+[[[link boost_icl.interface ['*Interface*]] ]]
]
[endsect][/ Iterator related]
Modified: sandbox/itl/libs/itl/doc/functions_range.qbk
==============================================================================
--- sandbox/itl/libs/itl/doc/functions_range.qbk (original)
+++ sandbox/itl/libs/itl/doc/functions_range.qbk 2010-10-16 13:30:30 EDT (Sat, 16 Oct 2010)
@@ -47,7 +47,7 @@
[table
[]
[[[link function_synopsis_table ['*Function Synopsis*]] ]]
-[[[link boost_itl.interface ['*Interface*]] ]]
+[[[link boost_icl.interface ['*Interface*]] ]]
]
[endsect][/ Range]
Modified: sandbox/itl/libs/itl/doc/functions_selection.qbk
==============================================================================
--- sandbox/itl/libs/itl/doc/functions_selection.qbk (original)
+++ sandbox/itl/libs/itl/doc/functions_selection.qbk 2010-10-16 13:30:30 EDT (Sat, 16 Oct 2010)
@@ -39,13 +39,13 @@
['*See also . . .*]
[table
[]
-[[[link boost_itl.function_reference.intersection ['*Intersection*]] ]]
+[[[link boost_icl.function_reference.intersection ['*Intersection*]] ]]
]
['*Back to section . . .*]
[table
[]
[[[link function_synopsis_table ['*Function Synopsis*]] ]]
-[[[link boost_itl.interface ['*Interface*]] ]]
+[[[link boost_icl.interface ['*Interface*]] ]]
]
[endsect][/ Selection]
Modified: sandbox/itl/libs/itl/doc/functions_size.qbk
==============================================================================
--- sandbox/itl/libs/itl/doc/functions_size.qbk (original)
+++ sandbox/itl/libs/itl/doc/functions_size.qbk 2010-10-16 13:30:30 EDT (Sat, 16 Oct 2010)
@@ -46,7 +46,7 @@
[table
[]
[[[link function_synopsis_table ['*Function Synopsis*]] ] ]
-[[[link boost_itl.interface ['*Interface*]] ] ]
+[[[link boost_icl.interface ['*Interface*]] ] ]
]
[endsect][/ Size]
Modified: sandbox/itl/libs/itl/doc/functions_streaming.qbk
==============================================================================
--- sandbox/itl/libs/itl/doc/functions_streaming.qbk (original)
+++ sandbox/itl/libs/itl/doc/functions_streaming.qbk 2010-10-16 13:30:30 EDT (Sat, 16 Oct 2010)
@@ -28,7 +28,7 @@
[table
[]
[[[link function_synopsis_table ['*Function Synopsis*]]]]
-[[[link boost_itl.interface ['*Interface*]] ]]
+[[[link boost_icl.interface ['*Interface*]] ]]
]
[endsect][/ Streaming, conversion]
Modified: sandbox/itl/libs/itl/doc/functions_subtraction.qbk
==============================================================================
--- sandbox/itl/libs/itl/doc/functions_subtraction.qbk (original)
+++ sandbox/itl/libs/itl/doc/functions_subtraction.qbk 2010-10-16 13:30:30 EDT (Sat, 16 Oct 2010)
@@ -32,9 +32,9 @@
the effect of the corresponding addition function.
Find more on
- [link boost_itl.concepts.addability__subtractability_and_aggregate_on_overlap ['subtractability of maps]]
+ [link boost_icl.concepts.addability__subtractability_and_aggregate_on_overlap ['subtractability of maps]]
and related
- [link boost_itl.semantics.maps ['semantic issues]]
+ [link boost_icl.semantics.maps ['semantic issues]]
following the links.
]]
@@ -166,14 +166,14 @@
['*See also . . .*]
[table
[]
-[[[link boost_itl.function_reference.addition ['*Addition*]] ]]
-[[[link boost_itl.function_reference.erasure ['*Erasure*]] ]]
+[[[link boost_icl.function_reference.addition ['*Addition*]] ]]
+[[[link boost_icl.function_reference.erasure ['*Erasure*]] ]]
]
['*Back to section . . .*]
[table
[]
[[[link function_synopsis_table ['*Function Synopsis*]] ]]
-[[[link boost_itl.interface ['*Interface*]] ]]
+[[[link boost_icl.interface ['*Interface*]] ]]
]
[endsect][/ Subtraction]
Modified: sandbox/itl/libs/itl/doc/functions_symmetric_difference.qbk
==============================================================================
--- sandbox/itl/libs/itl/doc/functions_symmetric_difference.qbk (original)
+++ sandbox/itl/libs/itl/doc/functions_symmetric_difference.qbk 2010-10-16 13:30:30 EDT (Sat, 16 Oct 2010)
@@ -151,15 +151,15 @@
['*See also . . .*]
[table
[]
-[[[link boost_itl.function_reference.intersection ['*Intersection*]] ]]
-[[[link boost_itl.function_reference.subtraction ['*Subtraction*]] ]]
-[[[link boost_itl.function_reference.addition ['*Addition*]] ]]
+[[[link boost_icl.function_reference.intersection ['*Intersection*]] ]]
+[[[link boost_icl.function_reference.subtraction ['*Subtraction*]] ]]
+[[[link boost_icl.function_reference.addition ['*Addition*]] ]]
]
['*Back to section . . .*]
[table
[]
[[[link function_synopsis_table ['*Function Synopsis*]] ]]
-[[[link boost_itl.interface ['*Interface*]] ]]
+[[[link boost_icl.interface ['*Interface*]] ]]
]
[endsect][/ Symmetric Difference]
Modified: sandbox/itl/libs/itl/doc/implementation.qbk
==============================================================================
--- sandbox/itl/libs/itl/doc/implementation.qbk (original)
+++ sandbox/itl/libs/itl/doc/implementation.qbk 2010-10-16 13:30:30 EDT (Sat, 16 Oct 2010)
@@ -8,14 +8,14 @@
[section Implementation]
-The [link boost_itl.interface previous section] gave an overview over the interface
+The [link boost_icl.interface previous section] gave an overview over the interface
of the *itl* outlining
-[link boost_itl.interface.class_templates class templates],
-[link boost_itl.interface.associated_types associated types]
+[link boost_icl.interface.class_templates class templates],
+[link boost_icl.interface.associated_types associated types]
and polymorphic
-[link boost_itl.interface.function_synopsis functions and operators].
+[link boost_icl.interface.function_synopsis functions and operators].
In preparation to the
-[link boost_itl.function_reference next section],
+[link boost_icl.function_reference next section],
that describes the *itl's* polymorphic functions in
more detail together with ['*complexity characteristics*],
this section summarizes some general information on
@@ -98,7 +98,7 @@
More information on ['*complexity characteristics*]
of *itl's* functions is contained in section
-[link boost_itl.function_reference Function Reference]
+[link boost_icl.function_reference Function Reference]
[h5 Time Complexity of Addition]
Modified: sandbox/itl/libs/itl/doc/interface.qbk
==============================================================================
--- sandbox/itl/libs/itl/doc/interface.qbk (original)
+++ sandbox/itl/libs/itl/doc/interface.qbk 2010-10-16 13:30:30 EDT (Sat, 16 Oct 2010)
@@ -425,82 +425,85 @@
[/ memberref boost::itl::set::iterative_size `iterative_size`]
-[table Icl Interfaces
+[table Synopsis Functions and Overloads
[[T] [interval][__ch_itv_sets__][__ch_itv_maps__][__ch_ele_sets__][__ch_ele_maps__]]
[/ interval itvset itvmap itl:set itl:map ]
-[[__biLConsCopyDest__ [#function_synopsis_table]][ ] [ ] [ ] [ ] [ ] ]
-[[`T::T()`] [1] [1] [1] [1] [1] ]
-[[`T::T(const P&)`] [A] [__eiS] [__bpM] [1] [1] ]
-[/ FYI [`T::T(...)`] [3] [ ] [ ] [3] [3] ]
-[[`T& T::operator=(const P&)`] [A] [__S] [__M] [1] [1] ]
-[[`void T::swap(T&)`] [ ] [1] [1] [1] [1] ]
+[[__biLConsCopyDest__ [#function_synopsis_table]] [ ] [ ] [ ] [ ] [ ] ]
+[[`T::T()`] [1] [1] [1] [1] [1] ]
+[[`T::T(const P&)`] [A] [__eiS] [__bpM] [1] [1] ]
+[/ FYI [`T::T(...)`] [3] [ ] [ ] [3] [3] ]
+[[`T& T::operator=(const P&)`] [A] [__S] [__M] [1] [1] ]
+[[`void T::swap(T&)`] [ ] [1] [1] [1] [1] ]
[[__biLContainedness__ ][interval][__ch_itv_sets__][__ch_itv_maps__][__ch_ele_sets__][__ch_ele_maps__]]
-[[`void T::clear()`] [1] [1] [1] [1] [1] ]
-[[`void clear(const T&)`] [1] [1] [1] [1] [1] ]
-[[`bool T::empty()const`] [1] [1] [1] [1] [1] ]
-[[`bool is_empty(const T&)`] [1] [1] [1] [1] [1] ]
-[[`bool contains(const T&, const P&)`] [__ei] [__eiS][__eiS __bpM][__es] [__bm] ]
-[[`bool within(const P&, const T&)`] [__ei] [__eiS][__eiS __bpM][__es] [__bm] ]
+[[`bool T::empty()const`] [ ] [1] [1] [1] [1] ]
+[[`bool is_empty(const T&)`] [1] [1] [1] [1] [1] ]
+[[`bool contains(const T&, const P&)`\n
+ `bool within(const P&, const T&)`] [__ei] [__eiS][__eiS __bpM][__es] [__bm] ]
[[__biLEquivsOrderings__ ][interval][__ch_itv_sets__][__ch_itv_maps__][__ch_ele_sets__][__ch_ele_maps__]]
-[[`bool operator == (const T&, const T&)`] [1] [1] [1] [1] [1] ]
-[[`bool operator != (const T&, const T&)`] [1] [1] [1] [1] [1] ]
-[[`bool operator < (const T&, const T&)`] [1] [1] [1] [1] [1] ]
-[[`bool operator > (const T&, const T&)`] [1] [1] [1] [1] [1] ]
-[[`bool operator <= (const T&, const T&)`] [1] [1] [1] [1] [1] ]
-[[`bool operator >= (const T&, const T&)`] [1] [1] [1] [1] [1] ]
-[[`bool is_element_equal(const T&, const P&)`] [ ] [__S] [__M] [1] [1] ]
-[[`bool is_element_less(const T&, const P&)`] [ ] [__S] [__M] [1] [1] ]
-[[`bool is_element_greater(const T&, const P&)`][ ] [__S] [__M] [1] [1] ]
-[[`bool is_distinct_equal(const T&, const P&)`][ ] [ ] [__M] [ ] [1] ]
+[[`bool operator == (const T&, const T&)`] [1] [1] [1] [1] [1] ]
+[[`bool operator != (const T&, const T&)`] [1] [1] [1] [1] [1] ]
+[[`bool operator < (const T&, const T&)`] [1] [1] [1] [1] [1] ]
+[[`bool operator > (const T&, const T&)`] [1] [1] [1] [1] [1] ]
+[[`bool operator <= (const T&, const T&)`] [1] [1] [1] [1] [1] ]
+[[`bool operator >= (const T&, const T&)`] [1] [1] [1] [1] [1] ]
+[[`bool is_element_equal(const T&, const P&)`] [ ] [__S] [__M] [1] [1] ]
+[[`bool is_element_less(const T&, const P&)`] [ ] [__S] [__M] [1] [1] ]
+[[`bool is_element_greater(const T&, const P&)`] [ ] [__S] [__M] [1] [1] ]
+[[`bool is_distinct_equal(const T&, const P&)`] [ ] [ ] [__M] [ ] [1] ]
[[__biLSize__ ] [interval][__ch_itv_sets__][__ch_itv_maps__][__ch_ele_sets__][__ch_ele_maps__]]
-[[`size_type T::size()const`] [1] [1] [1] [1] [1] ]
-[[`size_type size(const T&)`] [1] [1] [1] [1] [1] ]
-[[`size_type cardinality(const T&)`] [1] [1] [1] [1] [1] ]
-[[`difference_type length(const T&)`] [1] [1] [1] [ ] [ ] ]
-[[`size_t iterative_size(const T&)`] [ ] [1] [1] [1] [1] ]
-[[`size_t interval_count(const T&)`] [ ] [1] [1] [ ] [ ] ]
-
-[[__biLRange__ ] [ ] [ ] [ ] [ ] [ ] ]
-[[`interval<domain_type> hull(const T&)`] [ ] [1] [1] [ ] [ ] ]
-
-[[__biLSelection__ ] [ ] [ ] [ ] [ ] [ ] ]
-[[`J T::find(const domain_type&)`] [ ] [1] [1] [2] [2] ]
-[[`codomain_type& operator[] (const domain_type&)`][ ] [ ] [] [ ] [1] ]
-[[`codomain_type operator() (const domain_type&)const`][ ][ ] [1] [ ] [1] ]
+[[`size_type T::size()const`] [ ] [1] [1] [1] [1] ]
+[[`size_type size(const T&)`] [1] [1] [1] [1] [1] ]
+[[`size_type cardinality(const T&)`] [1] [1] [1] [1] [1] ]
+[[`difference_type length(const T&)`] [1] [1] [1] [ ] [ ] ]
+[[`size_t iterative_size(const T&)`] [ ] [1] [1] [1] [1] ]
+[[`size_t interval_count(const T&)`] [ ] [1] [1] [ ] [ ] ]
+
+[[__biLSelection__ ] [ ] [ ] [ ] [ ] [ ] ]
+[[`J T::find(const domain_type&)`] [ ] [1] [1] [2] [2] ]
+[[`codomain_type& operator[] (const domain_type&)`][ ] [ ] [ ] [ ] [1] ]
+[[`codomain_type operator() (const domain_type&)const`][ ] [ ] [1] [ ] [1] ]
+
+[[__biLHull__ ] [ ] [ ] [ ] [ ] [ ] ]
+[[`interval_type hull(const T&)`] [ ] [1] [1] [ ] [ ] ]
+[[`T hull(const T&, const T&)`] [1] [ ] [ ] [ ] [ ] ]
[[__biLAddition__] [interval][__ch_itv_sets__][__ch_itv_maps__][__ch_ele_sets__][__ch_ele_maps__]]
-[[`T& T::add(const P&)`] [ ] [__ei] [__bp] [__e] [__b] ]
-[[`T& T::add(J pos, const P&)`] [ ] [__i] [__p] [__e] [__b] ]
-[[`T& add(T&, const P&)`] [ ] [__ei] [__bp] [__e] [__b] ]
-[[`T& add(T&, J pos, const P&)`] [ ] [__i] [__p] [__e] [__b] ]
-[[`T& operator +=(T&, const P&)`] [ ] [__eiS] [__bpM] [__es] [__bm] ]
+[[`T& T::add(const P&)`] [ ] [__ei] [__bp] [ ] [__b] ]
+[[`T& add(T&, const P&)`] [ ] [__ei] [__bp] [__e] [__b] ]
+[[`T& T::add(J pos, const P&)`] [ ] [__i] [__p] [ ] [__b] ]
+[[`T& add(T&, J pos, const P&)`] [ ] [__i] [__p] [__e] [__b] ]
+
+[[`T& operator +=(T&, const P&)`] [ ] [__eiS] [__bpM] [__es] [__bm] ]
[[`T operator + (T, const P&)`\n`T operator + (const P&, T)`]
- [ ] [__eiS] [__bpM] [__es] [__bm] ]
-[[`T& operator |=( T&, const P&)`] [ ] [__eiS] [__bpM] [__es] [__bm] ]
+ [ ] [__eiS] [__bpM] [__es] [__bm] ]
+[[`T& operator |=( T&, const P&)`] [ ] [__eiS] [__bpM] [__es] [__bm] ]
[[`T operator | (T, const P&)`\n`T operator | (const P&, T)`]
- [ ] [__eiS] [__bpM] [__es] [__bm] ]
-[[__biLSubtraction__] [ ] [ ] [ ] [ ] [ ] ]
-[[`T& T::subtract(const P&)`] [ ] [__ei] [__bp] [__e] [__b] ]
-[[`T& subtract(T&, const P&)`] [ ] [__ei] [__bp] [__e] [__b] ]
-[[`T& operator -=( T&, const P&)`] [ ] [__eiS][__eiS __bpM][__es] [__bm] ]
-[[`T operator - (T, const P&)`] [ ] [__eiS][__eiS __bpM][__es] [__bm] ]
+ [ ] [__eiS] [__bpM] [__es] [__bm] ]
+[[__biLSubtraction__] [ ] [ ] [ ] [ ] [ ] ]
+[[`T& T::subtract(const P&)`] [ ] [__ei] [__bp] [ ] [__b] ]
+[[`T& subtract(T&, const P&)`] [ ] [__ei] [__bp] [__e] [__b] ]
+
+[[`T& operator -=(T&, const P&)`] [ ] [__eiS][__eiS __bpM][__es] [__bm] ]
+[[`T operator - (T, const P&)`] [ ] [__eiS][__eiS __bpM][__es] [__bm] ]
[[__biLInsertion__] [interval][__ch_itv_sets__][__ch_itv_maps__][__ch_ele_sets__][__ch_ele_maps__]]
-[[`V T::insert(const P&)`] [ ] [__ei] [__bp] [__e] [__b] ]
-[[`V T::insert(J pos, const P&)`] [ ] [__i] [__p] [__e] [__b] ]
-[[`V insert(T&, const P&)`] [ ] [__ei] [__bp] [__e] [__b] ]
-[[`V insert(T&, J pos, const P&)`] [ ] [__i] [__p] [__e] [__b] ]
-[[`T& insert(T&, const P&)`] [ ] [__eiS] [__bpM] [__es] [__bm] ]
-[[`T& T::set(const P&)`] [ ] [ ] [__bp] [ ] [1] ]
-
-[[__biLErasure__] [ ] [ ] [ ] [ ] [ ] ]
-[[`T& T::erase(const P&)`] [ ] [__ei ] [__ei __bp] [__e] [__bp] ]
-[[`T& erase(T&, const P&)`] [ ] [__eiS][__eiS __bpM][__es] [__bm] ]
-[[`void T::erase(iterator)`] [ ] [1] [1] [1] [1] ]
-[[`void T::erase(iterator,iterator)`] [ ] [1] [1] [1] [1] ]
+[[`V T::insert(const P&)`] [ ] [__ei] [__bp] [__e] [__b] ]
+[[`V insert(T&, const P&)`] [ ] [__ei] [__bp] [__e] [__b] ]
+[[`V T::insert(J pos, const P&)`] [ ] [__i] [__p] [__e] [__b] ]
+[[`V insert(T&, J pos, const P&)`] [ ] [__i] [__p] [__e] [__b] ]
+[[`T& insert(T&, const P&)`] [ ] [__eiS] [__bpM] [__es] [__bm] ]
+[[`T& T::set(const P&)`] [ ] [ ] [__bp] [ ] [1] ]
+
+[[__biLErasure__] [ ] [ ] [ ] [ ] [ ] ]
+[[`void T::clear()`] [ ] [1] [1] [1] [1] ]
+[[`void clear(const T&)`] [ ] [1] [1] [1] [1] ]
+[[`T& T::erase(const P&)`] [ ] [__ei ] [__ei __bp] [__e] [__bp] ]
+[[`T& erase(T&, const P&)`] [ ] [__eiS][__eiS __bpM][__es] [__bm] ]
+[[`void T::erase(iterator)`] [ ] [1] [1] [1] [1] ]
+[[`void T::erase(iterator,iterator)`] [ ] [1] [1] [1] [1] ]
[[__biLIntersection__] [interval][__ch_itv_sets__][__ch_itv_maps__][__ch_ele_sets__][__ch_ele_maps__]]
[[`void add_intersection(T&, const T&, const P&)`][ ] [__eiS][__eiS __bpM][ ] [ ] ]
@@ -510,11 +513,11 @@
[[`bool intersects(const T&, const P&)`] [__i] [__eiS][__eiS __bpM][__es] [__bm] ]
[[__biLSymmetricDifference__] [ ] [ ] [ ] [ ] [ ] ]
-[[`T& T::flip(const P&)`] [ ] [__ei] [__bp] [__e] [__b] ]
-[[`T& flip(T&, const P&)`] [ ] [__ei] [__bp] [__e] [__b] ]
+[[`T& T::flip(const P&)`\n
+ `T& flip(T&, const P&)`] [ ] [__ei] [__bp] [__e] [__b] ]
[[`T& operator ^=(T&, const P&)`] [ ] [__eiS] [__bpM] [__es] [__bm] ]
-[[`T operator ^ (T, const P&)`\n`T operator ^ (const P&, T)`]
- [ ] [__eiS] [__bpM] [__es] [__bm] ]
+[[`T operator ^ (T, const P&)`\n
+ `T operator ^ (const P&, T)`] [ ] [__eiS] [__bpM] [__es] [__bm] ]
[[__biLIteratorRelated__] [interval][__ch_itv_sets__][__ch_itv_maps__][__ch_ele_sets__][__ch_ele_maps__]]
[[`J T::begin()`] [ ] [2] [2] [2] [2] ]
[[`J T::end()`] [ ] [2] [2] [2] [2] ]
@@ -524,11 +527,11 @@
[[`J T::upper_bound(const key_type&)`] [ ] [2] [2] [2] [2] ]
[[`pair<J,J> T::equal_range(const key_type&)`] [ ] [2] [2] [2] [2] ]
-[[__biLIteratorRelated__] [interval][__ch_itv_sets__][__ch_itv_maps__][__ch_ele_sets__][__ch_ele_maps__]]
-[[`K elements_begin(P&)`] [ ] [2] [2] [2] [2] ]
-[[`K elements_end(P&)`] [ ] [2] [2] [2] [2] ]
-[[`K elements_rbegin(P&)`] [ ] [2] [2] [2] [2] ]
-[[`K elements_rend(P&)`] [ ] [2] [2] [2] [2] ]
+[[__biLElementIteration__] [interval][__ch_itv_sets__][__ch_itv_maps__][__ch_ele_sets__][__ch_ele_maps__]]
+[[`K elements_begin(T&)`] [ ] [2] [2] [ ] [ ] ]
+[[`K elements_end(T&)`] [ ] [2] [2] [ ] [ ] ]
+[[`K elements_rbegin(T&)`] [ ] [2] [2] [ ] [ ] ]
+[[`K elements_rend(T&)`] [ ] [2] [2] [ ] [ ] ]
[[__biLStreaming__ ] [interval][__ch_itv_sets__][__ch_itv_maps__][__ch_ele_sets__][__ch_ele_maps__]]
[[`std::basic_ostream operator << (basic_ostream&, const T&)`]
@@ -537,7 +540,8 @@
[h4 Element iterators for interval containers]
-Iterators on [*interval conainers] that are refered to so far are
+Iterators on [*interval conainers] that are refered to in section /Iteration/
+of the function synopsis table are
['*segment iterators*]. They reveal the more implementation specific
aspect, that the __conceptual__ aspect abstracts from.[/ NOTE Identical to function_element_iteration.qbk from here]
Iteration over segments is fast, compared to an iteration over elements,
@@ -562,21 +566,12 @@
[caution So we advice you to choose element iteration over
interval containers ['*judiciously*]. Do not use element iteration
['*by default or habitual*]. Always try to achieve results using
-member functions, global functions or operators
+namespace global functions or operators
(preferably inplace versions)
or iteration over segments first.]
-
-[table Element iterators for interval containers
-[[__biLElementIteration__] [__ch_itv_sets__][__ch_itv_maps__] ]
-[[`J T::elements_begin()`] [2] [2] ]
-[[`J T::elements_end()`] [2] [2] ]
-[[`J T::elements_rbegin()`] [2] [2] ]
-[[`J T::elements_rend()`] [2] [2] ]
-]
-
-
[endsect][/ Function Synopsis]
+
[endsect][/ Interface]
Modified: sandbox/itl/libs/itl/doc/introduction.qbk
==============================================================================
--- sandbox/itl/libs/itl/doc/introduction.qbk (original)
+++ sandbox/itl/libs/itl/doc/introduction.qbk 2010-10-16 13:30:30 EDT (Sat, 16 Oct 2010)
@@ -62,7 +62,7 @@
overlap on insertion.
For a condensed introduction and overview you may want to look at the
-[@http://www.herold-faulhaber.de/boost_itl/doc/libs/itl/doc/boostcon09/intro_to_itl.pdf
+[@http://www.herold-faulhaber.de/boost_icl/doc/libs/itl/doc/boostcon09/intro_to_itl.pdf
presentation material on the *ICL* from ['*BoostCon2009*]].
@@ -162,7 +162,7 @@
Addability and aggregate on overlap are useful features on
__itv_maps__ implemented via function `add` and `operator +=`.
But you can also use them with the ['traditional]
-[link boost_itl.function_reference.insertion insert semantics]
+[link boost_icl.function_reference.insertion insert semantics]
that behaves like `std::map::insert` generalized for
interval insertion.
@@ -266,7 +266,7 @@
Note that =interval_sets= /A/, /B/ and /C/ represent the same set of elements ={1,2,3,4}=
and =interval_maps= /D/ and /E/ represent the same map of elements [^{1->1, 2->2, 3->1, 4->1}].
-See example program [link boost_itl.examples.interval_container Interval container]
+See example program [link boost_icl.examples.interval_container Interval container]
for an additional demo.
[h4 Joining interval containers]
@@ -284,7 +284,7 @@
have an ['*insertion memory*]. They do accumulate interval borders both
from additions and intersections. This is specifically useful, if we want
to enrich an interval container with certain time grids, like e.g. months
-or calendar weeks or both. See example [link boost_itl.examples.month_and_week_grid time grids for months and weeks].
+or calendar weeks or both. See example [link boost_icl.examples.month_and_week_grid time grids for months and weeks].
[h4 Separating interval containers]
@@ -298,3 +298,4 @@
[endsect][/ Introduction]
+
Modified: sandbox/itl/libs/itl/doc/itl.qbk
==============================================================================
--- sandbox/itl/libs/itl/doc/itl.qbk (original)
+++ sandbox/itl/libs/itl/doc/itl.qbk 2010-10-16 13:30:30 EDT (Sat, 16 Oct 2010)
@@ -134,26 +134,27 @@
[link itl_set_type *s*] [link interval_set_types *S*]
[link itl_map_type *m*] [link interval_map_types *M*]]
-[def __biLConsCopyDest__ [link boost_itl.function_reference.construct__copy__destruct ['*Construct, copy, destruct*]]]
-[def __biLContainedness__ [link boost_itl.function_reference.containedness ['*Containedness*]]]
-[def __biLcontainedness__ [link boost_itl.function_reference.containedness ['*containedness*]]]
-[def __biLEquivsOrderings__ [link boost_itl.function_reference.equivalences_and_orderings ['*Equivalences and Orderings*]]]
-[def __biLSize__ [link boost_itl.function_reference.size ['*Size*]]]
-[def __biLRange__ [link boost_itl.function_reference.range ['*Range*]]]
-[def __biLSelection__ [link boost_itl.function_reference.selection ['*Selection*]]]
-[def __biLAddition__ [link boost_itl.function_reference.addition ['*Addition*]]]
-[def __biLadd__ [link boost_itl.function_reference.addition ['*add*]]]
-[def __biLSubtraction__ [link boost_itl.function_reference.subtraction ['*Subtraction*]]]
-[def __biLsubtraction__ [link boost_itl.function_reference.subtraction ['*subtraction*]]]
-[def __biLInsertion__ [link boost_itl.function_reference.insertion ['*Insertion*]]]
-[def __biLErasure__ [link boost_itl.function_reference.erasure ['*Erasure*]]]
-[def __biLerasure__ [link boost_itl.function_reference.erasure ['*erasure*]]]
-[def __biLIntersection__ [link boost_itl.function_reference.intersection ['*Intersection*]]]
-[def __biLintersection__ [link boost_itl.function_reference.intersection ['*intersection*]]]
-[def __biLSymmetricDifference__ [link boost_itl.function_reference.symmetric_difference ['*Symmetric difference*]]]
-[def __biLIteratorRelated__ [link boost_itl.function_reference.iterator_related ['*Iterator related*]]]
-[def __biLElementIteration__ [link boost_itl.function_reference.element_iteration ['*Element iteration*]]]
-[def __biLStreaming__ [link boost_itl.function_reference.streaming__conversion ['*Streaming, conversion*]]]
+[def __biLConsCopyDest__ [link boost_icl.function_reference.construct__copy__destruct ['*Construct, copy, destruct*]]]
+[def __biLContainedness__ [link boost_icl.function_reference.containedness ['*Containedness*]]]
+[def __biLcontainedness__ [link boost_icl.function_reference.containedness ['*containedness*]]]
+[def __biLEquivsOrderings__ [link boost_icl.function_reference.equivalences_and_orderings ['*Equivalences and Orderings*]]]
+[def __biLSize__ [link boost_icl.function_reference.size ['*Size*]]]
+[def __biLRange__ [link boost_icl.function_reference.range ['*Range*]]]
+[def __biLHull__ [link boost_icl.function_reference.range ['*Hull*]]]
+[def __biLSelection__ [link boost_icl.function_reference.selection ['*Selection*]]]
+[def __biLAddition__ [link boost_icl.function_reference.addition ['*Addition*]]]
+[def __biLadd__ [link boost_icl.function_reference.addition ['*add*]]]
+[def __biLSubtraction__ [link boost_icl.function_reference.subtraction ['*Subtraction*]]]
+[def __biLsubtraction__ [link boost_icl.function_reference.subtraction ['*subtraction*]]]
+[def __biLInsertion__ [link boost_icl.function_reference.insertion ['*Insertion*]]]
+[def __biLErasure__ [link boost_icl.function_reference.erasure ['*Erasure*]]]
+[def __biLerasure__ [link boost_icl.function_reference.erasure ['*erasure*]]]
+[def __biLIntersection__ [link boost_icl.function_reference.intersection ['*Intersection*]]]
+[def __biLintersection__ [link boost_icl.function_reference.intersection ['*intersection*]]]
+[def __biLSymmetricDifference__ [link boost_icl.function_reference.symmetric_difference ['*Symmetric difference*]]]
+[def __biLIteratorRelated__ [link boost_icl.function_reference.iterator_related ['*Iteration*]]]
+[def __biLElementIteration__ [link boost_icl.function_reference.element_iteration ['*Element iteration*]]]
+[def __biLStreaming__ [link boost_icl.function_reference.streaming__conversion ['*Streaming, conversion*]]]
[/ column headers]
[def __ch_dom_t__ domain\ntype]
Modified: sandbox/itl/libs/itl/doc/projects.qbk
==============================================================================
--- sandbox/itl/libs/itl/doc/projects.qbk (original)
+++ sandbox/itl/libs/itl/doc/projects.qbk 2010-10-16 13:30:30 EDT (Sat, 16 Oct 2010)
@@ -24,7 +24,7 @@
[table Overview over Icl Examples
[[level] [example] [classes] [features]]
- [[basic] [[link boost_itl.examples.large_bitset Large Bitset]]
+ [[basic] [[link boost_icl.examples.large_bitset Large Bitset]]
[__itv_map__][The most simple application of an interval map:
Counting the overlaps of added intervals.]]
]
Modified: sandbox/itl/libs/itl/doc/semantics.qbk
==============================================================================
--- sandbox/itl/libs/itl/doc/semantics.qbk (original)
+++ sandbox/itl/libs/itl/doc/semantics.qbk 2010-10-16 13:30:30 EDT (Sat, 16 Oct 2010)
@@ -210,7 +210,7 @@
The next table shows the relationship between
law instances,
-[link boost_itl.introduction.interval_combining_styles interval combining style]
+[link boost_icl.introduction.interval_combining_styles interval combining style]
and the
used equality relation.
@@ -238,7 +238,7 @@
The remaining five instantiations of `RightDistributivity`
are valid for lexicographical equality (demoted as `==`) as well.
-[link boost_itl.introduction.interval_combining_styles Interval combining styles]
+[link boost_icl.introduction.interval_combining_styles Interval combining styles]
correspond to containers according to
``
style set
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk