src/utils/TypeContainer.hpp

 /*
 * Copyright (c) 2005 The University of Notre Dame. All Rights Reserved.
 *
 * The University of Notre Dame grants you ("Licensee") a
 * non-exclusive, royalty free, license to use, modify and
 * redistribute this software in source and binary code form, provided
 * that the following conditions are met:
 *
 * 1. Acknowledgement of the program authors must be made in any
 *    publication of scientific results based in part on use of the
 *    program.  An acceptable form of acknowledgement is citation of
 *    the article in which the program was described (Matthew
 *    A. Meineke, Charles F. Vardeman II, Teng Lin, Christopher
 *    J. Fennell and J. Daniel Gezelter, "OOPSE: An Object-Oriented
 *    Parallel Simulation Engine for Molecular Dynamics,"
 *    J. Comput. Chem. 26, pp. 252-271 (2005))
 *
 * 2. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 *
 * 3. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the
 *    distribution.
 *
 * This software is provided "AS IS," without a warranty of any
 * kind. All express or implied conditions, representations and
 * warranties, including any implied warranty of merchantability,
 * fitness for a particular purpose or non-infringement, are hereby
 * excluded.  The University of Notre Dame and its licensors shall not
 * be liable for any damages suffered by licensee as a result of
 * using, modifying or distributing the software or its
 * derivatives. In no event will the University of Notre Dame or its
 * licensors be liable for any lost revenue, profit or data, or for
 * direct, indirect, special, consequential, incidental or punitive
 * damages, however caused and regardless of the theory of liability,
 * arising out of the use of or inability to use software, even if the
 * University of Notre Dame has been advised of the possibility of
 * such damages.
 */
 
 /**
  * @file TypeContainer.hpp
  * @author tlin
  * @date 11/04/2004
  * @time 13:51am
  * @version 1.0
  */

#ifndef UTILS_TYPECONTAINER_HPP
#define UTILS_TYPECONTAINER_HPP
#include <algorithm>
#include <map>
#include <vector>

#include "utils/Utility.hpp"

namespace oopse {

    /**
     * @class TypeContainer TypeContainer.hpp "utils/TypeContainer.hpp"
     */
    template<class ElemType, int SIZE>
    class TypeContainer {
        public:
            
            typedef ElemType* ElemPtr;
            typedef std::vector<std::string> KeyType;
            typedef typename KeyType::iterator KeyTypeIterator;
            typedef std::pair<int, ElemPtr> ValueType;
            typedef typename std::map<KeyType, ValueType> MapType;
            typedef typename std::map<KeyType, ValueType>::iterator MapTypeIterator;
            typedef typename MapType::value_type value_type;

            TypeContainer() : index_(0) {}
            
            ~TypeContainer() {
                MapTypeIterator i;
                for (i = data_.begin(); i != data_.end(); ++i) {
                    delete (i->second).second;
                }
                data_.clear();
            }
            
            bool add(KeyType& keys, ElemPtr elem) {
                assert(keys.size() == SIZE);
                assert(elem);
                return data_.insert(value_type(keys, std::make_pair(index_++,elem))).second;
            }

            /** Exact Match */
            ElemPtr find(KeyType& keys) {
                assert(keys.size() == SIZE);
                MapTypeIterator i;
                ValueType foundType;
                
                i = data_.find(keys);
                if (i != data_.end()) {
                    return (i->second).second;
                }

                KeyType reversedKeys = keys;
                std::reverse(reversedKeys.begin(), reversedKeys.end());

                i = data_.find(reversedKeys);
                if (i != data_.end()) {
                    return (i->second).second;
                } else {
                    return NULL;
                }
                
            }

            /**
             * @todo 
             */
            ElemPtr find(KeyType& keys, const std::string& wildCard) {
                assert(keys.size() == SIZE);
                
                std::vector<KeyTypeIterator> iterCont;
                KeyType replacedKey;
                MapTypeIterator i;
                std::vector<ValueType> foundTypes;
                
                while (replaceWithWildCard(iterCont, keys, replacedKey, wildCard)) {                    
                    i = data_.find(replacedKey);
                    if (i != data_.end()) {
                        foundTypes.push_back(i->second);
                    }
                }

                //reverse the order of keys
                KeyType reversedKeys = keys;
                std::reverse(reversedKeys.begin(), reversedKeys.end());

                //if the reversedKeys is the same as keys, just skip it
                if (reversedKeys != keys) {

                    
                    //empty the iterator container
                    iterCont.clear();

                    while (replaceWithWildCard(iterCont, reversedKeys, replacedKey, wildCard)) {
                        i = data_.find(replacedKey);
                        if (i != data_.end()) {
                            foundTypes.push_back(i->second);
                        }
                    }

                    //replaceWithWildCard can not generate this particular sequence, we have to 
                    //do it manually                
                    KeyType allWildCards(SIZE, wildCard);
                    i = data_.find(replacedKey);
                    if (i != data_.end()) {
                        foundTypes.push_back(i->second);
                    }

                }

                typename std::vector<ValueType>::iterator j;                
                j = std::min_element(foundTypes.begin(), foundTypes.end());

                return j == foundTypes.end() ? NULL : j->second;
            }

            unsigned int size() {
                return data_.size();
            }

            ElemPtr beginType(MapTypeIterator& i) {
                i = data_.begin();
                return i  != data_.end() ? (i->second).second : NULL;
            }

            ElemPtr nextType(MapTypeIterator& i) {
                ++i;
                return i  != data_.end() ? (i->second).second : NULL;
            }
            
        private:
            int index_;
            MapType data_;        
            
    };


}//end namespace oopse

#endif //UTILS_TYPECONTAINER_HPP
Revision:	2069
Committed:	Tue Mar 1 20:10:14 2005 UTC (19 years, 4 months ago) by tim
File size:	6812 byte(s)
Log Message:	fix compilation problem for g++ 3.4
#	User	Rev	Content
1	gezelter	1930	/*
2			* Copyright (c) 2005 The University of Notre Dame. All Rights Reserved.
3			*
4			* The University of Notre Dame grants you ("Licensee") a
5			* non-exclusive, royalty free, license to use, modify and
6			* redistribute this software in source and binary code form, provided
7			* that the following conditions are met:
8			*
9			* 1. Acknowledgement of the program authors must be made in any
10			* publication of scientific results based in part on use of the
11			* program. An acceptable form of acknowledgement is citation of
12			* the article in which the program was described (Matthew
13			* A. Meineke, Charles F. Vardeman II, Teng Lin, Christopher
14			* J. Fennell and J. Daniel Gezelter, "OOPSE: An Object-Oriented
15			* Parallel Simulation Engine for Molecular Dynamics,"
16			* J. Comput. Chem. 26, pp. 252-271 (2005))
17			*
18			* 2. Redistributions of source code must retain the above copyright
19			* notice, this list of conditions and the following disclaimer.
20			*
21			* 3. Redistributions in binary form must reproduce the above copyright
22			* notice, this list of conditions and the following disclaimer in the
23			* documentation and/or other materials provided with the
24			* distribution.
25			*
26			* This software is provided "AS IS," without a warranty of any
27			* kind. All express or implied conditions, representations and
28			* warranties, including any implied warranty of merchantability,
29			* fitness for a particular purpose or non-infringement, are hereby
30			* excluded. The University of Notre Dame and its licensors shall not
31			* be liable for any damages suffered by licensee as a result of
32			* using, modifying or distributing the software or its
33			* derivatives. In no event will the University of Notre Dame or its
34			* licensors be liable for any lost revenue, profit or data, or for
35			* direct, indirect, special, consequential, incidental or punitive
36			* damages, however caused and regardless of the theory of liability,
37			* arising out of the use of or inability to use software, even if the
38			* University of Notre Dame has been advised of the possibility of
39			* such damages.
40			*/
41
42			/**
43			* @file TypeContainer.hpp
44			* @author tlin
45			* @date 11/04/2004
46			* @time 13:51am
47			* @version 1.0
48			*/
49
50			#ifndef UTILS_TYPECONTAINER_HPP
51			#define UTILS_TYPECONTAINER_HPP
52			#include <algorithm>
53			#include <map>
54			#include <vector>
55
56			#include "utils/Utility.hpp"
57
58			namespace oopse {
59
60			/**
61			* @class TypeContainer TypeContainer.hpp "utils/TypeContainer.hpp"
62			*/
63			template<class ElemType, int SIZE>
64			class TypeContainer {
65			public:
66
67			typedef ElemType* ElemPtr;
68			typedef std::vector<std::string> KeyType;
69			typedef typename KeyType::iterator KeyTypeIterator;
70			typedef std::pair<int, ElemPtr> ValueType;
71	tim	2069	typedef typename std::map<KeyType, ValueType> MapType;
72	gezelter	1930	typedef typename std::map<KeyType, ValueType>::iterator MapTypeIterator;
73	tim	2069	typedef typename MapType::value_type value_type;
74	gezelter	1930
75			TypeContainer() : index_(0) {}
76
77			~TypeContainer() {
78			MapTypeIterator i;
79			for (i = data_.begin(); i != data_.end(); ++i) {
80			delete (i->second).second;
81			}
82			data_.clear();
83			}
84
85			bool add(KeyType& keys, ElemPtr elem) {
86			assert(keys.size() == SIZE);
87			assert(elem);
88	tim	2069	return data_.insert(value_type(keys, std::make_pair(index_++,elem))).second;
89	gezelter	1930	}
90
91			/** Exact Match */
92			ElemPtr find(KeyType& keys) {
93			assert(keys.size() == SIZE);
94			MapTypeIterator i;
95			ValueType foundType;
96
97			i = data_.find(keys);
98			if (i != data_.end()) {
99			return (i->second).second;
100			}
101
102			KeyType reversedKeys = keys;
103			std::reverse(reversedKeys.begin(), reversedKeys.end());
104
105			i = data_.find(reversedKeys);
106			if (i != data_.end()) {
107			return (i->second).second;
108			} else {
109			return NULL;
110			}
111
112			}
113
114			/**
115			* @todo
116			*/
117			ElemPtr find(KeyType& keys, const std::string& wildCard) {
118			assert(keys.size() == SIZE);
119
120			std::vector<KeyTypeIterator> iterCont;
121			KeyType replacedKey;
122			MapTypeIterator i;
123			std::vector<ValueType> foundTypes;
124
125			while (replaceWithWildCard(iterCont, keys, replacedKey, wildCard)) {
126			i = data_.find(replacedKey);
127			if (i != data_.end()) {
128			foundTypes.push_back(i->second);
129			}
130			}
131
132			//reverse the order of keys
133			KeyType reversedKeys = keys;
134			std::reverse(reversedKeys.begin(), reversedKeys.end());
135
136			//if the reversedKeys is the same as keys, just skip it
137			if (reversedKeys != keys) {
138
139
140			//empty the iterator container
141			iterCont.clear();
142
143			while (replaceWithWildCard(iterCont, reversedKeys, replacedKey, wildCard)) {
144			i = data_.find(replacedKey);
145			if (i != data_.end()) {
146			foundTypes.push_back(i->second);
147			}
148			}
149
150			//replaceWithWildCard can not generate this particular sequence, we have to
151			//do it manually
152			KeyType allWildCards(SIZE, wildCard);
153			i = data_.find(replacedKey);
154			if (i != data_.end()) {
155			foundTypes.push_back(i->second);
156			}
157
158			}
159
160			typename std::vector<ValueType>::iterator j;
161			j = std::min_element(foundTypes.begin(), foundTypes.end());
162
163			return j == foundTypes.end() ? NULL : j->second;
164			}
165
166			unsigned int size() {
167			return data_.size();
168			}
169
170			ElemPtr beginType(MapTypeIterator& i) {
171			i = data_.begin();
172			return i != data_.end() ? (i->second).second : NULL;
173			}
174
175			ElemPtr nextType(MapTypeIterator& i) {
176			++i;
177			return i != data_.end() ? (i->second).second : NULL;
178			}
179
180			private:
181			int index_;
182			MapType data_;
183
184			};
185
186
187			}//end namespace oopse
188
189			#endif //UTILS_TYPECONTAINER_HPP