rust-indexmap 1.0.2-1 source package in Ubuntu

Changelog

rust-indexmap (1.0.2-1) unstable; urgency=medium

  * Package indexmap 1.0.2 from crates.io using debcargo 2.2.9

 -- Wolfgang Silbermayr <email address hidden>  Mon, 03 Dec 2018 08:02:32 +0100

Upload details

Uploaded by:
Rust Maintainers on 2018-12-03
Uploaded to:
Sid
Original maintainer:
Rust Maintainers
Architectures:
any
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Disco release on 2018-12-03 universe misc

Downloads

File Size SHA-256 Checksum
rust-indexmap_1.0.2-1.dsc 2.2 KiB c54db66955ddb791e6513b2784742c5b67604a0753a2b1a40229303421babe90
rust-indexmap_1.0.2.orig.tar.gz 37.4 KiB 7e81a7c05f79578dbc15793d8b619db9ba32b4577003ef3af1a91c416798c58d
rust-indexmap_1.0.2-1.debian.tar.xz 2.7 KiB fe7549b38a94fcec2e1b484e50f1745fb38a3bec2ec0138353f79b937bc4a765

Available diffs

No changes file available.

Binary packages built by this source

librust-indexmap+serde-1-dev: Hash table with consistent order and fast iteration - feature "serde-1"

 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.
 .
 This metapackage enables feature serde-1 for the Rust indexmap crate, by
 pulling in any additional dependencies needed by that feature.

librust-indexmap+serde-dev: Hash table with consistent order and fast iteration - feature "serde"

 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.
 .
 This metapackage enables feature serde for the Rust indexmap crate, by pulling
 in any additional dependencies needed by that feature.

librust-indexmap-dev: Hash table with consistent order and fast iteration - Rust source code

 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.
 .
 This package contains the source for the Rust indexmap crate, packaged by
 debcargo for use with cargo and dh-cargo.