File: README.md

package info (click to toggle)
firefox 149.0-1
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 4,767,760 kB
  • sloc: cpp: 7,416,064; javascript: 6,752,859; ansic: 3,774,850; python: 1,250,473; xml: 641,578; asm: 439,191; java: 186,617; sh: 56,634; makefile: 18,856; objc: 13,092; perl: 12,763; pascal: 5,960; yacc: 4,583; cs: 3,846; lex: 1,720; ruby: 1,002; php: 436; lisp: 258; awk: 105; sql: 66; sed: 53; csh: 10; exp: 6
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)