| |
| | KCGL1 Help CXXLSTD Containers multiset (Site not responding. Last check: 2007-10-13) |
 | | Constructs an empty multiset which will use the optional relation comp to order keys, if it is supplied, and the allocator alloc for all storage management. |
 | | iterator erase(iterator first, iterator last); Providing the iterators first and last point to the same multiset and last is reachable from first, all elements in the range (first, last) will be deleted from the multiset. |
 | | For example, if your compiler does not support member function templates, you can construct a multiset in the following two ways: int intarray[10]; multiset first_multiset(intarray, intarray +10); multiset second_multiset(first_multiset.begin(), first_multiset.end()); but not this way: multiset long_multiset(first_multiset.begin(),first_multiset.end()); since the long_multiset and first_multiset are not the same type. |
| cctr.umkc.edu /HELP/CXXLSTD/CONTAINERS/MULTISET (1116 words) |
|