úÎËASafeOTSkipList6s are lists that support amortized efficient indexing.‹A SkipIndex stores "pointers" into the tail of a list for efficient deep indexing. If you have SkipIndex ls i and the quantization is q then the elements of q are "pointers" into every q%th tail of the list. For example, if q: = 2 and `ls = [1,2,3,4,5,6,7]`, then the frist level of iL contains: [1,2,3,4,5,6,7], [3,4,5,6,7], [5,6,7], [7] the next level of iw conceptually contains: [1,2,3,4,5,6,7], [5,6,7] Note however, that these are not lists, but rather references to  SkipIndexs from iConvert a list to a SkipList.!Build the infinite tree of skips. Lookup in a SkipList.Get an element from a  SkipIndex.  The step size in the index.The list to convert.The step increment in the indexThe current step size$Continuation to call with the resultThe index to look inThe position to look for    (skip-list-0.1.0.1-6HMrTsejxO2Adp9MLUDekq Data.SkipListSkipList toSkipListlookup$fFoldableSkipList$fFunctorSkipList SkipIndex toSkipIndexget