Crate competitive 

github

snippets

verification summary

benchmarks

coverage

formal verification

Modules

algebra

algebra

algorithm

algorithm

combinatorial_optimization

data_structure

data structures

formal

Kani

geometry

graph

graph structures and algorithms

heuristic

math

mathematical datas

num

prelude

string

string algorithms

tools

tree

tree algorithms

Macros

add_assign

array

avx_helper

bitand_assign

bitor_assign

bitxor_assign

chmax

chmin

comprehension

crecurse

Macro that returns a recursive function that (semi-)automatically captures.

define_basic_mint32

define_basic_mintbase

define_enum_scan

define enum scan rules

define_monoid

div_assign

impl_assoc_value

Implement AssociatedValue.

impl_basic_mint_dot_product

impl_bitand_identity

impl_bitor_identity

impl_bitxor_identity

invariant

iter_print

Print expressions with a separator.

main

max

memorize

Automatic memorization for recursive functions.

min

minmax

mlambda

Macro that define closure like macro. Unlike closure, this macro localizes variable capture.

mo_algorithm

solve with Mo’s algorithm

monoid_fold

mul_assign

prepare

Prepare useful macros.

prepare_io

Prepare sc!, sv!, pp!, and dg! with fast I/O for the supplied reader and writer. prepare_io!(buffered; reader, writer) reads incrementally for large numeric inputs. Every read must satisfy FastInput’s token requirements.

rand

Declare random values using RandomSpec.

rand_value

Return a random value using RandomSpec.

rem_assign

scan

scan and bind values with Scanner

scan_value

scan a value with Scanner

shl_assign

shr_assign

sub_assign

syakutori

arg:

transducer

build transducer

tree_mo_algorithm

vertices; tree, root, paths; |u| add, |u| remove, |i| answer, or edges; .... paths yields (u, v). Callbacks receive vertex or original edge IDs and input query IDs. Start with empty state; answer preserves it. The final state is unspecified. Path elements are unordered; answers are visited in Mo order.