C++ Library containing a lot of needful things: Stack Trace, Command Line Parser, Resource Handling, Configuration Files, Unix Command Execution, Directories, Regular Expressions, Tokenizer, Function Trace, Standard Extensions.
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
130 lines
3.5 KiB
130 lines
3.5 KiB
/** @file |
|
|
|
$Id$ |
|
|
|
$Date$ |
|
$Author$ |
|
|
|
@copy © Marc Wäckerlin |
|
@license LGPL, see file <a href="license.html">COPYING</a> |
|
|
|
$Log$ |
|
Revision 1.4 2005/11/29 12:39:42 marc |
|
make it compilable with gcc 4.0.2 and newer doxygen |
|
|
|
Revision 1.3 2005/04/07 20:48:20 marc |
|
docu: new doxygen, new grouping |
|
|
|
Revision 1.2 2004/12/20 07:40:35 marc |
|
documentation improved, new grouping |
|
|
|
Revision 1.1 2004/10/07 09:31:30 marc |
|
new feature |
|
|
|
|
|
*/ |
|
#ifndef __MRW__MAP__HPP__ |
|
#define __MRW__MAP__HPP__ |
|
|
|
#include <map> |
|
#include <mrw/checkcxx11.hxx> |
|
#include <mrw/exception.hxx> |
|
#include <mrw/string.hxx> |
|
|
|
/** @addtogroup StdExtSTL |
|
*/ |
|
//@{ |
|
/** @defgroup StdExtmap map |
|
*/ |
|
//@{ |
|
|
|
/** @brief insert a value in a map |
|
|
|
@code |
|
std::map<int, std::string> test; |
|
test<<std::make_pair(1, std::string("one")) |
|
<<std::make_pair(2, std::string("two")); |
|
@endcode |
|
|
|
@throw mrw::invalid_argument, if element is already in map |
|
@param l a map of values |
|
@param o a value to be inserted into map @c l |
|
@pre \#include <mrw/map.hxx> |
|
*/ |
|
template <typename K, typename T, class C, typename A> |
|
std::map<K, T, C, A>& operator<<(std::map<K, T, C, A>& l, |
|
const std::pair<K, T>& o) |
|
{ |
|
if (!l.insert(o).second) |
|
throw mrw::invalid_argument(std::string(__FILE__ ":")+__LINE__+ |
|
": std::map<>&" |
|
" operator<<(std::map<>&, const T&)," |
|
"map element already exists"); |
|
return l; |
|
} |
|
|
|
/** @brief insert a value in a map |
|
|
|
Makes a copy and returns the copy. |
|
|
|
@code |
|
std::map<int, std::string>() |
|
<<std::make_pair(1, std::string("one")) |
|
<<std::make_pair(2, std::string("two")); |
|
@endcode |
|
|
|
@throw mrw::invalid_argument, if element is already in map |
|
@param l a map of values |
|
@param o a value to be inserted into map @c l |
|
@pre \#include <mrw/map.hxx> |
|
*/ |
|
template <typename K, typename T, class C, typename A> |
|
std::map<K, T, C, A> operator<<(const std::map<K, T, C, A>& l, |
|
const std::pair<K, T>& o) |
|
{ |
|
std::map<K, T, C, A> copy(l); |
|
if (!copy.insert(o).second) |
|
throw mrw::invalid_argument(std::string(__FILE__ ":")+__LINE__+ |
|
": std::map<>&" |
|
" operator<<(std::map<>&, const T&)," |
|
"map element already exists"); |
|
return copy; |
|
} |
|
|
|
/** @brief extract the first value of a map |
|
|
|
@code |
|
std::map<int, std::string> test; |
|
test<<std::make_pair(1, std::string("one")) |
|
<<std::make_pair(2, std::string("two")); |
|
std::pair<int, std::string> i1, i2; |
|
test>>i1>>i2; |
|
// now: i1==(1, "one") i2==(2, "two") test=={} |
|
@endcode |
|
|
|
@param l a map of values |
|
@param o a value to be extracted from map @c l |
|
@throw mrw::length_error, if map was empty on entry |
|
@note when something is extracted from a map, it is removed |
|
from the map, that means after every shift the map is |
|
shortened by the shifted element |
|
@pre \#include <mrw/map.hxx> |
|
*/ |
|
template <typename K, typename T, class C, typename A> |
|
std::map<K, T, C, A>& operator>>(std::map<K, T, C, A>& l, |
|
std::pair<K, T>& o) |
|
{ |
|
typename std::map<K, T, C, A>::iterator it(l.begin()); |
|
if (it==l.end()) |
|
throw mrw::length_error(std::string(__FILE__ ":")+__LINE__+ |
|
": std::map<>& operator>>(std::map<>&, T&)," |
|
" map is empty"); |
|
o = *it; |
|
l.erase(it); |
|
return l; |
|
} |
|
|
|
//@} |
|
//@} |
|
|
|
#endif
|
|
|