bit(bit)
click to toggle source
Set a bit.
0.bit!(4) #=> 8
Using an inverted bit will clear a bit.
10.bit!(~3) #=> 2
0xb0100.bit(~3) #=> 0
CREDIT: Thomas Sawyer, George Moschovitis
14: def bit(bit)
15: if bit < 0
16: mask = (1 << ~bit)
17: self & ~mask
18: else
19: mask = (1 << bit)
20: self | mask
21: end
22: end
bit!(bit)
click to toggle source
Old name. Probably will be deprecated.
bit?(bit)
click to toggle source
Is a bit set?
8.bit?(3) #=> true
8.bit?(2) #=> false
CREDIT: Thomas Sawyer, George Moschovitis
43: def bit?(bit)
44: mask = (1 << bit)
45: (self & mask) != 0
46: end
bitmask(mask)
click to toggle source
Apply a bitmask.
1.bitmask(6) #=> 7
Using a inverted bitmask clears bits.
7.bitmask(~2) #=> 5
5.bitmask(~2) #=> 5
CREDIT: George Moschovitis
59: def bitmask(mask)
60: if mask < 0
61: self & mask
62: else
63: self | mask
64: end
65: end
bitmask!(mask)
click to toggle source
Old name. Probably will be deprecated.
bitmask?(mask)
click to toggle source
Is bitmask set?
7.bitmask?(7) #=> true
7.bitmask?(5) #=> true
8.bitmask?(3) #=> false
CREDIT: George Moschovitis
78: def bitmask?(mask)
79: (self & mask) != 0
80: end
clear_bit(bit)
click to toggle source
Clear bit.
CREDIT: George Moschovitis
31: def clear_bit(bit)
32: mask = (1 << bit)
33: self & ~mask
34: end
even?()
click to toggle source
Returns true if this integer is even, false otherwise.
2.even? #=> true
3.even? #=> false
CREDIT: Daniel Schierbeck
31: def even?
32:
33: self & 1 == 0
34: end
fac()
click to toggle source
factorial()
click to toggle source
Calculate the factorial of an integer.
2.factorial #=> 2
3.factorial #=> 6
3.factorial #=> 24
CREDIT: Malte Milatz
11: def factorial
12: return 1 if zero?
13: f = 1
14: 2.upto(self) { |n| f *= n }
15: f
16: end
multiple?(number)
click to toggle source
Is self a multiple of a given number?
7.multiple?(2) #=> false
8.multiple?(2) #=> true
CREDIT: Trans
10: def multiple?(number)
11: if number.zero?
12: zero? ? true : false
13: else
14: self % number == 0
15: end
16: end
odd?()
click to toggle source
Returns true if this integer is odd, false otherwise.
2.odd? #=> false
3.odd? #=> true
-99.odd? # -> true
-98.odd? # -> false
CREDIT: Daniel Schierbeck
15: def odd?
16:
17: self & 1 == 1
18: end
of(&block)
click to toggle source
Like # but returns a collection of the yield results.
a = 3.of { |i| "#{i+1}" }
a => [ "1", "2", "3" ]
9: def of(&block)
10: Array.new(self, &block)
11: end
ordinal()
click to toggle source
3: def ordinal
4: if [11,12,13].include?(self % 100)
5: "#{self}th"
6: else
7: case (self % 10)
8: when 1
9: "#{self}st"
10: when 2
11: "#{self}nd"
12: when 3
13: "#{self}rd"
14: else
15: "#{self}th"
16: end
17: end
18: end
ordinalize()
click to toggle source
roman()
click to toggle source
Converts this integer to a roman numeral.
24: def roman
25: int = self
26:
27: return "-#{(-int).roman}" if int < 0
28: return "" if int == 0
29: ROMAN_VALUES.each do |(i, v)|
30: return(i + (int-v).roman) if v <= int
31: end
32: end
round_at(*args)
click to toggle source
See Float#round_at.
27: def round_at(*args)
28: to_f.round_at(*args)
29: end
round_to(*args)
click to toggle source
See Float#round_to.
33: def round_to(*args)
34: to_f.round_to(*args)
35: end
times_collect(&block)
click to toggle source
times_map(&block)
click to toggle source
![[+]](./images/find.png "show/hide quicksearch")