File dbh.spec of Package dbh

#
# spec file for package dbh
#
# Copyright (c) 2011 SUSE LINUX Products GmbH, Nuernberg, Germany.
#
# All modifications and additions to the file contributed by third parties
# remain the property of their copyright owners, unless otherwise agreed
# upon. The license for this file, and modifications and additions to the
# file, is the same license as for the pristine package itself (unless the
# license for the pristine package is not an Open Source License, in which
# case the license is the MIT License). An "Open Source License" is a
# license that conforms to the Open Source Definition (Version 1.9)
# published by the Open Source Initiative.

# Please submit bugfixes or comments via http://bugs.opensuse.org/
#



Name:           dbh
%define lname	libdbh-4_5-4
Summary:        Disk-Based Hash Library
Version:        4.5.0
Release:        124
License:        GPL-2.0+
Group:          Development/Libraries/Other
Source:         %{name}-%{version}.tar.bz2
Url:            http://dbh.sourceforge.net
BuildRoot:      %{_tmppath}/%{name}-%{version}-build

%description 
Disk-based hashes is a method to create multidimensional binary trees
on disk. This library permits the extension of the database concept to
a plethora of electronic data, such as graphic information. With the
multidimensional binary tree, it is possible to mathematically prove
that access time to any particular record is minimized (using the
concept of critical points from calculus), which provides the means to
construct optimized databases for particular applications.

%package -n %lname
Summary:        Disk-Based Hash Library
Group:          Development/Libraries/Other
Obsoletes:      dbh < %version-%release
Provides:       dbh = %version-%release

%description -n %lname
Disk-based hashes is a method to create multidimensional binary trees
on disk. This library permits the extension of the database concept to
a plethora of electronic data, such as graphic information. With the
multidimensional binary tree, it is possible to mathematically prove
that access time to any particular record is minimized (using the
concept of critical points from calculus), which provides the means to
construct optimized databases for particular applications.

%package devel
Summary:        Development files for the Disk-Based Hash Library
Group:          Development/Libraries/Other
Requires:       %lname = %version

%description devel
Disk-based hashes is a method to create multidimensional binary trees
on disk. This library permits the extension of the database concept to
a plethora of electronic data, such as graphic information. With the
multidimensional binary tree, it is possible to mathematically prove
that access time to any particular record is minimized (using the
concept of critical points from calculus), which provides the means to
construct optimized databases for particular applications.

%prep
%setup -q

%build
%configure --disable-static --with-pic
make %{?_smp_mflags}

%install
make DESTDIR=$RPM_BUILD_ROOT install 
%{__rm} -f %{buildroot}%{_libdir}/*.la

%check
make check

%files -n %lname
%defattr(-,root,root)
%_libdir/lib*.so.*

%files devel
%defattr(-,root,root)
%doc AUTHORS COPYING ChangeLog README examples/*.c examples/Makefile* doc/*.html
%{_includedir}/*
%{_libdir}/lib*.so
%{_libdir}/pkgconfig/*.pc

%post -n %lname -p /sbin/ldconfig

%postun -n %lname -p /sbin/ldconfig

%changelog