gem5
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
bitvectest.cc
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2002-2005 The Regents of The University of Michigan
3  * All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without
6  * modification, are permitted provided that the following conditions are
7  * met: redistributions of source code must retain the above copyright
8  * notice, this list of conditions and the following disclaimer;
9  * redistributions in binary form must reproduce the above copyright
10  * notice, this list of conditions and the following disclaimer in the
11  * documentation and/or other materials provided with the distribution;
12  * neither the name of the copyright holders nor the names of its
13  * contributors may be used to endorse or promote products derived from
14  * this software without specific prior written permission.
15  *
16  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19  * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20  * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27  *
28  * Authors: Nathan Binkert
29  */
30 
31 #include <iostream>
32 #include <vector>
33 
34 using namespace std;
35 
36 int
38 {
39  vector<bool> v1(100);
40 
41  v1[0] = true;
42  v1.resize(500);
43  v1[100] = true;
44  v1[499] = true;
45  v1.resize(10000);
46  v1[9999] = true;
47 
48  cout << "v1.size() = " << v1.size() << "\n";
49  for (int i = 0; i < v1.size(); i++)
50  if (v1[i])
51  cout << "v1[" << i << "] = " << v1[i] << "\n";
52 
53  cout << "\n";
54 
55  vector<bool> v2 = v1;
56 
57  for (int i = 0; i < v2.size(); i++)
58  if (v2[i])
59  cout << "v2[" << i << "] = " << v2[i] << "\n";
60 
61  cout << "v1 " << ((v1 == v2) ? "==" : "!=") << " v2" << "\n";
62  v2[8583] = true;
63  cout << "v1 " << ((v1 == v2) ? "==" : "!=") << " v2" << "\n";
64  v1[8583] = true;
65  cout << "v1 " << ((v1 == v2) ? "==" : "!=") << " v2" << "\n";
66  v1.resize(100000);
67  cout << "v1 " << ((v1 == v2) ? "==" : "!=") << " v2" << "\n";
68  cout << flush;
69 }
Bitfield< 7 > i
Definition: miscregs.hh:1378
int main()
Definition: bitvectest.cc:37

Generated on Fri Jun 9 2017 13:03:52 for gem5 by doxygen 1.8.6