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;
    }

    bool replace(KeyType& keys, ElemPtr elem) {
      assert(keys.size() == SIZE);
      assert(elem);     

      MapTypeIterator i;
      i = data_.find(keys);
      if (i!=data_.end()) {
        data_[keys] = std::make_pair((i->second).first, elem);
        return true;
      } else {
        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:	3437
Committed:	Wed Jul 30 18:11:19 2008 UTC (15 years, 11 months ago) by gezelter
File size:	6100 byte(s)
Log Message:	Many fixes
#	User	Rev	Content
1	gezelter	2204	/*
2	gezelter	1930	* 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	gezelter	2204	/**
43			* @file TypeContainer.hpp
44			* @author tlin
45			* @date 11/04/2004
46			* @time 13:51am
47			* @version 1.0
48			*/
49	gezelter	1930
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	gezelter	2204	/**
61			* @class TypeContainer TypeContainer.hpp "utils/TypeContainer.hpp"
62			*/
63			template<class ElemType, int SIZE>
64			class TypeContainer {
65			public:
66	gezelter	1930
67	gezelter	2204	typedef ElemType* ElemPtr;
68			typedef std::vector<std::string> KeyType;
69			typedef typename KeyType::iterator KeyTypeIterator;
70			typedef std::pair<int, ElemPtr> ValueType;
71			typedef typename std::map<KeyType, ValueType> MapType;
72			typedef typename std::map<KeyType, ValueType>::iterator MapTypeIterator;
73			typedef typename MapType::value_type value_type;
74	gezelter	1930
75	gezelter	2204	TypeContainer() : index_(0) {}
76	gezelter	1930
77	gezelter	2204	~TypeContainer() {
78			MapTypeIterator i;
79			for (i = data_.begin(); i != data_.end(); ++i) {
80			delete (i->second).second;
81			}
82			data_.clear();
83			}
84	gezelter	1930
85	gezelter	2204	bool add(KeyType& keys, ElemPtr elem) {
86			assert(keys.size() == SIZE);
87			assert(elem);
88			return data_.insert(value_type(keys, std::make_pair(index_++,elem))).second;
89			}
90	gezelter	1930
91	gezelter	3437	bool replace(KeyType& keys, ElemPtr elem) {
92			assert(keys.size() == SIZE);
93			assert(elem);
94
95			MapTypeIterator i;
96			i = data_.find(keys);
97			if (i!=data_.end()) {
98			data_[keys] = std::make_pair((i->second).first, elem);
99			return true;
100			} else {
101			return data_.insert(value_type(keys, std::make_pair(index_++,elem))).second;
102			}
103			}
104
105	gezelter	2204	/** Exact Match */
106			ElemPtr find(KeyType& keys) {
107			assert(keys.size() == SIZE);
108			MapTypeIterator i;
109			ValueType foundType;
110	gezelter	1930
111	gezelter	2204	i = data_.find(keys);
112			if (i != data_.end()) {
113			return (i->second).second;
114			}
115	gezelter	1930
116	gezelter	2204	KeyType reversedKeys = keys;
117			std::reverse(reversedKeys.begin(), reversedKeys.end());
118	gezelter	1930
119	gezelter	2204	i = data_.find(reversedKeys);
120			if (i != data_.end()) {
121			return (i->second).second;
122			} else {
123			return NULL;
124			}
125	gezelter	1930
126	gezelter	2204	}
127	gezelter	1930
128	gezelter	2204	/**
129			* @todo
130			*/
131			ElemPtr find(KeyType& keys, const std::string& wildCard) {
132			assert(keys.size() == SIZE);
133	gezelter	1930
134	gezelter	2204	std::vector<KeyTypeIterator> iterCont;
135			KeyType replacedKey;
136			MapTypeIterator i;
137			std::vector<ValueType> foundTypes;
138	gezelter	1930
139	gezelter	2204	while (replaceWithWildCard(iterCont, keys, replacedKey, wildCard)) {
140			i = data_.find(replacedKey);
141			if (i != data_.end()) {
142			foundTypes.push_back(i->second);
143			}
144			}
145	gezelter	1930
146	gezelter	2204	//reverse the order of keys
147			KeyType reversedKeys = keys;
148			std::reverse(reversedKeys.begin(), reversedKeys.end());
149	gezelter	1930
150	gezelter	2204	//if the reversedKeys is the same as keys, just skip it
151			if (reversedKeys != keys) {
152	gezelter	1930
153
154	gezelter	2204	//empty the iterator container
155			iterCont.clear();
156	gezelter	1930
157	gezelter	2204	while (replaceWithWildCard(iterCont, reversedKeys, replacedKey, wildCard)) {
158			i = data_.find(replacedKey);
159			if (i != data_.end()) {
160			foundTypes.push_back(i->second);
161			}
162			}
163	gezelter	1930
164	gezelter	2204	//replaceWithWildCard can not generate this particular sequence, we have to
165			//do it manually
166			KeyType allWildCards(SIZE, wildCard);
167			i = data_.find(replacedKey);
168			if (i != data_.end()) {
169			foundTypes.push_back(i->second);
170			}
171	gezelter	1930
172	gezelter	2204	}
173	gezelter	1930
174	gezelter	2204	typename std::vector<ValueType>::iterator j;
175			j = std::min_element(foundTypes.begin(), foundTypes.end());
176	gezelter	1930
177	gezelter	2204	return j == foundTypes.end() ? NULL : j->second;
178			}
179	gezelter	1930
180	gezelter	2204	unsigned int size() {
181			return data_.size();
182			}
183	gezelter	1930
184	gezelter	2204	ElemPtr beginType(MapTypeIterator& i) {
185			i = data_.begin();
186			return i != data_.end() ? (i->second).second : NULL;
187			}
188	gezelter	1930
189	gezelter	2204	ElemPtr nextType(MapTypeIterator& i) {
190			++i;
191			return i != data_.end() ? (i->second).second : NULL;
192			}
193	gezelter	1930
194	gezelter	2204	private:
195			int index_;
196			MapType data_;
197	gezelter	1930
198	gezelter	2204	};
199	gezelter	1930
200
201			}//end namespace oopse
202
203			#endif //UTILS_TYPECONTAINER_HPP