Macro impl_compressed_binary_indexed_tree
Source macro_rules! impl_compressed_binary_indexed_tree {
(@tuple ($($l:tt)*) ($($r:tt)*) $T:ident) => { ... };
(@tuple ($($l:tt)*) ($($r:tt)*) $T:ident $($Rest:ident)+) => { ... };
(@cst $M:ident) => { ... };
(@cst $M:ident $T:ident $($Rest:ident)*) => { ... };
(@from_iter $M:ident $points:ident $T:ident) => { ... };
(@from_iter $M:ident $points:ident $T:ident $U:ident $($Rest:ident)*) => { ... };
(@acc $e:expr, $rng:ident $T:ident) => { ... };
(@acc $e:expr, $rng:ident $T:ident $($Rest:ident)+) => { ... };
(@update $e:expr, $M:ident $key:ident $x:ident $T:ident) => { ... };
(@update $e:expr, $M:ident $key:ident $x:ident $T:ident $($Rest:ident)+) => { ... };
(@impl $C:ident $($T:ident)*, $($Q:ident)*) => { ... };
(@inner [$C:ident][$($T:ident)*][$($Q:ident)*][]) => { ... };
(@inner [$C:ident][$($T:ident)*][$($Q:ident)*][$D:ident $U:ident $R:ident $($Rest:ident)*]) => { ... };
($C:ident $T:ident $Q:ident $($Rest:ident)* $(;$($t:tt)*)?) => { ... };
($($t:tt)*) => { ... };
}