bpp-core  2.2.0
StringTokenizer.cpp
Go to the documentation of this file.
1 //
2 // File: StringTokenizer.cpp
3 // Author : Julien Dutheil
4 // Sylvain Gaillard
5 // Last modification : Monday September 20 2004
6 //
7 
8 /*
9 Copyright or © or Copr. Bio++ Development Team, (November 17, 2004)
10 
11 This software is a computer program whose purpose is to provide utilitary
12 classes. This file belongs to the Bio++ Project.
13 
14 This software is governed by the CeCILL license under French law and
15 abiding by the rules of distribution of free software. You can use,
16 modify and/ or redistribute the software under the terms of the CeCILL
17 license as circulated by CEA, CNRS and INRIA at the following URL
18 "http://www.cecill.info".
19 
20 As a counterpart to the access to the source code and rights to copy,
21 modify and redistribute granted by the license, users are provided only
22 with a limited warranty and the software's author, the holder of the
23 economic rights, and the successive licensors have only limited
24 liability.
25 
26 In this respect, the user's attention is drawn to the risks associated
27 with loading, using, modifying and/or developing or reproducing the
28 software by the user in light of its specific status of free software,
29 that may mean that it is complicated to manipulate, and that also
30 therefore means that it is reserved for developers and experienced
31 professionals having in-depth computer knowledge. Users are therefore
32 encouraged to load and test the software's suitability as regards their
33 requirements in conditions enabling the security of their systems and/or
34 data to be ensured and, more generally, to use and operate it in the
35 same conditions as regards security.
36 
37 The fact that you are presently reading this means that you have had
38 knowledge of the CeCILL license and that you accept its terms.
39 */
40 
41 #include "StringTokenizer.h"
42 
43 using namespace bpp;
44 using namespace std;
45 
46 StringTokenizer::StringTokenizer(const std::string& s, const std::string& delimiters, bool solid, bool allowEmptyTokens):
47  tokens_(),
48  splits_(),
49  currentPosition_(0)
50 {
51  if (!solid)
52  {
53  string::size_type index = s.find_first_not_of(delimiters, 0);
54  while( index != s.npos)
55  {
56  string::size_type newIndex = s.find_first_of(delimiters, index);
57  if (newIndex != s.npos)
58  {
59  tokens_.push_back(s.substr(index, newIndex - index));
60  if (!allowEmptyTokens) index = s.find_first_not_of(delimiters, newIndex);
61  else index = newIndex + 1;
62  splits_.push_back(s.substr(newIndex, index - newIndex));
63  }
64  else
65  {
66  tokens_.push_back(s.substr(index));
67  index = newIndex;
68  }
69  }
70  }
71  else
72  {
73  string::size_type index = 0;
74  while (index != s.npos)
75  {
76  string::size_type newIndex = s.find(delimiters, index);
77  if (newIndex != s.npos)
78  {
79  tokens_.push_back(s.substr(index, newIndex - index));
80  if (!allowEmptyTokens)
81  {
82  index = newIndex + delimiters.size();
83  while (index != string::npos && s.substr(index, delimiters.size()) == delimiters)
84  index += delimiters.size();
85  }
86  else index = newIndex + delimiters.size();
87  splits_.push_back(s.substr(newIndex, index - newIndex));
88  }
89  else
90  {
91  tokens_.push_back(s.substr(index));
92  index = newIndex;
93  }
94  }
95  }
96 }
97 
98 const std::string& StringTokenizer::nextToken() throw (Exception)
99 {
100  if (!hasMoreToken()) throw Exception("No more token in tokenizer.");
101  return tokens_[currentPosition_++];
102 }
103 
105 {
106  for (size_t i = tokens_.size(); i > currentPosition_; i--)
107  {
108  if (tokens_[i - 1] == "") tokens_.erase(tokens_.begin() + static_cast<ptrdiff_t>(i - 1));
109  }
110 }
111 
113 {
114  string s;
115  for (size_t i = currentPosition_; i < tokens_.size() - 1; ++i) {
116  s += tokens_[i] + splits_[i];
117  }
118  if (numberOfRemainingTokens() > 0)
119  s += tokens_.back();
120  return s;
121 }
122 
This class allows to perform a correspondence analysis.
bool hasMoreToken() const
Tell if some tokens are still available.
STL namespace.
const std::string & nextToken()
Get the next available token. If no token is availbale, throw an Exception.
size_t numberOfRemainingTokens() const
Tell how many tokens are available.
void removeEmptyTokens()
remove all empty token from the current position.
std::deque< std::string > tokens_
Where the tokens are stored.
Exception base class.
Definition: Exceptions.h:57
std::string unparseRemainingTokens() const
std::deque< std::string > splits_
size_t currentPosition_
the current position in the token list.