proc-macro2 • 0.4.30A substitute implementation of the compiler's `proc_macro` API to decouple token-based libraries from the procedural macro use case.
INDIRECT
1
proc-macro2 • 1.0.88A substitute implementation of the compiler's `proc_macro` API to decouple token-based libraries from the procedural macro use case.
regex • 1.7.3An implementation of regular expressions for Rust. This implementation uses
finite automata and guarantees linear time matching on all inputs.
term_size • 0.3.2functions for determining terminal sizes and dimensions
DIRECT
4
toml • 0.4.10A native Rust encoder and decoder of TOML-formatted files and streams. Provides
implementations of the standard Serialize/Deserialize traits for TOML data to
facilitate deserializing and serializing Rust structures.
unicode-normalization • 0.1.24This crate provides functions for normalization of
Unicode strings, including Canonical and Compatible
Decomposition and Recomposition, as described in
Unicode Standard Annex #15.
INDIRECT
2
unicode-width • 0.1.14Determine displayed width of `char` and `str` types
according to Unicode Standard Annex #11 rules.
DIRECT
0
unicode-xid • 0.1.0Determine whether characters have the XID_Start
or XID_Continue properties according to
Unicode Standard Annex #31.
INDIRECT
0
url • 1.7.2URL library for Rust, based on the WHATWG URL Standard
INDIRECT
7
version_check • 0.1.5Tiny crate to check the version of the installed/running rustc.
INDIRECT
0
winapi-i686-pc-windows-gnu • 0.4.0Import libraries for the i686-pc-windows-gnu target. Please don't use this crate directly, depend on winapi instead.
INDIRECT
0
winapi-x86_64-pc-windows-gnu • 0.4.0Import libraries for the x86_64-pc-windows-gnu target. Please don't use this crate directly, depend on winapi instead.
bincode • 1.3.3A binary serialization / deserialization strategy for transforming structs into bytes and vice versa!
INDIRECT
6
lipsum • 0.6.0Lipsum is a lorem ipsum text generation library. It generates
pseudo-random Latin text. Use this if you need filler or dummy text
for your application.
The text is generated using a simple Markov chain, which you can
instantiate to generate your own pieces of pseudo-random text.
DIRECT
20
matches • 0.1.10A macro to evaluate, as a boolean, whether an expression matches a pattern.