2 * Copyright (c) 2001-2005 The Regents of The University of Michigan
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 * Authors: Nathan Binkert
40 template<class> class Hash;
42 class Hash<std::string> {
44 unsigned operator()(const std::string &s) {
45 std::string::const_iterator i = s.begin();
46 std::string::const_iterator end = s.end();
50 hash = ((hash << 5) + hash) + *i++;
57 eat_lead_white(std::string &s)
59 std::string::size_type off = s.find_first_not_of(' ');
60 if (off != std::string::npos) {
61 std::string::iterator begin = s.begin();
62 s.erase(begin, begin + off);
67 eat_end_white(std::string &s)
69 std::string::size_type off = s.find_last_not_of(' ');
70 if (off != std::string::npos)
71 s.erase(s.begin() + off + 1, s.end());
75 eat_white(std::string &s)
82 to_lower(const std::string &s)
89 for (int i = 0; i < len; ++i)
90 lower.push_back(tolower(s[i]));
95 // Split the string s into lhs and rhs on the first occurence of the
98 split_first(const std::string &s, std::string &lhs, std::string &rhs, char c);
100 // Split the string s into lhs and rhs on the last occurence of the
103 split_last(const std::string &s, std::string &lhs, std::string &rhs, char c);
105 // Tokenize the string <s> splitting on the character <token>, and
106 // place the result in the string vector <vector>. If <ign> is true,
107 // then empty result strings (due to trailing tokens, or consecutive
108 // tokens) are skipped.
110 tokenize(std::vector<std::string> &vector, const std::string &s,
111 char token, bool ign = true);
113 template <class T> bool
114 to_number(const std::string &value, T &retval);
118 to_string(const T &value)
120 std::stringstream str;
125 // Put quotes around string arg if it contains spaces.
127 quote(const std::string &s)
130 bool quote = s.find(' ') != std::string::npos;