úÎ! ç Ç     (c) Kadena LLC, 2019BSD3 Colin Woodbury <colin@kadena.io>Safe79 s  bounded-queue<A single-ended, bounded queue which keeps track of its size. bounded-queue$Given a limit value, yield an empty . bounded-queue<Given a limit value and an initial value, yield a singleton . bounded-queue\mathcal{O}(c). Naively keeps the first c= values of the input list (as defined by the given limiting = value) and does not attempt any elegant queue-like cycling. bounded-queue\mathcal{O}(1). bounded-queue\mathcal{O}(1). bounded-queue\mathcal{O}(n). bounded-queue\mathcal{O}(n). bounded-queue\mathcal{O}(\log(\min(i,n-i))).  bounded-queue\mathcal{O}(\log(\min(i,n-i))).  bounded-queue\mathcal{O}(1)  implementation.        *bounded-queue-1.0.0-6fHlBSsUo6Y5MKgg2DOph0Data.Queue.BoundedBQueueempty singletonfromListconsunconsaveragereversetakedrop$fSemigroupBQueue$fTraversableBQueue$fFoldableBQueue$fFunctorBQueue $fShowBQueue $fEqBQueue$fGenericBQueue$fNFDataBQueueghc-prim GHC.TypesIntbase Data.Foldablelength