Issues found with existing distfiles:
distfiles/eclipse-sourceBuild-srcIncluded-3.0.1.zip
distfiles/fortran-utils-1.1.tar.gz
distfiles/ivykis-0.39.tar.gz
distfiles/enum-1.11.tar.gz
distfiles/pvs-3.2-libraries.tgz
distfiles/pvs-3.2-linux.tgz
distfiles/pvs-3.2-solaris.tgz
distfiles/pvs-3.2-system.tgz
No changes made to these distinfo files.
Otherwise, existing SHA1 digests verified and found to be the same on
the machine holding the existing distfiles (morden). All existing
SHA1 digests retained for now as an audit trail.
It seems that after the ABI break in 0.7, which probably should have
incurred a major version increment, libgee since 0.8 has been
backwardly compatible.
Highlights from the release notes since 0.8.8, devel/libgee0.8:
* Workaround GC thread consuming 100% of CPU
* Fix HashMap destructor name
* Add explicit tee implementations
* Add UnrolledLinkedList class implementing List and Deque interface
* Clarify the add and insert operation on list iterators and make the behaviour consistent for ArrayList and LinkedList
* Allow (partially) disable internal asserts
* Internal symbols are hidden
* Fix HazardPointer bugs
* Fix List test
* Remove workaround for 'old' (<0.23.2) vala
* Use WeakRef for keeping of read-only proxy for collection
* The collection cloning no longer leaks memory
* Override read_only_view property in ReadOnlySortedMap and its subclasses
* Add adding to collection based on iterators
* Make Collection.add_all_array, contains_all_array and remove_all_array virtual
* Avoid destroy coroutine creation in hazard pointer implementation
* Add Traversable.tee
* Add exception handling to Future
* Add ability of getting Future from Lazy
* Make Traversable.flat_map a virtual function
* Add more specializations to .foreach
* Add flat_map method to Traversable
* Add zip method to Future
* Specialize stream iterator (4-22% speed improvement in tests)
* Extend the Traversable.Stream with Stream.WAIT
* Fix lazy value usage in unfold
* Add futures and promises to libgee
* Return true from HashSet.Iterator.foreach() if we fall off the end
* Fix memory leak in TreeSet and TreeMap
* ConcurrentSet implements SortedSet
* Fix HashMultiMap, TreeMultiSet constructor
* Add add/contains/remove_all working on array
* Allow creation of ArrayList from array
* Add read_only_view to Gee.MultiSet and Gee.MultiMap
* ConcurrentSet preliminary implementation
* Allow slice in ReadOnlyList
* Fix Iterator.remove in PriorityQueue
* Add foreach specializations
* Use foreach function instead of iterators
For full details see:
https://git.gnome.org/browse/libgee/tree/NEWS?h=0.16.1
changes: bugfixes (in particular a hash table problem)
pkgsrc changes:
-point to vala016 for regeneration of source files (which is only needed
after patches, not currently)
-add introspection support
Upstream changes:
libgee 0.6.2.1
==============
* Add check-news to AM_INIT_AUTOMAKE
libgee 0.6.2
============
* Fix adding second element to priority queue.
* Fix problem with key used in range is freed.
Upstream changes:
2011-01-28 Joerg Billeter <j@bitron.ch>
Release 0.6.1
Fix memory leak in LinkedList.clear
Based on patch by Travis Reitter, fixes bug 639254.
2011-01-20 Maciej Piechotka <uzytkownik2@gmail.com>
Remove depending on order of iteration in read-only collections' test
2010-11-20 Maciej Piechotka <uzytkownik2@gmail.com>
Fix memory leak on freeingi LinkedList
If fixes issue described in bug #63522
pkgsrc changes:
* set LICENSE=gnu-lgpl-v2.1
* drop dependency on vala, not used.
* add TEST_TARGET.
NEWS from upstream:
libgee 0.5.3
============
* Fix memory leaks in TimSort and LinkedList.
* Bug fixes in TreeMap and TreeSet.
libgee 0.5.2
============
* Build system enhancements to conform Gnome's style.
* Bug fixes in TreeSet, TreeMap and Collection.to_array.
* Deprecated Map methods marked with [Deprecated].
libgee 0.5.1
============
* Bug fixes in HashMultiSet, TimSort, TreeMap, TreeMultiSet, and TreeSet.
* Fix build with Vala 0.8.0 and later.
* Fix build on Windows.
* Fix subprocess handling in test infrastructure.
libgee 0.5.0
============
* API changes
* Introduce Functions hash, equal and compare function factory
* Introduce Comparable<G> interface
* Implementations provides sane defaults when constructed without functions
* ReadOnly* made internal in favor of a `read_only_view` properties
* Iterator<G> is now mutable and resettable
* Introduction of BidirIterator<G> bidirectional iterators
* List<G>.list_iterator () returns a specialized ListIterator<G>
* Various API contracts clarifications and enhancements
* Introduce List<G>.sort () with TimSort implementation
* Complete Map API rework
* Introduce Queue and Deque interfaces
* Introduce MultiSet and MultiMap interfaces (Ali Sabil)
* Introduce SortedSet interface (Maciej Pietchotka)
* New implementations
* HashMultiSet and HashMultiMap (Ali Sabil)
* TreeMultiSet and TreeMultiMap.
* PriorityQueue
* LinkedList now implements Deque
* TreeSet now implements SortedSet (Maciej Pietchotka)
* Infrastructure
* New test framework and complete tests refactoring (Julien Peters)
* New doc/ documentation directory (--enable-doc)
* Test coverage analysis using lcov (--enable-coverage)
* Basic benchmark framework and sort benchmark (--enable-benchmark)
* Use silent rules by default for users of automake 1.11
* Code Quality
* Many bug fixes
* Many optimizations
* Lots of additional documentation
* Better overall encapsulation, dangerous public setters have been removed
* Better test coverage (more than 90%)
libgee 0.4.0
============
* Bug fixes.
libgee 0.3.0
============
* Introduce AbstractCollection, AbstractList and AbstractMap base classes.
* Add new properties and methods to Collection, List and Map. (Tomaž Vajngerl)
* Add LinkedList implementation. (Mark Lee)
* Add TreeSet and TreeMap implementations. (Maciej Piechotka)
* Iterable.element_type is now a property.
* Map.remove now takes an optional parameter to retrieve the removed value.
* Bump library version info to reflect API/ABI breakage
libgee 0.2.0
============
* Generate GIR file.
libgee 0.1.6
============
* Fix build for Vala 0.7.
* Bug fixes.
This changes the buildlink3.mk files to use an include guard for the
recursive include. The use of BUILDLINK_DEPTH, BUILDLINK_DEPENDS,
BUILDLINK_PACKAGES and BUILDLINK_ORDER is handled by a single new
variable BUILDLINK_TREE. Each buildlink3.mk file adds a pair of
enter/exit marker, which can be used to reconstruct the tree and
to determine first level includes. Avoiding := for large variables
(BUILDLINK_ORDER) speeds up parse time as += has linear complexity.
The include guard reduces system time by avoiding reading files over and
over again. For complex packages this reduces both %user and %sys time to
half of the former time.
libgee is a collection library providing GObject-based interfaces and classes
for commonly used data structures.
libgee provides the following interfaces:
* Iterable
o Collection
+ List
+ Set
* Iterator
* Map
The ArrayList, HashSet, and HashMap classes provide a reasonable sample
implementation of the List, Set, and Map interfaces. ReadOnlyCollection,
ReadOnlyList, ReadOnlySet, and ReadOnlyMap are read-only wrapper classes that
prevent modification of the underlying collection.
libgee is written in Vala and can be used like any GObject-based C library.
It's planned to provide bindings for further languages.
