./devel/mdds, Collection of multi-dimensional data structure and indexing algorithms (1.0 branch)

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]


Branch: CURRENT, Version: 1.1.0nb5, Package name: mdds-1.1.0nb5, Maintainer: pkgsrc-users

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

This package contains the 1.0 branch of the software.


Required to run:
[devel/boost-libs]

Required to build:
[devel/boost-headers] [pkgtools/cwrappers]

Master sites:

SHA1: 4570846f61b8f37ca5a435aa43899b96e9eaf2ae
RMD160: ffc7ae1bbfdc7b0a4731070ad6aa9b5a0228bff4
Filesize: 252.628 KB

Version history: (Expand)


CVS history: (Expand)


   2018-01-01 22:18:57 by Adam Ciarcinski | Files touched by this commit (629) | Package updated
Log message:
Revbump after boost update
   2017-08-24 22:03:43 by Adam Ciarcinski | Files touched by this commit (621) | Package updated
Log message:
Revbump for boost update
   2017-04-30 03:22:04 by Ryo ONODERA | Files touched by this commit (612) | Package updated
Log message:
Recursive revbump from boost update
   2017-01-01 17:06:40 by Adam Ciarcinski | Files touched by this commit (616) | Package updated
Log message:
Revbump after boost update
   2016-10-07 20:26:14 by Adam Ciarcinski | Files touched by this commit (611) | Package updated
Log message:
Revbump post boost update
   2016-05-18 13:53:28 by Thomas Klausner | Files touched by this commit (2)
Log message:
Mention this is the 1.0 branch of the package.
   2016-03-08 19:50:21 by Ryo ONODERA | Files touched by this commit (3) | Package updated
Log message:
Update to 1.1.0

Changelog:
* packed_trie_map (new)

  * new data structure that implements a trie also known as a prefix
    tree.  This implementation requires all key values be known at
    construction time, after which its content is considered
    immutable.  Internally it packs all its nodes in a single
    contiguous array for space and lookup efficiencies.

* trie_map (new)

  * new data structure that implements a trie.  It works similar to
    packed_trie_map except that this version is mutable.

* multi_type_matrix

  * added a variant of walk() that takes the upper-left and
    lower-right corners to allow walking through a subset of the
    original matrix.

* multi_type_vector

  * fixed incorrect return values of the increment and decrement
    operators of in-block iterators.  They would previously return a
    value_type pointer which did not conform to the behaviors of STL
    iterators.

  * added support for custom event handlers for element block
    acquisitions and releases.

* flat_segment_tree

  * fixed incorrect return values of the increment and decrement
    operators of its leaf-node iterators as in multi_type_vector's
    fix.

* sorted_string_map

  * significantly improved the performance of its find() method by
    switching from using linear search to using binary search.  The
    improvement is especially visible with a large number of elements.
   2016-02-13 09:40:22 by Thomas Klausner | Files touched by this commit (11) | Package removed
Log message:
Update mdds to 1.0, based on the wip version by coypu and leot.

mdds 1.0.0

* all

  * introduced API versioning to ease parallel installation of API
    incompatible versions.  Version 1.0.0 will have an API versoin of
    1.0.

  * C++11 is now a hard requirement.

  * added API documentation via Doxygen, Sphinx and Breathe.

* mixed_type_matrix

  * officially removed for good in favor of multi_type_matrix.

* multi_type_vector

  * added memory usage reduction by conditionally shrinking the
    capacity of the underlying vector containers.

  * added slight performance gain by revising block adjustment policy
    during splitting of blocks.

* sorted_string_map

  * fixed a bug where a non-matching key was incorrectly returned as a
    matching key.