File: README.md

package info (click to toggle)
mozjs140 140.9.0-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 1,216,988 kB
  • sloc: javascript: 2,267,280; cpp: 1,423,816; python: 966,256; ansic: 632,542; xml: 115,965; sh: 15,392; asm: 13,397; makefile: 10,456; yacc: 4,504; perl: 2,223; lex: 1,414; ruby: 1,064; exp: 756; java: 185; sql: 66; sed: 18
file content (12 lines) | stat: -rw-r--r-- 493 bytes parent folder | download | duplicates (28)
1
2
3
4
5
6
7
8
9
10
11
12
range-map
=========

This crate provides maps and sets where the key is a primitive integer type.
Whereas in general-purpose maps and sets performance generally depends on the
number of keys, here it depends on the number of *ranges* of keys. For example,
in this crate it's very easy to represent the set of all `u32` values, but it
would be a bad idea to represent the same set using
`std::collections::HashSet<u32>`.

[Documentation](http://jneem.github.io/range-map/range_map/index.html)