Îõ³h* µ ì(      !"#$%&'1.0.0 Safe-Inferred"%'(-/139ÀÊÒØÚÛÝäéìõ÷ù!queuesA queue data structure with \mathcal{O}(1) (worst-case) operations.queues)The front of a queue, and the rest of it.queuesAn empty queue.queuesAn empty queue.queuesA singleton queue.queues\mathcal{O}(1)Ü. Construct a queue from a list. The head of the list corresponds to the front of the queue.queues\mathcal{O}(1)Á. Enqueue an element at the back of a queue, to be dequeued last.queues\mathcal{O}(1) front, \mathcal{O}(1)4 rest. Dequeue an element from the front of a queue.queues\mathcal{O}(1)Â. Enqueue an element at the front of a queue, to be dequeued next. queues\mathcal{O}(1). Is a queue empty? queues\mathcal{O}(n)/. Apply a function to every element in a queue. queues\mathcal{O}(n)/. Apply a function to every element in a queue. queues\mathcal{O}(n)Ü. Construct a list from a queue. The head of the list corresponds to the front of the queue.queues\mathcal{O}(n), where n$ is the size of the second argument.    Safe-Inferred"%'(-/139ÀÊÒØÚÛÝäéìõ÷ù ÌqueuesA queue data structure with \mathcal{O}(1)^*3 (amortized under ephemeral usage only) operations.queues)The front of a queue, and the rest of it.queuesAn empty queue.queuesAn empty queue.queuesA singleton queue.queues\mathcal{O}(1)Ü. Construct a queue from a list. The head of the list corresponds to the front of the queue.queues\mathcal{O}(1)Á. Enqueue an element at the back of a queue, to be dequeued last.queues\mathcal{O}(1)^* front, \mathcal{O}(1)^*4 rest. Dequeue an element from the front of a queue.queues\mathcal{O}(1)Â. Enqueue an element at the front of a queue, to be dequeued next.queues\mathcal{O}(1). Is a queue empty?queues\mathcal{O}(n)/. Apply a function to every element in a queue.queues\mathcal{O}(n)/. Apply a function to every element in a queue. queues\mathcal{O}(n)Ü. Construct a list from a queue. The head of the list corresponds to the front of the queue.#queues\mathcal{O}(n), where n$ is the size of the second argument.   (          #queues-1.0.0-AXACJZ8bGlfAzGHhpmzKrnQueueQueue.EphemeralqueuesFullEmptyempty singletonfromListenqueuedequeue enqueueFrontisEmptymaptraversetoList$fTraversableQueue $fShowQueue$fSemigroupQueue $fMonoidQueue$fFoldableQueue $fEqQueue$fFunctorQueueEphemeralQueue$fTraversableEphemeralQueue$fShowEphemeralQueue$fSemigroupEphemeralQueue$fMonoidEphemeralQueue$fFoldableEphemeralQueue$fEqEphemeralQueue$fFunctorEphemeralQueue