/* * Phusion Passenger - http://www.modrails.com/ * Copyright (c) 2011 Phusion * * "Phusion Passenger" is a trademark of Hongli Lai & Ninh Bui. * * Permission is hereby granted, free of charge, to any person obtaining a copy * of this software and associated documentation files (the "Software"), to deal * in the Software without restriction, including without limitation the rights * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell * copies of the Software, and to permit persons to whom the Software is * furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included in * all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN * THE SOFTWARE. */ #ifndef _PASSENGER_STRING_MAP_H_ #define _PASSENGER_STRING_MAP_H_ #include #include #include #include namespace Passenger { using namespace std; /** * An efficient map with string keys. map forces one to construct an * std::string object when looking up the map. StringMap interns all keys and * allows lookups without constructing an std::string key. * * StringMap requires the following properties on T: * - T's default constructor must be cheap, otherwise set() can be a bit slow. * - T must support operator=(). */ template class StringMap { private: struct Entry { string key; T value; }; typedef map InternalMap; typedef typename InternalMap::iterator Iterator; typedef typename InternalMap::const_iterator ConstIterator; typedef typename InternalMap::value_type ValueType; InternalMap store; public: T get(const StaticString &key) const { ConstIterator it = store.find(key); if (it == store.end()) { return T(); } else { return it->second.value; } } bool set(const StaticString &key, const T &value) { pair result = store.insert(make_pair(key, Entry())); if (result.second) { // Key has been inserted. Copy it internally and point key // to the copy. ValueType &node = *result.first; StaticString &originalKey = const_cast(node.first); Entry &entry = node.second; entry.key = key; entry.value = value; originalKey = entry.key; return true; } else { // Key already exists. Update value. Entry &entry = result.first->second; entry.value = value; return false; } } bool remove(const StaticString &key) { return store.erase(key) > 0; } }; } // namespace Passenger #endif /* _PASSENGER_STRING_MAP_H_ */