Changes between Version 81 and Version 82 of LibrariesUnderConstruction

Timestamp:

Sep 30, 2009, 8:26:02 AM (13 years ago)

Author:

Joachim Faulhaber

Comment:

--

LibrariesUnderConstruction

@@ -530 +530 @@
  * '''State:''' Stable, submitted for review
  * '''Last upload:''' 2009 September 09
- * '''Links:''' [http://www.sourceforge.net/projects/itl Home Page] [http://www.herold-faulhaber.de/boost_itl/doc/libs/itl/doc/html/index.html Documentation]
+ * '''Links:''' [http://www.herold-faulhaber.de/boost_itl/doc/libs/itl/doc/html/index.html Documentation] [https://svn.boost.org/svn/boost/sandbox/itl/ Boost Sandbox] [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=itl_3_1_0.zip&directory=Containers Boost Vault]
  * '''Categories:''' [#Containers Containers] 
- * '''Description:''' The Interval Template Library (ITL) offers '''intervals''' and two kinds of interval containers: '''interval_sets''' and '''interval_maps'''.
+ * '''Description:''' The Interval Template Library (ITL) provides '''intervals''' and two kinds of interval containers: '''interval_sets''' and '''interval_maps'''. Interval_sets and maps can be used just as the sets or maps of elements. Yet they are much more space and time efficient when the elements occur in contiguous chunks. This is obviously the case in many problem domains, particularly in fields that deal with problems related to date and time. In addition to common set and map semantics, interval containers are capable to compute with segmentation. A segmentation, e.g. a grid of months, can be intersected into other interval containers and then be iterated over. Finally interval_maps allow for aggregations on associated values, if added intervals overlap with intervals, that are stored in the interval_map. This feature is called '''aggregate on overlap'''.
 
 ---------------------------------------------------------------------------------------------------