perl-Tree-RedBlack/perl-Tree-RedBlack.spec
Name: perl-Tree-RedBlack
Summary: Perl implementation of Red/Black tree, a type of balanced tree
Version: 0.5
Release: 1
License: Artistic/GPL
Group: Applications/CPAN
URL: http://search.cpan.org/dist/Tree-RedBlack/
Description: Tree::RedBlack is a pure perl implementation of the Red/Black balanced tree
algorithm from the book "Algorithms" by Cormen, Leiserson & Rivest. It
supports insertion, searching, finding minima, maxima, predecessors and
successors, and deletion (deletion definitely has bugs right now). Each node
in the tree consists of a key and a value. Both can be any Perl scalar, even a
complex structure. By default, keys in the tree are ordered lexically, but the
ordering can be overriden by providing the tree with a comparison subroutine.
CentOS 7 x86_64
The build was succesful. The following RPMs were generated:
CentOS 6 x86_64
The build was succesful. The following RPMs were generated:
Contents
The spec file used by the build system currently has the following contents:
# $Id$
# Authority: dries
# Upstream: Benjamin Holzman <bholzman$earthlink,net>
%define perl_vendorlib %(eval "`%{__perl} -V:installvendorlib`"; echo $installvendorlib)
%define perl_vendorarch %(eval "`%{__perl} -V:installvendorarch`"; echo $installvendorarch)
%define real_name Tree-RedBlack
Summary: Perl implementation of Red/Black tree, a type of balanced tree
Name: perl-Tree-RedBlack
Version: 0.5
Release: 1%{?dist}
License: Artistic/GPL
Group: Applications/CPAN
URL: http://search.cpan.org/dist/Tree-RedBlack/
Source: http://www.cpan.org/modules/by-module/Tree/Tree-RedBlack-%{version}.tar.gz
BuildRoot: %{_tmppath}/%{name}-%{version}-%{release}-root
BuildArch: noarch
BuildRequires: perl
BuildRequires: perl(ExtUtils::MakeMaker)
%description
Tree::RedBlack is a pure perl implementation of the Red/Black balanced tree
algorithm from the book "Algorithms" by Cormen, Leiserson & Rivest. It
supports insertion, searching, finding minima, maxima, predecessors and
successors, and deletion (deletion definitely has bugs right now). Each node
in the tree consists of a key and a value. Both can be any Perl scalar, even a
complex structure. By default, keys in the tree are ordered lexically, but the
ordering can be overriden by providing the tree with a comparison subroutine.
%prep
%setup -n %{real_name}-%{version}
%build
%{__perl} Makefile.PL INSTALLDIRS="vendor" PREFIX="%{buildroot}%{_prefix}"
%{__make} %{?_smp_mflags}
%install
%{__rm} -rf %{buildroot}
%{__make} pure_install
### Clean up buildroot
find %{buildroot} -name .packlist -exec %{__rm} {} \;
%clean
%{__rm} -rf %{buildroot}
%files
%defattr(-, root, root, 0755)
%doc Changes README
%doc %{_mandir}/man3/*
%{perl_vendorlib}/Tree/RedBlack.pm
%{perl_vendorlib}/Tree/RedBlack
%changelog
* Wed Jun 10 2009 Christoph Maser <cmr@financial.com> - 0.5-1
- Updated to version 0.5.
* Wed Mar 22 2006 Dries Verachtert <dries@ulyssis.org> - 0.3-1.2
- Rebuild for Fedora Core 5.
* Sat Apr 9 2005 Dries Verachtert <dries@ulyssis.org> - 0.3-1
- Initial package.