/* * Copyright (C) 2002 Daniel Heck * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * as published by the Free Software Foundation; either version 2 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License along * with this program; if not, write to the Free Software Foundation, Inc., * 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA. */ #ifndef PX_ALIST_HH #define PX_ALIST_HH /* * This file defines STL-like associative lists (similar to the ones * found in Lisp dialects, but with a C++-ish look and feel. They can * be used as a std::map replacement when linear searches aren't * expensive. */ #include #include #include namespace px { template class AList : public std::list > { public: typedef KEY key_type; typedef std::pair value_type; typedef typename std::list::iterator iterator; typedef typename std::list::const_iterator const_iterator; // // Lookup of keys // iterator find (const key_type &key) { iterator i=begin(), e=end(); for (; i!=e; ++i) if (i->first == key) break; return i; } const_iterator find (const key_type &key) const { const_iterator i=begin(), e=end(); for (; i!=e; ++i) if (i->first == key) break; return i; } VAL &operator[] (const key_type &key) { iterator i=find(key); if (i==end()) i=insert(end(), make_pair(key, VAL())); return i->second; } }; } #endif