Foo += bar ^^^^^^^^^^^
Foo &&= bar ^^^^^^^^^^^^
Foo ||= bar ^^^^^^^^^^^^
Foo::Bar = 1 ^^^^^^^^^^^^
Foo::Foo, Bar::Bar = 1 ^^^^^^^^ ^^^^^^^^
Foo::Bar, = baz ^^^^^^^^
Compile a ConstantPathOperatorWriteNode
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.
Inspect a ConstantPathOperatorWriteNode
node.
Copy a ConstantPathOperatorWriteNode
node
Verify compaction reference consistency.
This method is implementation specific. During compaction, objects that were moved are replaced with T_MOVED objects. No object should have a reference to a T_MOVED object after compaction.
This function expands the heap to ensure room to move all objects, compacts the heap to make sure everything moves, updates all references, then performs a full GC. If any object contains a reference to a T_MOVED object, that object should be pushed on the mark stack, and will make a SEGV.
Returns the fractional part of the day in range (Rational(0, 1)…Rational(1, 1)):
DateTime.new(2001,2,3,12).day_fraction # => (1/2)
Returns the fractional part of the second in range (Rational(0, 1)…Rational(1, 1)):
DateTime.new(2001, 2, 3, 4, 5, 6.5).sec_fraction # => (1/2)
Returns the sharing detection flag as a boolean value. It is false (nil) by default.
Sets the sharing detection flag to b.
Raises PStore::Error
if the calling code is not in a PStore#transaction
.
Returns a new Array
that is the union of self
and all given Arrays other_arrays
; duplicates are removed; order is preserved; items are compared using eql?
:
[0, 1, 2, 3].union([4, 5], [6, 7]) # => [0, 1, 2, 3, 4, 5, 6, 7] [0, 1, 1].union([2, 1], [3, 1]) # => [0, 1, 2, 3] [0, 1, 2, 3].union([3, 2], [1, 0]) # => [0, 1, 2, 3]
Returns a copy of self
if no arguments given.
Related: Array#|
.