File mingw32-sparsehash.spec of Package mingw32-sparsehash

#
# spec file for package mingw32-sparsehash
#
# Copyright (c) 2014 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:           mingw32-sparsehash
Version:        2.0.2
Release:        0
Summary:        An extremely memory-efficient hash_map implementation
License:        BSD-3-Clause
Group:          System/Libraries
Url:            http://code.google.com/p/sparsehash/
Source:         sparsehash-%{version}.tar.gz
BuildRequires:  mingw32-cross-binutils
BuildRequires:  mingw32-cross-gcc
BuildRequires:  mingw32-cross-gcc-c++
BuildRequires:  mingw32-filesystem >= 23
BuildArch:      noarch
%_mingw32_package_header_debug

%description
An extremely memory-efficient hash_map implementation. 2 bits/entry overhead! The SparseHash library contains several hash-map implementations, including implementations that optimize for space or speed.
These hashtable implementations are similar in API to SGI's hash_map class and the tr1 unordered_map class, but with different performance characteristics. It's easy to replace hash_map or unordered_map by sparse_hash_map or dense_hash_map in C++ code.
They also contain code to serialize and unserialize from disk.

%package devel
Summary:        An extremely memory-efficient hash_map implementation
Group:          Development/Libraries/C and C++

%description devel
An extremely memory-efficient hash_map implementation. 2 bits/entry overhead! The SparseHash library contains several hash-map implementations, including implementations that optimize for space or speed.
These hashtable implementations are similar in API to SGI's hash_map class and the tr1 unordered_map class, but with different performance characteristics. It's easy to replace hash_map or unordered_map by sparse_hash_map or dense_hash_map in C++ code.
They also contain code to serialize and unserialize from disk.

%prep
%setup -q -n sparsehash-%{version}

%build
%{_mingw32_configure}

make %{?_smp_mflags} || make

%install
make DESTDIR=%{buildroot} install %{?_smp_mflags}

%files
%defattr(-,root,root)
%doc doc/*

%files devel
%defattr(-,root,root)
%{_mingw32_includedir}/google/
%{_mingw32_includedir}/sparsehash/
%{_mingw32_libdir}/pkgconfig/
%{_mingw32_datadir}/doc/sparsehash-%{version}/

%changelog