Index - B
| backBufferDSF | Data.Slide |
| backScanDSF | Data.Slide |
| balanceDSF | Data.Slide |
| bcMod | Math.PowMod |
| bestFlow | Data.Graph.MinCostFlow |
| bestFlow' | Data.Graph.MinCostFlow |
| bfs01SG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| bfsSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| bfsTreeSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| BinaryHeap | |
| 1 (Type/Class) | Data.BinaryHeap |
| 2 (Data Constructor) | Data.BinaryHeap |
| bindex | Data.Vector.Extra, ToyLib.Contest.Bisect |
| bisect | Algorithm.Bisect, ToyLib.Contest.Bisect |
| bisectF64 | Algorithm.Bisect, ToyLib.Contest.Bisect |
| bisectImpl | Algorithm.Bisect, ToyLib.Contest.Bisect |
| bisectL | Algorithm.Bisect, ToyLib.Contest.Bisect |
| bisectLF64 | Algorithm.Bisect, ToyLib.Contest.Bisect |
| bisectLRSS | Data.SplaySeq.Raw |
| bisectLSS | Data.SplaySeq |
| bisectLSTree | Data.SegmentTree.Lazy, ToyLib.Contest.LazySegmentTree |
| bisectLSTreeL | Data.SegmentTree.Lazy, ToyLib.Contest.LazySegmentTree |
| bisectLSTreeR | Data.SegmentTree.Lazy, ToyLib.Contest.LazySegmentTree |
| bisectM | Algorithm.Bisect, ToyLib.Contest.Bisect |
| bisectMF64 | Algorithm.Bisect, ToyLib.Contest.Bisect |
| bisectML | Algorithm.Bisect, ToyLib.Contest.Bisect |
| bisectMLF64 | Algorithm.Bisect, ToyLib.Contest.Bisect |
| bisectMR | Algorithm.Bisect, ToyLib.Contest.Bisect |
| bisectMRF64 | Algorithm.Bisect, ToyLib.Contest.Bisect |
| bisectR | Algorithm.Bisect, ToyLib.Contest.Bisect |
| bisectRF64 | Algorithm.Bisect, ToyLib.Contest.Bisect |
| bisectSTB | Data.SegmentTree.Beats |
| bisectSTBL | Data.SegmentTree.Beats |
| bisectSTBR | Data.SegmentTree.Beats |
| bitCeil | Math.BitSet |
| bitReverse | Math.NTT |
| bitRevSort | Math.NTT |
| bitsBV | Data.WaveletMatrix.BitVector |
| bitsOf | Math.BitSet |
| bitsRWM | Data.WaveletMatrix.Raw |
| BitVector | |
| 1 (Type/Class) | Data.WaveletMatrix.BitVector |
| 2 (Data Constructor) | Data.WaveletMatrix.BitVector |
| BlockIndex | Data.Sqrd |
| blockLenSqrd | Data.Sqrd |
| Boolean | |
| 1 (Type/Class) | Data.Core.Semiring |
| 2 (Data Constructor) | Data.Core.Semiring |
| boundsIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| bsearch | Algorithm.Bisect, ToyLib.Contest.Bisect |
| bsearchExact | Algorithm.Bisect, ToyLib.Contest.Bisect |
| bsearchL | Algorithm.Bisect, ToyLib.Contest.Bisect |
| bsearchM | Algorithm.Bisect, ToyLib.Contest.Bisect |
| bsearchMExact | Algorithm.Bisect, ToyLib.Contest.Bisect |
| bsearchML | Algorithm.Bisect, ToyLib.Contest.Bisect |
| bsearchMR | Algorithm.Bisect, ToyLib.Contest.Bisect |
| bsearchR | Algorithm.Bisect, ToyLib.Contest.Bisect |
| bsearchSTree | Data.SegmentTree.Strict |
| bsearchSTreeL | Data.SegmentTree.Strict |
| bsearchSTreeR | Data.SegmentTree.Strict |
| Buffer | |
| 1 (Type/Class) | Data.Buffer |
| 2 (Data Constructor) | Data.Buffer |
| bufferFoldSSF | Data.Slide |
| bufferSSF | Data.Slide |
| bufferVars | Data.Buffer |
| bufTSB | Data.Graph.TwoSat |
| buildBinaryHeapVia | Data.BinaryHeap |
| buildBuffer | Data.Buffer |
| buildEdgeTM | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| buildLSTree | Data.SegmentTree.Lazy, ToyLib.Contest.LazySegmentTree |
| buildMaxBinaryHeap | Data.BinaryHeap |
| buildMaxFlow | Data.Graph.MaxFlow |
| buildMinBinaryHeap | Data.BinaryHeap |
| buildMinCostFlow | Data.Graph.MinCostFlow |
| buildMST | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| buildRWM | Data.WaveletMatrix.Raw |
| buildSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| buildSG_ | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| buildSM | Data.SplayMap |
| buildSTB | Data.SegmentTree.Beats |
| buildSTree | Data.SegmentTree.Strict |
| buildVertTM | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| buildWM | Data.WaveletMatrix |
| buildWMST | Data.WaveletMatrix.SegTree |
| buildWSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| butterfly | Math.NTT |
| butterfly1 | Math.NTT |