Module: Weak::Set::WeakKeysWithDelete

Defined in:
lib/weak/set/weak_keys_with_delete.rb

Overview

This Weak::Set strategy targets Ruby >= 3.3.0. Older Ruby versions require additional indirections implemented in WeakKeys:

Ruby's ObjectSpace::WeakMap uses weak keys and weak values so that either the key or the value can be independently garbage collected. If either of them vanishes, the entry is removed.

The ObjectSpace::WeakMap also allows to delete entries. This allows us to directly use the ObjectSpace::WeakMap as a storage object.

Class Method Summary collapse

Instance Method Summary collapse

Class Method Details

.usable? ⇒ Bool

Checks if this strategy is usable for the current Ruby version.

Returns:

  • (Bool) —

    truethy for Ruby (aka. MRI, aka. YARV) >= 3.3.0, falsey otherwise



28
29
30
 
# File 'lib/weak/set/weak_keys_with_delete.rb', line 28

def self.usable?
  RUBY_ENGINE == "ruby" && ObjectSpace::WeakMap.method_defined?(:delete)
end

Instance Method Details

#add(obj) ⇒ self

Adds the given object to the weak set and return self. Use Weak::Set#merge to add many elements at once.

In contrast to other "regular" objects, we will not retain a strong reference to the added object. Unless some other live objects still references the object, it will eventually be garbage-collected.

Examples:

Weak::Set[1, 2].add(3)                #=> Weak::Set[1, 2, 3]
Weak::Set[1, 2].add([3, 4])           #=> Weak::Set[1, 2, [3, 4]]
Weak::Set[1, 2].add(2)                #=> Weak::Set[1, 2]

Parameters:

  • obj (Object) —

    an object

Returns:

  • (self) 


33
34
35
36
 
# File 'lib/weak/set/weak_keys_with_delete.rb', line 33

def add(obj)
  @map[obj] = true
  self
end

#clear ⇒ self

Removes all elements and returns self

Returns:

  • (self) 


39
40
41
42
 
# File 'lib/weak/set/weak_keys_with_delete.rb', line 39

def clear
  @map = ObjectSpace::WeakMap.new
  self
end

#delete?(obj) ⇒ self?

Note:

Weak::Set does not test member equality with == or eql?. Instead, it always checks strict object equality, so that, e.g., different strings are not considered equal, even if they may contain the same string content.

Deletes the given object from self and returns self if it was present in the set. If the object was not in the set, returns nil.

Parameters:

  • obj (Object)

Returns:

  • (self, nil) —

    self if the given object was deleted from the set or nil if the object was not part of the set



45
46
47
48
49
50
 
# File 'lib/weak/set/weak_keys_with_delete.rb', line 45

def delete?(obj)
  # `ObjectSpace::WeakMap#delete` returns the value if it was removed. As
  # we set it to true, `ObjectSpace::WeakMap#delete` returns either true
  # or nil here.
  self if @map.delete(obj)
end

#each {|element| ... } ⇒ self, Enumerator

Calls the given block once for each live element in self, passing that element as a parameter. Returns the weak set itself.

If no block is given, an Enumerator is returned instead.

Yields:

  • (element) —

    calls the given block once for each element in self

Yield Parameters:

  • element (Object) —

    the yielded value

Returns:

  • (self, Enumerator) —

    self if a block was given or an Enumerator if no block was given.



53
54
55
56
57
58
 
# File 'lib/weak/set/weak_keys_with_delete.rb', line 53

def each(&block)
  return enum_for(__method__) { size } unless block_given?

  @map.keys.each(&block)
  self
end

#include?(obj) ⇒ Bool

Note:

Weak::Set does not test member equality with == or eql?. Instead, it always checks strict object equality, so that, e.g., different strings are not considered equal, even if they may contain the same string content.

Returns true if the given object is included in self, false otherwise.

Parameters:

  • obj (Object) —

    an object

Returns:

  • (Bool) —

    true if the given object is included in self, false otherwise



61
62
63
 
# File 'lib/weak/set/weak_keys_with_delete.rb', line 61

def include?(obj)
  @map.key?(obj)
end

#prune ⇒ self

Cleanup data structures from the set to remove data associated with deleted or garbage collected elements. This method may be called automatically for some Weak::Set operations.

Returns:

  • (self) 


66
67
68
 
# File 'lib/weak/set/weak_keys_with_delete.rb', line 66

def prune
  self
end

#replace(enum) ⇒ self

Replaces the contents of self with the contents of the given enumerable object and returns self.

Examples:

set = Weak::Set[1, :c, :s]        #=> Weak::Set[1, :c, :s]
set.replace([1, 2])               #=> Weak::Set[1, 2]
set                               #=> Weak::Set[1, 2]

Parameters:

Returns:

  • (self) 


71
72
73
74
75
76
77
78
79
 
# File 'lib/weak/set/weak_keys_with_delete.rb', line 71

def replace(enum)
  map = ObjectSpace::WeakMap.new
  do_with_enum(enum) do |obj|
    map[obj] = true
  end
  @map = map

  self
end

#size ⇒ Integer

Returns the number of live elements in self.

Returns:

  • (Integer) —

    the number of live elements in self



82
83
84
 
# File 'lib/weak/set/weak_keys_with_delete.rb', line 82

def size
  @map.size
end

#to_a ⇒ Array

Note:

The order of elements on the returned Array is non-deterministic. We do not preserve preserve insertion order.

Returns the live elements contained in self as an Array.

Returns:

  • (Array) —

    the live elements contained in self as an Array



87
88
89
 
# File 'lib/weak/set/weak_keys_with_delete.rb', line 87

def to_a
  @map.keys
end