1. 1 Associative Containers Gordon College Prof. Brinton

2. 2 STL - Assoc. Containers Set –The key is the data set intSet; set keyword; set timeSet; To support the STL container - set; the programmer must overload the == operator and < operator by comparing the key field and giving a Boolean result.

3. 3 STL - Assoc. Containers Map –Stores entries as key-value pair. –In a pair, the first component is the key; the second is the value. Each component may have a different data type. map studentFile; studentFile[2343554] = new studentFile; studentFile[2343554].addToBalance(112);

4. 4 Set and Map Both containers do not allow duplicate keys. Multiset and multimap (also STL containers) allow duplicate keys)

5. 5 STL sets and maps

6. 6 STL Set include Constructors: set(); default - empty set set(T *first, T *last);use pointers or iterators Examples: set first; // empty set of ints int myints[]= {10,20,30,40,50}; set second (myints,myints+5); // pointers set third (second); // a copy of second set fourth (second.begin(), second.end()); // iterators into second

7. 7 STL Set include Operations: bool empty() const; void clear(); int size() const; int count(const T& key) const;//return either 1 or 0 iterator find(const T& key); const_iterator find(const T& key) const; // returns either an iterator or end() NOTE: STL Associative Containers iterators do access the elements in the defined order.

8. 8 STL Set include Operations: pair insert(const T& key); // this return a pair object Example: string t[]={"this","is","a","test"}; set s(t,t+4); pair ::iterator,bool> result = s.insert("OK"); (result.second)?cout << "TRUE":cout << "FALSE"; result = s.insert("OK"); (result.second)?cout << "TRUE":cout << "FALSE"; Result: TRUEFALSE

9. 9 STL Set include Operations: void erase ( iterator position ); void erase ( iterator first, iterator last ); size_type erase ( const key_type& x );//returns either 1 or 0 void swap ( set & st ); Obtaining the bounds: pair equal_range ( const key_type& x ) const; iterator lower_bound ( const key_type& x ) const; //iterator of first value not < x iterator upper_bound ( const key_type& x ) const; //iterator of first value > x

10. 10 STL Set include Iterators: iterator begin(); const_iterator begin(const); iterator end(); const_iterator end(const);

11. 11 Set operators Union setC = setA + setB; setC = 1 2 3 4 5 6 7 8 11 15 IntersectionA*B setC = setA * setB; setC = 3 5 7 8 11 Difference setC = setA - setB; setC = 1 4 1 4 3 5 7 8 11 3 5 7 8 15 2 6

12. 12 Map include Operations are like set’s operations –swap –begin –end –size –empty –operator[]//unlike set –find –erase See the following examples

13. 13 #include using namespace std; int main() { map Employees; Employees[5234] = "Mike C."; Employees[3374] = "Charlie M."; Employees[1923] = "David D."; Employees[7582] = "John A."; Employees[5328] = "Peter Q."; cout << "Employees[3374]=" << Employees[3374] << endl << endl; cout << "Map size: " << Employees.size() << endl; for( map ::iterator ii=Employees.begin(); ii!=Employees.end(); ++ii) { cout << (*ii).first << ": " << (*ii).second << endl; }

14. 14 #include using namespace std; int main() { map Employees; Employees[5234] = "Mike C."; Employees[3374] = "Charlie M."; Employees[1923] = "David D."; Employees[7582] = "John A."; Employees[5328] = "Peter Q."; cout << "Employees[3374]=" << Employees[3374] << endl << endl; cout << "Map size: " << Employees.size() << endl; for( map ::iterator ii=Employees.begin(); ii!=Employees.end(); ++ii) { cout << (*ii).first << ": " << (*ii).second << endl; } Employees[3374]=Charlie M. Map size: 5 1923: David D. 3374: Charlie M. 5234: Mike C. 5328: Peter Q. 7582: John A.

15. 15 #include using namespace std; int main() { map Employees; Employees["Mike C."] = 5234; Employees["Charlie M."] = 3374; Employees.insert(pair ("David D.",1923)); Employees.insert(map ::value_type("John A.",7582)); Employees.insert(make_pair("Peter Q.",5328)); cout << "Map size: " << Employees.size() << endl; for( map ::iterator ii=Employees.begin(); ii!=Employees.end(); ++ii) { cout << (*ii).first << ": " << (*ii).second << endl; }

16. 16 #include using namespace std; int main() { map Employees; Employees["Mike C."] = 5234; Employees["Charlie M."] = 3374; Employees.insert(pair ("David D.",1923)); Employees.insert(map ::value_type("John A.",7582)); Employees.insert(make_pair("Peter Q.",5328)); cout << "Map size: " << Employees.size() << endl; for( map ::iterator ii=Employees.begin(); ii!=Employees.end(); ++ii) { cout << (*ii).first << ": " << (*ii).second << endl; } Map size: 5 Charlie M.: 3374 David D.: 1923 John A.: 7582 Mike C.: 5234 Peter Q.: 5328

17. 17 struct cmp_str { bool operator()(char const *a, char const *b) { return strcmp(a, b) < 0; } }; int main() { map Employees; Employees["Mike C."] = 5234; Employees["Charlie M."] = 3374; Employees.insert(pair ("David D.",1923)); Employees.insert(map ::value_type("John A.",7582)); Employees.insert(make_pair((char *)"Peter Q.",5328)); cout << "Map size: " << Employees.size() << endl; for( map ::iterator ii=Employees.begin(); ii!=Employees.end(); ++ii) { cout << (*ii).first << ": " << (*ii).second << endl; }

18. 18 struct cmp_str { bool operator()(char const *a, char const *b) { return strcmp(a, b) < 0; } }; int main() { map Employees; Employees["Mike C."] = 5234; Employees["Charlie M."] = 3374; Employees.insert(pair ("David D.",1923)); Employees.insert(map ::value_type("John A.",7582)); Employees.insert(make_pair((char *)"Peter Q.",5328)); cout << "Map size: " << Employees.size() << endl; for( map ::iterator ii=Employees.begin(); ii!=Employees.end(); ++ii) { cout << (*ii).first << ": " << (*ii).second << endl; } Map size: 5 Charlie M.: 3374 David D.: 1923 John A.: 7582 Mike C.: 5234 Peter Q.: 5328 Could this be ordered differently?

19. 19 Map details Associative Arrays M[“Computer Science”] = 20; Keys are unique therefore: M[“Computer Science”] = 26; replaces the value in the tree for CS.

20. 20 Map details Creating a map: #include int main() { map A; …

21. 21 Map Details [ ] operator Steps 1.Search the for map for key 2.If key found, return a reference to the value object associated with key. 3.If key not found, create a new object of type value associated with key, and return a reference to that.

22. 22 Map Details [ ] operator int salary = Employee[“Jack Smith”]; Caution: this will create a new tree entry if it doesn’t exist and assign 0 to variable salary

23. 23 Map Details [ ] operator Better technique: if (( itr = Employee.find(“Jack Smith”)) == Employee.end()) cout << “ the employee does not exist.” << endl; Else cout second << endl;

24. 24 Map Details Pair Class 1. Contains two public members, first and second 2. Store key/value association itr->first itr->second

25. 25 Map Details Pair Class Easiest way to construct pair: pair a; a = make_pair(string(“Jack Smith”), int(100000));

26. 26 Map Details Element requirements: Each key and value must be assignable (an assignment operator which performs a “deep copy” Deep copy target of the assignment should be equal but independent of the source a = b; the value of a should match b - however if you change a it should not affect b (and vice versa) Note: if we talking about a linked list then a shallow copy would have two pointers pointing to the same list.

27. 27 Map Details Element requirements: Also each key should adhere to “weak ordering”: 1. A<A is false 2. Equality can be determined with (!(A<B) && !(B<A)) Note: only using the less than operator 3. If A<B and B<C then A<C must be true int, char, double, etc. (built-in types) are strict weak ordered

28. 28 Map Details Element requirements: value type used must have a defined default constructor. map The built in types have a type of default constructor: map

29. 29 Map Details OperationDescriptionTime Complexity swap Swaps elements with another map. This operation is performed in constant time. Ex: map1.swap(map2); O(1) begin Returns an iterator to the first pair in the map. Ex: itr = map1.begin(); O(1) end Returns an iterator just beyond the end of the map. O(1)

30. 30 Map Details OperationDescriptionTime Complexity size Returns the number of elements contained by the map. You should use empty() to test whether or not size equals 0, because empty() is faster. cout << map1.size(); O(n) empty Returns true if the map contains zero elements. O(1) Operator [ ]Accepts a key and returns a reference to the object associated with key. Note that this operator always creates an element associated with key if it does not exist. O(log n)

31. 31 Map Details OperationDescriptionTime Complexity find Accepts a key and returns an iterator to the pair element if found. If the key is not found in the map, this method returns end(). if ( (itr = map1.find("Bob")) == map1.end()) cerr << "Bob was not found in the map." << endl; else cout << "Bob was found in the map." << endl; O(log n)

32. 32 Map Details OperationDescriptionTime Complexity erase There are three overloaded forms of this method. The first accepts a single iterator, and removes the element implied by the iterator from the map. The map should be non-empty. O(1). map1.erase(map1.begin()); // remove the first element O(1)

33. 33 Map Details OperationDescriptionTime Complexity erase There are three overloaded forms of this method. The second accepts two iterators, that specify a range of values within the map to be removed. The time complexity is logarithmic plus linear time for the length of the sequence being removed. The two iterators must be valid iterators within the sequence contained by the map. Formally, the range of values [starting, ending) are removed. At worst, this is an O(n) operation. Ex: map1.erase(map1.begin(), map1.end()); // erase the entire map O(n)

34. 34 Map Details OperationDescriptionTime Complexity erase There are three overloaded forms of this method. The last accepts an object of the key type, and removes all occurrences of the key from map. Note that since map elements all have unique keys, this will erase at most 1 element. O(log n). Ex: map1.erase(string("Bob")); // removes all occurrences of "Bob" O(log n)

35. 35 Multimap/Multiset beginend rbeginrend clearempty count equal_rangelower_bound upper_bound insert erase find max_size operator= size swap

36. 36 Multimap/Multiset Details OperationDescription constructorcreates an empty multiset multiset S sizereturns the number of elements S.size() insertS.insert( const T& ) : adds an item to the set. If the item is already present, there will be multiple copies in the multiset/multimap S.insert(6);

37. 37 Multimap/Multiset Details OperationDescription countS.count( const T& t ) : returns the number of times that the item t is found in the set. This will be 0 if the item is not found eraseS.erase( const T& t ) : removes the all items equal to t from the multiset. eraseS.erase( multiset ::iterator i ) : removes the item pointed to by i. S.erase( v ); // ALL: removes all of items == v from the multiset S.erase( S.find( v ) ); // ONE: removes the first item == v from the multiset

38. 38 Multimap/Multiset Details OperationDescription reverse reverse( iterator begin, iterator end ) : reverses the order of the items: find S.find( const T& t ) : returns an iterator that points to the first item == t, or S.end() if the item could not be found.

39. 39 Multimap/Multiset Details OperationDescription equal_rangeS.equal_range(*iter) - returns a pair of iterators such that all occurrences of the item are in the iterator range pair ::iterator, multiset ::iterator > p; p = S.equal_range(5);

40. 40 Multimap/Multiset Details equal_range multiset ::iterator it; pair ::iterator,multiset ::iterator> ret; int myints[]= {77,30,16,2,30,30}; multiset mymultiset (myints, myints+6); // 2 16 30 30 30 77 ret = mymultiset.equal_range(30); for (it=ret.first; it!=ret.second; ++it) ++(*it); // 2 16 31 31 31 77

41. 41 Multimap/Multiset Details How is multiset implemented? Multiset: BST - with integer value representing each occurrence of the element insert {find - if not present create node else increment count} erase {remove node and report back count} 12 7 20 9 30 4 (2) (1) (5) (2) (3) (1) HOW WOULD THESE BE HANDLED? clearempty count find size

42. 42 Multimap/Multiset Details How is multimap implemented? Multimap: BST - with list or map as the node’s payload insert {find - if not present create node else add value to list/set} erase {remove node and report back count} HOW WOULD THESE BE HANDLED? clearempty count find size There is not guarantee as to order of duplicates 12 7 20 9 30 4 (“Tom” -> “Jack” -> “Joe”) (“Tom”) (“Jack” -> “Joe”) (“Jack”) (“Jack” -> “Joe”) (“Emma”)