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