School Commit Init

Anul 1/Semestrul 2/Data structures/Lab 4/Map.h

@@ -0,0 +1,66 @@
+#pragma once
+#include <utility>
+using namespace std;
+//DO NOT INCLUDE MAPITERATOR
+
+
+//DO NOT CHANGE THIS PART
+typedef int TKey;
+typedef int TValue;
+typedef std::pair<TKey, TValue> TElem;
+#define NULL_TVALUE -111111
+#define NULL_TELEM pair<TKey, TValue>(-111111, -111111)
+#define ALPHA 0.75
+#define INITIAL_CAPACITY 2300000
+class MapIterator;
+
+
+
+class Map {
+	//DO NOT CHANGE THIS PART
+	friend class MapIterator;
+
+	private:
+		//TODO - Representation
+		TElem* _elements;
+		int* _next;
+		int _size;
+		int _capacity;
+		int _nextFree;
+		void _resize();
+
+	public:
+
+	// implicit constructor
+	Map();
+
+	// adds a pair (key,value) to the map
+	//if the key already exists in the map, then the value associated to the key is replaced by the new value and the old value is returned
+	//if the key does not exist, a new pair is added and the value null is returned
+	TValue add(TKey c, TValue v);
+
+	//searches for the key and returns the value associated with the key if the map contains the key or null: NULL_TVALUE otherwise
+	TValue search(TKey c) const;
+
+	//removes a key from the map and returns the value associated with the key if the key existed ot null: NULL_TVALUE otherwise
+	TValue remove(TKey c);
+
+	//returns the number of pairs (key,value) from the map
+	int size() const;
+
+	//checks whether the map is empty or not
+	bool isEmpty() const;
+
+	//returns an iterator for the map
+	MapIterator iterator() const;
+
+
+	int getKeyRange() const;
+
+	// destructor
+	~Map();
+
+};
+
+
+