83 lines
2.7 KiB
C++
83 lines
2.7 KiB
C++
/*
|
|||
* Copyright (c) 2003 The Regents of The University of Michigan
|
|||
* All rights reserved.
|
|||
*
|
|||
* 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 the copyright holders 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 <iostream>
|
|||
#include "bhgp.hh"
|
|||
|
|||
int main(void)
|
|||
{
|
|||
typedef AssociativeTable<unsigned int, unsigned int> tableType;
|
|||
tableType table(10, 4); // 40 entry table
|
|||
|
|||
std::cout << "Initial state:" << std::endl;
|
|||
table.dump();
|
|||
|
|||
std::cout << "Inserting (2, 1)" << std::endl;
|
|||
table[2] = 1;
|
|||
table.dump();
|
|||
|
|||
std::cout << "Inserting (5, 2)" << std::endl;
|
|||
table[5] = 2;
|
|||
table.dump();
|
|||
|
|||
std::cout << "Inserting (10 + 2, 3)" << std::endl;
|
|||
table[10 + 2] = 3;
|
|||
table.dump();
|
|||
|
|||
tableType::const_iterator i = table.find(2);
|
|||
assert(i != table.end());
|
|||
std::cout << "Accessed 2: " << *i << std::endl;
|
|||
table.dump();
|
|||
|
|||
i = table.find(10 + 2);
|
|||
assert(i != table.end());
|
|||
std::cout << "Accessed 10 + 2: " << *i << std::endl;
|
|||
table.dump();
|
|||
|
|||
i = table.find(34);
|
|||
assert(i == table.end());
|
|||
|
|||
std::cout << "Inserting (2 * 10 + 2, 4)" << std::endl;
|
|||
table[2 * 10 + 2] = 4;
|
|||
table.dump();
|
|||
|
|||
std::cout << "Replacing (10 + 2) with 5" << std::endl;
|
|||
table[10 + 2] = 5;
|
|||
table.dump();
|
|||
|
|||
std::cout << "Inserting (3 * 10 + 2, 6)" << std::endl;
|
|||
table[3 * 10 + 2] = 6;
|
|||
table.dump();
|
|||
|
|||
std::cout << "Inserting (4 * 10 + 2, 7)" << std::endl;
|
|||
table[4 * 10 + 2] = 7;
|
|||
table.dump();
|
|||
|
|||
return(0);
|
|||
}
|
