|
|
|
@ -5,11 +5,11 @@
|
|
|
|
|
%global crate indexmap
|
|
|
|
|
|
|
|
|
|
Name: rust-%{crate}
|
|
|
|
|
Version: 1.8.2
|
|
|
|
|
Version: 1.9.1
|
|
|
|
|
Release: %autorelease
|
|
|
|
|
Summary: Hash table with consistent order and fast iteration
|
|
|
|
|
|
|
|
|
|
# Upstream license specification: Apache-2.0/MIT
|
|
|
|
|
# Upstream license specification: Apache-2.0 OR MIT
|
|
|
|
|
License: ASL 2.0 or MIT
|
|
|
|
|
URL: https://crates.io/crates/indexmap
|
|
|
|
|
Source: %{crates_source}
|
|
|
|
@ -19,14 +19,7 @@ ExclusiveArch: %{rust_arches}
|
|
|
|
|
BuildRequires: rust-packaging >= 21
|
|
|
|
|
|
|
|
|
|
%global _description %{expand:
|
|
|
|
|
Hash table with consistent order and fast iteration.
|
|
|
|
|
The indexmap is a hash table where the iteration order of the key-value pairs
|
|
|
|
|
is independent of the hash values of the keys. It has the usual hash table
|
|
|
|
|
functionality, it preserves insertion order except after removals, and it
|
|
|
|
|
allows lookup of its elements by either hash table key or numerical index. A
|
|
|
|
|
corresponding hash set type is also provided.
|
|
|
|
|
This crate was initially published under the name ordermap, but it was renamed
|
|
|
|
|
to indexmap.}
|
|
|
|
|
Hash table with consistent order and fast iteration.}
|
|
|
|
|
|
|
|
|
|
%description %{_description}
|
|
|
|
|
|
|
|
|
@ -42,8 +35,8 @@ use the "%{crate}" crate.
|
|
|
|
|
%files devel
|
|
|
|
|
%license %{crate_instdir}/LICENSE-APACHE
|
|
|
|
|
%license %{crate_instdir}/LICENSE-MIT
|
|
|
|
|
%doc %{crate_instdir}/README.rst
|
|
|
|
|
%doc %{crate_instdir}/RELEASES.rst
|
|
|
|
|
%doc %{crate_instdir}/README.md
|
|
|
|
|
%doc %{crate_instdir}/RELEASES.md
|
|
|
|
|
%{crate_instdir}/
|
|
|
|
|
|
|
|
|
|
%package -n %{name}+default-devel
|
|
|
|
|