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.
pub use std::os; |
| arc | Concurrency-enabled mechanisms for sharing mutable and/or immutable state between tasks. |
| arena | |
| base64 | Base64 binary-to-text encoding |
| bigint | A Big integer (signed version: BigInt, unsigned version: BigUint). |
| bitv | |
| 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 |
| cryptoutil | |
| digest | |
| dlist | A doubly-linked list with owned nodes. |
| ebml | |
| enum_set | |
| fileinput | A library for iterating through the lines in a series of files. Very similar to the Python module of the same name. |
| flate | Simple compression |
| flatpipes | Generic communication channels for things that can be represented as, or transformed to and from, byte vectors. |
| 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 |
| io_util | |
| json | json parsing and serialization |
| list | A standard, garbage-collected linked list. |
| md4 | |
| md5 | |
| priority_queue | A priority queue implemented with a binary heap |
| rational | Rational numbers |
| rc | |
| ringbuf | A double-ended queue implemented as a circular buffer |
| rl | |
| semver | Semantic version parsing and comparison. |
| serialize | Support code for encoding and decoding types. |
| sha1 | An implementation of the SHA-1 cryptographic hash. |
| sha2 | |
| smallintmap | A simple map based on a vector for small integer keys. Space requirements are O(highest integer key). |
| sort | Sorting methods |
| 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 |
Prefix searches with a type followed by a colon (e.g.
fn:) to restrict the search to a given type.
Accepted types are: fn, mod,
struct (or str), enum,
trait, typedef (or
tdef).