O(n + max_key) stable sort on the items generated by vals. Items v in vals are sorted according to val_to_key[v].

Creates an empty trie with a root node.

Finds the sequence of edges in an Euler path starting from u, assuming it exists and that the graph is directed. Undefined behavior if this preconditi

Helper function used by euler_path. Note that we can't use a for-loop that would consume the adjacency list as recursive calls may need it.

Assuming x >= 1, finds the prime factorization of n TODO: pollard_rho needs randomization to ensure correctness in contest settings!

Computes the discrete fourier transform of v, whose length is a power of 2. Forward transform: polynomial coefficients -> evaluate at roots of unity I

An example of binary search to find the first position whose element is negative. The DynamicArq version works on trees of any size, not necessarily a

Avoids the % operation but requires -M <= x < M

Computes the length of longest common prefix of text[i..] and text[j..].

A stable sort

After running maximum flow, use this to recover the dual minimum cut.

Builds an index, given the full set of coordinates to compress.

Precomputes the automaton that allows linear-time string matching. # Example ``` use contest_algorithms::string_proc::Matcher; let byte_string: &[u8

Construct a new RNG from a 64-bit seed.

Creates a new tree, built to handle queries on the interval [left, right).

Constuctor for the Casher # Examples ``` # use contest_algorithms::caching::Cacher; let mut squared = Cacher::new(|n: u32| n*n); ```

Initializes disjoint sets containing one element each.

Initializes an flow network with vmax vertices and no edges.

Initializes a static balanced binary tree on top of the given sequence.

Initializes the data structure without creating any nodes.

Returns the aggregate range query on all entries from l to r, inclusive.

Assuming slice is sorted and totally ordered, returns the minimum i for which slice[i] > key, or slice.len() if no such i exists