Index
| $$ | ToyLib.Debug, ToyLib.Contest.Prelude |
| +! | Data.Vector.CSum, ToyLib.Contest.Prelude |
| .$ | ToyLib.Debug, ToyLib.Contest.Prelude |
| .: | ToyLib.Prelude, ToyLib.Contest.Prelude |
| <+> | Data.Core.Semiring |
| <.> | Data.Core.Semiring |
| @! | Data.Vector.IxVector, ToyLib.Contest.Grid |
| @!! | Data.Vector.IxVector, ToyLib.Contest.Grid |
| @!!? | Data.Vector.IxVector, ToyLib.Contest.Grid |
| @!? | Data.Vector.IxVector, ToyLib.Contest.Grid |
| @+! | Data.Vector.IxVector, ToyLib.Contest.Grid |
| A2 | |
| 1 (Type/Class) | Data.Instances.A2 |
| 2 (Data Constructor) | Data.Instances.A2 |
| A3 | |
| 1 (Type/Class) | Data.Instances.A3 |
| 2 (Data Constructor) | Data.Instances.A3 |
| accessRWM | Data.WaveletMatrix.Raw |
| accessWM | Data.WaveletMatrix |
| accumulateIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| actFullSqrd | Data.Sqrd |
| actPartSqrd | Data.Sqrd |
| actRSS | Data.SplaySeq.Raw |
| actSqrd | Data.Sqrd |
| add2 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| add3 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| addACC | Data.SegmentTree.Beats.SumMinMax |
| AddChminChmax | |
| 1 (Type/Class) | Data.SegmentTree.Beats.SumMinMax |
| 2 (Data Constructor) | Data.SegmentTree.Beats.SumMinMax |
| AddChminChmaxRepr | Data.SegmentTree.Beats.SumMinMax |
| addMod | Math.PowMod |
| addMS | Data.MultiSet |
| addMS2 | Data.MultiSet2 |
| addOrTSB | Data.Graph.TwoSat |
| addOrTSB' | Data.Graph.TwoSat |
| adj | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| adjacentsSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| adjW | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| Affine2d | |
| 1 (Type/Class) | Data.Instances.Affine2d |
| 2 (Data Constructor) | Data.Instances.Affine2d |
| Affine2dRepr | Data.Instances.Affine2d |
| aggRSS | Data.SplaySeq.Raw |
| allMG | ToyLib.Procedural |
| allocNodeRSS | Data.SplaySeq.Raw |
| allocPool | Data.Pool |
| allocSeqRSS | Data.SplaySeq.Raw |
| allocSeqSS | Data.SplaySeq |
| ancestorHLD | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| and1 | ToyLib.Procedural |
| and2 | ToyLib.Procedural |
| anyMG | ToyLib.Procedural |
| appendCSum | Data.Vector.CSum, ToyLib.Contest.Prelude |
| assertRootRSS | Data.SplaySeq.Raw |
| assocsRWM | Data.WaveletMatrix.Raw |
| assocsWM | Data.WaveletMatrix |
| asTF | Data.Graph.TwoSat |
| 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 |
| cacheBLU | Data.BinaryLifting |
| cacheBLV | Data.BinaryLifting |
| canUnifyPUF | Data.UnionFind.Potencial |
| capacityDIS | Data.DenseIntSet |
| CapacityMCF | Data.Graph.MinCostFlow |
| capacityPool | Data.Pool |
| capacityRSS | Data.SplaySeq.Raw |
| capacitySM | Data.SplayMap |
| capacitySS | Data.SplaySeq |
| captureRSS | Data.SplaySeq.Raw |
| ceil2 | Math.BitSet |
| char' | ToyLib.Parser, ToyLib.Contest.Prelude |
| chmaxACC | Data.SegmentTree.Beats.SumMinMax |
| chminACC | Data.SegmentTree.Beats.SumMinMax |
| chunksOfG | Data.Vector.Extra, ToyLib.Contest.Bisect |
| clearBH | Data.BinaryHeap |
| clearBuffer | Data.Buffer |
| clearDSF | Data.Slide |
| clearHM | Data.DenseHashMap |
| clearMSV | Data.MultiSetVec |
| clearMUF | Data.UnionFind.Mutable |
| clearPool | Data.Pool |
| clearPUF | Data.UnionFind.Potencial |
| clearSM | Data.SplayMap |
| clearSSF | Data.Slide |
| cloneBuffer | Data.Buffer |
| cloneIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| Col | Math.Matrix |
| collectMST | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| combs | ToyLib.Prelude, ToyLib.Contest.Prelude |
| compareSL | Data.SizedList |
| compareVia | Data.BinaryHeap |
| componentInfoDI | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| componentsSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| compressInvNumG | Data.Vector.InvNum |
| compressU | Data.Vector.Extra, ToyLib.Contest.Bisect |
| concatBSB | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| concatHS | Data.RollingHash |
| consHS | Data.RollingHash |
| consSL | Data.SizedList |
| constructFor | ToyLib.DP |
| constructIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| constructMIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| constructMN | Data.Vector.Extra, ToyLib.Contest.Bisect |
| constructrMN | Data.Vector.Extra, ToyLib.Contest.Bisect |
| containsIM | Data.IntervalMap |
| containsIS | Data.IntervalSet |
| convertBase | Math.Digits |
| convolute64 | Math.NTT |
| convoluteMod | Math.NTT |
| CostMCF | Data.Graph.MinCostFlow |
| countMSV | Data.MultiSetVec |
| countUniqueSubstrings | Data.ByteString.SuffixArray |
| createBuffer | Data.Buffer |
| createIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| csum1D | Data.Vector.CSum, ToyLib.Contest.Prelude |
| csum2D | Data.Vector.IxVector, ToyLib.Contest.Grid |
| csumBV | Data.WaveletMatrix.BitVector |
| csumInPlaceBV | Data.WaveletMatrix.BitVector |
| dataPool | Data.Pool |
| dataSM | Data.SplayMap |
| dbg | ToyLib.Debug, ToyLib.Contest.Prelude |
| dbgAssert | ToyLib.Debug, ToyLib.Contest.Prelude |
| dbgGrid | ToyLib.Debug.Grid, ToyLib.Contest.Grid |
| dbgGridId | ToyLib.Debug.Grid, ToyLib.Contest.Grid |
| dbgGridM | ToyLib.Debug.Grid, ToyLib.Contest.Grid |
| dbgGridN | ToyLib.Debug.Grid, ToyLib.Contest.Grid |
| dbgGridNId | ToyLib.Debug.Grid, ToyLib.Contest.Grid |
| dbgId | ToyLib.Debug, ToyLib.Contest.Prelude |
| dbgLSTree | ToyLib.Debug.STree |
| dbgM | ToyLib.Debug, ToyLib.Contest.Prelude |
| dbgS | ToyLib.Debug, ToyLib.Contest.Prelude |
| dbgSM | ToyLib.Debug, ToyLib.Contest.Prelude |
| dbgSTree | ToyLib.Debug.STree |
| dbgSTreeAll | ToyLib.Debug.STree |
| dbgUF | ToyLib.Debug.UF |
| dbgVec | ToyLib.Debug, ToyLib.Contest.Prelude |
| deallocPool | Data.Pool |
| debug | ToyLib.Macro |
| decFindMaxMS | Data.MultiSet |
| decFindMaxMS2 | Data.MultiSet2 |
| decFindMinMS | Data.MultiSet |
| decFindMinMS2 | Data.MultiSet2 |
| decMS | Data.MultiSet |
| decMS2 | Data.MultiSet2 |
| decMSV | Data.MultiSetVec |
| deleteBH | Data.BinaryHeap |
| deleteDIM | Data.DenseIntMap |
| deleteDIS | Data.DenseIntSet |
| deleteFindMaxDIM | Data.DenseIntMap |
| deleteFindMaxDIS | Data.DenseIntSet |
| deleteFindMaxMayDIS | Data.DenseIntSet |
| deleteFindMinDIM | Data.DenseIntMap |
| deleteFindMinDIS | Data.DenseIntSet |
| deleteFindMinMayDIS | Data.DenseIntSet |
| deleteHM | Data.DenseHashMap |
| deleteHM_ | Data.DenseHashMap |
| deleteIM | Data.IntervalMap |
| deleteIS | Data.IntervalSet |
| deleteMIM | Data.IntervalMap |
| deleteMIS | Data.IntervalSet |
| deleteRSS | Data.SplaySeq.Raw |
| deleteSM | Data.SplayMap |
| deleteSM_ | Data.SplayMap |
| deleteSS | Data.SplaySeq |
| DenseHashMap | |
| 1 (Type/Class) | Data.DenseHashMap |
| 2 (Data Constructor) | Data.DenseHashMap |
| DenseIntMap | |
| 1 (Type/Class) | Data.DenseIntMap |
| 2 (Data Constructor) | Data.DenseIntMap |
| DenseIntSet | |
| 1 (Type/Class) | Data.DenseIntSet |
| 2 (Data Constructor) | Data.DenseIntSet |
| depthHLD | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| Deque | Data.Buffer |
| DequeSlidingFold | |
| 1 (Type/Class) | Data.Slide |
| 2 (Data Constructor) | Data.Slide |
| descAssocsRWM | Data.WaveletMatrix.Raw |
| descAssocsWM | Data.WaveletMatrix |
| dfsEveryPathLongestSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| dfsSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| dfsSM | Data.SplayMap |
| dfsTreeSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| diag4 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| dictWM | Data.WaveletMatrix |
| diffMayPUF | Data.UnionFind.Potencial |
| diffPUF | Data.UnionFind.Potencial |
| digits | Math.Digits |
| digitsRev | Math.Digits |
| digitsU' | ToyLib.Parser, ToyLib.Contest.Prelude |
| DigraphInfo | |
| 1 (Type/Class) | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| 2 (Data Constructor) | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| digraphSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| dimensions | Data.RollingHash |
| distsMCF | Data.Graph.MinCostFlow |
| distsMF | Data.Graph.MaxFlow |
| distsNN | Data.Graph.Generic, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| divisorsOf | Math.Divisors |
| divModConst | Math.PowMod |
| dj' | Data.Graph.Generic, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| djSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| djTreeSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| double' | ToyLib.Parser, ToyLib.Contest.Prelude |
| downScc1SG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| downSccSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| dualScanrSSF | Data.Slide |
| eAdj | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| edgeCapMCF | Data.Graph.MinCostFlow |
| edgeCapMF | Data.Graph.MaxFlow |
| edgeCostMCF | Data.Graph.MinCostFlow |
| edgeDstMCF | Data.Graph.MinCostFlow |
| edgeDstMF | Data.Graph.MaxFlow |
| EdgeId | Data.Graph.Alias, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| edgeRevIndexMCF | Data.Graph.MinCostFlow |
| edgeRevIndexMF | Data.Graph.MaxFlow |
| edgeSegmentsHLD | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| edgesMCF | Data.Graph.MinCostFlow |
| edgesMF | Data.Graph.MaxFlow |
| edgeVertsHLD | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| edgeWeightsSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| emptyHS | Data.RollingHash |
| emptyIM | Data.IntervalMap |
| emptyIS | Data.IntervalSet |
| emptyMS | Data.MultiSet |
| emptyMS2 | Data.MultiSet2 |
| emptySL | Data.SizedList |
| emptySUF | Data.UnionFind.Sparse |
| endlBSB | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| exchangeBack | Data.Buffer |
| exchangeFront | Data.Buffer |
| exchangeHM | Data.DenseHashMap |
| exchangeIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| exchangeNodeRSS | Data.SplaySeq.Raw |
| exchangeRSS | Data.SplaySeq.Raw |
| exchangeSS | Data.SplaySeq |
| exchangeSTree | Data.SegmentTree.Strict |
| exchangeTM | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| exgcd | Math.Exgcd |
| F | Data.Graph.TwoSat |
| factMod | Math.PowMod |
| factModsN | Math.PowMod |
| FailableSemigroupActionTarget | Data.SegmentTree.Util |
| failsSMM | Data.SegmentTree.Beats.SumMinMax |
| filterIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| findCycleComplexSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| findCycleDirectedSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| findCycleImplSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| findCycleUndirectedSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| findGEDIM | Data.DenseIntMap |
| findGEDIS | Data.DenseIntSet |
| findGTDIM | Data.DenseIntMap |
| findGTDIS | Data.DenseIntSet |
| findIndexIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| findIndexRWM | Data.WaveletMatrix.Raw |
| findIndexWM | Data.WaveletMatrix |
| findIndicesIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| findKthIndex0BV | Data.WaveletMatrix.BitVector |
| findKthIndex1BV | Data.WaveletMatrix.BitVector |
| findKthIndexRWM | Data.WaveletMatrix.Raw |
| findKthIndexWM | Data.WaveletMatrix |
| findLEDIM | Data.DenseIntMap |
| findLEDIS | Data.DenseIntSet |
| findLTDIM | Data.DenseIntMap |
| findLTDIS | Data.DenseIntSet |
| findMaxDIM | Data.DenseIntMap |
| findMaxDIS | Data.DenseIntSet |
| findMinDIM | Data.DenseIntMap |
| findMinDIS | Data.DenseIntSet |
| first4 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| fix1 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| fix2 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| fix3 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| floorSum | Math.FloorSum |
| floorSumUnsigned | Math.FloorSum |
| FlowMCF | Data.Graph.MinCostFlow |
| foldAllLSTree | Data.SegmentTree.Lazy, ToyLib.Contest.LazySegmentTree |
| foldAllRSS | Data.SplaySeq.Raw |
| foldAllSS | Data.SplaySeq |
| foldAllSTB | Data.SegmentTree.Beats |
| foldAllSTree | Data.SegmentTree.Strict |
| foldDSF | Data.Slide |
| foldEdgesCommuteHLD | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| foldEdgesHLD | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| foldHLD | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| foldLSTree | Data.SegmentTree.Lazy, ToyLib.Contest.LazySegmentTree |
| foldMayLSTree | Data.SegmentTree.Lazy, ToyLib.Contest.LazySegmentTree |
| foldMaySTB | Data.SegmentTree.Beats |
| foldMaySTree | Data.SegmentTree.Strict |
| foldMayWMST | Data.WaveletMatrix.SegTree |
| foldP | Data.Core.Semiring |
| foldPathViaLca | Data.Graph.Tree.Lca |
| foldRSS | Data.SplaySeq.Raw |
| foldSqrd | Data.Sqrd |
| foldSS | Data.SplaySeq |
| foldSSF | Data.Slide |
| foldSTB | Data.SegmentTree.Beats |
| foldSTree | Data.SegmentTree.Strict |
| foldSubtreeEdgeTM | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| foldSubtreeVertsTM | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| foldT | Data.Core.Semiring |
| foldTM | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| foldTreeAllSG | Data.Graph.Tree.TreeSG, ToyLib.Contest.Tree |
| foldTreeAllSG' | Data.Graph.Tree.TreeSG, ToyLib.Contest.Tree |
| foldTreeImplSG | Data.Graph.Tree.TreeSG, ToyLib.Contest.Tree |
| foldTreeSG | Data.Graph.Tree.TreeSG, ToyLib.Contest.Tree |
| foldVertsCommuteHLD | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| foldVertsHLD | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| fourth4 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| freeNodeRSS | Data.SplaySeq.Raw |
| freePool | Data.Pool |
| freeRSS | Data.SplaySeq.Raw |
| freeSS | Data.SplaySeq |
| freeSubtreeRSS | Data.SplaySeq.Raw |
| freezeBuffer | Data.Buffer |
| freezeInternalBuffer | Data.Buffer |
| freezeIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| freezeLeavesSTree | Data.SegmentTree.Strict |
| freq0BV | Data.WaveletMatrix.BitVector |
| freq1BV | Data.WaveletMatrix.BitVector |
| freqInRWM | Data.WaveletMatrix.Raw |
| freqInWM | Data.WaveletMatrix |
| freqLTRWM | Data.WaveletMatrix.Raw |
| freqRWM | Data.WaveletMatrix.Raw |
| freqWM | Data.WaveletMatrix |
| fromListMS | Data.MultiSet |
| fromListMS2 | Data.MultiSet2 |
| fromListSUF | Data.UnionFind.Sparse |
| fromVecIM | Data.IntervalMap |
| fromVecMIM | Data.IntervalMap |
| fromVecMSV | Data.MultiSetVec |
| fromVecSUF | Data.UnionFind.Sparse |
| frontBufferDSF | Data.Slide |
| frontScanDSF | Data.Slide |
| fst4 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| fth4 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| generateBuffer | Data.Buffer |
| generateIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| generateLSTree | Data.SegmentTree.Lazy, ToyLib.Contest.LazySegmentTree |
| generateLSTreeImpl | Data.SegmentTree.Lazy, ToyLib.Contest.LazySegmentTree |
| generateSTB | Data.SegmentTree.Beats |
| generateSTBImpl | Data.SegmentTree.Beats |
| genericBfs | Data.Graph.Generic, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| genericBfs01 | Data.Graph.Generic, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| genericBfsTree | Data.Graph.Generic, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| genericComponentsOf | Data.Graph.Generic, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| genericDfs | Data.Graph.Generic, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| genericDfsEveryPathL | Data.Graph.Generic, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| genericDfsLongestPath | Data.Graph.Generic, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| genericDfsTree | Data.Graph.Generic, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| genericDj | Data.Graph.Generic, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| genericDjTree | Data.Graph.Generic, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| genericGrouping | Data.Graph.Generic, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| genericSparseDj | Data.Graph.Generic, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| getBoolean | Data.Core.Semiring |
| getDiagMat' | ToyLib.Parser.Grid, ToyLib.Contest.Grid |
| getGrid' | ToyLib.Parser.Grid, ToyLib.Contest.Grid |
| getMat' | ToyLib.Parser.Grid, ToyLib.Contest.Grid |
| getMaxPlus | Data.Core.Semiring |
| getMidDouble | Algorithm.Bisect, ToyLib.Contest.Bisect |
| getMidInt | Algorithm.Bisect, ToyLib.Contest.Bisect |
| getMinPlus | Data.Core.Semiring |
| getMS | Data.MultiSet |
| getMS2 | Data.MultiSet2 |
| Group | Data.Core.Group |
| groupRootsMUF | Data.UnionFind.Mutable |
| groupSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| groupsMUF | Data.UnionFind.Mutable |
| groupsPUF | Data.UnionFind.Potencial |
| grow2 | Math.NTT |
| hashHM | Data.DenseHashMap |
| HashInt | Data.RollingHash |
| hashLength | Data.RollingHash |
| hashRH | Data.RollingHash |
| HashSlice | |
| 1 (Type/Class) | Data.RollingHash |
| 2 (Data Constructor) | Data.RollingHash |
| hashSum | Data.RollingHash |
| hashValue | Data.RollingHash |
| headHLD | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| headMay | Data.SafeList |
| headOr | Data.SafeList |
| heapifyBy | Data.BinaryHeap |
| heightRWM | Data.WaveletMatrix.Raw |
| HLD | |
| 1 (Type/Class) | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| 2 (Data Constructor) | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| hldOf | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| hldOf' | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| hldTM | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| identAffine2d | Data.Instances.Affine2d |
| idIndexMap | Data.BinaryLifting |
| idIndexMapWithAction | Data.BinaryLifting |
| idPermutation | Data.BinaryLifting |
| ifilterIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| ikthMaxRWM | Data.WaveletMatrix.Raw |
| ikthMaxWM | Data.WaveletMatrix |
| ikthMinRWM | Data.WaveletMatrix.Raw |
| ikthMinWM | Data.WaveletMatrix |
| imapIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| incMS | Data.MultiSet |
| incMS2 | Data.MultiSet2 |
| incMSV | Data.MultiSetVec |
| indexedIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| indexHLD | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| indexHM | Data.DenseHashMap |
| IndexMap | |
| 1 (Type/Class) | Data.BinaryLifting |
| 2 (Data Constructor) | Data.BinaryLifting |
| IndexMapWithAction | |
| 1 (Type/Class) | Data.BinaryLifting |
| 2 (Data Constructor) | Data.BinaryLifting |
| indexXWMST | Data.WaveletMatrix.SegTree |
| indexXYWMST | Data.WaveletMatrix.SegTree |
| indexYWMST | Data.WaveletMatrix.SegTree |
| initialBufferPos | Data.Buffer |
| innerMS | Data.MultiSet |
| innerMS2 | Data.MultiSet2 |
| insertBH | Data.BinaryHeap |
| insertDIM | Data.DenseIntMap |
| insertDIS | Data.DenseIntSet |
| insertIM | Data.IntervalMap |
| insertIS | Data.IntervalSet |
| insertMIM | Data.IntervalMap |
| insertMIS | Data.IntervalSet |
| insertRSS | Data.SplaySeq.Raw |
| insertSM | Data.SplayMap |
| insertSM_ | Data.SplayMap |
| insertSS | Data.SplaySeq |
| insertSUF | Data.UnionFind.Sparse |
| int' | ToyLib.Parser, ToyLib.Contest.Prelude |
| int1' | ToyLib.Parser, ToyLib.Contest.Prelude |
| interleave | ToyLib.Prelude, ToyLib.Contest.Prelude |
| internalBuffer | Data.Buffer |
| internalBufferSize | Data.Buffer |
| internalVecBH | Data.BinaryHeap |
| intersectsIM | Data.IntervalMap |
| intersectsIS | Data.IntervalSet |
| intersperseBSB | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| intersperseWithBSB | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| IntervalMap | |
| 1 (Type/Class) | Data.IntervalMap |
| 2 (Data Constructor) | Data.IntervalMap |
| IntervalSet | Data.IntervalSet |
| ints' | ToyLib.Parser, ToyLib.Contest.Prelude |
| ints011' | ToyLib.Parser, ToyLib.Contest.Prelude |
| ints11' | ToyLib.Parser, ToyLib.Contest.Prelude |
| ints110' | ToyLib.Parser, ToyLib.Contest.Prelude |
| ints111' | ToyLib.Parser, ToyLib.Contest.Prelude |
| ints2' | ToyLib.Parser, ToyLib.Contest.Prelude |
| ints3' | ToyLib.Parser, ToyLib.Contest.Prelude |
| ints4' | ToyLib.Parser, ToyLib.Contest.Prelude |
| ints5' | ToyLib.Parser, ToyLib.Contest.Prelude |
| ints6' | ToyLib.Parser, ToyLib.Contest.Prelude |
| intsN' | ToyLib.Parser, ToyLib.Contest.Prelude |
| intsU' | ToyLib.Parser, ToyLib.Contest.Prelude |
| intt | Math.NTT |
| intVarsBH | Data.BinaryHeap |
| invButterfly | Math.NTT |
| invButterfly1 | Math.NTT |
| invert | Data.Core.Group |
| invMat2x2 | Data.Instances.Affine2d |
| invModConst | Math.PowMod |
| invModGcd | Math.Exgcd |
| invNum | Data.Vector.InvNum |
| IOUnionFind | Data.UnionFind.Mutable |
| irelaxMany | ToyLib.DP |
| isAllDigraphDI | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| isCommuteTM | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| isEdgeTM | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| isFailureFSAT | Data.SegmentTree.Util |
| isInSubtreeHLD | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| isqrt | ToyLib.Prelude, ToyLib.Contest.Prelude |
| isqrtSlow | Algorithm.Bisect, ToyLib.Contest.Bisect |
| iterMF | Data.Graph.MaxFlow |
| iwiSpansU | ToyLib.DP |
| iwiSpansU' | ToyLib.DP |
| IxBVector | Data.Vector.IxVector, ToyLib.Contest.Grid |
| IxMBVector | Data.Vector.IxVector, ToyLib.Contest.Grid |
| IxMUVector | Data.Vector.IxVector, ToyLib.Contest.Grid |
| IxUVector | Data.Vector.IxVector, ToyLib.Contest.Grid |
| IxVector | |
| 1 (Type/Class) | Data.Vector.IxVector, ToyLib.Contest.Grid |
| 2 (Data Constructor) | Data.Vector.IxVector, ToyLib.Contest.Grid |
| jumpHLD | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| keyHM | Data.DenseHashMap |
| keySN | Data.SplayMap |
| kthMaxRWM | Data.WaveletMatrix.Raw |
| kthMaxWM | Data.WaveletMatrix |
| kthMinRWM | Data.WaveletMatrix.Raw |
| kthMinWM | Data.WaveletMatrix |
| lastCharOccurrences | ToyLib.DP |
| lastMay | Data.SafeList |
| lastOr | Data.SafeList |
| LazySegmentTree | |
| 1 (Type/Class) | Data.SegmentTree.Lazy, ToyLib.Contest.LazySegmentTree |
| 2 (Data Constructor) | Data.SegmentTree.Lazy, ToyLib.Contest.LazySegmentTree |
| lca | Data.Graph.Tree.Lca |
| LcaCache | Data.Graph.Tree.Lca |
| lcaCacheSG | Data.Graph.Tree.TreeSG, ToyLib.Contest.Tree |
| lcaHLD | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| lcaLen | Data.Graph.Tree.Lca |
| lcpOf | Data.ByteString.ZFunction |
| lcpOfSa | Data.ByteString.SuffixArray |
| lcsOf | ToyLib.DP |
| lengthBuffer | Data.Buffer |
| lengthHLD | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| lengthIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| lengthRH | Data.RollingHash |
| lengthRWM | Data.WaveletMatrix.Raw |
| lengthSM | Data.SplayMap |
| lexOrderMod | Data.Vector.InvNum |
| lexPerms | ToyLib.DP |
| line' | ToyLib.Parser, ToyLib.Contest.Prelude |
| lisOf | ToyLib.DP |
| lisOf' | ToyLib.DP |
| log2 | Math.BitSet |
| lookupGEDIM | Data.DenseIntMap |
| lookupGEDIS | Data.DenseIntSet |
| lookupGERWM | Data.WaveletMatrix.Raw |
| lookupGESM | Data.SplayMap |
| lookupGEWM | Data.WaveletMatrix |
| lookupGTDIM | Data.DenseIntMap |
| lookupGTDIS | Data.DenseIntSet |
| lookupGTRWM | Data.WaveletMatrix.Raw |
| lookupGTSM | Data.SplayMap |
| lookupGTWM | Data.WaveletMatrix |
| lookupIM | Data.IntervalMap |
| lookupIS | Data.IntervalSet |
| lookupLEDIM | Data.DenseIntMap |
| lookupLEDIS | Data.DenseIntSet |
| lookupLERWM | Data.WaveletMatrix.Raw |
| lookupLESM | Data.SplayMap |
| lookupLEWM | Data.WaveletMatrix |
| lookupLTDIM | Data.DenseIntMap |
| lookupLTDIS | Data.DenseIntSet |
| lookupLTRWM | Data.WaveletMatrix.Raw |
| lookupLTSM | Data.SplayMap |
| lookupLTWM | Data.WaveletMatrix |
| lookupMaxDIM | Data.DenseIntMap |
| lookupMaxDIS | Data.DenseIntSet |
| lookupMinDIM | Data.DenseIntMap |
| lookupMinDIS | Data.DenseIntSet |
| lookupMS | Data.MultiSet |
| lookupMS2 | Data.MultiSet2 |
| lookupSM | Data.SplayMap |
| lrFindIndexRWM | Data.WaveletMatrix.Raw |
| lrFindIndexWM | Data.WaveletMatrix |
| lrFindKthIndex0BV | Data.WaveletMatrix.BitVector |
| lrFindKthIndex1BV | Data.WaveletMatrix.BitVector |
| lrFindKthIndexRWM | Data.WaveletMatrix.Raw |
| lrFindKthIndexWM | Data.WaveletMatrix |
| lRSS | Data.SplaySeq.Raw |
| lsbOf | Math.BitSet |
| lSN | Data.SplayMap |
| M1 | Math.NTT |
| M2 | Math.NTT |
| M3 | Math.NTT |
| mapIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| mapM22 | Data.Instances.Affine2d |
| mapV2 | Data.Instances.Affine2d |
| maskHM | Data.DenseHashMap |
| Mat | Math.Matrix |
| Mat2x2 | |
| 1 (Type/Class) | Data.Instances.Affine2d |
| 2 (Data Constructor) | Data.Instances.Affine2d |
| Mat2x2Repr | Data.Instances.Affine2d |
| max2SMM | Data.SegmentTree.Beats.SumMinMax |
| MaxBinaryHeap | Data.BinaryHeap |
| maxCapHM | Data.DenseHashMap |
| maxCostFlow | Data.Graph.MinCostFlow |
| maxCostFlow' | Data.Graph.MinCostFlow |
| MaxFlow | |
| 1 (Type/Class) | Data.Graph.MaxFlow |
| 2 (Data Constructor) | Data.Graph.MaxFlow |
| maxFlow | Data.Graph.MaxFlow |
| maxFlow' | Data.Graph.MaxFlow |
| MaxFlowBuffer | |
| 1 (Type/Class) | Data.Graph.MaxFlow |
| 2 (Data Constructor) | Data.Graph.MaxFlow |
| maximumMay | Data.SafeList |
| maximumOr | Data.SafeList |
| maxMSV | Data.MultiSetVec |
| MaxPlus | |
| 1 (Type/Class) | Data.Core.Semiring |
| 2 (Data Constructor) | Data.Core.Semiring |
| maxSL | Data.SizedList |
| maxSMM | Data.SegmentTree.Beats.SumMinMax |
| mDigits | Math.Digits |
| mDigitsRev | Math.Digits |
| memberDIM | Data.DenseIntMap |
| memberDIS | Data.DenseIntSet |
| memberHM | Data.DenseHashMap |
| memberMS | Data.MultiSet |
| memberMS2 | Data.MultiSet2 |
| memberSM | Data.SplayMap |
| memberSUF | Data.UnionFind.Sparse |
| merge3RSS | Data.SplaySeq.Raw |
| mergeRSS | Data.SplaySeq.Raw |
| mergeSqrd | Data.Sqrd |
| mexIM | Data.IntervalMap |
| mexIS | Data.IntervalSet |
| min2SMM | Data.SegmentTree.Beats.SumMinMax |
| MinBinaryHeap | Data.BinaryHeap |
| MinCostFlow | |
| 1 (Type/Class) | Data.Graph.MinCostFlow |
| 2 (Data Constructor) | Data.Graph.MinCostFlow |
| minCostFlow | Data.Graph.MinCostFlow |
| minCostFlow' | Data.Graph.MinCostFlow |
| MinCostFlowBuffer | |
| 1 (Type/Class) | Data.Graph.MinCostFlow |
| 2 (Data Constructor) | Data.Graph.MinCostFlow |
| minimumMay | Data.SafeList |
| minimumOr | Data.SafeList |
| minMSV | Data.MultiSetVec |
| MinPlus | |
| 1 (Type/Class) | Data.Core.Semiring |
| 2 (Data Constructor) | Data.Core.Semiring |
| minSMM | Data.SegmentTree.Beats.SumMinMax |
| modifyBack | Data.Buffer |
| modifyBH | Data.BinaryHeap |
| modifyFront | Data.Buffer |
| modifyHM | Data.DenseHashMap |
| modifyIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| modifyM | ToyLib.Compat |
| modifyMBack | Data.Buffer |
| modifyMFront | Data.Buffer |
| modifyMIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| modifyNodeRSS | Data.SplaySeq.Raw |
| modifyRSS | Data.SplaySeq.Raw |
| modifySS | Data.SplaySeq |
| modifySTree | Data.SegmentTree.Strict |
| modifyTM | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| modifyWMST | Data.WaveletMatrix.SegTree |
| ModInt | |
| 1 (Type/Class) | Data.ModInt |
| 2 (Data Constructor) | Data.ModInt |
| msbOf | Math.BitSet |
| mtimes' | Math.Stimes |
| mtimesBL | Data.BinaryLifting |
| MUFChild | Data.UnionFind.Mutable |
| MUFNode | Data.UnionFind.Mutable |
| MUFRoot | Data.UnionFind.Mutable |
| mul2 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| mul3 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| mulM22M22 | Data.Instances.Affine2d |
| mulM22V2 | Data.Instances.Affine2d |
| mulMat | Math.Matrix |
| mulMatMod | Math.Matrix |
| mulMatToCol | Math.Matrix |
| mulMatToColMod | Math.Matrix |
| mulMod | Math.PowMod |
| MultiSet | Data.MultiSet |
| MultiSet2 | Data.MultiSet2 |
| MultiSetVec | |
| 1 (Type/Class) | Data.MultiSetVec |
| 2 (Data Constructor) | Data.MultiSetVec |
| MUnionFind | |
| 1 (Type/Class) | Data.UnionFind.Mutable |
| 2 (Data Constructor) | Data.UnionFind.Mutable |
| MVector | Data.Core.Semiring, Data.Instances.A2, Data.Instances.A3, Data.Instances.T2, Data.RollingHash, Data.SplayMap, Data.UnionFind.Mutable, Data.Instances.Affine2d, Data.SegmentTree.Beats.SumMinMax, Data.ModInt |
| MV_A2 | Data.Instances.A2 |
| MV_A3 | Data.Instances.A3 |
| MV_AddChminChmax | Data.SegmentTree.Beats.SumMinMax |
| MV_Affine2d | Data.Instances.Affine2d |
| MV_Foo | Data.Core.Semiring |
| MV_Mat2x2 | Data.Instances.Affine2d |
| MV_MaxPlus | Data.Core.Semiring |
| MV_MinPlus | Data.Core.Semiring |
| MV_ModInt | Data.ModInt |
| MV_MUFNode | Data.UnionFind.Mutable |
| MV_RH | Data.RollingHash |
| MV_SplayNode | Data.SplayMap |
| MV_SumMinMax | Data.SegmentTree.Beats.SumMinMax |
| MV_T2 | Data.Instances.T2 |
| MV_V2 | Data.Instances.Affine2d |
| nEdgesMCF | Data.Graph.MinCostFlow |
| nEdgesMF | Data.Graph.MaxFlow |
| nEdgesSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| newAddACC | Data.SegmentTree.Beats.SumMinMax |
| newBinaryHeap | Data.BinaryHeap |
| newBuffer | Data.Buffer |
| newBufferAsDeque | Data.Buffer |
| newChmaxACC | Data.SegmentTree.Beats.SumMinMax |
| newChminACC | Data.SegmentTree.Beats.SumMinMax |
| newCSumBV | Data.WaveletMatrix.BitVector |
| newCSumU | Data.Vector.CSum, ToyLib.Contest.Prelude |
| newDIM | Data.DenseIntMap |
| newDIS | Data.DenseIntSet |
| newDSF | Data.Slide |
| newHM | Data.DenseHashMap |
| newIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| newLazySS | Data.SplaySeq |
| newLSTree | Data.SegmentTree.Lazy, ToyLib.Contest.LazySegmentTree |
| newLSTreeImpl | Data.SegmentTree.Lazy, ToyLib.Contest.LazySegmentTree |
| newMaxBinaryHeap | Data.BinaryHeap |
| newMinBinaryHeap | Data.BinaryHeap |
| newMSV | Data.MultiSetVec |
| newMUF | Data.UnionFind.Mutable |
| newPool | Data.Pool |
| newPUF | Data.UnionFind.Potencial |
| newRevBuffer | Data.Buffer |
| newRH | Data.RollingHash |
| newRSS | Data.SplaySeq.Raw |
| newSM | Data.SplayMap |
| newSS | Data.SplaySeq |
| newSSF | Data.Slide |
| newSTB | Data.SegmentTree.Beats |
| newSTBImpl | Data.SegmentTree.Beats |
| newSTree | Data.SegmentTree.Strict |
| newSUF | Data.UnionFind.Sparse |
| newTSB | Data.Graph.TwoSat |
| nextDigitRH | Data.RollingHash |
| nextPermutation | ToyLib.Compat |
| nextPermutationBy | ToyLib.Compat |
| nextPermutationByLt | ToyLib.Compat |
| nextPool | Data.Pool |
| nMaxSMM | Data.SegmentTree.Beats.SumMinMax |
| nMinSMM | Data.SegmentTree.Beats.SumMinMax |
| nodesPUF | Data.UnionFind.Potencial |
| note | ToyLib.Debug, ToyLib.Contest.Prelude |
| notMemberDIM | Data.DenseIntMap |
| notMemberDIS | Data.DenseIntSet |
| notMemberMS | Data.MultiSet |
| notMemberMS2 | Data.MultiSet2 |
| ntt | Math.NTT |
| nullBuffer | Data.Buffer |
| nullMSV | Data.MultiSetVec |
| nullPI | Data.Pool |
| nullSI | |
| 1 (Function) | Data.SplayMap |
| 2 (Function) | Data.SplaySeq.Raw |
| nullSL | Data.SizedList |
| nValidLeavesSegmentTree | Data.SegmentTree.Strict |
| nVarsTSB | Data.Graph.TwoSat |
| nVertsMCF | Data.Graph.MinCostFlow |
| nVertsMF | Data.Graph.MaxFlow |
| nVertsSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| nZerosRWM | Data.WaveletMatrix.Raw |
| offsetsMCF | Data.Graph.MinCostFlow |
| offsetsMF | Data.Graph.MaxFlow |
| offsetsSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| or1 | ToyLib.Procedural |
| or2 | ToyLib.Procedural |
| ordPowerset | ToyLib.DP |
| OrdVia | Data.BinaryHeap |
| ortho4 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| ortho4' | ToyLib.Prelude, ToyLib.Contest.Prelude |
| orthoWith | ToyLib.Prelude, ToyLib.Contest.Prelude |
| parentHLD | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| partitionsOf | Math.BitSet |
| partitionsOfK | Math.BitSet |
| pathHLD | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| Permutation | |
| 1 (Type/Class) | Data.BinaryLifting |
| 2 (Data Constructor) | Data.BinaryLifting |
| Pool | |
| 1 (Type/Class) | Data.Pool |
| 2 (Data Constructor) | Data.Pool |
| PoolIndex | Data.Pool |
| popBack | Data.Buffer |
| popBackDSF | Data.Slide |
| popBackN | Data.Buffer |
| popBackN_ | Data.Buffer |
| popBack_ | Data.Buffer |
| popFront | Data.Buffer |
| popFrontDSF | Data.Slide |
| popFrontN | Data.Buffer |
| popFrontN_ | Data.Buffer |
| popFrontSSF | Data.Slide |
| popFront_ | Data.Buffer |
| popRootSM | Data.SplayMap |
| potencialPUF | Data.UnionFind.Potencial |
| potPUF | Data.UnionFind.Potencial |
| power | Math.Stimes |
| powerMay | Math.Stimes |
| powerOr | Math.Stimes |
| powerset | Math.BitSet |
| powersetM_ | Math.BitSet |
| powersetU | Math.BitSet |
| powModConst | Math.PowMod |
| prevEdgeMCF | Data.Graph.MinCostFlow |
| prevPermutation | ToyLib.Compat |
| prevPermutationBy | ToyLib.Compat |
| prevVertMCF | Data.Graph.MinCostFlow |
| primeFactors | Math.Primes |
| primes | Math.Primes |
| primRoot | Math.NTT |
| printBSB | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| printGrid | ToyLib.ShowBSB.Grid, ToyLib.Contest.Grid |
| printList | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| printMat | ToyLib.ShowBSB.Grid, ToyLib.Contest.Grid |
| printVec | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| printYn | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| priorityBH | Data.BinaryHeap |
| propNodeFromRootRSS | Data.SplaySeq.Raw |
| propNodeRSS | Data.SplaySeq.Raw |
| pRSS | Data.SplaySeq.Raw |
| PUnionFind | |
| 1 (Type/Class) | Data.UnionFind.Potencial |
| 2 (Data Constructor) | Data.UnionFind.Potencial |
| pushBack | Data.Buffer |
| pushBackDSF | Data.Slide |
| pushBacks | Data.Buffer |
| pushBackSSF | Data.Slide |
| pushBasedConstructIV | ToyLib.DP |
| pushBasedConstructN | ToyLib.DP |
| pushFront | Data.Buffer |
| pushFrontDSF | Data.Slide |
| pushFronts | Data.Buffer |
| pushRootSM | Data.SplayMap |
| putBSB | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| putList | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| putLnBSB | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| putVec | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| queueMF | Data.Graph.MaxFlow |
| rangeG | ToyLib.Prelude, ToyLib.Contest.Prelude |
| rangeGR | ToyLib.Prelude, ToyLib.Contest.Prelude |
| rangeU | ToyLib.Prelude, ToyLib.Contest.Prelude |
| rangeUR | ToyLib.Prelude, ToyLib.Contest.Prelude |
| rangeV | ToyLib.Prelude, ToyLib.Contest.Prelude |
| rangeVR | ToyLib.Prelude, ToyLib.Contest.Prelude |
| RawSplaySeq | |
| 1 (Type/Class) | Data.SplaySeq.Raw |
| 2 (Data Constructor) | Data.SplaySeq.Raw |
| rawSS | Data.SplaySeq |
| RawWaveletMatrix | |
| 1 (Type/Class) | Data.WaveletMatrix.Raw |
| 2 (Data Constructor) | Data.WaveletMatrix.Raw |
| rawWM | Data.WaveletMatrix |
| rawWmWMST | Data.WaveletMatrix.SegTree |
| readBack | Data.Buffer |
| readCSum | Data.Vector.CSum, ToyLib.Contest.Prelude |
| readFront | Data.Buffer |
| readFullSqrd | Data.Sqrd |
| readHM | Data.DenseHashMap |
| readIM | Data.IntervalMap |
| readIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| readKSM | Data.SplayMap |
| readLSM | Data.SplayMap |
| readLSTree | Data.SegmentTree.Lazy, ToyLib.Contest.LazySegmentTree |
| readMaybeBack | Data.Buffer |
| readMaybeFront | Data.Buffer |
| readMaybeIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| readMayHM | Data.DenseHashMap |
| readMayIM | Data.IntervalMap |
| readMSV | Data.MultiSetVec |
| readPartSqrd | Data.Sqrd |
| readRSM | Data.SplayMap |
| readRSS | Data.SplaySeq.Raw |
| readSS | Data.SplaySeq |
| readSTB | Data.SegmentTree.Beats |
| readSTree | Data.SegmentTree.Strict |
| readTM | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| readVSM | Data.SplayMap |
| relaxMany | ToyLib.DP |
| relaxMany' | ToyLib.DP |
| replicateIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| restCapHM | Data.DenseHashMap |
| restorePath | Data.Graph.Generic, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| reverseNodeRSS | Data.SplaySeq.Raw |
| reverseRSS | Data.SplaySeq.Raw |
| reverseSS | Data.SplaySeq |
| revIndexHLD | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| revRSS | Data.SplaySeq.Raw |
| revSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| RH | |
| 1 (Type/Class) | Data.RollingHash |
| 2 (Data Constructor) | Data.RollingHash |
| rh1 | Data.RollingHash |
| RHRepr | Data.RollingHash |
| RollingHash | |
| 1 (Type/Class) | Data.RollingHash |
| 2 (Data Constructor) | Data.RollingHash |
| rolls | Heuristic.Randoms |
| rollsM | Heuristic.Randoms |
| rootHLD | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| rootMUF | Data.UnionFind.Mutable |
| rootPUF | Data.UnionFind.Potencial |
| rootSM | Data.SplayMap |
| rootSS | Data.SplaySeq |
| rootSUF | Data.UnionFind.Sparse |
| rot45 | Math.Manhattan |
| rotateLSM | Data.SplayMap |
| rotateRSM | Data.SplayMap |
| rotateRSS | Data.SplaySeq.Raw |
| rRSS | Data.SplaySeq.Raw |
| rSN | Data.SplayMap |
| runFileIO | ToyLib.Parser, ToyLib.Contest.Prelude |
| runIO | ToyLib.Parser, ToyLib.Contest.Prelude |
| runMaxFlow | Data.Graph.MaxFlow |
| runMaxFlowBfs | Data.Graph.MaxFlow |
| runMaxFlowDfs | Data.Graph.MaxFlow |
| runMinCostFlow | Data.Graph.MinCostFlow |
| runMinCostFlowShortests | Data.Graph.MinCostFlow |
| runMo | Algorithm.Mo |
| runMoG | Algorithm.Mo |
| runMoPure | Algorithm.Mo |
| runMoPureG | Algorithm.Mo |
| runPersistentDfs | Data.Graph.Generic, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| sact | Data.Core.SemigroupAction, ToyLib.Contest.LazySegmentTree |
| sactAtLSTree | Data.SegmentTree.Lazy, ToyLib.Contest.LazySegmentTree |
| sactAtSTB | Data.SegmentTree.Beats |
| sactBL | Data.BinaryLifting |
| sactLSTree | Data.SegmentTree.Lazy, ToyLib.Contest.LazySegmentTree |
| sactNodeRSS | Data.SplaySeq.Raw |
| sactRSS | Data.SplaySeq.Raw |
| sactSS | Data.SplaySeq |
| sactSTB | Data.SegmentTree.Beats |
| sactTimes | Data.Core.SemigroupAction, ToyLib.Contest.LazySegmentTree |
| SafeList | Data.SafeList |
| SafeListElem | Data.SafeList |
| sameMUF | Data.UnionFind.Mutable |
| samePUF | Data.UnionFind.Potencial |
| sameSUF | Data.UnionFind.Sparse |
| saOf | Data.ByteString.SuffixArray |
| saOfNaive | Data.ByteString.SuffixArray |
| scanTreeSG | Data.Graph.Tree.TreeSG, ToyLib.Contest.Tree |
| second4 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| segAct | Data.Core.SegmentAction, ToyLib.Contest.LazySegmentTree |
| segActWithLength | Data.Core.SegmentAction, ToyLib.Contest.LazySegmentTree |
| SegmentAction | Data.Core.SegmentAction, ToyLib.Contest.LazySegmentTree |
| SegmentTree | |
| 1 (Type/Class) | Data.SegmentTree.Strict |
| 2 (Data Constructor) | Data.SegmentTree.Strict |
| SegmentTreeBeats | |
| 1 (Type/Class) | Data.SegmentTree.Beats |
| 2 (Data Constructor) | Data.SegmentTree.Beats |
| segTreesWMST | Data.WaveletMatrix.SegTree |
| SemigroupAction | Data.Core.SemigroupAction, ToyLib.Contest.LazySegmentTree |
| Semiring | Data.Core.Semiring |
| seqSizeRSS | Data.SplaySeq.Raw |
| seqSizeSS | Data.SplaySeq |
| setDIM | Data.DenseIntMap |
| ShowBSB | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| showBSB | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| ShowGrid | ToyLib.Debug.Grid, ToyLib.Contest.Grid |
| showGrid | ToyLib.Debug.Grid, ToyLib.Contest.Grid |
| showGridBSB | ToyLib.ShowBSB.Grid, ToyLib.Contest.Grid |
| showGridN | ToyLib.Debug.Grid, ToyLib.Contest.Grid |
| showLnBSB | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| showMatBSB | ToyLib.ShowBSB.Grid, ToyLib.Contest.Grid |
| showMSV | Data.MultiSetVec |
| siftDownBy | Data.BinaryHeap |
| siftUpBy | Data.BinaryHeap |
| simpleRunMo | Algorithm.Mo |
| simpleRunMoPure | Algorithm.Mo |
| singletonMS | Data.MultiSet |
| singletonMS2 | Data.MultiSet2 |
| singletonSMM | Data.SegmentTree.Beats.SumMinMax |
| sizeBN | Data.BinaryHeap |
| sizeDIM | Data.DenseIntMap |
| sizeDIS | Data.DenseIntSet |
| sizeDIS_ | Data.DenseIntSet |
| SizedList | Data.SizedList |
| sizeHM | Data.DenseHashMap |
| sizeMUF | Data.UnionFind.Mutable |
| sizePool | Data.Pool |
| sizePUF | Data.UnionFind.Potencial |
| sizeRSS | Data.SplaySeq.Raw |
| sizeSS | Data.SplaySeq |
| slice | ToyLib.Prelude, ToyLib.Contest.Prelude |
| sliceRH | Data.RollingHash |
| slideMaxIndices | Algorithm.SlideMin |
| slideMinIndices | Algorithm.SlideMin |
| slideMinIndicesOn | Algorithm.SlideMin |
| snd4 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| solveTS | Data.Graph.TwoSat |
| sone | Data.Core.Semiring |
| sortByCharacter | Data.ByteString.SuffixArray |
| sortCyclicShifts | Data.ByteString.SuffixArray |
| sortCyclicShifts' | Data.ByteString.SuffixArray |
| sortMo | Algorithm.Mo |
| sourceLength | Data.RollingHash |
| Span | ToyLib.DP |
| spanDP | ToyLib.DP |
| SparseGraph | |
| 1 (Type/Class) | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| 2 (Data Constructor) | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| SparseUnionFind | Data.UnionFind.Sparse |
| splayBySM | Data.SplayMap |
| SplayIndex | |
| 1 (Type/Class) | Data.SplayMap |
| 2 (Type/Class) | Data.SplaySeq.Raw |
| splayKthRSS | Data.SplaySeq.Raw |
| splayLMostSM | Data.SplayMap |
| SplayMap | |
| 1 (Type/Class) | Data.SplayMap |
| 2 (Data Constructor) | Data.SplayMap |
| SplayNode | |
| 1 (Type/Class) | Data.SplayMap |
| 2 (Data Constructor) | Data.SplayMap |
| SplayNodeRepr | Data.SplayMap |
| splayRMostSM | Data.SplayMap |
| splayRSS | Data.SplaySeq.Raw |
| SplaySeq | |
| 1 (Type/Class) | Data.SplaySeq |
| 2 (Data Constructor) | Data.SplaySeq |
| split3RSS | Data.SplaySeq.Raw |
| splitAtRSS | Data.SplaySeq.Raw |
| Sqrd | |
| 1 (Type/Class) | Data.Sqrd |
| 2 (Data Constructor) | Data.Sqrd |
| square | ToyLib.Prelude, ToyLib.Contest.Prelude |
| sRSS | Data.SplaySeq.Raw |
| StackSlidingFold | |
| 1 (Type/Class) | Data.Slide |
| 2 (Data Constructor) | Data.Slide |
| stimes' | Math.Stimes |
| stimesBL | Data.BinaryLifting |
| stimesOr' | Math.Stimes |
| streeBTM | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| streeFTM | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| STUnionFind | Data.UnionFind.Mutable |
| sub2 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| sub3 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| subMod | Math.PowMod |
| subMS | Data.MultiSet |
| subMS2 | Data.MultiSet2 |
| subtreeSegmentsHLD | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| subtreeSizeHLD | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| SumMinMax | |
| 1 (Type/Class) | Data.SegmentTree.Beats.SumMinMax |
| 2 (Data Constructor) | Data.SegmentTree.Beats.SumMinMax |
| SumMinMaxRepr | Data.SegmentTree.Beats.SumMinMax |
| sumSMM | Data.SegmentTree.Beats.SumMinMax |
| swapBack | Data.Buffer |
| swapDupe | ToyLib.Prelude, ToyLib.Contest.Prelude |
| swapDupeU | ToyLib.Prelude, ToyLib.Contest.Prelude |
| swapDupeW | ToyLib.Prelude, ToyLib.Contest.Prelude |
| swapFront | Data.Buffer |
| swapIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| swapLrNodeRSS | Data.SplaySeq.Raw |
| szero | Data.Core.Semiring |
| T | Data.Graph.TwoSat |
| T2 | |
| 1 (Type/Class) | Data.Instances.T2 |
| 2 (Data Constructor) | Data.Instances.T2 |
| TF | Data.Graph.TwoSat |
| thawIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| thd4 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| third4 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| times | ToyLib.Prelude, ToyLib.Contest.Prelude |
| toDegree | ToyLib.Prelude, ToyLib.Contest.Prelude |
| toDigitsU | Math.DigitsVector |
| toMat2x2 | Data.Instances.Affine2d |
| toNDigitsU | Math.DigitsVector |
| topSccSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| topSortSG | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| toRadian | ToyLib.Prelude, ToyLib.Contest.Prelude |
| toV2 | Data.Instances.Affine2d |
| treeDepthInfoSG | Data.Graph.Tree.TreeSG, ToyLib.Contest.Tree |
| treeDiameterPathSG | Data.Graph.Tree.TreeSG, ToyLib.Contest.Tree |
| treeDiameterSG | Data.Graph.Tree.TreeSG, ToyLib.Contest.Tree |
| TreeMonoid | |
| 1 (Type/Class) | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| 2 (Data Constructor) | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| tspDP | ToyLib.DP |
| twoPointers | Algorithm.TwoPointers |
| twoPointersU | Algorithm.TwoPointers |
| twoPtr | Algorithm.TwoPointers |
| twoPtrM | Algorithm.TwoPointers |
| twoSat | Data.Graph.TwoSat |
| TwoSatBuilder | |
| 1 (Type/Class) | Data.Graph.TwoSat |
| 2 (Data Constructor) | Data.Graph.TwoSat |
| twoSplits | ToyLib.DP |
| unBitSet | Math.BitSet |
| undefMCF | Data.Graph.MinCostFlow |
| undefMF | Data.Graph.MaxFlow |
| undefPI | Data.Pool |
| undefSI | |
| 1 (Function) | Data.SplayMap |
| 2 (Function) | Data.SplaySeq.Raw |
| unDigits | Math.Digits |
| unDigitsU | Math.DigitsVector |
| uniformRSt | Heuristic.Randoms |
| unifyMUF | Data.UnionFind.Mutable |
| unifyMUF_ | Data.UnionFind.Mutable |
| unifyPUF | Data.UnionFind.Potencial |
| unifyPUF_ | Data.UnionFind.Potencial |
| unifySUF | Data.UnionFind.Sparse |
| unIM | Data.IntervalMap |
| Unindex | Data.Utils.Unindex |
| unindex | Data.Utils.Unindex |
| unIndexMap | Data.BinaryLifting |
| unIndexMapWithAction | Data.BinaryLifting |
| unitMat | Math.Matrix |
| unlinesBSB | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| unMat2x2 | Data.Instances.Affine2d |
| unModInt | Data.ModInt |
| unPermutation | Data.BinaryLifting |
| unsafeAssocsHM | Data.DenseHashMap |
| unsafeDeleteBH | Data.BinaryHeap |
| unsafeDeleteBH_ | Data.BinaryHeap |
| unsafeExchangeBack | Data.Buffer |
| unsafeExchangeFront | Data.Buffer |
| unsafeExchangeIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| unsafeFreezeBH | Data.BinaryHeap |
| unsafeFreezeBuffer | Data.Buffer |
| unsafeFreezeInternalBuffer | Data.Buffer |
| unsafeFreezeIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| unsafeFreezeLeavesSTree | Data.SegmentTree.Strict |
| unsafeFreezeMSV | Data.MultiSetVec |
| unsafeIKthMaxRWM | Data.WaveletMatrix.Raw |
| unsafeIKthMaxWM | Data.WaveletMatrix |
| unsafeIKthMinRWM | Data.WaveletMatrix.Raw |
| unsafeIKthMinWM | Data.WaveletMatrix |
| unsafeKeysDIM | Data.DenseIntMap |
| unsafeKeysDIS | Data.DenseIntSet |
| unsafeKthMaxRWM | Data.WaveletMatrix.Raw |
| unsafeKthMaxWM | Data.WaveletMatrix |
| unsafeKthMinRWM | Data.WaveletMatrix.Raw |
| unsafeKthMinWM | Data.WaveletMatrix |
| unsafeModifyBack | Data.Buffer |
| unsafeModifyFront | Data.Buffer |
| unsafeModifyIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| unsafeModifyMBack | Data.Buffer |
| unsafeModifyMFront | Data.Buffer |
| unsafeModifyMIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| unsafeReadIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| unsafeSwapBack | Data.Buffer |
| unsafeSwapFront | Data.Buffer |
| unsafeSwapIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| unsafeThawIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| unsafeViewBH | Data.BinaryHeap |
| unsafeWriteBack | Data.Buffer |
| unsafeWriteFront | Data.Buffer |
| unsafeWriteIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| unSegmentTree | Data.SegmentTree.Strict |
| unV2 | Data.Instances.Affine2d |
| unwordsBSB | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| updateNodeRSS | Data.SplaySeq.Raw |
| usedHM | Data.DenseHashMap |
| V2 | |
| 1 (Type/Class) | Data.Instances.Affine2d |
| 2 (Data Constructor) | Data.Instances.Affine2d |
| V2Repr | Data.Instances.Affine2d |
| valDIM | Data.DenseIntMap |
| valHM | Data.DenseHashMap |
| validateKeyDIS | Data.DenseIntSet |
| valSN | Data.SplayMap |
| vecDIS | Data.DenseIntSet |
| vecIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| Vector | Data.Core.Semiring, Data.Instances.A2, Data.Instances.A3, Data.Instances.T2, Data.RollingHash, Data.SplayMap, Data.UnionFind.Mutable, Data.Instances.Affine2d, Data.SegmentTree.Beats.SumMinMax, Data.ModInt |
| vertColorDI | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| vertComponentDI | Data.Graph.Sparse, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| Vertex | Data.Graph.Alias, ToyLib.Contest.Graph, ToyLib.Contest.Tree |
| VertexHLD | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| vertSegmentsHLD | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| viewBH | Data.BinaryHeap |
| vRSS | Data.SplaySeq.Raw |
| V_A2 | Data.Instances.A2 |
| V_A3 | Data.Instances.A3 |
| V_AddChminChmax | Data.SegmentTree.Beats.SumMinMax |
| V_Affine2d | Data.Instances.Affine2d |
| V_Foo | Data.Core.Semiring |
| V_Mat2x2 | Data.Instances.Affine2d |
| V_MaxPlus | Data.Core.Semiring |
| V_MinPlus | Data.Core.Semiring |
| V_ModInt | Data.ModInt |
| V_MUFNode | Data.UnionFind.Mutable |
| V_RH | Data.RollingHash |
| V_SplayNode | Data.SplayMap |
| V_SumMinMax | Data.SegmentTree.Beats.SumMinMax |
| V_T2 | Data.Instances.T2 |
| V_V2 | Data.Instances.Affine2d |
| WaveletMatrix | |
| 1 (Type/Class) | Data.WaveletMatrix |
| 2 (Data Constructor) | Data.WaveletMatrix |
| WaveletMatrixSegTree | |
| 1 (Type/Class) | Data.WaveletMatrix.SegTree |
| 2 (Data Constructor) | Data.WaveletMatrix.SegTree |
| withLine' | ToyLib.Parser, ToyLib.Contest.Prelude |
| word' | ToyLib.Parser, ToyLib.Contest.Prelude |
| wordDIS | Data.DenseIntSet |
| wordWM | Data.WaveletMatrix.BitVector |
| writeBack | Data.Buffer |
| writeFront | Data.Buffer |
| writeHM | Data.DenseHashMap |
| writeIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| writeKSM | Data.SplayMap |
| writeLSM | Data.SplayMap |
| writeNodeRSS | Data.SplaySeq.Raw |
| writeRSM | Data.SplayMap |
| writeRSS | Data.SplaySeq.Raw |
| writeSS | Data.SplaySeq |
| writeSTree | Data.SegmentTree.Strict |
| writeTM | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| writeVSM | Data.SplayMap |
| wsBSB | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| xysWMST | Data.WaveletMatrix.SegTree |
| yn | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| ynBSB | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| ysWMST | Data.WaveletMatrix.SegTree |
| zero2 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| zero3 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| zipWithIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| zOf | Data.ByteString.ZFunction |
| zOfNaive | Data.ByteString.ZFunction |
| _assocsWithRWM | Data.WaveletMatrix.Raw |
| _bufferBackPos | Data.Buffer |
| _bufferFrontPos | Data.Buffer |
| _buildRawTM | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| _checkIndexBuffer | Data.Buffer |
| _childL | Data.SegmentTree.Util |
| _childR | Data.SegmentTree.Util |
| _descAssocsWithRWM | Data.WaveletMatrix.Raw |
| _foldLTWMST | Data.WaveletMatrix.SegTree |
| _goDownRWM | Data.WaveletMatrix.Raw |
| _goUpRWM | Data.WaveletMatrix.Raw |
| _isLChild | Data.SegmentTree.Util |
| _isRChild | Data.SegmentTree.Util |
| _lookupWithSM | Data.SplayMap |
| _propAt | |
| 1 (Function) | Data.SegmentTree.Lazy, ToyLib.Contest.LazySegmentTree |
| 2 (Function) | Data.SegmentTree.Beats |
| _propDownFromRoot | Data.SegmentTree.Lazy, ToyLib.Contest.LazySegmentTree |
| _propDownFromRootSTB | Data.SegmentTree.Beats |
| _pruneTrick | Data.SegmentTree.Util |
| _readLMostSM | Data.SplayMap |
| _readRMostSM | Data.SplayMap |
| _sactAt | Data.SegmentTree.Lazy, ToyLib.Contest.LazySegmentTree |
| _sactAtSTB | Data.SegmentTree.Beats |
| _segmentsHLD | Data.Graph.Tree.Hld, ToyLib.Contest.Tree |
| _sizeBH | Data.BinaryHeap |
| _unsafeUpdateParentNodes | Data.SegmentTree.Strict |
| _unwrapMUFRoot | Data.UnionFind.Mutable |