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

14 lines
321 B
Makefile
Raw Normal View History

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
# $NetBSD: buildlink3.mk,v 1.9 2009/03/20 19:24:11 joerg Exp $
Importing darts-0.2. Darts: Double-ARray Trie System This is a C++ template library that implements Double-Array [Aoe 1989]. Currently only Japanese documentation is provided. * [Aoe1989] Aoe, J. An Efficient Digital Search Algorithm by Using a Double-Array Structure. IEEE Transactions on Software Engineering. Vol. 15, 9 (Sep 1989). pp. 1066-1077. * [Datrie] Theppitak Karoonboonyanan An Implementation of Double-Array Triehttp://www.links.nectec.or.th/~thep/datrie/
2004-05-06 15:22:43 +02: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+= darts
Importing darts-0.2. Darts: Double-ARray Trie System This is a C++ template library that implements Double-Array [Aoe 1989]. Currently only Japanese documentation is provided. * [Aoe1989] Aoe, J. An Efficient Digital Search Algorithm by Using a Double-Array Structure. IEEE Transactions on Software Engineering. Vol. 15, 9 (Sep 1989). pp. 1066-1077. * [Datrie] Theppitak Karoonboonyanan An Implementation of Double-Array Triehttp://www.links.nectec.or.th/~thep/datrie/
2004-05-06 15:22:43 +02: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(DARTS_BUILDLINK3_MK)
DARTS_BUILDLINK3_MK:=
Importing darts-0.2. Darts: Double-ARray Trie System This is a C++ template library that implements Double-Array [Aoe 1989]. Currently only Japanese documentation is provided. * [Aoe1989] Aoe, J. An Efficient Digital Search Algorithm by Using a Double-Array Structure. IEEE Transactions on Software Engineering. Vol. 15, 9 (Sep 1989). pp. 1066-1077. * [Datrie] Theppitak Karoonboonyanan An Implementation of Double-Array Triehttp://www.links.nectec.or.th/~thep/datrie/
2004-05-06 15:22:43 +02:00
Update devel/darts to 0.32 which is needed by newer chasen. Changes from web page: - Add license file whihc wasn't included. - Miscellaneous code clean up (constify).
2008-08-03 17:21:56 +02:00
BUILDLINK_API_DEPENDS.darts+= darts>=0.32
Correct path for BUILDLINK_PKGSRCDIR.darts.
2004-05-08 23:34:43 +02:00
BUILDLINK_PKGSRCDIR.darts?= ../../devel/darts
Update darts to 0.31. pkgsrc change: o Add DESTDIR supoprt. o fix buildlink3.mk, stopping pkglint's warning. darts change from 0.2 to 0.31. o Change license from LGPL to BSD/LGPL dual license. o Fix a bug which cause illegal access when create doule array. o Change some methods' name, such as setArray to set_array. o Stop providing rpm packages.
2007-08-02 17:00:55 +02:00
BUILDLINK_DEPMETHOD.darts?= build
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 # DARTS_BUILDLINK3_MK
Importing darts-0.2. Darts: Double-ARray Trie System This is a C++ template library that implements Double-Array [Aoe 1989]. Currently only Japanese documentation is provided. * [Aoe1989] Aoe, J. An Efficient Digital Search Algorithm by Using a Double-Array Structure. IEEE Transactions on Software Engineering. Vol. 15, 9 (Sep 1989). pp. 1066-1077. * [Datrie] Theppitak Karoonboonyanan An Implementation of Double-Array Triehttp://www.links.nectec.or.th/~thep/datrie/
2004-05-06 15:22:43 +02: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+= -darts
Reference in a new issue Copy permalink