|
| 1 | +# frozen_string_literal: true |
| 2 | + |
| 3 | +# Released under the MIT License. |
| 4 | +# Copyright, 2018-2024, by Samuel Williams. |
| 5 | +# Copyright, 2019, by Ryan Musgrave. |
| 6 | +# Copyright, 2020-2022, by Bruno Sutic. |
| 7 | + |
| 8 | +require "async" |
| 9 | +require "async/queue" |
| 10 | +require "sus/fixtures/async" |
| 11 | +require "async/semaphore" |
| 12 | + |
| 13 | +require "async/chainable_async" |
| 14 | + |
| 15 | +module Async |
| 16 | + AQueue = Sus::Shared("a queue") do |
| 17 | + let(:queue) {subject.new} |
| 18 | + |
| 19 | + with "#push" do |
| 20 | + it "adds an item to the queue" do |
| 21 | + queue.push(:item) |
| 22 | + expect(queue.size).to be == 1 |
| 23 | + expect(queue.dequeue).to be == :item |
| 24 | + end |
| 25 | + end |
| 26 | + |
| 27 | + with "#pop" do |
| 28 | + it "removes an item from the queue" do |
| 29 | + queue.push(:item) |
| 30 | + expect(queue.pop).to be == :item |
| 31 | + expect(queue.size).to be == 0 |
| 32 | + end |
| 33 | + end |
| 34 | + |
| 35 | + with "#each" do |
| 36 | + it "can enumerate queue items" do |
| 37 | + reactor.async do |task| |
| 38 | + 10.times do |item| |
| 39 | + task.sleep(0.0001) |
| 40 | + queue.enqueue(item) |
| 41 | + end |
| 42 | + |
| 43 | + queue.enqueue(nil) |
| 44 | + end |
| 45 | + |
| 46 | + items = [] |
| 47 | + queue.each do |item| |
| 48 | + items << item |
| 49 | + end |
| 50 | + |
| 51 | + expect(items).to be == 10.times.to_a |
| 52 | + end |
| 53 | + end |
| 54 | + |
| 55 | + it "should process items in order" do |
| 56 | + reactor.async do |task| |
| 57 | + 10.times do |i| |
| 58 | + task.sleep(0.001) |
| 59 | + queue.enqueue(i) |
| 60 | + end |
| 61 | + end |
| 62 | + |
| 63 | + 10.times do |j| |
| 64 | + expect(queue.dequeue).to be == j |
| 65 | + end |
| 66 | + end |
| 67 | + |
| 68 | + it "can enqueue multiple items" do |
| 69 | + items = Array.new(10) { rand(10) } |
| 70 | + |
| 71 | + reactor.async do |task| |
| 72 | + queue.enqueue(*items) |
| 73 | + end |
| 74 | + |
| 75 | + items.each do |item| |
| 76 | + expect(queue.dequeue).to be == item |
| 77 | + end |
| 78 | + end |
| 79 | + |
| 80 | + it "can dequeue items asynchronously" do |
| 81 | + reactor.async do |task| |
| 82 | + queue << 1 |
| 83 | + queue << nil |
| 84 | + end |
| 85 | + |
| 86 | + queue.async do |task, item| |
| 87 | + expect(item).to be == 1 |
| 88 | + end |
| 89 | + end |
| 90 | + |
| 91 | + with "#<<" do |
| 92 | + it "adds an item to the queue" do |
| 93 | + queue << :item |
| 94 | + expect(queue.size).to be == 1 |
| 95 | + expect(queue.dequeue).to be == :item |
| 96 | + end |
| 97 | + end |
| 98 | + |
| 99 | + with "#size" do |
| 100 | + it "returns queue size" do |
| 101 | + expect(queue.size).to be == 0 |
| 102 | + queue.enqueue("Hello World") |
| 103 | + expect(queue.size).to be == 1 |
| 104 | + end |
| 105 | + end |
| 106 | + |
| 107 | + with "#signal" do |
| 108 | + it "can signal with an item" do |
| 109 | + queue.signal(:item) |
| 110 | + expect(queue.dequeue).to be == :item |
| 111 | + end |
| 112 | + end |
| 113 | + |
| 114 | + with "#wait" do |
| 115 | + it "can wait for an item" do |
| 116 | + reactor.async do |task| |
| 117 | + queue.enqueue(:item) |
| 118 | + end |
| 119 | + |
| 120 | + expect(queue.wait).to be == :item |
| 121 | + end |
| 122 | + end |
| 123 | + |
| 124 | + with "an empty queue" do |
| 125 | + it "is expected to be empty" do |
| 126 | + expect(queue).to be(:empty?) |
| 127 | + end |
| 128 | + end |
| 129 | + |
| 130 | + with "task finishing queue" do |
| 131 | + it "can signal task completion" do |
| 132 | + 3.times do |
| 133 | + Async(finished: queue) do |
| 134 | + :result |
| 135 | + end |
| 136 | + end |
| 137 | + |
| 138 | + 3.times do |
| 139 | + task = queue.dequeue |
| 140 | + expect(task.wait).to be == :result |
| 141 | + end |
| 142 | + end |
| 143 | + end |
| 144 | + |
| 145 | + with "semaphore" do |
| 146 | + let(:capacity) {2} |
| 147 | + let(:semaphore) {Async::Semaphore.new(capacity)} |
| 148 | + let(:repeats) {capacity * 2} |
| 149 | + |
| 150 | + it "should process several items limited by a semaphore" do |
| 151 | + count = 0 |
| 152 | + |
| 153 | + Async do |
| 154 | + repeats.times do |
| 155 | + queue.enqueue :item |
| 156 | + end |
| 157 | + |
| 158 | + queue.enqueue nil |
| 159 | + end |
| 160 | + |
| 161 | + queue.async(parent: semaphore) do |task| |
| 162 | + count += 1 |
| 163 | + end |
| 164 | + |
| 165 | + expect(count).to be == repeats |
| 166 | + end |
| 167 | + end |
| 168 | + |
| 169 | + it_behaves_like Async::ChainableAsync do |
| 170 | + def before |
| 171 | + chainable.enqueue(:item) |
| 172 | + |
| 173 | + # The limited queue may block. |
| 174 | + Async do |
| 175 | + chainable.enqueue(nil) |
| 176 | + end |
| 177 | + |
| 178 | + super |
| 179 | + end |
| 180 | + end |
| 181 | + end |
| 182 | +end |
0 commit comments