cycle -glut

cycle :: [a] -> [a]
base Prelude, base Data.List
cycle ties a finite list into a circular one, or equivalently, the infinite repetition of the original list. It is the identity on infinite lists.
cycle :: ByteString -> ByteString
bytestring Data.ByteString.Lazy, bytestring Data.ByteString.Lazy.Char8
cycle ties a finite ByteString into a circular one, or equivalently, the infinite repetition of the original ByteString.
package data-cycle
package
This package implements a cyclic doubly linked list and defines various instances for it. Version 0.1.2
ucycle :: Graph gr => Int -> gr () ()
fgl Data.Graph.Inductive.Example
ucycleM :: GraphM m gr => Int -> m (gr () ())
fgl Data.Graph.Inductive.Example