Install this package:
emerge -a dev-libs/unordered_dense
| Version | EAPI | Keywords | Slot |
|---|---|---|---|
| 9999 | 8 | ~amd64 ~arm64 ~ppc64 ~riscv ~x86 | 0 |
| 4.9.2 | 8 | ~amd64 ~arm64 ~ppc64 ~riscv ~x86 | 0 |
| 4.8.1 | 8 | ~amd64 ~arm64 ~ppc64 ~riscv ~x86 | 0 |
| 4.4.0 | 8 | ~amd64 ~arm64 ~ppc64 ~riscv ~x86 | 0 |
| 4.11.0 | 8 | ~amd64 ~arm64 ~ppc64 ~riscv ~x86 | 0 |
| 4.0.1 | 8 | ~amd64 ~arm64 ~ppc64 ~riscv ~x86 | 0 |
<pkgmetadata> <maintainer type="person"> <email>vowstar@gmail.com</email> <name>Huang Rui</name> </maintainer> <longdescription lang="en"> A fast and densely stored hashmap and hashset based on robin-hood backward shift deletion. The classes ankerl::unordered_dense::map and ankerl::unordered_dense::set are (almost) drop-in replacements of std::unordered_map and std::unordered_set. While they don't have as strong iterator / reference stability guaranties, they are typically much faster. </longdescription> <upstream> <remote-id type="github">martinus/unordered_dense</remote-id> </upstream> </pkgmetadata>
Manage flags for this package:
euse -i <flag> -p dev-libs/unordered_dense |
euse -E <flag> -p dev-libs/unordered_dense |
euse -D <flag> -p dev-libs/unordered_dense
| Flag | Description | 9999 | 4.9.2 | 4.8.1 | 4.4.0 | 4.11.0 | 4.0.1 |
|---|---|---|---|---|---|---|---|
| test | Build and run tests ⚠️ | ✗ | ✗ | ✗ | ✗ | ✗ | ✓ |
| Type | File | Size | Versions |
|---|---|---|---|
| DIST | unordered_dense-4.0.1.tar.gz | 364688 bytes | 4.0.1 |
| DIST | unordered_dense-4.11.0.tar.gz | 1434832 bytes | 4.11.0 |
| DIST | unordered_dense-4.4.0.tar.gz | 900081 bytes | 4.4.0 |
| DIST | unordered_dense-4.8.1.tar.gz | 915251 bytes | 4.8.1 |
| DIST | unordered_dense-4.9.2.tar.gz | 1347717 bytes | 4.9.2 |
| Type | File | Size |
|---|