kpriv/pkgsrc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
pkgsrc/devel/libdatrie/buildlink3.mk

13 lines
325 B
Makefile
Raw Normal View History

Update libdatrie to 0.2.2. 0.2.2 (2009-04-29) ===== - Support building with linkers without symbol versioning supports, including Mac, Cygwin, MinGW. - Support other iconv implementations than that's in glibc, for Mac and MinGW. 0.2.1 (2009-04-05) ===== - Fix errors in documentation - Symbol versioning to ease upgrade across SONAME - Minor cleanups 0.2.0 (2009-03-24) ===== - New APIs for performance: trie_state_copy(), trie_state_is_single() - Clean-ups 0.1.99.2 (2008-12-15) ======== - More robust handling of alphabet ranges - Allow co-existence with libdatrie0 0.1.99.1 (2008-12-12) ======== - Breaking ABI with libdatrie0 - More capacity with 32-bit node index - Adjusted API for non-file trie usage - All data in one file, no more *.br and *.tl split - Drop SBTrie wrapper; all features are merged into Trie - Domain characters are now Unicode
2009-05-15 10:52:42 +02:00
# $NetBSD: buildlink3.mk,v 1.3 2009/05/15 08:52:42 obache Exp $
Import libdatrie version 0.1.3. datrie is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries.
2008-02-11 03:11:24 +01:00
Simply and speed up buildlink3.mk files and processing. 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.
2009-03-20 20:23:50 +01:00
BUILDLINK_TREE+= libdatrie
Import libdatrie version 0.1.3. datrie is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries.
2008-02-11 03:11:24 +01:00
Simply and speed up buildlink3.mk files and processing. 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.
2009-03-20 20:23:50 +01:00
.if !defined(LIBDATRIE_BUILDLINK3_MK)
LIBDATRIE_BUILDLINK3_MK:=
Import libdatrie version 0.1.3. datrie is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries.
2008-02-11 03:11:24 +01:00
Update libdatrie to 0.2.2. 0.2.2 (2009-04-29) ===== - Support building with linkers without symbol versioning supports, including Mac, Cygwin, MinGW. - Support other iconv implementations than that's in glibc, for Mac and MinGW. 0.2.1 (2009-04-05) ===== - Fix errors in documentation - Symbol versioning to ease upgrade across SONAME - Minor cleanups 0.2.0 (2009-03-24) ===== - New APIs for performance: trie_state_copy(), trie_state_is_single() - Clean-ups 0.1.99.2 (2008-12-15) ======== - More robust handling of alphabet ranges - Allow co-existence with libdatrie0 0.1.99.1 (2008-12-12) ======== - Breaking ABI with libdatrie0 - More capacity with 32-bit node index - Adjusted API for non-file trie usage - All data in one file, no more *.br and *.tl split - Drop SBTrie wrapper; all features are merged into Trie - Domain characters are now Unicode
2009-05-15 10:52:42 +02:00
BUILDLINK_API_DEPENDS.libdatrie+= libdatrie>=0.2.0
Import libdatrie version 0.1.3. datrie is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries.
2008-02-11 03:11:24 +01:00
BUILDLINK_PKGSRCDIR.libdatrie?= ../../devel/libdatrie
Simply and speed up buildlink3.mk files and processing. 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.
2009-03-20 20:23:50 +01:00
.endif # LIBDATRIE_BUILDLINK3_MK
Import libdatrie version 0.1.3. datrie is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries.
2008-02-11 03:11:24 +01:00
Simply and speed up buildlink3.mk files and processing. 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.
2009-03-20 20:23:50 +01:00
BUILDLINK_TREE+= -libdatrie
Reference in a new issue Copy permalink