src/s2string.cc

   1 /*
   2  * See s2string.hh for more information about this file.
   3  *
   4  * Copyright (C) 2008 David Kolossa
   5  *
   6  * This file is part of OpenStranded.
   7  *
   8  * OpenStranded is free software; you can redistribute it and/or modify
   9  * it under the terms of the GNU General Public License as published by
  10  * the Free Software Foundation, either version 3 of the License, or
  11  * (at your option) any later version.
  12  *
  13  * OpenStranded is distributed in the hope that it will be useful,
  14  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  16  * GNU General Public License for more details.
  17  *
  18  * You should have received a copy of the GNU General Public License
  19  * along with OpenStranded. If not, see <http://www.gnu.org/licenses/>.
  20  */
  21
  22 #include "s2string.hh"
  23
  24 int
  25 s2str::explode (std::string &str, std::string *buf, const char *token, size_t count)
  26 {
  27         std::vector<size_t> tokenPos (1, 0);
  28         int warnFlag = 0;
  29
  30         while (str.find (token, tokenPos.back () ) != std::string::npos)
  31         {
  32                 tokenPos.push_back (str.find (token, tokenPos.back () ));
  33                 str.erase (tokenPos.back (), 1);
  34         }
  35
  36         // the number of commas in str has to be one lower than count
  37         // but because of the additional entry for position 0, the size of the
  38         // vector has to be count
  39         if (tokenPos.size () < count)
  40         {
  41                 warnFlag |= EXPLODE_LOWER;      // number of substrings lower than count
  42         }
  43
  44         if (tokenPos.size () > count)
  45         {
  46                 warnFlag |= EXPLODE_GREATER;    // number of substrings greater than count
  47         }
  48
  49         // Catch the special case that no token occured
  50         if (tokenPos.size () == 1)
  51         {
  52                 buf[0] = str;
  53                 warnFlag |= EXPLODE_NO_TOKEN;
  54         }
  55         else
  56         {
  57                 for (int i=0; i < (int) count; i++)
  58                 {
  59                         buf[i] = str.substr (tokenPos[i], (tokenPos[i+1] - tokenPos[i]));
  60                 }
  61         }
  62
  63         return warnFlag;
  64 }
  65
  66
  67 bool
  68 s2str::stof (std::string &str, float &buf)
  69 {
  70         std::istringstream stream;
  71         bool pointOccured = false;
  72
  73         for (std::string::iterator c = str.begin (); c != str.end (); c++)
  74         {
  75                 if ( (*c >= '0' && *c <= '9') || (*c == '.' && !pointOccured) )
  76                 {
  77                         continue;
  78                 }
  79                 else if (*c == ' ' || *c == '\t')
  80                 {
  81                         str.erase (c--);
  82                         continue;
  83                 }
  84                 else
  85                 {
  86                         buf = 0.0;
  87                         return false;
  88                 }
  89         }
  90         stream.str (str);
  91         stream >> buf;
  92         return true;
  93 }
  94
  95
  96 bool
  97 s2str::stoi (std::string &str, int &buf)
  98 {
  99         std::istringstream stream;
 100
 101         for (std::string::iterator c = str.begin (); c != str.end (); c++)
 102         {
 103                 if (*c >= '0' && *c <= '9')
 104                 {
 105                         continue;
 106                 }
 107                 else if (*c == ' ' || *c == '\t')
 108                 {
 109                         str.erase (c--);
 110                         continue;
 111                 }
 112                 else
 113                 {
 114                         buf = 0;
 115                         return false;
 116                 }
 117         }
 118         stream.str (str);
 119         stream >> buf;
 120         return true;
 121 }