async 1.28.4 → 1.28.9

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 1cfb65b7409df962b9b4b9d2c48fda3882c6f79c29b66dce5a915d42f2db4352
-  data.tar.gz: afec5fb15947cc6e1cccc152342dde75a8b27e0c9fb1d46cb91b5479f4cda8b6
+  metadata.gz: 6ca8ba4c610a65bfe25595780c26681ad5920a5423b8f065d12917df8db4144d
+  data.tar.gz: d5488881518a83750bf540a150e66dd63d993a88c30d5e6f839714456cd2709e
 SHA512:
-  metadata.gz: 0ec16c8b0249146ccf7cb25b51d2c396611e7b0ea74f13c960c34e865bd6f6963371be8bf1610c47633ebdd586578f6ac47c5b4ae6cdf9da5027218c738569bf
-  data.tar.gz: ac43cc50125a2036826d217a07f736a4dec92c82fc89ecb272814a736e3992af8a1b368ba17eb65afbdd15974842e2028c748b5b59b41dd0c0c4cf402d8184f9
+  metadata.gz: 33200c36d76c0af962c8573da82962e1c32d83c74c3c98486b401ba366d2417d85afb6f7e70432bb4e667c9047a0d074afc308436b8f6c50af452f2269a4d6aa
+  data.tar.gz: be364fa61facbaeb3879945cd137499da161646cee5ceb4da31db12173f9b6fea4bbf8754b5aa076959e8b2a59778ba929724781aa32da18b01ce44c334e1ad4

data/lib/async/node.rb

@@ -24,6 +24,7 @@ module Async
 	# A double linked list.
 	class List
 		def initialize
+			# The list behaves like a list node, so @tail points to the next item (the first one) and head points to the previous item (the last one). This may be slightly confusing but it makes the interface more natural.
 			@head = nil
 			@tail = nil
 			@size = 0
@@ -36,21 +37,21 @@ module Async
 		
 		# Inserts an item at the end of the list.
 		def insert(item)
-			unless @head
-				@head = item
+			unless @tail
 				@tail = item
+				@head = item
 				
 				# Consistency:
 				item.head = nil
 				item.tail = nil
 			else
-				@tail.tail = item
-				item.head = @tail
+				@head.tail = item
+				item.head = @head
 				
 				# Consistency:
 				item.tail = nil
 				
-				@tail = item
+				@head = item
 			end
 			
 			@size += 1
@@ -59,14 +60,14 @@ module Async
 		end
 		
 		def delete(item)
-			if @head.equal?(item)
-				@head = @head.tail
+			if @tail.equal?(item)
+				@tail = @tail.tail
 			else
 				item.head.tail = item.tail
 			end
 			
-			if @tail.equal?(item)
-				@tail = @tail.head
+			if @head.equal?(item)
+				@head = @head.head
 			else
 				item.tail.head = item.head
 			end
@@ -79,15 +80,17 @@ module Async
 			return self
 		end
 		
-		def each
+		def each(&block)
 			return to_enum unless block_given?
 			
-			item = @head
-			while item
-				# We store the tail pointer so we can remove the current item from the linked list:
-				tail = item.tail
-				yield item
-				item = tail
+			current = self
+			while node = current.tail
+				yield node
+				
+				# If the node has deleted itself or any subsequent node, it will no longer be the next node, so don't use it for continued traversal:
+				if current.tail.equal?(node)
+					current = node
+				end
 			end
 		end
 		
@@ -100,19 +103,19 @@ module Async
 		end
 		
 		def first
-			@head
+			@tail
 		end
 		
 		def last
-			@tail
+			@head
 		end
 		
 		def empty?
-			@head.nil?
+			@tail.nil?
 		end
 		
 		def nil?
-			@head.nil?
+			@tail.nil?
 		end
 	end
 	
@@ -276,6 +279,8 @@ module Async
 						if child.finished?
 							delete_child(child)
 						else
+							# In theory we don't need to do this... because we are throwing away the list. However, if you don't correctly update the list when moving the child to the parent, it foobars the enumeration, and subsequent nodes will be skipped, or in the worst case you might start enumerating the parents nodes.
+							delete_child(child)
 							parent.add_child(child)
 						end
 					end

data/lib/async/reactor.rb

@@ -102,7 +102,7 @@ module Async
 			fiber = Fiber.current
 			
 			if timeout
-				timer = self.after(timeout) do
+				timer = @timers.after(timeout) do
 					if fiber.alive?
 						fiber.resume(false)
 					end
@@ -111,7 +111,7 @@ module Async
 			
 			begin
 				@blocked += 1
-				Fiber.yield
+				Task.yield
 			ensure
 				@blocked -= 1
 			end
@@ -198,7 +198,7 @@ module Async
 		def yield(fiber = Fiber.current)
 			@ready << fiber
 			
-			Fiber.yield
+			Task.yield
 		end
 		
 		def finished?
@@ -223,7 +223,7 @@ module Async
 				@running.clear
 			end
 			
-			unless @blocked.zero?
+			if @unblocked.any?
 				unblocked = Array.new
 				
 				@guard.synchronize do
@@ -347,7 +347,7 @@ module Async
 			timer = @timers.after(timeout) do
 				if fiber.alive?
 					error = exception.new("execution expired")
-					fiber.resume error
+					fiber.resume(error)
 				end
 			end
 			

data/lib/async/scheduler.rb

@@ -34,24 +34,20 @@ module Async
 		
 		def initialize(reactor)
 			@reactor = reactor
-			@wrappers = nil
 		end
 		
+		attr :wrappers
+		
 		def set!
-			@wrappers = {}
 			Fiber.set_scheduler(self)
 		end
 		
 		def clear!
-			# Because these instances are created with `autoclose: false`, this does not close the underlying file descriptor:
-			# @ios&.each_value(&:close)
-			
-			@wrappers = nil
 			Fiber.set_scheduler(nil)
 		end
 		
 		private def from_io(io)
-			@wrappers[io] ||= Wrapper.new(io, @reactor)
+			Wrapper.new(io, @reactor)
 		end
 		
 		def io_wait(io, events, timeout = nil)
@@ -72,6 +68,8 @@ module Async
 			end
 			
 			return false
+		rescue TimeoutError
+			return nil
 		ensure
 			wrapper.reactor = nil
 		end
@@ -87,7 +85,7 @@ module Async
 		end
 		
 		def kernel_sleep(duration)
-			@reactor.sleep(duration)
+			self.block(nil, duration)
 		end
 		
 		def block(blocker, timeout)

data/lib/async/task.rb

@@ -72,14 +72,14 @@ module Async
 		# Create a new task.
 		# @param reactor [Async::Reactor] the reactor this task will run within.
 		# @param parent [Async::Task] the parent task.
-		def initialize(reactor, parent = Task.current?, logger: nil, **options, &block)
+		def initialize(reactor, parent = Task.current?, logger: nil, finished: nil, **options, &block)
 			super(parent || reactor, **options)
 			
 			@reactor = reactor
 			
 			@status = :initialized
 			@result = nil
-			@finished = nil
+			@finished = finished
 			
 			@logger = logger
 			

data/lib/async/version.rb

@@ -21,5 +21,5 @@
 # THE SOFTWARE.
 
 module Async
-	VERSION = "1.28.4"
+	VERSION = "1.28.9"
 end

data/lib/kernel/sync.rb

@@ -28,7 +28,10 @@ module Kernel
 		if task = ::Async::Task.current?
 			yield task
 		else
-			::Async::Reactor.run(&block).wait
+			::Async::Reactor.run(
+				finished: ::Async::Condition.new,
+				&block
+			).wait
 		end
 	end
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: async
 version: !ruby/object:Gem::Version
-  version: 1.28.4
+  version: 1.28.9
 platform: ruby
 authors:
 - Samuel Williams
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2021-01-27 00:00:00.000000000 Z
+date: 2021-02-16 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: console
@@ -179,7 +179,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.1.2
+rubygems_version: 3.2.3
 signing_key:
 specification_version: 4
 summary: A concurrency framework for Ruby.