panthema / 2012 / 1119-eSAIS-Inducing-Suffix-and-LCP-Arrays-in-External-Memory / eSAIS-DC3-LCP-0.5.2 / stxxl / containers / btree / test_btree.cpp (Download File)
/***************************************************************************
 *  containers/btree/test_btree.cpp
 *
 *  A very basic test
 *
 *  Part of the STXXL. See http://stxxl.sourceforge.net
 *
 *  Copyright (C) 2006 Roman Dementiev <dementiev@ira.uka.de>
 *
 *  Distributed under the Boost Software License, Version 1.0.
 *  (See accompanying file LICENSE_1_0.txt or copy at
 *  http://www.boost.org/LICENSE_1_0.txt)
 **************************************************************************/

#include <iostream>

#include <stxxl/bits/containers/btree/btree.h>
#include <stxxl/stats>
#include <stxxl/timer>


struct comp_type : public std::less<int>
{
    static int max_value()
    {
        return (std::numeric_limits<int>::max)();
    }
};

typedef stxxl::btree::btree<int, double, comp_type, 4096, 4096, stxxl::SR> btree_type;

std::ostream & operator << (std::ostream & o, const std::pair<int, double> & obj)
{
    o << obj.first << " " << obj.second;
    return o;
}

#define node_cache_size (25 * 1024 * 1024)
#define leaf_cache_size (25 * 1024 * 1024)

int main(int argc, char * argv[])
{
    if (argc < 2)
    {
        STXXL_MSG("Usage: " << argv[0] << " #ins");
        return -1;
    }

    btree_type BTree1(node_cache_size, leaf_cache_size);

    unsigned nins = atoi(argv[1]);
    if (nins < 100)
        nins = 100;


    stxxl::random_number32 rnd;

    // .begin() .end() test
    BTree1[10] = 100.;
    btree_type::iterator begin = BTree1.begin();
    btree_type::iterator end = BTree1.end();
    assert(begin == BTree1.begin());
    BTree1[5] = 50.;
    btree_type::iterator nbegin = BTree1.begin();
    btree_type::iterator nend = BTree1.end();
    assert(nbegin == BTree1.begin());
    assert(begin != nbegin);
    assert(end == nend);
    assert(begin != end);
    assert(nbegin != end);
    assert(begin->first == 10);
    assert(begin->second == 100);
    assert(nbegin->first == 5);
    assert(nbegin->second == 50);

    BTree1[10] = 200.;
    assert(begin->second == 200.);

    btree_type::iterator it = BTree1.find(5);
    assert(it != BTree1.end());
    assert(it->first == 5);
    assert(it->second == 50.);
    it = BTree1.find(6);
    assert(it == BTree1.end());
    it = BTree1.find(1000);
    assert(it == BTree1.end());


    int f = BTree1.erase(5);
    assert(f == 1);
    f = BTree1.erase(6);
    assert(f == 0);
    f = BTree1.erase(5);
    assert(f == 0);

    assert(BTree1.count(10) == 1);
    assert(BTree1.count(5) == 0);

    it = BTree1.insert(BTree1.begin(), std::pair<int, double>(7, 70.));
    assert(it->second == 70.);
    assert(BTree1.size() == 2);
    it = BTree1.insert(BTree1.begin(), std::pair<int, double>(10, 300.));
    assert(it->second == 200.);
    assert(BTree1.size() == 2);

    // test lower_bound

    it = BTree1.lower_bound(6);
    assert(it != BTree1.end());
    assert(it->first == 7);

    it = BTree1.lower_bound(7);
    assert(it != BTree1.end());
    assert(it->first == 7);

    it = BTree1.lower_bound(8);
    assert(it != BTree1.end());
    assert(it->first == 10);

    it = BTree1.lower_bound(11);
    assert(it == BTree1.end());

    // test upper_bound

    it = BTree1.upper_bound(6);
    assert(it != BTree1.end());
    assert(it->first == 7);

    it = BTree1.upper_bound(7);
    assert(it != BTree1.end());
    assert(it->first == 10);

    it = BTree1.upper_bound(8);
    assert(it != BTree1.end());
    assert(it->first == 10);

    it = BTree1.upper_bound(10);
    assert(it == BTree1.end());

    it = BTree1.upper_bound(11);
    assert(it == BTree1.end());

    // test equal_range

    std::pair<btree_type::iterator, btree_type::iterator> it_pair = BTree1.equal_range(1);
    assert(BTree1.find(7) == it_pair.first);
    assert(BTree1.find(7) == it_pair.second);

    it_pair = BTree1.equal_range(7);
    assert(BTree1.find(7) == it_pair.first);
    assert(BTree1.find(10) == it_pair.second);

    it_pair = BTree1.equal_range(8);
    assert(BTree1.find(10) == it_pair.first);
    assert(BTree1.find(10) == it_pair.second);

    it_pair = BTree1.equal_range(10);
    assert(BTree1.find(10) == it_pair.first);
    assert(BTree1.end() == it_pair.second);

    it_pair = BTree1.equal_range(11);
    assert(BTree1.end() == it_pair.first);
    assert(BTree1.end() == it_pair.second);

    //

    it = BTree1.lower_bound(0);
    BTree1.erase(it);
    assert(BTree1.size() == 1);

    BTree1.clear();
    assert(BTree1.size() == 0);

    for (unsigned int i = 0; i < nins / 2; ++i)
    {
        BTree1[rnd() % nins] = 10.1;
    }
    STXXL_MSG("Size of map: " << BTree1.size());


    BTree1.clear();

    for (unsigned int i = 0; i < nins / 2; ++i)
    {
        BTree1[rnd() % nins] = 10.1;
    }

    STXXL_MSG("Size of map: " << BTree1.size());

    btree_type BTree2(comp_type(), node_cache_size, leaf_cache_size);

    STXXL_MSG("Construction of BTree3 from BTree1 that has " << BTree1.size() << " elements");
    btree_type BTree3(BTree1.begin(), BTree1.end(), comp_type(), node_cache_size, leaf_cache_size);

    assert(BTree3 == BTree1);

    STXXL_MSG("Bulk construction of BTree4 from BTree1 that has " << BTree1.size() << " elements");
    btree_type BTree4(BTree1.begin(), BTree1.end(), comp_type(), node_cache_size, leaf_cache_size, true);

    STXXL_MSG("Size of BTree1: " << BTree1.size());
    STXXL_MSG("Size of BTree4: " << BTree4.size());

    assert(BTree4 == BTree1);
    assert(BTree3 == BTree4);

    BTree4.begin()->second = 0;
    assert(BTree3 != BTree4);
    assert(BTree4 < BTree3);

    BTree4.begin()->second = 1000;
    assert(BTree4 > BTree3);

    assert(BTree3 != BTree4);

    it = BTree4.begin();
    ++it;
    STXXL_MSG("Size of Btree4 before erase: " << BTree4.size());
    BTree4.erase(it, BTree4.end());
    STXXL_MSG("Size of Btree4 after erase: " << BTree4.size());
    assert(BTree4.size() == 1);


    STXXL_MSG("Size of Btree1 before erase: " << BTree1.size());
    BTree1.erase(BTree1.begin(), BTree1.end());
    STXXL_MSG("Size of Btree1 after erase: " << BTree1.size());
    assert(BTree1.empty());

    // a copy of BTree3
    btree_type BTree5(BTree3.begin(), BTree3.end(), comp_type(), node_cache_size, leaf_cache_size, true);
    assert(BTree5 == BTree3);

    btree_type::iterator b3 = BTree3.begin();
    btree_type::iterator b4 = BTree4.begin();
    btree_type::iterator e3 = BTree3.end();
    btree_type::iterator e4 = BTree4.end();

    STXXL_MSG("Testing swapping operation (std::swap)");
    std::swap(BTree4, BTree3);
    assert(b3 == BTree4.begin());
    assert(b4 == BTree3.begin());
    assert(e3 == BTree4.end());
    assert(e4 == BTree3.end());

    assert(BTree5 == BTree4);
    assert(BTree5 != BTree3);

    btree_type::const_iterator cb = BTree3.begin();
    btree_type::const_iterator ce = BTree3.end();
    const btree_type & CBTree3 = BTree3;
    cb = CBTree3.begin();
    b3 == cb;
    b3 != cb;
    cb == b3;
    cb != b3;
    ce = CBTree3.end();
    btree_type::const_iterator cit = CBTree3.find(0);
    cit = CBTree3.lower_bound(0);
    cit = CBTree3.upper_bound(0);

    std::pair<btree_type::const_iterator, btree_type::const_iterator> cit_pair = CBTree3.equal_range(1);

    assert(CBTree3.max_size() >= CBTree3.size());


    CBTree3.key_comp();
    CBTree3.value_comp();

    double sum = 0.0;

    STXXL_MSG(*stxxl::stats::get_instance());

    stxxl::timer Timer2;
    Timer2.start();
    cit = BTree5.begin();
    for ( ; cit != BTree5.end(); ++cit)
        sum += cit->second;

    Timer2.stop();
    STXXL_MSG("Scanning with const iterator: " << Timer2.mseconds() << " msec");

    STXXL_MSG(*stxxl::stats::get_instance());

    stxxl::timer Timer1;
    Timer1.start();
    it = BTree5.begin();
    for ( ; it != BTree5.end(); ++it)
        sum += it->second;

    Timer1.stop();
    STXXL_MSG("Scanning with non const iterator: " << Timer1.mseconds() << " msec");

    STXXL_MSG(*stxxl::stats::get_instance());

    BTree5.disable_prefetching();
    BTree5.enable_prefetching();
    BTree5.prefetching_enabled();
    assert(BTree5.prefetching_enabled());

    STXXL_MSG("All tests passed successfully");

    return 0;
}
RSS 2.0 Weblog Feed Atom 1.0 Weblog Feed Valid XHTML 1.1 Valid CSS (2.1)
Copyright 2005-2014 Timo Bingmann - Impressum