File: README.md

package info (click to toggle)
firefox 147.0.3-1
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 4,683,320 kB
  • sloc: cpp: 7,607,359; javascript: 6,533,295; ansic: 3,775,223; python: 1,415,500; xml: 634,561; asm: 438,949; java: 186,241; sh: 62,752; makefile: 18,079; objc: 13,092; perl: 12,808; yacc: 4,583; cs: 3,846; pascal: 3,448; lex: 1,720; ruby: 1,003; php: 436; lisp: 258; awk: 247; sql: 66; sed: 54; csh: 10; exp: 6
file content (12 lines) | stat: -rw-r--r-- 493 bytes parent folder | download | duplicates (25) 
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)