Adaptive Radix Trees implemented in C
18.33 KB
built 2026-10-14 19:57:53 GMT
Description
This library provides a C99 implementation of the Adaptive Radix Tree or ART.
The ART operates similar to a traditional radix tree but avoids the wasted
space of internal nodes by changing the node size. It makes use of 4 node sizes
(4, 16, 48, 256), and can guarantee that the overhead is no more than 52 bytes
per key, though in practice it is much lower.
Dependencies
12 totalRequires9
- ld-linux-riscv64-lp64d.so.1()(64bit)
- ld-linux-riscv64-lp64d.so.1(GLIBC_2.27)(64bit)
- libc.so.6()(64bit)
- libc.so.6(GLIBC_2.27)(64bit)
- rpmlib(CompressedFileNames) <= 3.0.4-1
- rpmlib(FileDigests) <= 4.6.0-1
- rpmlib(PayloadFilesHavePrefix) <= 4.0-1
- rpmlib(PayloadIsZstd) <= 5.4.18-1
- rtld(GNU_HASH)
Provides3
- libart = 0-14.20210723git3010468.fc45
- libart(riscv-64) = 0-14.20210723git3010468.fc45
- libart.so.0()(64bit)
ObsoletesNo Obsoletes
ConflictsNo Conflicts
RecommendsNo Recommends
SuggestsNo Suggests
SupplementsNo Supplements
EnhancesNo Enhances
Files
8Name  |
Size |
|---|---|
| /usr/lib/.build-id | 0.00 B |
| /usr/lib/.build-id/a0 | 0.00 B |
| /usr/lib/.build-id/a0/7b706750708121aa331b8b99ee1121f38cbaf2 | 33.00 B |
| /usr/lib64/libart.so.0 | 15.00 KB |
| /usr/share/doc/libart | 0.00 B |
| /usr/share/doc/libart/README.md | 1.56 KB |
| /usr/share/licenses/libart | 0.00 B |
| /usr/share/licenses/libart/LICENSE | 1.46 KB |
Files 1–8 of 8
Component of
buildroots that installed this RPMNo Buildroots