Commit graph

21 commits

Author SHA1 Message Date
adam
81059da3bd Revbump after updating devel/boost-libs 2013-11-20 20:04:35 +00:00
obache
be6a7bf66d recursive bump from boost-lib shlib major bump. 2013-11-20 13:23:41 +00:00
ryoon
00c1cece6c Bump PKGREVISION.
* Install more header files.
2013-10-09 14:29:47 +00:00
richard
587c6d7a3a extract with gtar in order to support extended headers in mdds source archive 2013-09-03 05:24:50 +00:00
jaapb
b6379b5294 Updated package to its latest version, 0.9.0. Changes (apart from bugfixes)
include:
* all
  * added .pc file for pkg-config.
* multi_type_vector
  * added another block function template to make it easier to declare
    container with 3 custom element types.
  * added two variants of release():
    * template<typename _T> iterator
      release(size_type pos, _T& value)
    * template<typename _T> iterator
      release(const iterator& pos_hint, size_type pos, _T& value)
  * added a variant of release() that takes no arguments.  This one
    releases all elements and makes the container empty afterward.
  * added a new variant of position() that takes const_iterator as
    position hint.
    * std::pair<const_iterator, size_type>
      position(const const_iterator& pos_hint, size_type pos) const
  * added compile-time macro MDDS_MULTI_TYPE_VECTOR_USE_DEQUE to allow
    users to specify std::deque as the underlying data array.  By
    default, multi_type_vector uses std::vector as the underlying data
    array container.
  * added a new variant of swap() that allows partial swapping of
    content with another container.
  * added static block type identifier so that the numeric block type
    ID can be deduced from the block type directly.
  * value_type (which is a type of object returned when dereferencing
    an iterator) now stores 'position' which is the logical position
    of the first element of a block.
  * added position_type and const_position_type which are typedefs to
    the return types of position() methods.
  * added char and unsigned char types to the standard types supported
    by default.
  * added position() member method that takes a logical element
    position and returns a pair of block iterator where the element
    resides and its offset within that block.
  * added at() static member method to the data block, which calls the
    at() method of the underlying std::vector container.
  * added release() member method to allow caller to release an object
    stored inside a managed block.
  * added two templates to ease creation of custom element block
    functions when using one or two custom element types.
  * added transfer() member method to allow elements in a specified
    range to be transferred from one container to another.  When
    transferring elements stored in a managed element block, the
    ownership of those elements is also transferred.
  * add variants of set() methods (both single- and multi-value)
    insert(), set_empty() and insert_empty() methods that take an
    iterator as an additional position hint parameter for block lookup
    speed optimization.
  * add support for non-const iterators which allow the client code to
    modify values directly from the iterators.
  * set() methods (both single- and multi-parameter variants),
    set_empty(), insert() and insert_empty() methods now return
    iterator that references the block to which the values are set or
    inserted.
* multi_type_matrix:
  * get_numeric(), get_boolean(), and get_string() are made more
    efficient.
  * added position() method that returns a reference object to an
    element (position object).
  * added variants of get_numeric(), get_boolean() and get_string()
    that retrieves elements from position objects.
  * added variants of set() that sets new element values via position
    objects.
  * add a variant of the position() method that takes an iterator as
    positional hint.  Note that there is no variant of position() that
    takes const_iterator.
* flat_segment_tree
  * changed the return type of search_tree from bool to
    std::pair<const_iterator,bool>, to make it consistent with the
    search() method.  Note that this is an API-incompatible change.
2013-08-22 14:42:57 +00:00
obache
07659b9b8d recursive bump from boost-lib shlib update. 2013-02-15 11:53:59 +00:00
asau
e1ab7079b6 Drop superfluous PKG_DESTDIR_SUPPORT, "user-destdir" is default these days. 2012-10-31 11:16:30 +00:00
wiz
fe9a5e2d43 Update to 0.6.1:
This is purely a bug fix release, and contain no new functionality
since 0.6.0.

This release fixes a bug in the iterator implementation of
flat_segment_tree. Prior to this release, the iterator would treat
the position immediately before the end position to be the end
position, which would result in incorrectly skipping the last data
position during iteration. This release contains a fix for that
bug.

It also contains fixes for various build errors and compiler
warnings.

Many thanks to David Tardon, Stephan Bergmann, Tomáš Chvátal,
and Markus Mohrhard for having submitted patches since the release
of 0.6.0.
2012-10-02 17:27:02 +00:00
obache
fb0eef126f Recursive bump from boost-libs update. 2012-08-29 11:22:09 +00:00
wiz
69a1426af0 Fix libreoffice runtime error using upstream patch, via ftigeot.
Bump PKGREVISION.
2012-08-15 18:13:38 +00:00
wiz
3079ce6415 Update to 0.6.0:
mdds 0.6.0

* all

  * added MSVS Solution file, to make it easier to build unit test
    programs on Windows.

* mixed_type_matrix

  * improved performance of size() method by caching it.

* multi_type_vector (new)

  * new data structure to support efficient storage of data of different
    types.

* multi_type_matrix (new)

  * new data structure to eventually replace mixed_type_matrix.  It uses
    multi_type_vector as its backend storage.
2012-07-29 20:02:15 +00:00
adam
9fde0ec108 Revbump after updating boost 2012-07-02 13:37:35 +00:00
wiz
2152a05c84 Update to 0.5.4:
mdds 0.5.4

* segment_tree

  * fixed build breakage, to allow it to be buildable when UNIT_TEST
    is not defined.

  * fixed a crasher with MSVC when comparing iterators of empty
    search_result instances.

* point_quad_tree

  * fixed a bug where de-referencing copied search_result iterators
    would return an uninitialized node data.
2012-03-12 15:56:58 +00:00
hans
718bbf4bcf Recursive bump from devel/boost-libs update. 2012-02-29 16:32:19 +00:00
obache
78cb977b26 Recursive bump from boost-libs shlib bump. 2012-01-09 02:54:24 +00:00
obache
9725d3de74 Recursive Bump from boost-libs ABI bump. 2011-10-19 06:12:58 +00:00
wiz
aa9e9e6459 Update to 0.5.3:
mdds 0.5.3

* mixed_type_matrix

  * re-implemented the filled storage for better performance, with two
    separate implementations for zero and emtpy matrix types.  The
    newer implementation should improve object creation time
    considerably.
2011-08-06 10:53:30 +00:00
wiz
60516b9fe1 Add buildlink3.mk file. 2011-04-10 11:07:43 +00:00
wiz
669b07d605 Update to 0.5.2:
mdds 0.5.2

* flat_segment_tree

  * fixed a crash on assignment by properly implementing assignment
    operator().

  * fixed several bugs in shift_right():

    * shifting of all existing nodes was not handled properly.

    * leaf nodes were not properly linked under certain conditions.

    * shifting with skip node option was not properly skipping the
      node at insertion position when the insertion position was at
      the leftmost node.

  * implemented min_key(), max_key(), default_value(), clear() and
    swap().

  * fixed a bug in operator==() where two different containers were
    incorrectly evaluated to be equal.

  * added quickcheck test code.
2011-04-05 12:57:54 +00:00
wiz
da9091c4b4 Remove file added by accident 2011-03-01 09:29:15 +00:00
wiz
5a3c14b041 Initial import of mdds-0.5.1:
Multi-Dimensional Data Structure (mdds)

A collection of multi-dimensional data structure and indexing algorithm.

It implements the following data structure:

    * flat segment tree
    * segment tree
    * rectangle set
2011-02-28 18:10:51 +00:00