pkgsrc/devel/libgee/Makefile

30 lines
854 B
Makefile
Raw Normal View History

2020-03-11 10:53:51 +01:00
# $NetBSD: Makefile,v 1.38 2020/03/11 09:53:52 wiz Exp $
DISTNAME= libgee-0.20.1
2020-03-11 10:53:51 +01:00
PKGREVISION= 4
Update libgee to 0.16.1 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
2014-11-01 12:20:53 +01:00
CATEGORIES= devel gnome
MASTER_SITES= ${MASTER_SITE_GNOME:=sources/libgee/${PKGVERSION_NOREV:R}/}
2012-02-03 16:15:44 +01:00
EXTRACT_SUFX= .tar.xz
MAINTAINER= pkgsrc-users@NetBSD.org
Update libgee to 0.16.1 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
2014-11-01 12:20:53 +01:00
HOMEPAGE= https://wiki.gnome.org/Projects/Libgee
COMMENT= Library providing GObject-based interfaces and classes
Update libgee to 0.5.3. 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.
2010-09-23 10:26:09 +02:00
LICENSE= gnu-lgpl-v2.1
GNU_CONFIGURE= yes
USE_LIBTOOL= yes
USE_TOOLS+= pkg-config gmake
Update libgee to 0.16.1 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
2014-11-01 12:20:53 +01:00
PKGCONFIG_OVERRIDE+= gee-0.8.pc.in
Update libgee to 0.5.3. 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.
2010-09-23 10:26:09 +02:00
TEST_TARGET= check
BUILDLINK_DEPMETHOD.gobject-introspection:= build
.include "../../devel/gobject-introspection/buildlink3.mk"
Update libgee to 0.16.1 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
2014-11-01 12:20:53 +01:00
BUILDLINK_API_DEPENDS.glib2+= glib2>=2.36
.include "../../devel/glib2/buildlink3.mk"
Update libgee to 0.16.1 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
2014-11-01 12:20:53 +01:00
BUILDLINK_DEPMETHOD.vala:= build
BUILDLINK_API_DEPENDS.vala+= vala>=0.25.1
.include "../../lang/vala/buildlink3.mk"
.include "../../mk/bsd.pkg.mk"