other/int_alias.cpp

• View this file on GitHub
• Last update: 2020-03-02 16:21:18+09:00

Required by

• Axiotis-Tzamos Knapsack (algorithm/axiotis_tzamos_knapsack.cpp)
• Axiotis-Tzamos Unbounded Knapsack (algorithm/axiotis_tzamos_unbounded_knapsack.cpp)
• Concave Max Plus Convolution (algorithm/concave_max_plus_convolution.cpp)
• Divisor Möbius Transform (algorithm/divisor_mobius_transform.cpp)
• Divisor Zeta Transform (algorithm/divisor_zeta_transform.cpp)
• Max Plus Convolution (algorithm/max_plus_convolution.cpp)
• Multiple Möbius Transform (algorithm/multiple_mobius_transform.cpp)
• Multiple Zeta Transform (algorithm/multiple_zeta_transform.cpp)
• SMAWK Algorithm (algorithm/smawk.cpp)
• Subset Möbius Transform (algorithm/subset_mobius_transform.cpp)
• Subset Zeta Transform (algorithm/subset_zeta_transform.cpp)
• Superset Möbius Transform (algorithm/superset_mobius_transform.cpp)
• Superset Zeta Transform (algorithm/superset_zeta_transform.cpp)
• 3-Edge-Connected Component Decomposition (algorithm/three_edge_connected_component_decomposition.cpp)
• Banker's Queue (data_structure/bankers_queue.cpp)
• Bit Vector (data_structure/bit_vector.cpp)
• Dual Segment Tree (data_structure/dual_segment_tree.cpp)
• Fenwick Tree (data_structure/fenwick_tree.cpp)
• Incremental Bridge-Connectivity (data_structure/incremental_bridge_connectivity.cpp)
• Lazy Segment Tree (data_structure/lazy_segment_tree.cpp)
• Partially Persistent Union Find (data_structure/partially_persistent_union_find.cpp)
• Persistent Skew Binary Random Access List (data_structure/persistent_skew_binary_random_access_list.cpp)
• Physicist's Queue (data_structure/physicists_queue.cpp)
• Potentialized Union Find (data_structure/potentialized_union_find.cpp)
• Radix Heap (data_structure/radix_heap.cpp)
• Randomized Queue (data_structure/randomized_queue.cpp)
• Range Mode Query (data_structure/range_mode_query.cpp)
• Segment Tree (data_structure/segment_tree.cpp)
• Ternary Treap (data_structure/ternary_treap.cpp)
• Union Enumerate (data_structure/union_enumerate.cpp)
• Union Find (data_structure/union_find.cpp)
• w-ary Tree Set (data_structure/w_ary_tree_set.cpp)
• Wavelet Matrix (data_structure/wavelet_matrix.cpp)
• other/bit_width.cpp
• other/countl_zero.cpp
• other/countr_zero.cpp
• other/popcount.cpp
• other/select64.cpp

Verified with

• test/axiotis_tzamos_knapsack.test.cpp
• test/axiotis_tzamos_unbounded_knapsack.test.cpp
• test/bankers_queue.test.cpp
• test/dual_segment_tree.test.cpp
• test/fenwick_tree.test.cpp
• test/incremental_bridge_connectivity.test.cpp
• test/larsch.test.cpp
• test/lazy_segment_tree.test.cpp
• test/physicists_queue.test.cpp
• test/potentialized_union_find.test.cpp
• test/radix_heap.test.cpp
• test/randomized_queue.test.cpp
• test/segment_tree.test.cpp
• test/three_edge_connected_component_decomposition.test.cpp
• test/union_find.test.cpp
• test/w_ary_tree_set.pred.test.cpp
• test/w_ary_tree_set.test.cpp
• test/wavelet_matrix.quantile.test.cpp
• test/wavelet_matrix.rangefreq.test.cpp
• test/wavelet_matrix.select.test.cpp
• test/zeta_transform.test.cpp

Code

#pragma once

#include <cstddef>
#include <cstdint>

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

#line 2 "other/int_alias.cpp"

#include <cstddef>
#include <cstdint>

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

Back to top page