pkgsrc/devel/libstree/distinfo

$NetBSD: distinfo,v 1.3 2005/02/23 22:24:19 agc Exp $

SHA1 (libstree-0.4.0.tar.gz) = b6df1ff749d8d402deaf73a918bb10efffc8dd08
RMD160 (libstree-0.4.0.tar.gz) = 92e0e999a20ee02510e5bc1d2cd243132d034b74
Size (libstree-0.4.0.tar.gz) = 253700 bytes
Add RMD160 digests. 2005-02-23 23:24:08 +01:00			$NetBSD: distinfo,v 1.3 2005/02/23 22:24:19 agc Exp $
Initial import of libstree 0.3.0. LibSTree is a library containing generic string algorithms based on suffix trees. The underlying implementation is based on Ukkonen's linear suffix tree creation algorithm, supporting multiple strings per tree. 2003-12-04 05:52:46 +01:00
Update to libstree 0.4.0. Changes since 0.3.0: * Fixed logic error in lst_string_eq() * Added support for determining the longest repeated substring 2004-08-22 18:49:39 +02:00			`SHA1 (libstree-0.4.0.tar.gz) = b6df1ff749d8d402deaf73a918bb10efffc8dd08`
Add RMD160 digests. 2005-02-23 23:24:08 +01:00			`RMD160 (libstree-0.4.0.tar.gz) = 92e0e999a20ee02510e5bc1d2cd243132d034b74`
Update to libstree 0.4.0. Changes since 0.3.0: * Fixed logic error in lst_string_eq() * Added support for determining the longest repeated substring 2004-08-22 18:49:39 +02:00			`Size (libstree-0.4.0.tar.gz) = 253700 bytes`