How do I implement a queue in Swift?

In Swift, a queue can be implemented using various techniques, such as using arrays or linked lists. The queue data structure follows the First In First Out (FIFO) principle, meaning that the first element added to the queue will be the first one to be removed. Below is a simple example of how to create a queue using a generic class in Swift.

class Queue { private var elements: [T] = [] var isEmpty: Bool { return elements.isEmpty } var count: Int { return elements.count } func enqueue(_ element: T) { elements.append(element) } func dequeue() -> T? { guard !isEmpty else { return nil } return elements.removeFirst() } func peek() -> T? { return elements.first } } // Usage let queue = Queue() queue.enqueue(1) queue.enqueue(2) queue.enqueue(3) print(queue.dequeue()!) // Outputs: 1 print(queue.peek()!) // Outputs: 2

Swift Queue Data Structure FIFO Generic Class

Related Questions

How do I avoid rehashing overhead with std::set in multithreaded code?

How do I find elements with custom comparators with std::set for embedded targets?

How do I erase elements while iterating with std::set for embedded targets?

How do I provide stable iteration order with std::unordered_map for large datasets?

How do I reserve capacity ahead of time with std::unordered_map for large datasets?

How do I erase elements while iterating with std::unordered_map in multithreaded code?

How do I provide stable iteration order with std::map for embedded targets?

How do I provide stable iteration order with std::map in multithreaded code?

How do I avoid rehashing overhead with std::map in performance-sensitive code?

How do I merge two containers efficiently with std::map for embedded targets?