pkgsrc/devel/mdds/distinfo

$NetBSD: distinfo,v 1.17 2016/03/08 18:50:21 ryoon Exp $

SHA1 (mdds-1.1.0.tar.bz2) = 4570846f61b8f37ca5a435aa43899b96e9eaf2ae
RMD160 (mdds-1.1.0.tar.bz2) = ffc7ae1bbfdc7b0a4731070ad6aa9b5a0228bff4
SHA512 (mdds-1.1.0.tar.bz2) = 928cb6dffacdb2fe9e67dde094bbd8191137cb58402172d0fc99ed8c7aa6069668c6b1f06e515366a0843325ea051e8e0650aa2142cbc94b107a748a399d7a47
Size (mdds-1.1.0.tar.bz2) = 258691 bytes
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-03-08 19:50:21 +01:00			$NetBSD: distinfo,v 1.17 2016/03/08 18:50:21 ryoon Exp $
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 19:10:51 +01:00
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-03-08 19:50:21 +01:00			`SHA1 (mdds-1.1.0.tar.bz2) = 4570846f61b8f37ca5a435aa43899b96e9eaf2ae`
			`RMD160 (mdds-1.1.0.tar.bz2) = ffc7ae1bbfdc7b0a4731070ad6aa9b5a0228bff4`
			`SHA512 (mdds-1.1.0.tar.bz2) = 928cb6dffacdb2fe9e67dde094bbd8191137cb58402172d0fc99ed8c7aa6069668c6b1f06e515366a0843325ea051e8e0650aa2142cbc94b107a748a399d7a47`
			`Size (mdds-1.1.0.tar.bz2) = 258691 bytes`