#include <iostream>
#include "Single_list.h"
using namespace std;
using namespace Data_structures;

int main() {
	Single_list<int> ls;

	for ( int i = 0; i < 10; ++i ) {
		ls.push_front( i*i );
	}

	for ( Single_list<int>::iterator itr = ls.begin(); itr != ls.end(); ++itr ) {
		cout << *itr << " ";
	}

	cout << endl;

	for ( int i = 0; i < 102; ++i ) {
		cout << ( ls.find( i ) != ls.end() );
	}

	cout << endl;

	for ( Single_list<int>::iterator itr = ls.begin(); itr != ls.end(); ++itr ) {
		*itr = 2*(*itr);
	}

	for ( Single_list<int>::iterator itr = ls.begin(); itr != ls.end(); ++itr ) {
		cout << *itr << " ";
	}

	cout << endl;

	return 0;
}