Results for: "module_function"

Dispatch enter and leave events for ConstantPathWriteNode nodes and continue walking the tree.

Dispatch enter and leave events for NumberedReferenceReadNode nodes and continue walking the tree.

Copy a BackReferenceReadNode node

Copy a ConstantAndWriteNode node

Copy a ConstantOperatorWriteNode node

Copy a ConstantOrWriteNode node

Copy a ConstantPathTargetNode node

Copy a ConstantPathWriteNode node

Copy a NumberedReferenceReadNode node

Returns every spec that has the given full_name

Compile a ConstantPathAndWriteNode node

Compile a ConstantPathOperatorWriteNode node

Compile a ConstantPathOrWriteNode node

Dispatch enter and leave events for ConstantPathAndWriteNode nodes and continue walking the tree.

Dispatch enter and leave events for ConstantPathOperatorWriteNode nodes and continue walking the tree.

Dispatch enter and leave events for ConstantPathOrWriteNode nodes and continue walking the tree.

Copy a ConstantPathAndWriteNode node

Copy a ConstantPathOperatorWriteNode node

Copy a ConstantPathOrWriteNode node

Returns garbage collector generation for the given object.

class B
  include ObjectSpace

  def foo
    trace_object_allocations do
      obj = Object.new
      p "Generation is #{allocation_generation(obj)}"
    end
  end
end

B.new.foo #=> "Generation is 3"

See ::trace_object_allocations for more information and examples.

Returns a new Array containing each element found both in self and in all of the given Arrays other_arrays; duplicates are omitted; items are compared using eql? (items must also implement hash correctly):

[0, 1, 2, 3].intersection([0, 1, 2], [0, 1, 3]) # => [0, 1]
[0, 0, 1, 1, 2, 3].intersection([0, 1, 2], [0, 1, 3]) # => [0, 1]

Preserves order from self:

[0, 1, 2].intersection([2, 1, 0]) # => [0, 1, 2]

Returns a copy of self if no arguments given.

Related: Array#&.

Returns a 3-element array of substrings of self.

Matches a pattern against self, scanning from the beginning. The pattern is:

• string_or_regexp itself, if it is a Regexp.

• Regexp.quote(string_or_regexp), if string_or_regexp is a string.

If the pattern is matched, returns pre-match, first-match, post-match:

'hello'.partition('l')      # => ["he", "l", "lo"]
'hello'.partition('ll')     # => ["he", "ll", "o"]
'hello'.partition('h')      # => ["", "h", "ello"]
'hello'.partition('o')      # => ["hell", "o", ""]
'hello'.partition(/l+/)     #=> ["he", "ll", "o"]
'hello'.partition('')       # => ["", "", "hello"]
'тест'.partition('т')       # => ["", "т", "ест"]
'こんにちは'.partition('に')  # => ["こん", "に", "ちは"]

If the pattern is not matched, returns a copy of self and two empty strings:

'hello'.partition('x') # => ["hello", "", ""]

Related: String#rpartition, String#split.

Returns a 3-element array of substrings of self.

Matches a pattern against self, scanning backwards from the end. The pattern is:

• string_or_regexp itself, if it is a Regexp.

• Regexp.quote(string_or_regexp), if string_or_regexp is a string.

If the pattern is matched, returns pre-match, last-match, post-match:

'hello'.rpartition('l')      # => ["hel", "l", "o"]
'hello'.rpartition('ll')     # => ["he", "ll", "o"]
'hello'.rpartition('h')      # => ["", "h", "ello"]
'hello'.rpartition('o')      # => ["hell", "o", ""]
'hello'.rpartition(/l+/)     # => ["hel", "l", "o"]
'hello'.rpartition('')       # => ["hello", "", ""]
'тест'.rpartition('т')       # => ["тес", "т", ""]
'こんにちは'.rpartition('に')  # => ["こん", "に", "ちは"]

If the pattern is not matched, returns two empty strings and a copy of self:

'hello'.rpartition('x') # => ["", "", "hello"]

Related: String#partition, String#split.