Container / collection literal macros for HashMap <https://doc.rust-lang.org/beta/std/collections/struct.HashMap.html>
, HashSet <https://doc.rust-lang.org/beta/std/collections/struct.HashSet.html>
, BTreeMap <https://doc.rust-lang.org/beta/std/collections/struct.BTreeMap.html>
, BTreeSet <https://doc.rust-lang.org/beta/std/collections/struct.BTreeSet.html>
.
You can use these for convenience. Using them has no other implications.
Please read the API documentation here
__
__ https://docs.rs/maplit/
|buildstatus| |crates|_
.. |buildstatus| image:: https://travis-ci.org/bluss/maplit.svg?branch=master .. _buildstatus: https://travis-ci.org/bluss/maplit
.. |crates| image:: http://meritbadge.herokuapp.com/maplit .. _crates: https://crates.io/crates/maplit
1.0.2
maplit::hashmap!(..)
(#27)1.0.1
unused_results
lint in the macros by @povilasb1.0.0
0.1.6
convert_args!
for composable opt-in conversion of the
expressions being used for the maplit macros.0.1.5
0.1.4
0.1.2
0.1.0
Question: Very large maps take a long time to compile?
Answer: Rustc is very slow to compile big expressions with many literals (including integers and float literals). Work around this by either using explicitly typed literals, or explicitly typed conversions. See https://github.com/bluss/maplit/issues/14 for more information.
Dual-licensed to be compatible with the Rust project.
Licensed under the Apache License, Version 2.0 http://www.apache.org/licenses/LICENSE-2.0 or the MIT license http://opensource.org/licenses/MIT, at your option. This file may not be copied, modified, or distributed except according to those terms.