Navigation:
Browse pkgsrc
(this page)| 2018-12-13 20:52:27 by Adam Ciarcinski | Files touched by this commit (668) |
Log message: revbump for boost 1.69.0 |
2018-08-16 20:55:17 by Adam Ciarcinski | Files touched by this commit (653) |  |
Log message: revbump after boost-libs update |
| 2018-04-29 23:32:09 by Adam Ciarcinski | Files touched by this commit (629) | |
Log message: revbump for boost-libs update |
| 2018-01-01 22:18:57 by Adam Ciarcinski | Files touched by this commit (629) | |
Log message: Revbump after boost update |
| 2017-08-24 22:03:43 by Adam Ciarcinski | Files touched by this commit (621) | |
Log message: Revbump for boost update |
| 2017-04-30 03:22:04 by Ryo ONODERA | Files touched by this commit (612) | |
Log message: Recursive revbump from boost update |
| 2017-01-01 17:06:40 by Adam Ciarcinski | Files touched by this commit (616) | |
Log message: Revbump after boost update |
| 2016-10-07 20:26:14 by Adam Ciarcinski | Files touched by this commit (611) | |
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) |
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.
|
New packages: