File: lazy_array_test.cc

package info (click to toggle)
rlvm 0.14-5.2
  • links: PTS
  • area: main
  • in suites: sid, trixie
  • size: 17,104 kB
  • sloc: cpp: 91,574; ansic: 39,346; perl: 768; sh: 320; python: 181; makefile: 8
file content (183 lines) | stat: -rw-r--r-- 6,068 bytes parent folder | download | duplicates (6)
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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
// -*- Mode: C++; tab-width:2; indent-tabs-mode: nil; c-basic-offset: 2 -*-
// vi:tw=80:et:ts=2:sts=2
//
// -----------------------------------------------------------------------
//
// This file is part of RLVM, a RealLive virtual machine clone.
//
// -----------------------------------------------------------------------
//
// Copyright (C) 2007 Elliot Glaysher
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA.
//
// -----------------------------------------------------------------------

#include "gtest/gtest.h"

#include <boost/archive/text_iarchive.hpp>
#include <boost/archive/text_oarchive.hpp>
#include <boost/serialization/export.hpp>
#include <boost/serialization/tracking.hpp>

#include "utilities/lazy_array.h"

#include "test_utils.h"

#include <iostream>
#include <algorithm>
using namespace std;

const int SIZE = 10;

class LazyArrayTest : public ::testing::Test {
 public:
  // Helper class because boost::serialization doesn't like the
  // concept of serializing an int*
  class IntWrapper {
   private:
    friend class boost::serialization::access;
    template <class Archive>
    void serialize(Archive& ar, const unsigned int version) {
      ar& num;
    }

    int num;

   public:
    IntWrapper() : num(0) {}

    IntWrapper& operator=(int in) {
      num = in;
      return *this;
    }

    operator int() const { return num; }
  };

 protected:
  template <typename T>
  void populateIntArray(T& lazyArray) {
    // Set each even slot to its number
    for (int i = 0; i < SIZE; ++i)
      if (i % 2 == 0)
        lazyArray[i] = i;
  }

  template <typename T>
  void checkArray(LazyArray<T>& in) {
    // iterating across everything; every other cell should report
    // being unallocated
    FullLazyArrayIterator<T> it = in.full_begin();
    FullLazyArrayIterator<T> end = in.full_end();
    for (int i = 0; it != end && i < SIZE; ++it, ++i) {
      if (it.pos() % 2 == 0) {
        EXPECT_TRUE(it.valid()) << "Invalid in valid position";
        EXPECT_EQ(i, it.pos()) << "Pointing to correct item";
        EXPECT_EQ(i, *it) << "Correct value";
      } else {
        EXPECT_FALSE(it.valid()) << "Valid in invalid position";
      }
    }
  }
};

// -----------------------------------------------------------------------

BOOST_CLASS_EXPORT(LazyArrayTest::IntWrapper);
BOOST_CLASS_TRACKING(LazyArrayTest::IntWrapper,
                     boost::serialization::track_always);

// -----------------------------------------------------------------------

TEST_F(LazyArrayTest, EmptyArray) {
  // Empty lazy arrays should simply set size
  LazyArray<int> lazyArray(SIZE);
  EXPECT_EQ(SIZE, lazyArray.size()) << "Lazy Array didn't remember its size";

  EXPECT_TRUE(lazyArray.begin() == lazyArray.end())
      << "Allocated Lazy iterator is valid on an empty array";

  // iterating across everything; each cell should report being unallocated
  FullLazyArrayIterator<int> it = lazyArray.full_begin();
  FullLazyArrayIterator<int> end = lazyArray.full_end();
  for (; it != end; ++it) {
    EXPECT_FALSE(it.valid())
        << "LazyArray with no items says something is valid";
  }
}

TEST_F(LazyArrayTest, AllozatedLazyArrayIterator) {
  LazyArray<int> lazyArray(SIZE);
  EXPECT_EQ(SIZE, lazyArray.size()) << "Lazy Array didn't remember its size";
  populateIntArray(lazyArray);
  checkArray(lazyArray);

  // Test to make sure that when we use AllocatedLazyArrayIterator, we
  // only stop on items that are valid.
  AllocatedLazyArrayIterator<int> ait = lazyArray.begin();
  AllocatedLazyArrayIterator<int> aend = lazyArray.end();
  EXPECT_TRUE(ait != aend)
      << "Allocated Lazy iterator is invalid on an array with items in it";

  for (int i = 0; ait != aend && i < SIZE; ++ait, i += 2) {
    EXPECT_EQ(0, ait.pos() % 2) << "Stopped on invalid item!";
    EXPECT_EQ(i, *ait) << "Correct value";
  }
}

TEST_F(LazyArrayTest, BothIterators) {
  // Allocate even objects and then these
  LazyArray<int> lazyArray(SIZE);
  EXPECT_EQ(SIZE, lazyArray.size()) << "Lazy Array didn't remember its size";

  // Go through each item in the array (by FullLazyArrayIterator) and
  // set the values.
  FullLazyArrayIterator<int> it = lazyArray.full_begin();
  FullLazyArrayIterator<int> end = lazyArray.full_end();
  for (int i = 0; it != end && i < SIZE; ++it, ++i) {
    EXPECT_FALSE(it.valid()) << "Position starts off invalid.";
    *it = i;
    EXPECT_TRUE(it.valid()) << "Position ends up valid after writing.";
  }

  // Now we should be able to iterate across all the items with
  // AllocatedLazyArrayIterator, and make sure their values are correct.
  AllocatedLazyArrayIterator<int> ait = lazyArray.begin();
  AllocatedLazyArrayIterator<int> aend = lazyArray.end();
  for (int i = 0; ait != aend && i < SIZE; ++ait, ++i) {
    EXPECT_EQ(i, *ait) << "Correct value in position";
  }
}

TEST_F(LazyArrayTest, Serialization) {
  stringstream ss;

  LazyArray<IntWrapper> lazyArray(SIZE);
  EXPECT_EQ(SIZE, lazyArray.size()) << "Lazy Array didn't remember its size";
  populateIntArray(lazyArray);
  {
    boost::archive::text_oarchive oa(ss);
    oa << const_cast<const LazyArray<IntWrapper>&>(lazyArray);
  }
  {
    // Thaw the data that was saved into a different LazyArray and
    // make sure that it's the same data.
    LazyArray<IntWrapper> newArray(SIZE);
    boost::archive::text_iarchive ia(ss);
    ia >> newArray;
    checkArray(newArray);
  }
}