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

#include "Skip_list.h"
using namespace Data_structures;

int main() {
	int const N = 8;

	srand( time( 0 ) );
	Skip_list<int, int> skip;

	for ( int i = 0; i < N; ++i ) {
		skip[7*i % 5] = i;
	}

	// Performs:
	//    0 => 0, 2 => 1, 4 => 2, 1 => 3, 3 => 4, 0 => 5, 2 => 6, 4 => 7, 1 => 1, 3 => 9
	// Yeilds:
	//    0 => 5, 1 => 3, 2 => 6, 3 => 4, 4 => 7

	for ( int i = 0; i < 5; ++i ) {
		Skip_list<int, int>::iterator itr = skip.find( i );
		cout << (*itr).first << ", " << (*itr).second << endl;
	}

	cout << skip << endl;

	for ( int i = 0; i < 5; ++i ) {
		Skip_list<int, int>::iterator itr = skip.find( i );
		(*itr).second = (*itr).second*(*itr).second;
	}

	for ( int i = 0; i < 5; ++i ) {
		Skip_list<int, int>::iterator itr = skip.find( i );
		cout << (*itr).first << ", " << (*itr).second << endl;
	}

	return 0;
}