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 |
| accumulateIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| 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 |
| Affine1 | |
| 1 (Type/Class) | Data.Instances.Affine1 |
| 2 (Data Constructor) | Data.Instances.Affine1 |
| Affine1Repr | Data.Instances.Affine1 |
| allocModifyPathT | Data.Trie |
| allocModifyT | Data.Trie |
| allocPathT | Data.Trie |
| appendCSum | Data.Vector.CSum, ToyLib.Contest.Prelude |
| asserted | ToyLib.Debug, ToyLib.Contest.Prelude |
| backBufferDSF | Data.Slide |
| backScanDSF | Data.Slide |
| balanceDSF | Data.Slide |
| bcMod | Math.PowMod |
| bisectF64 | Algorithm.Bisect |
| bisectImpl | Algorithm.Bisect |
| bisectLF64 | Algorithm.Bisect |
| bisectMF64 | Algorithm.Bisect |
| bisectMLF64 | Algorithm.Bisect |
| bisectMRF64 | Algorithm.Bisect |
| bisectRF64 | Algorithm.Bisect |
| bitCeil | Math.BitSet |
| bitsOf | Math.BitSet |
| Boolean | |
| 1 (Type/Class) | Data.Core.Semiring |
| 2 (Data Constructor) | Data.Core.Semiring |
| boundsIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| bufferFoldSSF | Data.Slide |
| bufferSSF | Data.Slide |
| buildSTB | Data.SegmentTree.Beats |
| ceil2 | Math.BitSet |
| char' | ToyLib.Parser, ToyLib.Contest.Prelude |
| childrenT | Data.Trie |
| chmaxACC | Data.SegmentTree.Beats.SumMinMax |
| chminACC | Data.SegmentTree.Beats.SumMinMax |
| chunksOfG | Data.Vector.Extra |
| clearDSF | Data.Slide |
| clearMSV | Data.MultiSetVec |
| clearSSF | Data.Slide |
| cloneIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| combs | ToyLib.Prelude, ToyLib.Contest.Prelude |
| compressInvNumG | Data.Vector.InvNum |
| compressU | Data.Vector.Extra |
| concatBSB | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| constructFor | ToyLib.DP |
| constructIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| constructMIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| constructMN | Data.Vector.Extra |
| constructrMN | Data.Vector.Extra |
| convertBase | Math.Digits |
| countDivisors | Math.Divisors |
| countDivisorsInPlace | Math.Divisors |
| countMSV | Data.MultiSetVec |
| countUniqueSubstringsBS | Data.ByteString.SuffixArray |
| createIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| csum1D | Data.Vector.CSum, ToyLib.Contest.Prelude |
| csum2D | Data.Vector.IxVector, ToyLib.Contest.Grid |
| csum3D | Data.Vector.CSum, ToyLib.Contest.Prelude |
| 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 |
| dbgM | ToyLib.Debug, ToyLib.Contest.Prelude |
| dbgS | ToyLib.Debug, ToyLib.Contest.Prelude |
| dbgSM | ToyLib.Debug, ToyLib.Contest.Prelude |
| dbgVec | ToyLib.Debug, ToyLib.Contest.Prelude |
| debug | ToyLib.Macro |
| decFindMaxMS | Data.MultiSet |
| decFindMaxMS2 | Data.MultiSet2 |
| decFindMinMS | Data.MultiSet |
| decFindMinMS2 | Data.MultiSet2 |
| decMS | Data.MultiSet |
| decMS2 | Data.MultiSet2 |
| decMSV | Data.MultiSetVec |
| DequeSlidingFold | |
| 1 (Type/Class) | Data.Slide |
| 2 (Data Constructor) | Data.Slide |
| diag4 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| digits | Math.Digits |
| digitsRev | Math.Digits |
| digitsU' | ToyLib.Parser, ToyLib.Contest.Prelude |
| divisorsOf | Math.Divisors |
| divModConst | Math.PowMod |
| double' | ToyLib.Parser, ToyLib.Contest.Prelude |
| dualScanrSSF | Data.Slide |
| EdgeId | Data.Graph.Alias, ToyLib.Contest.Prelude |
| emptyMS | Data.MultiSet |
| emptyMS2 | Data.MultiSet2 |
| emptySUF | Data.UnionFind.Sparse |
| endlBSB | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| exchangeIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| exgcd | Math.Exgcd |
| extractImos2d | Data.Vector.IxVector, ToyLib.Contest.Grid |
| factMod | Math.PowMod |
| factModsN | Math.PowMod |
| FailableSemigroupActionTarget | Data.SegmentTree.Util |
| failsSMM | Data.SegmentTree.Beats.SumMinMax |
| filterIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| findIndexIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| findIndicesIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| first4 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| fix1 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| fix2 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| fix3 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| foldAllSTB | Data.SegmentTree.Beats |
| foldDSF | Data.Slide |
| foldMaySTB | Data.SegmentTree.Beats |
| foldP | Data.Core.Semiring |
| foldSSF | Data.Slide |
| foldSTB | Data.SegmentTree.Beats |
| foldT | Data.Core.Semiring |
| fourth4 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| freezeIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| fromListMS | Data.MultiSet |
| fromListMS2 | Data.MultiSet2 |
| fromListSUF | Data.UnionFind.Sparse |
| 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 |
| generateIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| generateSTB | Data.SegmentTree.Beats |
| generateSTBImpl | Data.SegmentTree.Beats |
| genericComponentsOf | Data.Graph.Generic |
| 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 |
| getMinPlus | Data.Core.Semiring |
| getMS | Data.MultiSet |
| getMS2 | Data.MultiSet2 |
| Group | Data.Core.Group |
| headMay | Data.SafeList |
| headOr | Data.SafeList |
| identAffine1 | Data.Instances.Affine1 |
| ifilterIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| imapIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| imos2d | Data.Vector.IxVector, ToyLib.Contest.Grid |
| incMS | Data.MultiSet |
| incMS2 | Data.MultiSet2 |
| incMSV | Data.MultiSetVec |
| index' | Data.Vector.IxVector, ToyLib.Contest.Grid |
| indexedIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| innerMS | Data.MultiSet |
| innerMS2 | Data.MultiSet2 |
| insertSUF | Data.UnionFind.Sparse |
| int' | ToyLib.Parser, ToyLib.Contest.Prelude |
| int1' | ToyLib.Parser, ToyLib.Contest.Prelude |
| interleave | ToyLib.Prelude, ToyLib.Contest.Prelude |
| intersperseBSB | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| intersperseWithBSB | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| 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 |
| invert | Data.Core.Group |
| invMat2x2 | Data.Instances.Affine1 |
| invModConst | Math.PowMod |
| invModGcd | Math.Exgcd |
| invNum | Data.Vector.InvNum |
| irelaxMany | ToyLib.DP |
| isFailureFSAT | Data.SegmentTree.Util |
| isqrt | ToyLib.Prelude, ToyLib.Contest.Prelude |
| 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 |
| lastCharOccurrences | ToyLib.DP |
| lastMay | Data.SafeList |
| lastOr | Data.SafeList |
| lcsOf | ToyLib.DP |
| lengthIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| lexOrderMod | Data.Vector.InvNum |
| lexPerms | ToyLib.DP |
| line' | ToyLib.Parser, ToyLib.Contest.Prelude |
| lineU' | ToyLib.Parser, ToyLib.Contest.Prelude |
| lisOf | ToyLib.DP |
| lisOf' | ToyLib.DP |
| log2 | Math.BitSet |
| lookBackHigherIndices | Algorithm.SlideMin |
| lookBackIndicesOn | Algorithm.SlideMin |
| lookBackLowerIndices | Algorithm.SlideMin |
| lookupMS | Data.MultiSet |
| lookupMS2 | Data.MultiSet2 |
| lookupT | Data.Trie |
| lsbOf | Math.BitSet |
| mapIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| mapM22 | Data.Instances.Affine1 |
| mapV2 | Data.Instances.Affine1 |
| Mat2x2 | |
| 1 (Type/Class) | Data.Instances.Affine1 |
| 2 (Data Constructor) | Data.Instances.Affine1 |
| Mat2x2Repr | Data.Instances.Affine1 |
| max2SMM | Data.SegmentTree.Beats.SumMinMax |
| maximumMay | Data.SafeList |
| maximumOr | Data.SafeList |
| maxMSV | Data.MultiSetVec |
| MaxPlus | |
| 1 (Type/Class) | Data.Core.Semiring |
| 2 (Data Constructor) | Data.Core.Semiring |
| maxSMM | Data.SegmentTree.Beats.SumMinMax |
| mDigits | Math.Digits |
| mDigitsRev | Math.Digits |
| memberMS | Data.MultiSet |
| memberMS2 | Data.MultiSet2 |
| memberSUF | Data.UnionFind.Sparse |
| memberT | Data.Trie |
| min2SMM | Data.SegmentTree.Beats.SumMinMax |
| 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 |
| modifyIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| modifyM | ToyLib.Compat |
| modifyMIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| modifyNodeT | Data.Trie |
| modifyPathT | Data.Trie |
| modifyT | Data.Trie |
| msbOf | Math.BitSet |
| mul2 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| mul3 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| mulM22M22 | Data.Instances.Affine1 |
| mulM22V2 | Data.Instances.Affine1 |
| mulMod | Math.PowMod |
| MultiSet | Data.MultiSet |
| MultiSet2 | Data.MultiSet2 |
| MultiSetVec | |
| 1 (Type/Class) | Data.MultiSetVec |
| 2 (Data Constructor) | Data.MultiSetVec |
| MVector | Data.Core.Semiring, Data.Instances.A2, Data.Instances.A3, Data.Instances.Affine1, Data.SegmentTree.Beats.SumMinMax |
| MV_A2 | Data.Instances.A2 |
| MV_A3 | Data.Instances.A3 |
| MV_AddChminChmax | Data.SegmentTree.Beats.SumMinMax |
| MV_Affine1 | Data.Instances.Affine1 |
| MV_Foo | Data.Core.Semiring |
| MV_Mat2x2 | Data.Instances.Affine1 |
| MV_MaxPlus | Data.Core.Semiring |
| MV_MinPlus | Data.Core.Semiring |
| MV_SumMinMax | Data.SegmentTree.Beats.SumMinMax |
| MV_V2 | Data.Instances.Affine1 |
| newAddACC | Data.SegmentTree.Beats.SumMinMax |
| newChmaxACC | Data.SegmentTree.Beats.SumMinMax |
| newChminACC | Data.SegmentTree.Beats.SumMinMax |
| newCSumU | Data.Vector.CSum, ToyLib.Contest.Prelude |
| newDSF | Data.Slide |
| newIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| newMSV | Data.MultiSetVec |
| newSSF | Data.Slide |
| newSTB | Data.SegmentTree.Beats |
| newSTBImpl | Data.SegmentTree.Beats |
| newSUF | Data.UnionFind.Sparse |
| nMaxSMM | Data.SegmentTree.Beats.SumMinMax |
| nMinSMM | Data.SegmentTree.Beats.SumMinMax |
| note | ToyLib.Debug, ToyLib.Contest.Prelude |
| notMemberMS | Data.MultiSet |
| notMemberMS2 | Data.MultiSet2 |
| nullMSV | Data.MultiSetVec |
| ordPowerset | ToyLib.DP |
| ortho4 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| ortho4' | ToyLib.Prelude, ToyLib.Contest.Prelude |
| orthoWith | ToyLib.Prelude, ToyLib.Contest.Prelude |
| partitionsOf | Math.BitSet |
| partitionsOfK | Math.BitSet |
| pathT | Data.Trie |
| payloadT | Data.Trie |
| popBackDSF | Data.Slide |
| popFrontDSF | Data.Slide |
| popFrontSSF | Data.Slide |
| powerset | Math.BitSet |
| powersetM_ | Math.BitSet |
| powersetU | Math.BitSet |
| powModConst | Math.PowMod |
| 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 |
| pushBackDSF | Data.Slide |
| pushBackSSF | Data.Slide |
| pushBasedConstructIV | ToyLib.DP |
| pushBasedConstructN | ToyLib.DP |
| pushFrontDSF | Data.Slide |
| putBSB | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| putList | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| putLnBSB | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| putVec | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| 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 |
| readCSum | Data.Vector.CSum, ToyLib.Contest.Prelude |
| readIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| readMaybeIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| readMSV | Data.MultiSetVec |
| readSTB | Data.SegmentTree.Beats |
| relaxMany | ToyLib.DP |
| relaxMany' | ToyLib.DP |
| replicateIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| rleOf | ToyLib.Prelude, ToyLib.Contest.Prelude |
| rleOfU | ToyLib.Prelude, ToyLib.Contest.Prelude |
| rolls | Heuristic.Randoms |
| rollsM | Heuristic.Randoms |
| rootSUF | Data.UnionFind.Sparse |
| rootT | Data.Trie |
| rot45 | Math.Manhattan |
| runFileIO | ToyLib.Parser, ToyLib.Contest.Prelude |
| runIO | ToyLib.Parser, ToyLib.Contest.Prelude |
| runPersistentDfs | Data.Graph.Generic |
| sact | Data.Core.SemigroupAction, ToyLib.Contest.Prelude |
| sactAtSTB | Data.SegmentTree.Beats |
| sactSTB | Data.SegmentTree.Beats |
| sactTimes | Data.Core.SemigroupAction, ToyLib.Contest.Prelude |
| SafeList | Data.SafeList |
| SafeListElem | Data.SafeList |
| sameSUF | Data.UnionFind.Sparse |
| second4 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| SegmentTreeBeats | |
| 1 (Type/Class) | Data.SegmentTree.Beats |
| 2 (Data Constructor) | Data.SegmentTree.Beats |
| SemigroupAction | Data.Core.SemigroupAction, ToyLib.Contest.Prelude |
| Semiring | Data.Core.Semiring |
| 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 |
| singletonMS | Data.MultiSet |
| singletonMS2 | Data.MultiSet2 |
| singletonSMM | Data.SegmentTree.Beats.SumMinMax |
| slice | ToyLib.Prelude, ToyLib.Contest.Prelude |
| slideCmpIndicesOn | Algorithm.SlideMin |
| slideMaxIndices | Algorithm.SlideMin |
| slideMinIndices | Algorithm.SlideMin |
| snd4 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| sone | Data.Core.Semiring |
| Span | ToyLib.DP |
| spanDP | ToyLib.DP |
| SparseUnionFind | Data.UnionFind.Sparse |
| square | ToyLib.Prelude, ToyLib.Contest.Prelude |
| StackSlidingFold | |
| 1 (Type/Class) | Data.Slide |
| 2 (Data Constructor) | Data.Slide |
| sub2 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| sub3 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| subMod | Math.PowMod |
| subMS | Data.MultiSet |
| subMS2 | Data.MultiSet2 |
| 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 |
| swapDupe | ToyLib.Prelude, ToyLib.Contest.Prelude |
| swapDupeU | ToyLib.Prelude, ToyLib.Contest.Prelude |
| swapDupeW | ToyLib.Prelude, ToyLib.Contest.Prelude |
| swapIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| szero | Data.Core.Semiring |
| 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.Affine1 |
| toNDigitsU | Math.DigitsVector |
| toRadian | ToyLib.Prelude, ToyLib.Contest.Prelude |
| toV2 | Data.Instances.Affine1 |
| Trie | |
| 1 (Type/Class) | Data.Trie |
| 2 (Data Constructor) | Data.Trie |
| tspDP | ToyLib.DP |
| twoPointers | Algorithm.TwoPointers |
| twoPointersU | Algorithm.TwoPointers |
| twoPtr | Algorithm.TwoPointers |
| twoPtrM | Algorithm.TwoPointers |
| twoSplits | ToyLib.DP |
| unBitSet | Math.BitSet |
| unDigits | Math.Digits |
| unDigitsU | Math.DigitsVector |
| uniformRSt | Heuristic.Randoms |
| unifySUF | Data.UnionFind.Sparse |
| Unindex | Data.Core.Unindex |
| unindex | Data.Core.Unindex |
| unlinesBSB | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| unMat2x2 | Data.Instances.Affine1 |
| unsafeExchangeIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| unsafeFreezeIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| unsafeFreezeMSV | Data.MultiSetVec |
| unsafeModifyIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| unsafeModifyMIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| unsafeReadIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| unsafeSwapIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| unsafeThawIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| unsafeWriteIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| unV2 | Data.Instances.Affine1 |
| unwordsBSB | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| V2 | |
| 1 (Type/Class) | Data.Instances.Affine1 |
| 2 (Data Constructor) | Data.Instances.Affine1 |
| V2Repr | Data.Instances.Affine1 |
| vecIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| Vector | Data.Core.Semiring, Data.Instances.A2, Data.Instances.A3, Data.Instances.Affine1, Data.SegmentTree.Beats.SumMinMax |
| Vertex | Data.Graph.Alias, ToyLib.Contest.Prelude |
| V_A2 | Data.Instances.A2 |
| V_A3 | Data.Instances.A3 |
| V_AddChminChmax | Data.SegmentTree.Beats.SumMinMax |
| V_Affine1 | Data.Instances.Affine1 |
| V_Foo | Data.Core.Semiring |
| V_Mat2x2 | Data.Instances.Affine1 |
| V_MaxPlus | Data.Core.Semiring |
| V_MinPlus | Data.Core.Semiring |
| V_SumMinMax | Data.SegmentTree.Beats.SumMinMax |
| V_V2 | Data.Instances.Affine1 |
| windowsOfG | Data.Vector.Extra |
| withLine' | ToyLib.Parser, ToyLib.Contest.Prelude |
| word' | ToyLib.Parser, ToyLib.Contest.Prelude |
| writeIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| wsBSB | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| yn | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| ynBSB | ToyLib.ShowBSB, ToyLib.Contest.Prelude |
| zero2 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| zero3 | ToyLib.Prelude, ToyLib.Contest.Prelude |
| zipWithIV | Data.Vector.IxVector, ToyLib.Contest.Grid |
| _childL | Data.SegmentTree.Util |
| _childR | Data.SegmentTree.Util |
| _isLChild | Data.SegmentTree.Util |
| _isRChild | Data.SegmentTree.Util |
| _propAt | Data.SegmentTree.Beats |
| _propDownFromRootSTB | Data.SegmentTree.Beats |
| _pruneTrick | Data.SegmentTree.Util |
| _sactAtSTB | Data.SegmentTree.Beats |