| 1 | // [License]
|
---|
| 2 | // The Ariba-Underlay Copyright
|
---|
| 3 | //
|
---|
| 4 | // Copyright (c) 2008-2009, Institute of Telematics, UniversitÀt Karlsruhe (TH)
|
---|
| 5 | //
|
---|
| 6 | // Institute of Telematics
|
---|
| 7 | // UniversitÀt Karlsruhe (TH)
|
---|
| 8 | // Zirkel 2, 76128 Karlsruhe
|
---|
| 9 | // Germany
|
---|
| 10 | //
|
---|
| 11 | // Redistribution and use in source and binary forms, with or without
|
---|
| 12 | // modification, are permitted provided that the following conditions are
|
---|
| 13 | // met:
|
---|
| 14 | //
|
---|
| 15 | // 1. Redistributions of source code must retain the above copyright
|
---|
| 16 | // notice, this list of conditions and the following disclaimer.
|
---|
| 17 | // 2. Redistributions in binary form must reproduce the above copyright
|
---|
| 18 | // notice, this list of conditions and the following disclaimer in the
|
---|
| 19 | // documentation and/or other materials provided with the distribution.
|
---|
| 20 | //
|
---|
| 21 | // THIS SOFTWARE IS PROVIDED BY THE INSTITUTE OF TELEMATICS ``AS IS'' AND
|
---|
| 22 | // ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
---|
| 23 | // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
---|
| 24 | // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE ARIBA PROJECT OR
|
---|
| 25 | // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
---|
| 26 | // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
---|
| 27 | // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
---|
| 28 | // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
---|
| 29 | // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
---|
| 30 | // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
---|
| 31 | // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
---|
| 32 | //
|
---|
| 33 | // The views and conclusions contained in the software and documentation
|
---|
| 34 | // are those of the authors and should not be interpreted as representing
|
---|
| 35 | // official policies, either expressed or implied, of the Institute of
|
---|
| 36 | // Telematics.
|
---|
| 37 | // [License]
|
---|
| 38 |
|
---|
| 39 | #ifndef KEY_MAPPING_H__
|
---|
| 40 | #define KEY_MAPPING_H__
|
---|
| 41 |
|
---|
| 42 | #include <map>
|
---|
| 43 |
|
---|
| 44 | using std::map;
|
---|
| 45 | using std::pair;
|
---|
| 46 |
|
---|
| 47 | namespace ariba {
|
---|
| 48 | namespace utility {
|
---|
| 49 |
|
---|
| 50 | /**
|
---|
| 51 | * Template class for the administration
|
---|
| 52 | * of a mapping to an index key with networks
|
---|
| 53 | */
|
---|
| 54 | template<class T>
|
---|
| 55 | class KeyMapping {
|
---|
| 56 | private:
|
---|
| 57 | typedef map<T,unsigned long> KeyMap; //< maps an item to an id, e.g. a node pair to a linkid
|
---|
| 58 | typedef map<unsigned long, KeyMap> NetworkKeyMap; //< maps the network to the KeyMap, which map is responsible for this network?
|
---|
| 59 |
|
---|
| 60 | typedef typename KeyMap::iterator KeyMapIterator;
|
---|
| 61 | typedef typename NetworkKeyMap::iterator NetworkKeyMapIterator;
|
---|
| 62 |
|
---|
| 63 | NetworkKeyMap networkKeyMap;
|
---|
| 64 |
|
---|
| 65 | inline unsigned long nextid(){
|
---|
| 66 | return rand()+time(0);
|
---|
| 67 | }
|
---|
| 68 |
|
---|
| 69 | public:
|
---|
| 70 | inline KeyMapping(){
|
---|
| 71 | srand( time(NULL) );
|
---|
| 72 | }
|
---|
| 73 |
|
---|
| 74 | inline ~KeyMapping(){
|
---|
| 75 | }
|
---|
| 76 |
|
---|
| 77 | inline bool exists(unsigned long network, T item){
|
---|
| 78 |
|
---|
| 79 | NetworkKeyMapIterator i = networkKeyMap.find( network );
|
---|
| 80 | if( i == networkKeyMap.end()) return false;
|
---|
| 81 |
|
---|
| 82 | KeyMapIterator k = i->second.find( item );
|
---|
| 83 | return ( k != i->second.end() );
|
---|
| 84 | }
|
---|
| 85 |
|
---|
| 86 | inline unsigned long get(unsigned long network, T item){
|
---|
| 87 | assert( exists(network, item) );
|
---|
| 88 |
|
---|
| 89 | NetworkKeyMapIterator i = networkKeyMap.find( network );
|
---|
| 90 | KeyMapIterator k = i->second.find( item );
|
---|
| 91 |
|
---|
| 92 | return k->second;
|
---|
| 93 | }
|
---|
| 94 |
|
---|
| 95 | inline unsigned long insert(unsigned long network, T item){
|
---|
| 96 |
|
---|
| 97 | KeyMap* keyMap = NULL;
|
---|
| 98 |
|
---|
| 99 | // if we have no link map yet for this network,
|
---|
| 100 | // insert one and get the reference back to work with
|
---|
| 101 |
|
---|
| 102 | NetworkKeyMapIterator i = networkKeyMap.find( network );
|
---|
| 103 |
|
---|
| 104 | if( i == networkKeyMap.end() ){
|
---|
| 105 | pair<NetworkKeyMapIterator, bool> ret =
|
---|
| 106 | networkKeyMap.insert( make_pair(network,KeyMap()) );
|
---|
| 107 |
|
---|
| 108 | keyMap = &(ret.first->second);
|
---|
| 109 | } else {
|
---|
| 110 |
|
---|
| 111 | keyMap = &(i->second);
|
---|
| 112 | }
|
---|
| 113 |
|
---|
| 114 | unsigned long key = nextid();
|
---|
| 115 | keyMap->insert( make_pair( item, key) );
|
---|
| 116 |
|
---|
| 117 | assert( get(network,item) == key );
|
---|
| 118 | return key;
|
---|
| 119 | }
|
---|
| 120 |
|
---|
| 121 | inline void remove(unsigned long network, T item){
|
---|
| 122 | NetworkKeyMapIterator i = networkKeyMap.find( network );
|
---|
| 123 | if( i == networkKeyMap.end() ) return;
|
---|
| 124 |
|
---|
| 125 | i->second.erase( item );
|
---|
| 126 | }
|
---|
| 127 |
|
---|
| 128 | }; // class KeyMapping
|
---|
| 129 |
|
---|
| 130 | }} // namespave spovnet, common
|
---|
| 131 |
|
---|
| 132 | #endif // KEY_MAPPING_H__
|
---|
| 133 |
|
---|