Sha256: 8f9be152e34492464de5ad555ff26da8cfd69302b4788625f5a2ee811d7cdaea
Contents?: true
Size: 1.43 KB
Versions: 4
Compression:
Stored size: 1.43 KB
Contents
module Concurrent
module Edge
class LockFreeLinkedSet
class Window
attr_accessor :pred, :curr
def initialize(pred, curr)
@pred, @curr = pred, curr
end
# This method is used to find a 'window' for which `add` and `remove`
# methods can use to know where to add and remove from the list. However,
# it has another responsibilility, which is to physically unlink any
# nodes marked for removal in the set. This prevents adds/removes from
# having to retraverse the list to physically unlink nodes.
def self.find(head, item)
loop do
break_inner_loops = false
pred = head
curr = pred.next_node
loop do
succ, marked = curr.Successor_reference.get
# Remove sequence of marked nodes
while marked
removed = pred.Successor_reference.compare_and_set curr, succ, false, false
# If could not remove node, try again
break_inner_loops = true && break unless removed
curr = succ
succ, marked = curr.Successor_reference.get
end
break if break_inner_loops
# We have found a window
return new pred, curr if curr >= item
pred = curr
curr = succ
end
end
end
end
end
end
end
Version data entries
4 entries across 4 versions & 1 rubygems