Class: Concurrent::Edge::LockFreeLinkedSet::Node

Inherits:

Synchronization::Object

• Object
• Synchronization::Object
• Concurrent::Edge::LockFreeLinkedSet::Node

show all

Includes:

Comparable

Defined in:

lib/concurrent/edge/lock_free_linked_set/node.rb

Instance Method Summary (collapse)

• - (undocumented) <=>(other)

  We use Object#hash as a way to enforce ordering on the nodes.

• - (undocumented) data
• - (Node) initialize(data = nil, successor = nil) constructor

  A new instance of Node.

• - (undocumented) key
• - (undocumented) key_for(data)

  This method provides a unqiue key for the data which will be used for ordering.

• - (Boolean) last?

  Check to see if the node is the last in the list.

• - (undocumented) next_node

  Next node in the list.

• - (undocumented) successor_reference

11
12
13
14
15
16

# File 'lib/concurrent/edge/lock_free_linked_set/node.rb', line 11

def initialize(data = nil, successor = nil)
  super()
  @SuccessorReference = AtomicMarkableReference.new(successor || Tail.new)
  @Data                = data
  @Key                 = key_for data
end

51
52
53

# File 'lib/concurrent/edge/lock_free_linked_set/node.rb', line 51

def <=>(other)
  @Key <=> other.hash
end

18
19
20

# File 'lib/concurrent/edge/lock_free_linked_set/node.rb', line 18

def data
  @Data
end

26
27
28

# File 'lib/concurrent/edge/lock_free_linked_set/node.rb', line 26

def key
  @Key
end

44
45
46

# File 'lib/concurrent/edge/lock_free_linked_set/node.rb', line 44

def key_for(data)
  data.hash
end

31
32
33

# File 'lib/concurrent/edge/lock_free_linked_set/node.rb', line 31

def last?
  @SuccessorReference.value.is_a? Tail
end

37
38
39

# File 'lib/concurrent/edge/lock_free_linked_set/node.rb', line 37

def next_node
  @SuccessorReference.value
end

22
23
24

# File 'lib/concurrent/edge/lock_free_linked_set/node.rb', line 22

def successor_reference
  @SuccessorReference
end