/**
 * Benchmarks for sstring.h
 *
 * @author David Manura, 2006-07
 * (c) 2006 David Manura
 * Distributed under the Boost Software License, Version 1.0. (www.boost.org)
 */ 

#include "sstring.h"

#include <iostream>
#include <boost/algorithm/string.hpp>
#include <ctime>
using namespace boost;
using namespace std;

const int num_loops = 5000000;

template<class T1, class T2, class T3>
void compare()
{
    for (int n=0; n<3; n++) {
        clock_t t0 = clock();
        T1::run();
        clock_t t1 = clock();
        T2::run();
        clock_t t2 = clock();
        T3::run();
        clock_t t3 = clock();
        cout << (t1 - t0) << " " << (t2 - t1) << " " << (t3 - t2) << endl;
    }
}

struct test1_sstring {
    static void run() {
        for (int n=0; n<num_loops; n++) {
            sstring<200> s;
            s += "12345678901234567890";
            s += s;
        }
    }
};

struct test1_string {
    static void run() {
        for (int n=0; n<num_loops; n++) {
            string s;
            s.reserve(200);
            s += "12345678901234567890";
            s += s;
        }
    }
};

struct test1_c {
    static void run() {
        for (int n=0; n<num_loops; n++) {
            char s[200]; s[0] = '\0';
            strcpy(s, "12345678901234567890");
            size_t len = strlen(s);
            memcpy(s + len, s, len);
            s[len*2] = '\0';
        }
    }
};


int main()
{
    cout << "begin" << endl;
    compare<test1_sstring, test1_string, test1_c>(); //test1_c>();
    cout << "end" << endl;
    return 0;
}