Module extra
Rust extras.
The extra
crate is a set of useful modules for a variety of
purposes, including collections, numerics, I/O, serialization,
and concurrency.
Rust extras are part of the standard Rust distribution.
Modules
arc | Concurrency-enabled mechanisms for sharing mutable and/or immutable state between tasks. |
arena | The arena, a fast but limited type of allocator. |
base64 | Base64 binary-to-text encoding |
bigint | A Big integer (signed version: |
bitv | |
btree | Starting implementation of a btree for rust. Structure inspired by github user davidhalperin's gist. |
c_vec | Library to interface with chunks of memory allocated in C. |
comm | Higher level communication abstractions. |
complex | Complex numbers. |
container | Container traits for extra |
dlist | A doubly-linked list with owned nodes. |
ebml | |
enum_set | A structure for holding a set of enum variants |
flate | Simple compression |
future | A type representing values that may be computed concurrently and operations for working with them. |
getopts | Simple getopt alternative. |
glob | Support for matching file paths against Unix shell style patterns. |
hex | Hex binary-to-text encoding |
json | json parsing and serialization |
list | A standard, garbage-collected linked list. |
lru_cache | A cache that holds a limited number of key-value pairs. When the capacity of the cache is exceeded, the least-recently-used (where "used" means a look-up or putting the pair into the cache) pair is automatically removed. |
priority_queue | A priority queue implemented with a binary heap |
rational | Rational numbers |
ringbuf | A double-ended queue implemented as a circular buffer |
semver | Semantic version parsing and comparison. |
serialize | Support code for encoding and decoding types. |
smallintmap | A simple map based on a vector for small integer keys. Space requirements are O(highest integer key). |
stats | |
sync | |
task_pool | |
tempfile | Temporary files and directories |
term | Simple ANSI color library |
terminfo | |
time | |
treemap | An ordered map and set implemented as self-balancing binary search
trees. The only requirement for the types is that the key implements
|
url | Types/fns concerning URLs (see RFC 3986) |
uuid | Generate and parse UUIDs |
workcache |