PT_Zapoctovka_2

/* --------------------------------------------------------------------------------
Meno:

Subor premenujte na Priezvisko_Meno_Id_pisomka2_10hod.cpp (pouzite vase udaje, pripona musi ostat .cpp).
Cela implementacia musi byt v tomto jednom subore (odovzdajte do miesta odovzdania v AIS len tento zdrojovy subor).
Nemente deklaracie funkcii. <- DOLEZITE
Programu musi byt kompilovatelny. <- DOLEZITE
Nemente implementacie hotovych funkci, ani zadanych struktur a tried.
V pripade potreby mozete kod doplnit o dalsie funkcie, struktury, alebo triedy.
Globalne premenne su zakazane.
Funkcia 'main' musi byt v zdrojovom kode posledna.

Vypracujte ulohy zadane dalej.
V maine je uz pripravy testovaci kod.
-------------------------------------------------------------------------------- */

#include <iostream>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <string>
#include <sstream>
#include <iomanip>
#include <algorithm>

using namespace std;

#pragma warning( disable : 4290 ) //zabranenie warning-u //warning C4290 : C++ exception specification ignored except to indicate a function is not __declspec(nothrow)

//---------- 1. uloha (1 bod) ---------------------------------------------------------

//Doplnte a otestujte implementaciu hash-ovacej funkcie.
//Vstupom je e-mailova adresa 'emailAddress'.
//Hash-ovacia funkcia musi byt zavisla iba od casti pred znakom '@', nesmie byt zavisla od zvysnej casti.
//Ak by e-mailova adresa obsahovala viacero znakov '@', tak do vypoctu zahrnte iba znaky pred prvym vyskytom znaku '@'.
//Ak by e-mailova adresa neobsahovala znak '@', tak hodnota hash-ovacej funkcie bude zavisiet od vsetkych znakov.
//Algoritmus pre vypocet hash-u vypocita sumu ASCII kodov znakov, z ktorej potom vypocita zvysok po deleni 11.
int hashEmailAddress(string emailAddress) {
	return -1; //tento riadok je len kvoli kompilacii
}

//---------- 2. a 3. uloha (2 body a 1 bod) -----------------------------------------------------------

//2) Doplnte a otestujte kopirovaci konstruktor triedy 'Polygon', ktory zabezpeci vytvorenie hlbokej kopie. (2 body)

//3) Doplnte destruktor triedy 'Polygon', ktory dealokuje dynamicky akokovanu pamat v konstruktoroch
//   Pouzite spravnu verziu operatora. (1 bod)

struct Position { //struktura reprezentuje poziciu bodu polygonu
	int x;
	int y;
};

class Polygon { //trieda reprezentuje polygon definovany postupnostou bodov
private:
	Position* points; //pozicie bodov polygonu
	int length; //pocet bodov polygonu
public:
	Polygon(int length) : length(length) {
		points = new Position[length];
		for (int i = 0; i < length; i++) {
			points[i].x = rand() % 10;
			points[i].y = rand() % 10;
		}
	}
	//TU DOPLNTE KOPIROVACI KONSTRUKTOR


	//TU DOPLNTE DESTRUKTOR


	void set(int index, int valueX, int valueY) {
		points[index].x = valueX;
		points[index].y = valueY;
	}
	string toString() { //funkcia vrati obsah polygonu ako string (pre testovacie ucely)
		ostringstream stream;
		for (int i = 0; i < length; i++) {
			stream << setw(3) << to_string(points[i].x) << ',' << setw(3) << to_string(points[i].y) << ", ";
		}
		return stream.str();
	}
};

//---------- 4. uloha (1 bod) ------------------------------------------------------------------------

//Doplnte a otestujte implementaciu funkcie 'append', ktora prida na koniec zoznamu 'data' hodnotu 100.
void append(list<int> & data) {

}

//---------- 5. uloha (1 bod) ------------------------------------------------------------------------

//Doplnte a otestujte implementaciu funkcie, ktora vrati pocet prvok zoznamu 'data' vacsich ako 500.
//V implementacii pouzite funkciu 'count_if'

int countGreaterThan500(list<int> data) {
	return -1; //tento riadok je len kvoli kompilacii
}

//---------- 6. uloha (2 body) ---------------------------------------------------------------

//Funkcia 'squareRoot' vrati druhu odmocninu vstupneho parametra 'number'.
//Doplnte a otestujte implementaciu funkcie tak, aby funkcia vyhodila vynimku typu 'invalid_argument' ak je hodnota 'number' mensia ako 0.
//Poznamka: konstruktor vynimky 'invalid_argument' musi mat zadany parameter.
double squareRoot(double number) throw (invalid_argument) {

	return sqrt(number);
}

//---------- 7. uloha (2 body) ------------------------------------------------------------

//Doplnte a otestujte implementaciu funkcie 'contains' vykonavajucej binarne hladavanie nad usporiadanym vektorom 'sortedVector'.
//Prvky su vo vstupnom vektore usporiadane od najmensieho po najvacsi.
//Funkcia vrati 'true' ak vstupny vektor obsahuje hodnotu 'number', inak vrati 'false'.
//Maximalny pocet iteracii/rekurzivnych volani musi byt logaritmus poctu prvkov vstupneho vektora.
bool contains(int number, vector<int> & sortedVector) {
	return -1; //tento riadok je len kvoli kompilacii
}

//-------------------------------------------------------------------------------------------

int main() {

	cout << "---- 1. uloha ----" << endl;
	string email1 = "peter@gmail.com";
	string email2 = "peter@is.stuba.sk";
	string email3 = "palo@gmail.com";
	string email4 = "email_bez_zavinacu";
	string email5 = "aaaa@b@c";
	cout << hashEmailAddress(email1) << " == 5" << endl;
	cout << hashEmailAddress(email2) << " == 5" << endl;
	cout << hashEmailAddress(email3) << " == 10" << endl;
	cout << hashEmailAddress(email4) << " == 4" << endl;
	cout << hashEmailAddress(email5) << " == 3" << endl;

	cout << "---- 2. uloha ----" << endl;
	Polygon p1(8);
	Polygon p2(p1);
	p1.set(1, 100, 200);
	p1.set(7, 300, 400);
	cout << p1.toString() << endl;
	cout << p2.toString() << endl;

	cout << "---- 4. uloha ----" << endl;
	list<int> data4append = { 6, 7, 1, 2 };
	append(data4append);
	for (int value : data4append) {
		cout << value << ", ";
	}
	cout << endl;

	cout << "---- 5. uloha ----" << endl;
	list<int> data5greater = { 1, 1001, 1005, 5, 6, 1007, 1009, 8, 2, 7, 3, 1004 };
	cout << countGreaterThan500(data5greater) << " == 5" << endl;

	cout << "---- 6. uloha ----" << endl;
	try {
		cout << squareRoot(4) << " == 2" << endl;
		cout << squareRoot(16) << " == 4" << endl;
	}
	catch (invalid_argument & exception) {
		cout << "ERROR: BOLA VYHODNA VYNIMKA " << exception.what() << endl;
	}
	try {
		cout << squareRoot(-1) << endl;
		cout << "ERROR: NEBOLA VYHODENA VYNIMKA" << endl;
	}
	catch (invalid_argument & exception) {
		cout << "OK: bola vyhodna vynimka " << exception.what() << endl;
	}

	cout << "---- 7. uloha ----" << endl;
	vector<int> v7 = { 10, 15, 20, 50, 60, 80, 90 };
	cout << contains(10, v7) << " == 1" << endl;
	cout << contains(15, v7) << " == 1" << endl;
	cout << contains(20, v7) << " == 1" << endl;
	cout << contains(50, v7) << " == 1" << endl;
	cout << contains(60, v7) << " == 1" << endl;
	cout << contains(80, v7) << " == 1" << endl;
	cout << contains(90, v7) << " == 1" << endl;
	cout << "-----" << endl;
	cout << contains( 1, v7) << " == 0" << endl;
	cout << contains(14, v7) << " == 0" << endl;
	cout << contains(51, v7) << " == 0" << endl;
	cout << contains(85, v7) << " == 0" << endl;
	cout << contains(100,v7) << " == 0" << endl;
	cout << "-----" << endl;
	vector<int> v71 = { 10 };
	cout << contains(10, v71) << " == 1" << endl;
	cout << "-----" << endl;
	cout << contains( 5, v71) << " == 0" << endl;
	cout << contains(15, v71) << " == 0" << endl;
	cout << "-----" << endl;
	vector<int> v70;
	cout << contains(10, v70) << " == 0" << endl;

	return EXIT_SUCCESS;
}