Documentation ¶
Index ¶
- Constants
- type Bitset
- func (b Bitset) Equals(c Bitset) bool
- func (b Bitset) Flip(p int)
- func (b Bitset) Foreach(f func(p int) (Break bool))
- func (b Bitset) Has(p int) bool
- func (b Bitset) HasSubset(c Bitset) bool
- func (b Bitset) Index0() int
- func (b Bitset) Index1() int
- func (b Bitset) Lsh(k int)
- func (b Bitset) Merge(c Bitset)
- func (b Bitset) Next1(p int) int
- func (b Bitset) OnesCount() (c int)
- func (b Bitset) Reset(p int)
- func (b Bitset) Rsh(k int)
- func (b Bitset) Set(p int)
- type Deque
- func (q Deque) Back() interface{}
- func (q Deque) Empty() bool
- func (q Deque) Front() interface{}
- func (q Deque) Get(i int) interface{}
- func (q *Deque) PopBack() (v interface{})
- func (q *Deque) PopFront() (v interface{})
- func (q *Deque) PushBack(v interface{})
- func (q *Deque) PushFront(v interface{})
- func (q Deque) Size() int
- type Int
Constants ¶
View Source
const P = 998244353
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Bitset ¶
type Bitset []uint
Source Files ¶
- big.go
- bits.go
- bst.go
- cartesian_tree.go
- common.go
- deque.go
- dp.go
- fenwick_tree.go
- games.go
- geometry.go
- graph.go
- graph_tree.go
- heap.go
- io.go
- kd_tree.go
- leftist_tree.go
- link_cut_tree.go
- math.go
- math_continued_fraction.go
- math_fft.go
- math_fwt.go
- math_matrix.go
- math_ntt.go
- math_numerical_analysis.go
- misc.go
- mo.go
- monotone_queue.go
- monotone_stack.go
- odt.go
- odt_bst.go
- pq_tree.go
- rand.go
- red_black_tree.go
- scapegoat_tree.go
- search.go
- segment_tree.go
- sort.go
- sparse_table.go
- splay.go
- sqrt_decomposition.go
- strings.go
- treap.go
- trie.go
- trie01.go
- union_find.go
Click to show internal directories.
Click to hide internal directories.