List of all items
Structs
- accumulate_iterator::Iter
- adjacency_list_graph_old::AdjacencyList
- adjacency_matrix_graph::AdjacencyMatrix
- algebraic_structure_impl::GroupApprox
- array_compression_unique_binary_search::ArrayCompression
- avl_tree::AVLTree
- avl_tree_array::AVLArray
- avl_tree_ngtkn::AvlTree
- avl_tree_ngtkn::IntoIter
- avl_tree_ngtkn::Iter
- avl_tree_node_with_box_recurse_merge_split_based::Node
- avl_tree_node_with_rc_refcell_merge_split_based_recurse::Node
- avl_tree_node_with_value_size_box_recurse::Node
- avl_tree_ordered_multiset::AVLMultiset
- avl_tree_ordered_multiset_merge_split_based::AVLMultiset
- avl_tree_ordered_multiset_merge_split_based_rc_refcell::AVLMultiset
- barrett_reduction::BarrettReduction
- barrett_reduction::BarrettReduction32
- barrett_reduction::BarrettReduction64
- bfs_01_priority_queue::BFS01Queue
- binary_min_heap_0_indexed::BinaryMinHeap
- bit_array::BitArray
- cached_fibonacci_number::CachedFibonacci
- cartesian_product::CartesianProduct
- catalan_number_with_formula_modular_with_factorial_tables_usize::CatalanNumber
- circle_2d_cartesian_i64::Circle
- circular_buffer_deque::Deque
- combination_from_u64::Combination
- complex_number::Complex
- complex_number_f64::Complex
- complex_number_polar_form_f64::Polar
- const_generics_dimensional_geometric_vector::Vector
- const_generics_dimensional_geometric_vector_i64::Vector
- const_generics_modular_int_i64::Modint
- const_generics_n_dim_dynamic_shaped_tensor::NdimDynamicTensor
- const_generics_ndim_vector::LineSegment
- const_generics_ndim_vector::Vector
- const_generics_shaped_matrix::Matrix
- const_generics_shaped_matrix_with_flattened_data::Matrix
- const_generics_sized_square_matrix::Matrix
- const_generics_sized_square_matrix_on_usize_bitwise_xor_and::Matrix
- const_modulus_frequent::Mod1_000_000_007
- const_modulus_frequent::Mod998_244_353
- cumulative_array::CumulativeArray
- default_static_modular_arithmetic::DefaultStatic
- define_const_modulus_macro::Mod1_000_000_007
- define_const_modulus_macro::Mod1_000_000_007I64
- define_const_modulus_macro::Mod998_244_353
- define_const_modulus_with_const_generics_macro::ModU32
- define_const_modulus_with_const_generics_macro::ModU64
- define_static_modulus_macro_with_atomic_cell::ModU32
- define_static_modulus_macro_with_atomic_cell::ModU64
- deque_with_2_stacks::Deque
- distance_on_tree_query_with_lca_doubling::TreeDist
- doubly_linked_list_deque::Deque
- doubly_linked_list_node::Node
- dynamic_array_queue::Queue
- dynamic_modulus::DynMod
- dynamic_shaped_matrix::Matrix
- dynamic_shaped_matrix_with_flattened_data::Matrix
- dynamic_sliding_window_maximum_queue_i64::SWAGQueue
- dynamic_sliding_window_sum_deque_i64::SWAGDeque
- dynamic_sqrt_bucket::SqrtBucket
- dynamic_sqrt_bucket_multiset::Multiset
- dynamic_tensor::DynamicTensor
- enumerate_nodes_in_rectangle_static_with_1d_bisect::GetNodesInRectangle
- enumerate_nodes_in_rectangle_static_with_array_compression_bisect::GetNodesInRectangle
- euler_totient_with_least_prime_factor_table_usize::EulerTotient
- euler_tour_teqnique_as_struct::EulerTour
- factorial_tables_frequent_ops_from_i32::FactorialTablesFrequentOps
- factorial_tables_frequent_ops_modular_usize::FactorialTablesFrequentOps
- farthest_node_query_on_unweigted_tree::FarthestNode
- fenwick_tree::Dual
- fenwick_tree::Fw
- fenwick_tree_additive_from_i32::Fenwick
- fenwick_tree_dual_i64_add_1_indexed::Fenwick
- fenwick_tree_dual_with_instance_commutative_monoid::DualFenwick
- fenwick_tree_dynamic_cumulative_sum_2_i64::CumulativeSum2
- fenwick_tree_dynamic_cumulative_sum_3_i64::CumulativeSum3
- fenwick_tree_i32_add_0_indexed::Fenwick
- fenwick_tree_i32_add_1_indexed::Fenwick
- fenwick_tree_multiset::Multiset
- fenwick_tree_range_add_range_sum_i64::RangeAddRangeSum
- fenwick_tree_usize_add_1_indexed::Fenwick
- fenwick_tree_with_instance_commutative_monoid_1_indexed::Fenwick
- fenwick_tree_with_static_commutative_monoid_1_indexed::Fenwick
- fenwick_tree_xor::Fenwick
- find_a_node_from_given_node_step_by_k_edges_on_tree::KthNodeQuery
- fraction_i64::Fraction
- functional_graph_kth_from::FunctionalGraphKthFrom
- functional_graph_kth_from_any_with_doubling::FunctionalGraphKthFrom
- functional_graph_prefix_aggregation::PrefixAggregation
- functional_graph_prefix_sum::PrefixSum
- geometric_vector_2d_i64::Vector2D
- graph_disconnected::DisconnectedError
- graph_old::DenseGraph
- graph_old::DirectedEdge
- graph_old::DirectedGraph
- graph_old::UndirectedEdge
- graph_old::UndirectedGraph
- graph_pointer_directed::DirectedGraph
- graph_pointer_mixed::MixedGraph
- graph_pointer_undirected::UndirectedGraph
- graph_trait_pointer_mixed::MixedGraph
- group_theory_id::Additive
- group_theory_id::GCD
- group_theory_id::LCM
- group_theory_id::Max
- group_theory_id::Min
- group_theory_id::Multiplicative
- group_theory_id::Xor
- homogeneous_product::HomogeneousProduct
- identifier::DefaultId
- io_buffered_read_wrapper::ReadWrapper
- lazy_binary_heap_with_count_hash::LazyBinaryHeap
- lazy_binary_heap_with_remove_queue::LazyBinaryHeap
- level_ancestor_with_doubling::LevelAncestor
- level_ancestor_with_doubling_from_parent_depth::LevelAncestor
- line_segment_2d_i64::Segment
- lowest_common_ancestor_old::tree::Doubling
- lowest_common_ancestor_old::tree::EulerTourRMQ
- lowest_common_ancestor_old::tree::LCAHLD
- lowest_common_ancestor_with_binary_lifting::LCA
- lowlink::LowlinkResult
- matrix_with_static_property::Matrix
- matrix_with_static_property_define_bitwise_xor_and_usize::R
- matrix_with_static_semiring_and_property::Matrix
- median_priority_queue_with_two_binary_heap::MedianQueue
- median_priority_queue_with_two_lazy_binary_heap::MedianQueue
- median_priority_queue_with_two_std_btree_multiset::MedianQueue
- min_max_linear_function_composition::MinMaxLinear
- min_max_priority_queue_lazy_with_two_binary_heap::MinMaxQueue
- min_max_priority_queue_with_btree_map::MinMaxQueue
- modular_int_with_arithmetic::Modint
- modular_int_with_const_modulus_i64::Modint
- modular_int_with_static_modulus::Modint
- modular_int_with_static_modulus_i64::Modint
- montgomery_modular_multiplication::MontgomeryMultiplication
- montgomery_modular_multiplication_64::MontgomeryMultiplication64
- negative_cycle::NegativeCycleError
- network_graph_node::Node
- newton_method_with_derivative_function_f64::Options
- pascal_rule_cached_from_usize::PascalRule
- permutation_functional_graph_kth_from_any::KthFrom
- pivot_tree_node_usize_recurse::Node
- pivot_tree_node_usize_with_size_recurse::Node
- pivot_tree_ordered_set::PivotSet
- pivot_tree_ordered_set_simple::PivotSet
- pivot_tree_ordered_set_usize_with_size_with_vec::PivotTreeSet
- pocket_modint_u32::Modint
- pocket_modint_u32::modulus::Mod1_000_000_007
- pocket_modint_u32::modulus::Mod998_244_353
- pocket_modint_u32::modulus::StaticMod
- pointer_grpah::Edge
- pointer_grpah::Vertex
- polar_coordinates_2d_f64::Polar
- popcount_cached_usize::Popcount
- popcount_with_k_bit_table_usize::Popcount
- prime::PrimeFactorizeLPF
- prime_factorize_with_least_prime_factor_table_u32::PrimeFactorize
- prime_factorize_with_least_prime_factor_table_usize::PrimeFactorize
- queue_with_2_stacks::Queue
- red_black_tree::Node
- rerooting_dp_with_instance_commutative_monoid_as_struct_recurse::ReRootingDP
- rng_linear_congruential::RngLCGCell
- rng_linear_congruential::RngLinearCongruentialGenerator
- rng_xorshift1024star::Xorshift1024Star
- rng_xorshift128::XorShift128
- rng_xorshift128plus::Xorshift128Plus
- rng_xorshift32::XorShift32
- rng_xorshift64::Xorshift64
- rng_xorshift64star::Xorshift64Star
- rng_xorshift96::XorShift96
- rng_xorwow::Xorwow
- rng_xoshiro256plus::Xoshiro256Plus
- rng_xoshiro256starstar::Xoshiro256StarStar
- segment_tree_additive_with_std::Segtree
- segment_tree_dual_additive_from_i32_with_std::DualSegtree
- segment_tree_dual_range_update_additive_from_i32_with_std::Value
- segment_tree_dual_range_update_with_instance::Update
- segment_tree_dual_range_update_with_static::Update
- segment_tree_dual_with_instance_monoid::DualSegtree
- segment_tree_dual_with_instance_monoid_recurse::DualSegtree
- segment_tree_dual_with_static_monoid::DualSegtree
- segment_tree_i64_add::Segtree
- segment_tree_i64_min::Segtree
- segment_tree_lazy_01_sequence_range_xor_range_inversion_number::RangeXorRangeInversion01
- segment_tree_lazy_additive_homomorphism_with_std_ops::LazySegtree
- segment_tree_lazy_additive_homomorpshim_range_update_range_sum_modint::F
- segment_tree_lazy_additive_homomorpshim_range_update_range_sum_modint::S
- segment_tree_lazy_i64_range_add_range_sum::RangeAddRangeSumI64
- segment_tree_lazy_range_add_range_minimum::RangeAddRangeMinimum
- segment_tree_lazy_range_affine_range_sum::RangeAffineRangeSum
- segment_tree_lazy_range_update_range_minimum::RangeUpdateRangeMinimum
- segment_tree_lazy_range_update_range_sum::RangeUpdateRangeSum
- segment_tree_lazy_with_instance_homomorphism::LazySegtree
- segment_tree_lazy_with_instance_homomorphism_recurse::LazySegtree
- segment_tree_lazy_with_static_ops::SegtreeLazy
- segment_tree_min::Segtree
- segment_tree_multiset::Multiset
- segment_tree_point_update_get_range_sum_and_range_prefix_sum_min_i64::PrefixSumMinimum
- segment_tree_range_minimum::RangeMinimum
- segment_tree_with_instance_monoid::SegmentTree
- segment_tree_with_instance_monoid_recurse::Segtree
- segment_tree_with_static_monoid::Segtree
- sieve_of_eratosthenes_enumerate_primes_in_range_query_optim_u64::EnumerateRangePrimes
- sieve_of_eratosthenes_enumerate_primes_in_range_query_usize::EnumerateRangePrimes
- sieve_of_eratosthenes_low_memory_prime_generator_optim_u64::PrimeGenerator
- sieve_of_eratosthenes_low_memory_prime_generator_usize::PrimeGenerator
- sieve_of_eratosthenes_prime_factorize_table_in_range_query::RangeFactorize
- singly_linked_list_node_with_box::Node
- singly_linked_list_node_with_rc_refcell::Node
- singly_linked_list_queue::Queue
- singly_linked_list_stack::Stack
- sliding_window_aggregation_deque_with_instance_group::SWAGDeque
- sliding_window_aggregation_queue_with_instance_monoid::SWAGQueue
- sortable_fifo_queue::SortableQueue
- sparse_table_with_instance_idempotent_binary_operation::SparseTable
- sparse_table_with_static_idempotent_binary_operation::SparseTable
- sparse_table_with_static_idempotent_semigroup::DisjointSparseTable
- sparse_table_with_static_idempotent_semigroup::SparseTable
- splay_tree_multiset::Multiset
- splay_tree_multiset_recurse::Multiset
- splay_tree_multiset_unsafe::Multiset
- splay_tree_multiset_unsafe_recurse::Multiset
- splay_tree_multiset_with_array_recurse::Multiset
- splay_tree_node::Node
- splay_tree_node_recurse::Node
- splay_tree_node_unsafe::Node
- splay_tree_node_unsafe_recurse::Node
- splay_tree_node_with_array_recurse::Node
- splay_tree_node_with_trait::DefaultData
- splay_tree_node_with_trait::Node
- sqrt_decomposition::SqrtDecomposition
- sqrt_decomposition_dual_range_add_i64::RangeAdd
- sqrt_decomposition_dual_range_update_i32::RangeUpdate
- sqrt_decomposition_dual_with_instance_monoid::DualSqrtDecomposition
- sqrt_decomposition_i64_add::SqrtDecomposition
- sqrt_decomposition_lazy_i64_range_add_range_sum::RangeAddRangeSumI64
- sqrt_decomposition_lazy_range_add_range_minimum::RangeAddRangeMinimum
- sqrt_decomposition_lazy_range_update_range_minimum::RangeUpdateRangeMinimum
- sqrt_decomposition_lazy_range_update_range_sum::RangeUpdateRangeSum
- sqrt_decomposition_lazy_with_instance_homomorphism::LazySqrtDecomposition
- sqrt_decomposition_multiset::Multiset
- sqrt_decomposition_range_minimum_i32::RangeMinimum
- sqrt_decomposition_range_sum_i64::RangeSum
- sqrt_decomposition_with_instance_monoid::SqrtDecomposition
- stack_with_vec::Stack
- static_const_modulus_frequent::Mod1_000_000_007
- static_const_modulus_frequent::Mod998_244_353
- static_matrix_property_frequent::Prop100
- static_matrix_property_i64_2_2::MatrixPropI6422
- static_modular_int_i64::Modint
- static_modular_int_with_id_i64::DefaultId
- static_modular_int_with_id_i64::Modint
- static_square_matrix::Matrix
- static_tensor_shape::TensorShape2_3_4
- strongly_connected_components_kosaraju_as_struct_recurse::SCC
- strongly_connected_components_path_based_as_struct_recurse::SCC
- strongly_connected_components_tarjan_lowlink_as_struct_recurse::SCC
- tensor::Tensor
- topological_sort::NonDAGError
- tree_dfs_euler_tour_heavy_light_decomposition_as_struct::Tree
- tree_get_path_query_with_lifting::TreePath
- triangle_2d_with_vector_i64::Triangle
- two_satisfiability::TwoSat
- union_find_low_memory::UnionFind
- union_find_low_memory_minimal::UnionFind
- union_find_low_memory_with_trait::UnionFind
- union_find_persistent::PersitentUF
- union_find_potentialized_i64_add::PotentialUnionFind
- union_find_potentialized_with_instance_abelian_group::PotentialUnionFind
- union_find_potentialized_with_static_abelian_group_and_trait::PotentialUF
- union_find_rollback::RollbackUF
- xor_distance_on_tree_query::XorTreeDist
- xor_prefix_set_hash::PrefixSetHash
- xor_vectors_rank_online_with_gaussian_elimination::XorVectorsRank
Enums
- geometric_vector_2d_i64::AngleType
- geometric_vector_2d_i64::DirectionType
- geometric_vector_2d_i64::TriangleAngleType
- zeller_day_of_week_congruence_formula::DayOfWeek
Traits
- algebraic_structure::AbelianGroup
- algebraic_structure::Group
- algebraic_structure::Loop
- algebraic_structure::Magma
- algebraic_structure::Monoid
- algebraic_structure::Quasigroup
- algebraic_structure::Ring
- algebraic_structure::Semigroup
- algebraic_structure::Semiring
- algebraic_structure::UnitalMagma
- algebraic_structure::dynamic::Magma
- algebraic_structure::itself::Group
- algebraic_structure::itself::Magma
- algebraic_structure::itself::Monoid
- algebraic_structure::itself::Semigroup
- algebraic_structure_std::Add
- algebraic_structure_std::Magma
- algebraic_structure_std::Monoid
- algebraic_structure_std::One
- algebraic_structure_std::Semigroup
- algebraic_structure_std::Zero
- binary_function::Absorbing
- binary_function::Add
- binary_function::AddInv
- binary_function::Associative
- binary_function::BinaryFunc
- binary_function::BinaryOp
- binary_function::Commutative
- binary_function::Distributive
- binary_function::ExtBinaryOp
- binary_function::Idempotence
- binary_function::Identity
- binary_function::Inverse
- binary_function::LatinSquare
- binary_function::Mul
- binary_function::MulInv
- binary_function::One
- binary_function::Zero
- binary_function::dynamic::BinaryOp
- binary_function::itself::Associative
- binary_function::itself::BinaryOp
- binary_function::itself::Commutative
- binary_function::itself::Id
- binary_function::itself::Idempotence
- binary_function::itself::Identity
- binary_function::itself::Inverse
- binary_tree_node::Child
- binary_tree_node::ChildMut
- binary_tree_node::Update
- bitops::BSF
- bitops::BSR
- bitops::CLZ
- bitops::CTZ
- bitops::CountLeadingOnes
- bitops::CountOnes
- bitops::CountTrailingOnes
- bitops::CountZeros
- bitops::Inverse
- bitops::Popcount
- bitops::Reverse
- bitops::ShrUntilOdd
- cartesian_coordinates_trait::Cartesian
- category::Category
- choose::Choose
- cmp::Infinity
- collection::IsEmpty
- composition_category_theory::Composition
- const_matrix_property_trait::Shape
- const_modulus_trait::Modulus
- const_square_matrix_property_trait::Size
- convert_to_bool::ToBool
- count_leading_zeros::CountLeadingZeros
- default::Default
- default::DefaultContext
- dijkstra_sparse_queue::DijkstraSparseQueue
- dynamic_matrix_property_trait::Shape
- dynamic_modular_arithmetic_trait::ModularArithmetic
- dynamic_modulus_trait::Get
- dynamic_modulus_trait::Set
- fenwick_tree_with_instance_abelian_group_1_indexed::AbelianGroup
- fenwick_tree_with_instance_commutative_monoid_1_indexed::Monoid
- fenwick_tree_with_static_abelian_group_1_indexed::AbelianGroup
- fenwick_tree_with_static_commutative_monoid_1_indexed::Monoid
- generalized_greatest_common_divisor_trait::GCD
- graph::edge::Capacity
- graph::edge::DirectedEdge
- graph::edge::Edge
- graph::edge::From
- graph::edge::Reversed
- graph::edge::To
- graph::edge::ToDirected
- graph::edge::UndirectedEdge
- graph::edge::Value
- graph::edge::ValueMut
- graph::edge::Weight
- graph::edge::WeightMut
- graph_edge_trait::Capacity
- graph_edge_trait::From
- graph_edge_trait::Reverse
- graph_edge_trait::To
- graph_edge_trait::ToDirected
- graph_edge_trait::Undirected
- graph_edge_trait::Value
- graph_edge_trait::ValueMut
- graph_edge_trait::Weight
- graph_edge_trait::WeightMut
- height::Height
- identifier::Identifier
- insertion::Insert
- join::Join
- matrix_with_static_semiring_and_property::Semiring
- modular_int_with_static_modulus::Element
- multiplicative_inverse::MulInv
- number_trait::Number
- number_trait::One
- number_trait::Zero
- ops::MulInv
- pocket_modint_u32::modulus::StaticGet
- polar_coordinates_trait::Polar
- pop::Pop
- power_group_itself::PowGroup
- power_group_trait::PowGroup
- power_monoid_itself::PowMonoid
- power_monoid_trait::PowMonoid
- power_semigroup_itself::PowSemigroup
- power_semigroup_trait::PowSemigroup
- priority_queue::IsEmpty
- priority_queue::MaximumQueue
- priority_queue::MinimumQueue
- priority_queue::Pop
- priority_queue::PriorityQueue
- priority_queue::Push
- priority_queue::Top
- priority_queue_trait::Pop
- priority_queue_trait::Push
- priority_queue_trait::Top
- prufer_group::PruferGroup
- query::RangeGetQuery
- query::RangeMinimumQuery
- rerooting_dp_with_instance_commutative_monoid::Edge
- rerooting_dp_with_instance_commutative_monoid::Monoid
- rerooting_dp_with_instance_commutative_monoid_as_struct_recurse::Edge
- rerooting_dp_with_instance_commutative_monoid_as_struct_recurse::Monoid
- segment_tree_dual_with_instance_monoid::Monoid
- segment_tree_dual_with_instance_monoid_recurse::Monoid
- segment_tree_dual_with_static_monoid::Monoid
- segment_tree_lazy_additive_homomorphism_with_std_ops::Identity
- segment_tree_lazy_with_instance_homomorphism::Ops
- segment_tree_lazy_with_instance_homomorphism_recurse::Ops
- segment_tree_with_instance_monoid::Monoid
- segment_tree_with_instance_monoid_recurse::Monoid
- set_theory::Mapping
- shortest_path_potential::ShortestPathPotentialEdge
- size::Size
- sliding_window_aggregation_deque_with_instance_group::Group
- sliding_window_aggregation_queue_with_instance_monoid::Monoid
- solver::Solver
- sparse_table_with_static_idempotent_binary_operation::BinaryOp
- split::Split
- sqrt_decomposition_dual_with_instance_monoid::Monoid
- sqrt_decomposition_lazy_with_instance_homomorphism::Ops
- sqrt_decomposition_with_instance_monoid::Monoid
- static_matrix_property_trait::Shape
- static_modular_arithmetic_trait::ModularArithmetic
- static_modulus_trait::Get
- static_modulus_trait::Set
- static_square_matrix_property_trait::Size
- tensor_property::Dimension
- tensor_property::Shape
- tensor_property::Size
- tensor_property::Strides
- tensor_property::TensorProperty
- tensor_trait::Matrix
- tensor_trait::Scalar
- tree_node::Insert
- tree_node::Parent
- tree_node::ParentMut
- tree_node::Pop
- union_find_potentialized_with_instance_abelian_group::AbelianGroup
- union_find_traits::Labels
- union_find_traits::Root
- union_find_traits::Same
- union_find_traits::Size
- union_find_traits::SizeOf
- union_find_traits::Unite
- zero_element::Zero
Macros
Functions
- abs_diff::abs_diff
- accumulate_iterator::accumulate
- accumulate_vec::accumulate
- add_middle_nodes_and_make_double_tree_undirected_tuple_edges::add_middle_nodes
- add_with_xor_and_bitwise_and::add
- adjacency_list_graph_from_edges::graph_from_edges
- adjacency_list_graph_from_edges_weighted::graph_from_weigted_edges
- adjacency_list_graph_with_edge_id_from_edges::graph_from_edges
- adjacency_list_to_directed_edges::adjacency_list_to_edges
- apsp_johnson_dense::johnson_dense
- apsp_johnson_sparse::johnson_sparse
- argmax::argmax
- argmin::argmin
- argsort::argsort
- arithmetic_series_with_diff::arithmetic_series
- array_rank_with_argsort::array_rank
- articulation_points_detection_lowlink::find_articulation_points_lowlink
- ascii_characters::lowercases
- ascii_characters::uppercases
- base_conversion_base_k_to_decimal::base_k_to_decimal
- base_conversion_decimal_to_base_k_with_divmod::decimal_to_base_k
- base_conversion_decimal_to_base_k_with_euclid_divrem::decimal_to_base_k
- bellman_ford_abstract_dp::bellman_ford_abstract
- bellman_ford_sssp_option_i64_with_negative_cycle_error::bellman_ford
- bellman_ford_sssp_tuple_edges_no_error_with_inf_i64::bellman_ford
- bellman_ford_sssp_tuple_edges_no_error_with_inf_i64_with_abstract::bellman_ford
- bfs_on_sparse_graph_in_degree_oriented::bfs
- bin_count::bin_count
- binary_greatest_common_divisor_u64::binary_gcd
- binary_search_2_ok_usize::binary_search
- binary_search_f64_with_max_epoch::binary_search
- binary_search_f64_with_terminate_func::binary_search
- binary_search_ng_ok_i64::binary_search
- binary_search_on_slice_bisection_of_2_ok::binary_search
- binary_search_on_slice_bisection_of_ng_ok::binary_search
- bisection_analysis::bisect
- bit_length_binary_search_u64::binary_search
- bit_length_naive_u64::naive
- bit_length_primitive::bit_length
- bit_length_table::table
- bit_length_with_count_leading_zeros_u128::bit_length
- bit_length_with_count_leading_zeros_u64::bit_length
- bit_length_with_count_leading_zeros_usize::bit_length
- bit_reverse_divide_and_conquer_butterfly_usize::bit_reverse
- bit_reverse_with_std_usize::bit_reverse
- bitops::flip
- bitops::invert
- bitops::reset
- bitops::rot_l
- bitops::shr_until_odd
- bits_mask_less_than::bit_mask
- bits_mask_range::bit_mask
- bool_to_int::to_int
- breadth_first_search_tree_from_adjacency_list::bfs_tree
- breadth_first_search_tree_from_edges::bfs_tree
- bubble_sort::bubble_sort
- bytes_to_char_vec::bytes_to_char_vec
- caesar_cipher::decrypt
- caesar_cipher::encrypt
- catalan_number_with_formula_modular_with_instant_choose_fn_usize::catalan_number
- catalan_numbers_table_modular_usize_with_dp::catalan_numbers
- ceil_division_i64::ceil_div
- ceil_square_root_u64::ceil
- center_nodes_of_tree::center_of_nodes
- change_max::chmax
- change_min::chmin
- chebyshev_distance_2d_i64::chebychev_dist
- chebyshev_distance_ndim_i64::chebychev_dist
- check_compressed_sparse_graph_is_sorted::is_csgraph_sorted
- check_two_circles_intersection::check_intersect
- chinese_remainder_theorem_extended_euclidean_gcd_coprime_i64::crt_coprime
- chinese_remainder_theorem_extended_euclidean_gcd_coprime_usize::crt_coprime
- chinese_remainder_theorem_extended_euclidean_gcd_i64::crt
- chinese_remainder_theorem_extended_euclidean_gcd_prod_i64::crt_prod
- chinese_remainder_theorem_extended_euclidean_gcd_prod_i64_direct::crt
- chinese_remainder_theorem_extended_euclidean_gcd_prod_usize::crt_prod
- chinese_remainder_theorem_extended_euclidean_gcd_safe_i64::safe_crt
- chinese_remainder_theorem_extended_euclidean_gcd_safe_usize::safe_crt
- chinese_remainder_theorem_extended_euclidean_gcd_usize::crt
- chinese_remainder_theorem_garner_algorithm_i64::garner
- chinese_remainder_theorem_garner_algorithm_with_mod_i64::garner_with_mod
- compressed_sparse_graph_from_dense_with_inf::csgraph_from_dense
- compressed_sparse_graph_from_edges::csgraph_from_edges
- connected_components_bfs::connected_components
- connected_components_dfs::connected_components
- connected_components_dfs_recurse::connected_components
- connected_components_dsu::connected_components
- connected_components_group_by_id::group_by_id
- connected_components_labels_to_groups::labels_to_groups
- convex_hull_monotone_chain::convex_hull
- convolution_with_discrete_fourier_transform_f64::dft_convolve
- convolution_with_discrete_fourier_transform_f64::from_i64
- convolution_with_fft_cooley_tukey_inplace_f64::fft_convolve
- convolution_with_fft_cooley_tukey_inplace_f64::from_i64
- convolution_with_fft_cooley_tukey_recurse_f64::fft_convolve
- convolution_with_fft_cooley_tukey_recurse_f64::from_i64
- count_divisors_by_factorization::count_divisors_by_factorization
- count_divisors_naive::count_divisors_naive
- count_leading_zeros_std::count_leading_zeros_std
- count_subset_sum::subset_sum_counting_table
- count_trailing_zeros_in_digits_double_factorial::ctz_digits_double_factorial
- count_trailing_zeros_in_digits_factorial_legendre::count_factorial_trailing_zeros
- count_trailing_zeros_std::count_trailing_zeros
- counting_argsort::argsort
- counting_array_rank::array_rank
- counting_sort::counting_sort
- cumulative_product_vec_with_std_mul::cumprod
- cycle_detection_undirected_graph_union_find::has_cycle
- cycle_nodes_detection_on_undirected_unicyclic_simple_graph_with_bfs::detect_on_cycle
- dense_graph_from_edges_with_inf::dense_graph_from_edges
- dense_graph_from_not_simple_edges_with_inf::dense_graph_from_edges
- depth_first_search_tree_from_adjacency_list_recurse::dfs_tree
- depth_first_search_tree_from_edges_recurse::dfs_tree
- digits_sum::digits_sum
- dijkstra_arborescence::dijkstra_arborescense
- dijkstra_dense_i64_with_inf::dijkstra_dense
- dijkstra_dense_option_u64::dijkstra_dense
- dijkstra_shortest_path_count_modular_i64_with_inf_sparse::dijkstra
- dijkstra_sparse::dijkstra
- dijkstra_sparse_from_potential::dijkstra_sparse_from_potential::dijkstra
- dijkstra_sparse_general_extended::dijkstra
- dijkstra_sparse_option::dijkstra
- dijkstra_sparse_parents::dijkstra_sparse_parents
- dijkstra_sparse_path_count::dijkstra_path_count
- dijkstra_sparse_predecessors::dijkstra_sparse_predecessors
- dijkstra_sparse_tuple_edges_adjacency_list_i64_with_const_inf::dijkstra
- dijkstra_sparse_tuple_edges_adjacency_list_i64_with_initial_dist::dijkstra
- dijkstra_tree::dijkstra_tree
- discrete_fourier_transform_f64::dft
- discrete_fourier_transform_f64::idft
- dist_2d_to_the_power_of_2::dist2
- divisor_function_table_naive::divisor_func
- divisor_function_table_with_divisor_fast_zeta::divisor_func
- divisor_function_table_with_divisor_zeta::divisor_func
- divisors_count_from_prime_factors::divisors_count_from_prime_factors
- divisors_from_prime_factors::divisors_from_prime_factors
- divisors_sum_by_fatorization::divisors_sum_by_factorization
- divisors_sum_from_prime_factors::divisors_sum_from_prime_factors
- divisors_sum_table::divisors_sum_table
- divisors_table::divisors_table
- double_factorial_table_from_i32::double_factorial
- dual_unbounded_subset_sum_min_count_item_oriented_with_inf::subset_sum
- dual_unbounded_subset_sum_min_count_sum_oriented_with_inf::subset_sum
- edges_to_0_indexed::edges_to_0_indexed
- enumerate_combinations_bits_with_next_combination::combinations
- enumerate_combinations_dfs::combinations
- enumerate_combinations_dfs_recurse::combinations
- enumerate_combinations_inplace_iterative::combinations
- enumerate_cycles_of_functional_graph_with_dfs_recurse::enumerate_cycles
- enumerate_homogeneous_products_dfs_recurse::homogeneous_products
- enumerate_homogeneous_products_inplace_iterative::homogeneous_products
- enumerate_prime_factor_candidates_for_highly_composite_numbers::enumerate_prime_candidates
- enumerate_repeated_products_dfs_recurse::repeated_products
- enumerate_repeated_products_inplace_iterative::repeated_products
- enumerate_stepping_numbers_less_than_with_bfs::stepping_numbers
- enumerate_subset_bits::enumerate_subsets
- ett::first_positions
- ett::last_positions
- ett::tour_edges
- ett::tour_nodes
- euclidean_division_i64::divrem_euclid
- euler_criterion::euler_criterion
- euler_phi_table_mobius_inversion_formula_divisor_fast_zeta_modint::phi_table
- euler_phi_table_mobius_inversion_formula_divisor_zeta_modint::phi_table
- euler_totient_function_table_with_divisor_fast_mobius::phi_table
- euler_totient_function_table_with_divisor_mobius::phi_table
- euler_totient_function_table_with_multiplicative_divisor_fast_zeta::phi_table
- euler_totient_function_table_with_multiplicative_divisor_zeta::phi_table
- euler_totient_with_instant_prime_factorize::euler_totient
- euler_totient_with_trial_division_i64::phi
- euler_totient_with_trial_division_u64::phi
- euler_totient_with_trial_division_usize::phi
- euler_tour_edges::euler_tour_edges
- euler_tour_edges_recurse::euler_tour_edges
- euler_tour_nodes_direct::euler_tour_nodes
- euler_tour_nodes_direct_recurse::euler_tour_nodes
- euler_tour_nodes_from_edges::euler_tour_nodes
- extended_euclidean_gcd_generic_int_recurse::extgcd
- extended_euclidean_gcd_i64::extgcd
- extended_euclidean_gcd_i64_recurse::extgcd
- extended_euclidean_modular_gcd_inverse_i64_with_extgcd::mod_gcd_inv
- extended_euclidean_modular_gcd_inverse_u64_direct::mod_gcd_inv
- extended_euclidean_modular_gcd_inverse_usize_with_extgcd::mod_gcd_inv
- factorial::factorial
- factorial_table_from_i32::factorial
- factorial_table_from_u64::factorial_table
- fairfield_ad_day_formula::ad_day
- farthest_node_on_unweighted_tree::farthest_node
- fast_fourier_transform_cooley_tukey_inplace::fft
- fast_fourier_transform_cooley_tukey_inplace::ifft
- fast_fourier_transform_cooley_tukey_recurse::fft
- fast_fourier_transform_cooley_tukey_recurse::ifft
- fast_mobius_transform_for_divisors_additive_with_std::fast_mobius_divisors
- fast_mobius_transform_for_divisors_with_instant_func::fast_mobius_divisors
- fast_mobius_transform_for_multiples_additive_with_std::fast_mobius_multiples
- fast_mobius_transform_for_multiples_with_instant_func::fast_mobius_multiples
- fast_mobius_transform_for_subset_additive_with_std::fast_mobius_subset
- fast_mobius_transform_for_superset_additive_with_std::fast_mobius_superset
- fast_zeta_transform_for_divisors_additive_with_std::fast_zeta_divisors
- fast_zeta_transform_for_divisors_with_instant_func::fast_zeta_divisors
- fast_zeta_transform_for_multiples_additive_with_std::fast_zeta_multiples
- fast_zeta_transform_for_multiples_with_instant_func::fast_zeta_multiples
- fast_zeta_transform_for_subset_additive_with_std::fast_zeta_subset
- fast_zeta_transform_for_subset_additive_with_std_optim::fast_zeta_subset
- fast_zeta_transform_for_superset_additive_with_std::fast_zeta_superset
- fermat_factorization_method::fermat_factorization_method
- fibonacci_sequence_modular::fibonacci
- find_a_prime_factor_pollard_rho_brent::find_prime_factor_pollard_rho
- find_divisor_pollard_rho_repeat_brent::find_divisor_pollard_rho_repeat
- find_divisor_pollard_rho_with_brent_cycle_detection::find_divisor_pollard_rho_brent
- find_divisor_pollard_rho_with_floyd_cycle_detection::find_divisor_pollard_rho_floyd
- find_divisors_constructive_with_prime_factorize_lpf_table::structive_find_divisors
- find_divisors_for_const_remainders::find_divisors_for_const_remainder
- find_divisors_for_same_remainders::find_divisors_for_same_remainders
- find_divisors_trial_division_u64::find_divisors
- find_divisors_trial_division_usize::find_divisors
- find_kth_permutation::kth_permutation
- find_kth_set_bit_by_removing_lsb::kth_set_bit
- find_low_median_of_divisors::find_divisors_median_low
- flat_nonzero_int::flat_nonzero
- flat_nonzero_with_to_bool::flat_nonzero
- flatten_2d_tournament_list_to_1d::flatten_tournament
- floor_division_i64::floor_div
- floor_square_root_u64::floor
- floyd_warshall_abstruct_with_ternary_map::floyd_warshall
- floyd_warshall_apsp_i64_with_inf::floyd_warshall
- floyd_warshall_apsp_option_i64::floyd_warshall
- floyd_warshall_apsp_u64::floyd_warshall
- fold::fold_left
- fraction_floor_sum::floor_sum
- fraction_floor_sum_with_sqrt_split::floor_sum
- fraction_floor_sum_with_sqrt_split_strict::floor_sum
- functional_graph_basic_properties::functional_graph_prop
- functional_graph_doubling_table::doubling_table
- gaussian_elimination_xor::eliminate
- gcd_convolution_ring_with_std_multiples_fast_zeta_mobius::gcd_convolve
- gcds_for_lcm::gcds_for_lcm
- gcds_for_sum::gcds_for_sum
- general_dijkstra_sparse::general_dijkstra_sparse
- geometric_series::geometric_series
- ghost_leg::solve_ghost_leg
- graph_bfs_abstract::graph_bfs
- graph_bfs_level::bfs_level
- graph_bfs_path_count::path_count
- graph_bfs_reachablity_from_any_of_multiple_nodes::bfs_reachable
- graphops::bfs
- graphops::bfs_arborescence
- graphops::bfs_tree
- graphops::dfs
- graphops::dfs_arborescense
- graphops::dfs_tree
- graphops::edges_to_directed
- greatest_common_divisor_euclid::gcd
- greatest_common_divisor_euclidean::gcd
- greatest_common_divisor_euclidean_recurse::gcd
- greatest_common_divisor_euclidean_recurse_i64::gcd
- greatest_common_divisor_euclidean_reduce::gcd_reduce
- greatest_common_divisor_euclidean_signed::gcd_signed
- greatest_common_divisor_euclidean_u64::gcd
- greatest_prime_factor_table_with_sieve_of_eratosthenes::greatest_prime_factor
- greatest_prime_factor_with_least_prime_factor_usize::greatest_prime_factor
- heavly_light_decomposition::heavy_light_decompose
- heavy_light_decomposition_labeling_post_order_more_than_half::hld
- insertion_sort::insertion_sort
- insertion_sort_enumerate_all_states::insertion_sort_states
- int_kth_root_binary_search::int_kth_root_binary_search
- int_kth_root_fast::int_kth_root_fast
- int_kth_root_linear::int_kth_root_linear
- integer_square_root_digit_by_digit_recurse_u64::isqrt
- integer_square_root_linear_u64::isqrt
- integer_square_root_with_binary_search_u64::isqrt
- integer_square_root_with_binary_search_usize::isqrt
- integer_square_root_with_linear_addition_u64::isqrt
- integer_square_root_with_linear_subtraction_u64::isqrt
- integer_square_root_with_newton_method_u64::isqrt
- intersection_length_of_2_intervals::intersection
- intersection_of_2_intervals::intersection
- inverse_factorial_table_from_i32::inverse_factorial
- inverse_factorial_table_from_u64::inverse_factorial_table
- inversion_number_with_array_compression_and_fenwick_tree::inversion_number
- io_locked_stdin_reader::locked_stdin_reader
- io_locked_stdout_buffered_writer::locked_stdout_buf_writer
- io_read_stdin::read_stdin
- io_read_stdin_direct::read
- io_read_token::read_token
- is_absorbing::is_absorbing
- is_absorbing::is_left_absorbing
- is_absorbing::is_right_absorbing
- is_adjacency_matrix::is_adjacency_matrix
- is_bipartite_graph::is_bipartite
- is_identity::is_identity
- is_identity::is_left_identity
- is_identity::is_right_identity
- is_invertible::is_invertible
- is_multiple_of_9::is_multiple_of_9
- is_pairwise_coprime_with_prime_factorize::is_pairwise_coprime
- is_pairwise_coprime_with_sum_of_multiple_count::is_pairwise_coprime
- is_perfect_number::is_perfect_number
- is_prime_naive::is_prime_naive
- is_prime_table_from_enumerate_primes::is_prime
- is_quadratic_residue_z_pz_euler_criterion::is_quadratic_residue_z_pz_euler_criterion
- is_setwise_coprime::is_setwise_coprime
- is_undirected_dense_graph::is_undirected_dense_graph
- iterate_over_multiples_for_1_n_harmonic_series_abstract::iter_over_multiples
- iterate_over_multiples_for_primes_in_1_n_harmonic_series_abstract::iter_over_multiples
- jacobi_symbol::jacobi_symbol
- jacobi_symbol_recurse::jacobi_symbol_recurse
- karatsuba_mul_quotient_pow_2_power_of_2_128::karatsuba_mul_quotient_pow_2_power_of_2
- knapsack::kp01::dual::dual_knapsack_01
- knapsack::kp01::few_kinds_of_weights
- knapsack::kp01::knapsack_01
- knapsack::kp01::knapsack_01_at_most_k
- knapsack::kp01::knapsack_01_meet_in_the_middle
- knapsack::kp01::knapsack_01_small_values_sum
- knapsack::kp01::knapsack_01_small_weights_sum
- knapsack::unbouneded::unbounded_knapsack
- knapsack_01_dual_table_with_inf::knapsack_dual
- knapsack_01_for_large_weights_with_dual::knapsack
- knapsack_01_table::knapsack
- knapsack_unbounded_table_bottom_up_max_value_oriented::knapsack
- knapsack_unbounded_table_item_oriented::knapsack
- knuth_morris_pratt_failure_function_table_0_indexed::failure_function
- knuth_morris_pratt_failure_function_table_1_indexed::kmp_table
- knuth_morris_pratt_find_all_substring_indices::kmp_findall
- kth_node_query_on_tree_offline::kth_nodes
- label_bipartite_graph_with_bfs::label_bipartite
- lcm_convolution_ring_with_std_divisors_fast_zeta_mobius::lcm_convolve
- least_common_multiple_with_gcd_i64::lcm
- least_common_multiple_with_gcd_reduce_u64::lcm_reduce
- least_common_multiple_with_gcd_u64::lcm
- least_common_multiple_with_gcd_usize::lcm
- least_prime_factor_table_with_sieve_of_eratosthenes_u32::least_prime_factor
- least_significant_bit_from_lsb_number::lsb
- least_significant_bit_number_direct_i64::lsb_num
- least_significant_bit_number_from_lsb_usize::lsb_num
- least_significant_bit_with_std_ctz_u64::lsb
- legendre_formula_recurse_u64::legendre
- legendre_formula_recurse_usize::legendre
- legendre_formula_u64::legendre
- legendre_symbol_euler_criterion::legendre_symbol_euler_criterion
- level_ancestor_offline_with_dfs_recurse::level_ancestor
- levenstein_distance::levenstein_distance
- levenstein_distance_low_memory::levenstein_dist
- levenstein_distance_low_memory_inplace::levenstein_dist
- linear_prime_sieve_option_u32::linear_sieve
- linear_time_minimum_spanning_tree::mst_randomized_linear
- log_2_floor_u64::log_2
- logarithm_f64_for_any_base_with_log_e::log
- logarithm_u64_floor_for_any_base_recursive::log
- longest_common_prefix_array_kasai::lcp_array
- longest_common_subsequence::len
- longest_common_subsequence::len_lowmem
- longest_common_subsequence::struct_one
- longest_common_substring_find_all_ends::find_all_ends
- longest_common_substring_length_low_memory::lcs_len
- longest_common_substring_length_low_memory_with_z_algorithm::lcs_len
- longest_common_substring_table::longest_common_substring
- longest_increasing_subsequece_naive_i64::lis
- longest_increasing_subsequence::longest_increasing_subsequence
- longest_increasing_subsequence::longest_non_decreasing_subsequence
- lower_bound_on_slice::lower_bound
- lowest_common_ancestor_offline_tarjan::lca
- lowest_common_ancestor_old::tree::tarjan
- lucas_numbers_table::lucas_numbers
- make_sparse_histogram::make_sparse_histogram
- matrix_addition_i64::add
- matrix_multiplication::mul
- matrix_multiplication_i64::mul
- matrix_rotate_counterclockwise_270::rot270
- matrix_rotate_counterclockwise_90::rot90
- matrix_subtraction_i64::sub
- matrix_transpose::transpose
- matrix_transpose_with_option::transpose
- maximal_clique_for_small_adjacency_bits::max_clique
- maximum_cardinality_matching::blossom
- maximum_cardinality_matching::ford_fulkerson
- maximum_cardinality_matching::hopcroft_karp
- maximum_flow::max::binary_blocking
- maximum_flow::max::blnpsssw_bllsssw
- maximum_flow::max::cklpgs
- maximum_flow::max::dinic
- maximum_flow::max::dinic_dyntree
- maximum_flow::max::edmonds_karp
- maximum_flow::max::ford_fulkerson
- maximum_flow::max::gao_liu_peng
- maximum_flow::max::kathuria_liu_sidford
- maximum_flow::max::krt
- maximum_flow::max::mkm
- maximum_flow::max::mpm
- maximum_flow::max::orlin
- maximum_flow::max::push_relabel::dist_vertex
- maximum_flow::max::push_relabel::dyntree
- maximum_flow::max::push_relabel::fifo_vertex
- maximum_flow::max::push_relabel::general
- maximum_flow::max::push_relabel::normal
- merge_sort_bottom_up::merge_sort
- merge_sort_recurse::merge_sort
- merge_two_sorted_slice_as_vec::merge_sorted
- merge_two_sorted_vec_taking::merge_sorted
- minimum_cost_elastic_matching::min_cost_elastic_match
- minimum_pair_sum_for_const_product::min_pair_sum_const_prod
- minimum_spanning_tree_boruvka::mst_boruvka
- minimum_spanning_tree_kruskal::mst_kruskcal
- minimum_spanning_tree_prim_dense::mst_prim_dense
- minimum_spanning_tree_prim_sparse::mst_prim_sparse
- minimum_spanning_tree_reverse_delete::mst_reverse_delete
- mobius_function::mobius_function
- mobius_function_table_with_divisor_fast_mobius_isize::mobius_function
- mobius_function_table_with_divisor_mobius_isize::mobius_function
- mobius_function_with_trial_division::mobius
- mobius_transform_for_divisors_additive_with_std::mobius_divisors
- mobius_transform_for_divisors_with_instant_func::mobius_divisors
- mobius_transform_for_multiples_additive_with_std::mobius_multiples
- mobius_transform_for_multiples_with_instant_func::mobius_multiples
- mobius_transform_for_subset_additive_with_std::mobius_subset
- modular_cumprod_i64::cumprod
- modular_cumprod_usize::cumprod
- modular_division_i64::divmod
- modular_factorial_table_i64::factorial
- modular_factorial_table_usize::factorial
- modular_inverse_euclidean_i64_no_error::modinv
- modular_inverse_euclidean_u64::modinv
- modular_inverse_euler_theorem_i64::modinv
- modular_inverse_euler_theorem_u64::modinv
- modular_inverse_factorial_table_i64::inverse_factorial
- modular_inverse_factorial_table_usize::inverse_factorial
- modular_inverse_fermat_little_theorem_i32::modinv
- modular_inverse_of_2_for_odd_modulus::mod_inv_of_2
- modular_inverse_power_of_2_table_for_odd_modulus_i64::power_of_inv_2
- modular_inverse_table_usize::inverse
- modular_linear_equation_with_chinese_remainder_theorem_euclidean::mod_linear_equation
- modular_linear_equation_with_chinese_remainder_theorem_garner::mod_linear_equation
- modular_linear_equation_with_euler_theorem_i64::mod_linear_equation
- modular_linear_equation_with_extended_euclidean_gcd::mod_linear_equation
- modular_matrix_multiplication_karatsuba_i64::mod_mul
- modular_mul_u128_with_add_doubling::mul_doubling
- modular_power_for_prime_usize_recurse::pow
- modular_power_of_k_table::power_of_k
- modular_power_of_power_for_prime_modulus::pow_of_pow
- modular_power_recurse_i64::pow
- modular_power_u32::pow
- modular_power_u64::pow
- modular_power_usize_recurse::pow
- modular_power_with_neg_exp_i32::pow
- montmort_numbers_table_from_i32::montmort_numbers
- montmort_numbers_table_modular_usize::montmort_numbers
- morris_pratt_longest_border_table_0_indexed::longest_border
- morris_pratt_longest_border_table_1_indexed::longest_border
- most_significant_bit_number_with_binary_search::msb_number
- most_significant_bit_number_with_msb::msb_number
- most_significant_bit_with_bit_length_u64::msb
- n_choose_table_from_i32::n_choose
- naive_mobius_transform_for_subset_additive_with_std::mobius_subset
- newton_method_with_derivative_function_f64::newton2d
- newton_method_with_derivative_function_f64::root
- next_combination_bits::next_combination
- next_power_of_two_with_bit_length_u64::next_power_of_2
- next_power_of_two_with_builtin_u64::next_power_of_2
- next_prime_number::next_prime
- next_prime_number_table::next_prime_table
- next_subset_bits::next_subset_bits
- normalize_sort_csgraph::normalize_csgraph
- number_of_common_subsequences_from_i32::number_of_common_subsequences
- number_of_common_subsequences_low_memory_modular_i64::number_of_common_subsequences
- number_of_common_subsequences_modular_i64::number_of_common_subsequences
- number_of_days_between_2_dates::number_of_days
- number_of_distinct_prime_factors_table_with_divisor_fast_zeta_usize::number_of_prime_factors
- number_of_distinct_prime_factors_table_with_divisor_zeta_usize::number_of_prime_factors
- number_of_distinct_subsequences_modular_i64::number_of_subsequences
- number_of_distinct_subsequences_with_min_step_modular_i64::number_of_subsequences
- number_of_distinct_substrings_with_sais_lcp_kasai::count_substrings
- number_of_divisors_from_prime_factorize_result_modular::number_of_divisors
- number_of_divisors_table_naive_usize::number_of_divisors
- number_of_divisors_table_with_divisor_fast_zeta_transform_usize::number_of_divisors
- number_of_divisors_table_with_divisor_zeta_transform_usize::number_of_divisors
- number_of_edges_in_subgraph_naive_dp::edge_count
- number_of_edges_in_subgraph_with_subset_fast_zeta::edge_count
- number_of_gcd_pairs_in_range_table_with_gcd_convolution::number_of_gcd_pairs
- number_of_gcd_pairs_in_range_table_with_multiples_fast_mobius::number_of_gcd_pairs
- number_of_lattice_points_in_polygon::polygon_lattice_points
- number_of_lattice_points_on_segment::segment_lattice_points
- number_of_lcm_pairs_in_range_table_with_lcm_convolution::number_of_lcm_pairs
- number_of_multiples_table_naive_usize::number_of_multiples
- number_of_multiples_table_with_fast_multiple_zeta_usize::number_of_multiples
- number_of_multiples_table_with_multiple_zeta_usize::number_of_multiples
- number_of_nodes_reachable_into_cycle_bfs_rev_edges::check_into_cycle
- number_of_nodes_reachable_into_cycle_dfs_recurse::check_into_cycle
- number_of_swap_in_bubble_sort_with_target_naive::count_swap
- number_of_swap_in_selection_sort::number_of_swap
- number_of_swap_in_shell_sort::number_of_swap
- number_of_topological_sort::count_toposort
- number_of_topological_sort_modular::count_toposort
- number_of_undirected_cycle_graph_table::number_of_cycle_graph
- number_of_undirected_path_graph_table::number_of_path_graph
- numeric_array_normalize_min_as_0::normalize
- numeric_array_normalize_min_as_offset::normalize
- pascal_triangle_from_i32::pascal_triangle
- pascal_triangle_from_u64_low_memory::pascal_triangle
- pascal_triangle_with_instance_semiring::pascal_triangle
- permutation_argsort::argsort
- pi_with_arccosine::pi
- pocket_tree_bfs_depth::tree_bfs_depth
- pocket_tree_bfs_parent::tree_bfs_parent
- polar_coordinates_distance::polar_dist
- polygon_area_2_times_2d::polygon_area_x2
- polygon_area_2d::polygon_area
- popcount_bit_by_bit::popcount
- popcount_divide_and_conquer::popcount
- popcount_divide_and_conquer_optimized::popcount
- popcount_resetting_lsb_usize::popcount
- popcount_table::popcount
- popcount_table_with_subset_fast_zeta::popcount
- popcount_with_const_8_bit_table_usize::popcount
- popcount_with_std_u64::popcount
- power_group::pow_group
- power_monoid::pow_monoid
- power_multiplicative_group_with_std_ops_exp_from_i32::power
- power_multiplicative_monoid_with_std_ops_exp_from_i32::power
- power_multiplicative_semigroup_with_std_ops::power
- power_multiplicative_semigroup_with_std_ops_exp_from_i32::power
- power_multiplicative_semigroup_with_std_ops_recurse::power
- power_semigroup::pow_semigroup
- power_semigroup_recurse::pow_semigroup_recurse
- previous_prime_number::previous_prime_number
- previous_prime_number_table::previous_prime_table
- primality::test::fermat::is_p
- primality::test::mr::is_p
- primality::test::rng_bases
- primality::test::solovay_strassen::is_p
- prime::count_prime_factors
- prime::find_prime_numbers
- prime::greatest_prime_factor
- prime::least_prime_factor
- prime::prime_factorize
- prime::sieve_of_eratosthenes
- prime_counting_fast::prime_pi_fast
- prime_counting_fast_half::prime_pi_fast_half
- prime_counting_fast_optimized::prime_pi_fast_optimized
- prime_factorization_of_lcm_of_multiple_nums::lcm_of_factorization
- prime_factorize_combination_with_sieve_of_eratosthenes::factorize_combination
- prime_factorize_combination_with_sieve_of_eratosthenes_legendre::factorize_combination
- prime_factorize_factorial_histogram_with_trial_division::factorize_factorial
- prime_factorize_factorial_with_legendre_formula_u32::factorize_factorial
- prime_factorize_factorial_with_legendre_formula_usize::factorize_factorial
- prime_factorize_factorial_with_lpf_u32::prime_factorize_factorial_lpf
- prime_factorize_fermat::prime_factorize_fermat
- prime_factorize_pollard_rho::prime_factorize_pollard_rho
- prime_factorize_pollard_rho_flat::prime_factorize_flat_pollard_rho
- prime_factorize_pollard_rho_flat_2::prime_factorize_flat_pollard_rho_2
- prime_factorize_trial_division::prime_factorize
- prime_factorize_trial_division_usize::prime_factorize
- prime_pi_approx_ln::prime_pi_approx_ln
- prime_pi_table_from_enumerate_primes::prime_pi_table
- quick_sort_inplace_recurse::quick_sort
- random_sequence_generate::random_sequence
- rank_of_permutation_for_small_n::permutation_rank
- read_adjacency_list_graph::read_graph
- read_edges::read_edges
- read_matrix::read_matrix
- read_weighted_adjacency_list_graph::read_weigted_graph
- read_weigted_edges::read_weighted_edges
- reduce::reduce
- rerooting_dp_with_instance_commutative_monoid::rerooting_dp
- reset_least_significant_bit_direct_u64::reset_lsb
- reset_least_significant_bit_smart::reset_lsb
- reset_least_significant_bit_smart_u64::reset_lsb
- reset_least_significant_bit_subtract_lsb_number::reset_lsb
- rng_static_xorshift64::static_xorshift64
- rng_xorshift128::xorshift128
- rng_xorshift32::xorshift32
- rng_xorshift64::xorshift64
- rng_xorshift64::xorshift64_fast
- rng_xorshift96::xorshift96
- round_up_with_int_u64::round_up
- run_length_encoding::rle
- safe_int_power::safe_int_pow
- selection_sort::selection_sort
- shell_sort::shell_sort
- shortest_path_a_star_2d_grid_path_or_wall_udlr_option_u32::a_star
- shortest_path_a_star_sparse_tuple_edges_adjacency_list_i64_with_inf::a_star
- shortest_path_bfs_2d_grid_path_or_wall_simple_udlr_move::bfs_grid
- shortest_path_bfs_sparse_tuple_edges_adjacency_list_usize::bfs
- shortest_path_desopo_pape_sparse::desopo_pape
- shortest_path_potential::shortest_path_potential
- sieve_of_eratosthenes_enumerate_primes_in_range_usize::range_primes
- sieve_of_eratosthenes_enumerate_primes_u32::enumerate_primes
- sieve_of_eratosthenes_enumerate_primes_usize::enumerate_primes
- sieve_of_eratosthenes_euler_totient_function_table_direct_usize::phi_table
- sieve_of_eratosthenes_greatest_prime_factor_table_direct_usize::greatest_prime_factor
- sieve_of_eratosthenes_is_prime_table::is_prime
- sieve_of_eratosthenes_is_prime_table_const_fast::is_prime
- sieve_of_eratosthenes_least_prime_factor_table_usize::least_prime_factor
- sieve_of_eratosthenes_least_prime_factor_table_usize_optim2::least_prime_factor
- sieve_of_eratosthenes_least_prime_factor_table_usize_optim::least_prime_factor
- sieve_of_eratosthenes_mobius_function_table_direct_isize::mobius_function
- sieve_of_eratosthenes_mobius_function_table_direct_isize_optim::mobius_function
- sieve_of_eratosthenes_number_of_distinct_prime_factors_table_usize::number_of_prime_factors
- sieve_of_eratosthenes_prime_factorize_factorial::factorize_factorial
- sieve_of_eratosthenes_prime_factorize_factorial_flat::factorize_factorial
- sieve_of_eratosthenes_prime_factorize_factorial_histogram::factorize_factorial
- sieve_of_eratosthenes_prime_factorize_flat_in_range::factorize
- sieve_of_eratosthenes_prime_factorize_in_range::factorize
- sieve_of_eratosthenes_prime_factorize_table_flat_usize::prime_factorize
- sieve_of_eratosthenes_prime_factorize_table_usize::prime_factorize
- sieve_of_sundaram_u32::enumerate_primes
- sliding_window_maximum_with_deque::sliding_window_maximum
- sliding_window_minimum_with_deque::sliding_window_minimum
- spanning_forest_with_uf::spanning_forest
- sssp_dijkstra_sparse_with_general::dijkstra_sparse
- sssp_faster_algorithm::spfa
- strconv::char_slice_to_string
- strconv::chars_to_byte_vec
- strconv::str_to_byte_vec
- strconv::str_to_char_vec
- strict_bellman_ford_abstract::bellman_ford_strict
- string_ith_ascii_letter::get
- string_ith_char::get
- strongly_connected_components_kosaraju::scc
- strongly_connected_components_kosaraju_recurse::scc
- strongly_connected_components_path_based::scc
- strongly_connected_components_path_based_another::scc
- strongly_connected_components_path_based_recurse::scc
- strongly_connected_components_tarjan_lowlink::scc
- strongly_connected_components_tarjan_lowlink_recurse::scc
- strongly_connected_components_topological_sort::toposort
- strongly_connected_components_transpose::transpose
- subset_sum::is_achievable_subset_sum
- subset_sum_at_most_k::is_achievable_subset_sum_at_most_k
- subset_sum_limited_count_multiple_same_values::is_achievable_subset_sum_multiple_same_values
- subset_sum_max_less_than_meet_in_the_middle_usize::subset_sum_max
- subset_sum_min_count::subset_sum_min_count_table
- subset_sum_min_count::subset_sum_min_count_table_2
- suffix_array_doubling_argsort::suffix_array
- suffix_array_doubling_argsort_const_optim::suffix_array
- suffix_array_doubling_counting_argsort::suffix_array
- suffix_array_induced_sort::sa_is
- suffix_array_induced_sort_recurse::from_str
- suffix_array_induced_sort_recurse::sa_is
- sum_arithmetic_progression::sum_arithmetic_progression
- sum_of_all_pairs_xor_in_array_modular::sum_of_xor
- sum_of_all_pairs_xor_in_array_modular_usize::sum_of_xor
- sum_of_divisors_count::sum_of_divisors_count
- sum_of_divisors_count_times_i::sum_of_divisors_count_times_i
- sum_of_divisors_sum::sum_of_divisors_sum
- sum_of_divisors_table_naive::sum_of_divisors
- sum_of_divisors_table_with_divisor_fast_zeta::sum_of_divisors
- sum_of_divisors_table_with_divisor_zeta::sum_of_divisors
- sum_of_gcd_for_each_element_is_1_to_k_euler_phi_from_usize::sum_of_gcd
- sum_of_gcd_for_each_element_is_1_to_k_fast_mobius_transform_from_usize::sum_of_gcd
- sum_of_gcd_for_each_element_is_1_to_k_fast_mobius_transform_usize::sum_of_gcd
- sum_of_gcd_for_each_element_is_1_to_k_mobius_transform_from_usize::sum_of_gcd
- sum_of_gcd_for_each_element_is_1_to_k_mobius_transform_usize::sum_of_gcd
- sum_of_gcd_with_k_for_1_to_n_with_divisors_euler_phi::sum_of_gcd
- sum_of_gcd_with_k_for_1_to_n_with_divisors_factorize_fast_mobius::sum_of_gcd
- sum_of_lcp_of_all_suffix_pairs_with_sais_lcp_kasai::sum_of_lcp
- sum_of_lcp_with_all_suffixes_with_z_algorithm::sum_of_lcp
- sum_of_multiples::sum_of_multiples
- sum_of_multiples_count_range::sum_of_multiples_count_range
- sum_of_multiples_count_times_i_range::sum_of_multiples_count_times_i_range
- sum_of_multiples_sum_range::sum_of_multiples_sum_range
- sum_of_multiples_sum_with_smart_formula::sum_of_multiples_sum
- sum_of_multiples_table_naive::sum_of_multiples
- sum_of_multiples_table_with_multiples_fast_zeta::sum_of_multiples
- sum_of_multiples_table_with_multiples_zeta::sum_of_multiples
- sum_of_product_of_all_pairs::sum_of_product
- sum_of_xor_prod_of_all_subsets_in_array_modular::sum_xor_for_all_subsets
- topological_sort::kahn
- topological_sort::with_dfs
- transpose_sparse_graph_with_unweighted_edges::transpose
- transpose_sparse_graph_with_weighted_edges::transpose
- traveling_salesperson_give_and_take_mem_access_optim_with_inf::tsp
- traveling_salesperson_giving_with_inf::tsp
- traveling_salesperson_taking_with_inf::tsp
- tree_bfs_abstract::tree_bfs
- tree_bfs_depth_with_abstract::tree_depths
- tree_bfs_parent::tree_bfs_parent
- tree_bfs_parent_depth::bfs
- tree_bfs_parent_with_abstract::tree_parents
- tree_dfs_abstract::tree_dfs
- tree_dfs_parent_depth_size::tree_dfs
- tree_dfs_size_recurse::tree_dfs_size
- tree_dfs_size_with_abstract::tree_sizes
- tree_diameter_and_path_weigted_edge_find_farthest_2_times_with_dfs::tree_diameter
- tree_diameter_dp_for_each_subtree_with_dfs::tree_diameter
- tree_diameter_finding_farthest_2_times_with_bfs::tree_diameter
- tree_diameter_path_unweighted::diameter_path
- tree_diameter_terminal_nodes::diameter_ends
- tree_edges_to_graph::tree_edges_to_graph
- tree_edges_to_graph::tree_edges_with_data_to_graph
- tree_get_path_with_bfs::tree_path
- tree_restore_path_from_parents::restore_tree_path
- triangle_2d_area_with_vector_cross_product::triangle_area
- tribonacci_sequence_modular::tribonacci
- trigonometry_tau_with_pi::tau
- undirected_bridge_detection_lowlink::find_bridges_lowlink
- undirected_edges_to_bidirected::edges_to_bidirected
- undirected_lowlink::undirected_lowlink
- undirected_tuple_edges_to_adjacency_list::to_adjlist
- upper_bound_on_slice::upper_bound
- vector_rotate_counterclockwise_180_2d_i64::rot180
- vector_rotate_counterclockwise_270_2d_i64::rot270
- vector_rotate_counterclockwise_90_2d_i64::rot90
- vector_rotation_2d_by_radian_with_matrix::rotate
- vector_rotation_matrix_2d::rotation_matrix
- vector_unique::unique
- volume_of_torus::volume
- xor_distance_on_tree_with_dfs_usize::tree_dfs_xor_dist
- xor_of_all_pairs_bitwise_and_of_two_arrays::xor_of_all_bitwise_and
- xor_vector_space_basis_original_with_gaussian_elimination::xor_basis_original
- xor_vector_space_basis_original_with_linear_span_bfs::xor_basis_original
- xor_vector_space_basis_with_cumulative_min::xor_basis
- xor_vector_space_basis_with_gaussian_elimination::xor_basis
- xor_vector_space_gaussian_elimination::xor_gaussian_elimination
- z_algorithm::z_algorithm
- z_algorithm_find_all_substring_indices::z_algorithm_findall
- zeller_day_of_week_congruence_formula::day_of_week
- zeta_transform_for_divisors_additive_with_std::zeta_divisors
- zeta_transform_for_divisors_with_instant_func::fast_zeta_divisors
- zeta_transform_for_multiples_additive_with_std::zeta_multiples
- zeta_transform_for_multiples_with_instant_func::zeta_multiples
- zeta_transform_for_subset_additive_with_std::zeta_subset
Type Definitions
- avl_tree_node_with_rc_refcell_merge_split_based_recurse::Cell
- btree_multiset::Multiset
- default_static_modular_arithmetic::Modular1_000_000_007
- default_static_modular_arithmetic::Modular998_244_353
- dijkstra_queue_binary_heap_std::DijkstraQueueBinaryHeapStd
- doubly_linked_list_node::Cell
- ett::E
- matrix_as_2d_vec::Matrix
- matrix_with_static_property_define_bitwise_xor_and_usize::BitXorAndMat
- singly_linked_list_node_with_rc_refcell::Cell
- static_matrix_property_frequent::Mat100
- static_modular_int_with_id_i64::Mint
Constants
- catalan_numbers_constant::CATALAN_NUMBERS
- const_ascii_characters::ASCII_DIGITS
- const_ascii_characters::ASCII_LOWERCASES
- const_ascii_characters::ASCII_UPPERCASES
- const_montmort_numbers_usize::MONTMORT_NUMBERS
- euler_jacobi_pseudo_prime::EULER_JACOBI_PSEUDO_PRIMES
- next_power_of_2_table_const_usize::NEXT_POWER_OF_2
- perfect_numbers::PERFECT_NUMBERS
- popcount_table_const_8_bit_usize::POPCOUNT
- primality::test::CARMICHAEL_NUMS
- primality::test::mr::bases::B32
- primality::test::mr::bases::B64_12
- primality::test::mr::bases::B64_7
- prime_pi_power_of_10::PRIME_PI_POWER_OF_10
- shell_sort_gap_sequences::CIURA_2001
- shell_sort_gap_sequences::KNUTH_1973
- shell_sort_gap_sequences::KNUTH_SEDGEWICK_1985
- shell_sort_gap_sequences::PRATT_1971
- shell_sort_gap_sequences::SEDGEWICK_1982
- shell_sort_gap_sequences::SEDGEWICK_1986
- shell_sort_gap_sequences::SEDGEWICK_1996
- shell_sort_gap_sequences::TOKUDA_1992