[ nabia ]
[ aramo ]
[ Källkod: rust-indexmap ]
Paket: librust-indexmap+rayon-dev (1.2.0-1)
Länkar för librust-indexmap+rayon-dev
Trisquelresurser:
Hämta källkodspaketet rust-indexmap:
Ansvarig:
Original Maintainers:
- Debian Rust Maintainers
- Wolfgang Silbermayr
Liknande paket:
- librust-indexmap-dev
- librust-ordermap+serde-dev
- librust-ordermap+serde-1-dev
- librust-linked-hash-map+serde-dev
- librust-linked-hash-map+serde-impl-dev
- librust-linked-hash-map+serde-test-dev
- librust-linked-hash-map+heapsize-dev
- librust-linked-hash-map+heapsize-impl-dev
- librust-ordermap-dev
- librust-lru-cache+heapsize-dev
- librust-lru-cache+heapsize-impl-dev
Hash table with consistent order and fast iteration - feature "rayon"
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 "rayon" for the Rust indexmap crate, by pulling in any additional dependencies needed by that feature.
Andra paket besläktade med librust-indexmap+rayon-dev
|
|
|
-
- dep: librust-indexmap-dev (= 1.2.0-1)
- Hash table with consistent order and fast iteration - Rust source code
-
- dep: librust-rayon-1+default-dev
- Paketet inte tillgängligt
Hämta librust-indexmap+rayon-dev
| Arkitektur | Paketstorlek | Installerad storlek | Filer |
|---|---|---|---|
| amd64 | 1,3 kbyte | 6 kbyte | [filförteckning] |
| armhf | 1,3 kbyte | 6 kbyte | [filförteckning] |