Restore 100% test coverage.

Author: ioquatix

lib/async/list.rb

@@ -137,34 +137,34 @@ def empty?
 			@size == 0
 		end
 
-		def validate!(node = nil)
-			previous = self
-			current = @tail
-			found = node.equal?(self)
+		# def validate!(node = nil)
+		# 	previous = self
+		# 	current = @tail
+		# 	found = node.equal?(self)
 
-			while true
-				break if current.equal?(self)
+		# 	while true
+		# 		break if current.equal?(self)
 
-				if current.head != previous
-					raise "Invalid previous linked list node!"
-				end
+		# 		if current.head != previous
+		# 			raise "Invalid previous linked list node!"
+		# 		end
 
-				if current.is_a?(List) and !current.equal?(self)
-					raise "Invalid list in list node!"
-				end
+		# 		if current.is_a?(List) and !current.equal?(self)
+		# 			raise "Invalid list in list node!"
+		# 		end
 
-				if node
-					found ||= current.equal?(node)
-				end
+		# 		if node
+		# 			found ||= current.equal?(node)
+		# 		end
 
-				previous = current
-				current = current.tail
-			end
+		# 		previous = current
+		# 		current = current.tail
+		# 	end
 
-			if node and !found
-				raise "Node not found in list!"
-			end
-		end
+		# 	if node and !found
+		# 		raise "Node not found in list!"
+		# 	end
+		# end
 
 		# Iterate over each node in the linked list. It is generally safe to remove the current node, any previous node or any future node during iteration.
 		#
@@ -293,8 +293,6 @@ def each
 			end
 
 			def self.each(list, &block)
-				list.validate!
-				
 				return if list.empty?
 
 				iterator = Iterator.new(list)

test/async/list.rb

@@ -25,6 +25,7 @@ def initialize(value)
 			list.append(Item.new(3))
 
 			expect(list.each.map(&:value)).to be == [1, 2, 3]
+			expect(list.to_a.map(&:value)).to be == [1, 2, 3]
 			expect(list.to_s).to be =~ /size=3/
 		end
 
@@ -115,6 +116,19 @@ def initialize(value)
 
 			expect(enumerated).to be == nodes
 		end
+		
+		it "can get #first and #last while enumerating" do
+			list.append(first = Item.new(1))
+			list.append(last = Item.new(2))
+			
+			list.each do |item|
+				if item.equal?(last)
+					# This ensures the last node in the list is an iterator:
+					list.remove(last)
+					expect(list.last).to be == first
+				end
+			end
+		end
 	end
 
 	with '#first' do

test/async/scheduler.rb

@@ -9,6 +9,10 @@
 require 'net/http'
 
 describe Async::Scheduler do
+	it "is supported" do
+		expect(Async::Scheduler).to be(:supported?)
+	end
+	
 	describe 'Fiber.schedule' do
 		it "can start child task" do
 			fiber = nil