#
# spec file for package cddlib
#
# 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:           cddlib
%define lname	libcdd0
Version:        0.94f
Release:        0
Summary:        Library for finding vertices of convex polytopes
Group:          Productivity/Scientific/Math
License:        GPL-2.0+
URL:            http://www.ifor.math.ethz.ch/~fukuda/cdd_home/

Source:         cddlib-094f.tar.xz
Patch1:		cddlib-shared.diff
Patch2:		cddlib-flags.diff
BuildRoot:      %{_tmppath}/%{name}-%{version}-build
BuildRequires:  gmp-devel >= 3, xz

%description
cddlib is a C implementation of the Double Description Method of
Motzkin et al. for generating all vertices (i.e. extreme points) and
extreme rays of a general convex polyhedron in R^d given by a system
of linear inequalities.

%package -n %lname
Summary:        Library for finding vertices of convex polytopes
Group:          System/Libraries

%description -n %lname
cddlib is a C implementation of the Double Description Method of
Motzkin et al. for generating all vertices (i.e. extreme points) and
extreme rays of a general convex polyhedron in R^d given by a system
of linear inequalities.

%package devel
Summary:        Development files for cddlib
Group:          Development/Libraries/C and C++
Requires:       %lname = %version

%description devel
cddlib is a C implementation of the Double Description Method of
Motzkin et al. for generating all vertices (i.e. extreme points) and
extreme rays of a general convex polyhedron in R^d given by a system
of linear inequalities.

%prep
%setup -qn %name-094f
%patch -P 1 -P 2 -p1

%build
autoreconf -fi;
%configure --enable-shared --disable-static
make %{?_smp_mflags}

%install
%make_install
find "%buildroot" -name "*.la" -delete;

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

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

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

%files devel
%defattr(-,root,root)
%_bindir/*
%_libdir/libcdd*.so
%_includedir/*

%changelog