File: bit_length_spec.rb

package info (click to toggle)
ruby3.3 3.3.8-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 153,620 kB
  • sloc: ruby: 1,244,308; ansic: 836,474; yacc: 28,074; pascal: 6,748; sh: 3,913; python: 1,719; cpp: 1,158; makefile: 742; asm: 712; javascript: 394; lisp: 97; perl: 62; awk: 36; sed: 23; xml: 4
file content (76 lines) | stat: -rw-r--r-- 2,458 bytes parent folder | download | duplicates (7)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
require_relative '../../spec_helper'

describe "Integer#bit_length" do
  context "fixnum" do
    it "returns the position of the leftmost bit of a positive number" do
      0.bit_length.should == 0
      1.bit_length.should == 1
      2.bit_length.should == 2
      3.bit_length.should == 2
      4.bit_length.should == 3
      n = fixnum_max.bit_length
      fixnum_max[n].should == 0
      fixnum_max[n - 1].should == 1

      0.bit_length.should == 0
      1.bit_length.should == 1
      0xff.bit_length.should == 8
      0x100.bit_length.should == 9
      (2**12 - 1).bit_length.should == 12
      (2**12).bit_length.should == 13
      (2**12 + 1).bit_length.should == 13
    end

    it "returns the position of the leftmost 0 bit of a negative number" do
      -1.bit_length.should == 0
      -2.bit_length.should == 1
      -3.bit_length.should == 2
      -4.bit_length.should == 2
      -5.bit_length.should == 3
      n = fixnum_min.bit_length
      fixnum_min[n].should == 1
      fixnum_min[n - 1].should == 0

      (-2**12 - 1).bit_length.should == 13
      (-2**12).bit_length.should == 12
      (-2**12 + 1).bit_length.should == 12
      -0x101.bit_length.should == 9
      -0x100.bit_length.should == 8
      -0xff.bit_length.should == 8
      -2.bit_length.should == 1
      -1.bit_length.should == 0
    end
  end

  context "bignum" do
    it "returns the position of the leftmost bit of a positive number" do
      (2**1000-1).bit_length.should == 1000
      (2**1000).bit_length.should == 1001
      (2**1000+1).bit_length.should == 1001

      (2**10000-1).bit_length.should == 10000
      (2**10000).bit_length.should == 10001
      (2**10000+1).bit_length.should == 10001

      (1 << 100).bit_length.should == 101
      (1 << 100).succ.bit_length.should == 101
      (1 << 100).pred.bit_length.should == 100
      (1 << 10000).bit_length.should == 10001
    end

    it "returns the position of the leftmost 0 bit of a negative number" do
      (-2**10000-1).bit_length.should == 10001
      (-2**10000).bit_length.should == 10000
      (-2**10000+1).bit_length.should == 10000

      (-2**1000-1).bit_length.should == 1001
      (-2**1000).bit_length.should == 1000
      (-2**1000+1).bit_length.should == 1000

      ((-1 << 100)-1).bit_length.should == 101
      ((-1 << 100)-1).succ.bit_length.should == 100
      ((-1 << 100)-1).pred.bit_length.should == 101
      ((-1 << 10000)-1).bit_length.should == 10001
    end
  end
end