Class List

Here are the classes, structs, unions and interfaces with brief descriptions:

[detail level 123]

▼Ncplib
CBarrettModInt	Modular integer using Barrett reduction
CBitDict	Static bit sequence with rank query in \(O(1)\)
CDaryHeap	D-ary heap, slightly faster than binary heap due to less random memory access
CHashTable	Linear probing hash table with std non-compliant interface
CModInt2P61M1	Modular integer modulo \(N=2^{61}-1\), a Mersenne prime
CMontgomeryModInt	Modular integer stored in Montgomery form
▼CPairingHeap	Pairing heap, a pointer-based heap supporting efficient merge and decrease-key
Citerator
CPolynomial
Cradix2_fft_root	\(2^n\)-th root of unity for radix-2 FFT
Cradix2_fft_root< MMInt64< 4242390848983007233 > >
Cradix2_fft_root< MMInt64< 4512606826625236993 > >	Specialization of radix2_fft_root for a large FFT-friendly finite prime field
Cradix2_fft_root< MMInt< 998244353 > >	Specialization of radix2_fft_root for \(\mathbb{F}_{998244353}\), the most common FFT-friendly finite prime field in competitive programming
Cradix2_fft_root< std::complex< Float > >	Specialzation of radix2_fft_root for complex numbers
CRangeMinQuery	Efficient \(\langle O(N), O(1) \rangle\) static range minimum query
CSparseTable	\(\langle O(N\log N), O(1) \rangle\) sparse table for certain binary operations like min and gcd
CStaticSizedBitTrie	Bit trie that manages an ordered set of integers, with compile-time fixed height
CStaticSizedBitTrie< T, Bits, 0 >	Specialization of StaticSizedBitTrie on the lowest level, using only a bitmap
CWaveletArray	Efficient representation of a wavelet tree, supporting various static range queries
CWyHash	Hash function class like std::hash but uses wyhash
CWyHash< std::pair< T1, T2 > >	WyHash specialization for std::pair
CWyHash< std::string >	WyHash specialization for std::string