src/base/str.cc

   1 /*
   2  * Copyright (c) 2001-2005 The Regents of The University of Michigan
   3  * All rights reserved.
   4  *
   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.
  15  *
  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.
  27  *
  28  * Authors: Nathan Binkert
  29  */
  30
  31 #include <string>
  32 #include <vector>
  33
  34 #include "base/str.hh"
  35
  36 using namespace std;
  37
  38 bool
  39 split_first(const string &s, string &lhs, string &rhs, char c)
  40 {
  41     string::size_type offset = s.find(c);
  42     if (offset == string::npos) {
  43         lhs = s;
  44         rhs = "";
  45         return false;
  46     }
  47
  48     lhs = s.substr(0, offset);
  49     rhs = s.substr(offset + 1);
  50     return true;
  51 }
  52
  53 bool
  54 split_last(const string &s, string &lhs, string &rhs, char c)
  55 {
  56     string::size_type offset = s.rfind(c);
  57     if (offset == string::npos) {
  58         lhs = s;
  59         rhs = "";
  60         return false;
  61     }
  62
  63     lhs = s.substr(0, offset);
  64     rhs = s.substr(offset + 1);
  65     return true;
  66 }
  67
  68 void
  69 tokenize(vector<string>& v, const string &s, char token, bool ignore)
  70 {
  71     string::size_type first = 0;
  72     string::size_type last = s.find_first_of(token);
  73
  74     if (s.empty())
  75         return;
  76
  77     if (ignore && last == first) {
  78         while (last == first)
  79             last = s.find_first_of(token, ++first);
  80
  81         if (last == string::npos) {
  82             if (first != s.size())
  83                 v.push_back(s.substr(first));
  84             return;
  85         }
  86     }
  87
  88     while (last != string::npos) {
  89         v.push_back(s.substr(first, last - first));
  90
  91         if (ignore) {
  92             first = s.find_first_not_of(token, last + 1);
  93
  94             if (first == string::npos)
  95                 return;
  96         } else
  97             first = last + 1;
  98
  99         last = s.find_first_of(token, first);
 100     }
 101
 102     v.push_back(s.substr(first));
 103 }