Rank Support (RS)

Classes
class	sdsl::nearest_neighbour_dictionary< sample_dens >
	Nearest neighbour dictionary for sparse uniform sets (described in Geary et al., A Simple Optimal Representation for Balanced Parentheses, CPM 2004). More...
class	sdsl::rank_support_jmc
	A class supporting rank queries in constant time. The implementation is a lightweight version of the data structure proposed by Jacobson (1989), Munro (1996), and Clark (1996). More...
class	sdsl::rank_support_v< b, pattern_len >
	A class supporting rank queries in constant time. The implementation is a version of the data structure proposed by Vigna (WEA 2008). More...
class	sdsl::rank_support_v5< b, pattern_len >
	A class supporting rank queries in constant time. The implementation is a space saving version of the data structure proposed by Vigna (WEA 2008). More...

---

Detailed Description

This group contains data structures which support an sdsl::bit_vector with the rank method.