test-bit-vector.cc 3.86 KB
Newer Older
1
// Copyright 2012 the V8 project authors. All rights reserved.
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
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
//     * Redistributions of source code must retain the above copyright
//       notice, this list of conditions and the following disclaimer.
//     * Redistributions in binary form must reproduce the above
//       copyright notice, this list of conditions and the following
//       disclaimer in the documentation and/or other materials provided
//       with the distribution.
//     * Neither the name of Google Inc. nor the names of its
//       contributors may be used to endorse or promote products derived
//       from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

#include <stdlib.h>

30
#include "src/v8.h"
31

32
#include "src/bit-vector.h"
33
#include "test/cctest/cctest.h"
34

35 36
namespace v8 {
namespace internal {
37 38

TEST(BitVector) {
39
  v8::internal::AccountingAllocator allocator;
40
  Zone zone(&allocator, ZONE_NAME);
41
  {
42
    BitVector v(15, &zone);
43 44 45 46 47 48
    v.Add(1);
    CHECK(v.Contains(1));
    v.Remove(0);
    CHECK(!v.Contains(0));
    v.Add(0);
    v.Add(1);
49
    BitVector w(15, &zone);
50 51 52 53 54 55
    w.Add(1);
    v.Intersect(w);
    CHECK(!v.Contains(0));
    CHECK(v.Contains(1));
  }

56
  {
57
    BitVector v(64, &zone);
58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73
    v.Add(27);
    v.Add(30);
    v.Add(31);
    v.Add(33);
    BitVector::Iterator iter(&v);
    CHECK_EQ(27, iter.Current());
    iter.Advance();
    CHECK_EQ(30, iter.Current());
    iter.Advance();
    CHECK_EQ(31, iter.Current());
    iter.Advance();
    CHECK_EQ(33, iter.Current());
    iter.Advance();
    CHECK(iter.Done());
  }

74
  {
75
    BitVector v(15, &zone);
76
    v.Add(0);
77
    BitVector w(15, &zone);
78 79 80 81 82 83
    w.Add(1);
    v.Union(w);
    CHECK(v.Contains(0));
    CHECK(v.Contains(1));
  }

84
  {
85
    BitVector v(15, &zone);
86
    v.Add(0);
87
    BitVector w(15, &zone);
88
    w.CopyFrom(v);
89 90
    CHECK(w.Contains(0));
    w.Add(1);
91
    BitVector u(w, &zone);
92 93 94 95 96 97 98
    CHECK(u.Contains(0));
    CHECK(u.Contains(1));
    v.Union(w);
    CHECK(v.Contains(0));
    CHECK(v.Contains(1));
  }

99
  {
100
    BitVector v(35, &zone);
101
    v.Add(0);
102
    BitVector w(35, &zone);
103 104 105 106 107 108 109
    w.Add(33);
    v.Union(w);
    CHECK(v.Contains(0));
    CHECK(v.Contains(33));
  }

  {
110
    BitVector v(35, &zone);
111 112
    v.Add(32);
    v.Add(33);
113
    BitVector w(35, &zone);
114 115 116 117
    w.Add(33);
    v.Intersect(w);
    CHECK(!v.Contains(32));
    CHECK(v.Contains(33));
118
    BitVector r(35, &zone);
119 120 121 122
    r.CopyFrom(v);
    CHECK(!r.Contains(32));
    CHECK(r.Contains(33));
  }
123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145

  {
    BitVector v(35, &zone);
    v.Add(32);
    v.Add(33);
    CHECK(v.Contains(32));
    CHECK(v.Contains(33));
    CHECK(!v.Contains(22));
    CHECK(!v.Contains(34));
    v.Resize(50, &zone);
    CHECK(v.Contains(32));
    CHECK(v.Contains(33));
    CHECK(!v.Contains(22));
    CHECK(!v.Contains(34));
    CHECK(!v.Contains(43));
    v.Resize(300, &zone);
    CHECK(v.Contains(32));
    CHECK(v.Contains(33));
    CHECK(!v.Contains(22));
    CHECK(!v.Contains(34));
    CHECK(!v.Contains(43));
    CHECK(!v.Contains(243));
  }
146
}
147 148 149

}  // namespace internal
}  // namespace v8