| // Copyright 2019 Google Inc. All rights reserved. | |
| // | |
| // Redistribution and use in source and binary forms, with or without | |
| // modification, are permitted provided that the following conditions are | |
| // met: | |
| // | |
| // * Redistributions of source code must retain the above copyright | |
| // notice, this list of conditions and the following disclaimer. | |
| // * Redistributions in binary form must reproduce the above | |
| // copyright notice, this list of conditions and the following disclaimer | |
| // in the documentation and/or other materials provided with the | |
| // distribution. | |
| // * Neither the name of Google Inc. nor the names of its | |
| // contributors may be used to endorse or promote products derived from | |
| // this software without specific prior written permission. | |
| // | |
| // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
| // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
| // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
| // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
| // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
| // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
| // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
| // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
| // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
| // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
| // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
| #include <assert.h> | |
| #include "tools/windows/converter_exe/tokenizer.h" | |
| namespace crash { | |
| // static | |
| void Tokenizer::Tokenize(const string& delimiters, const string& input, | |
| vector<string>* output) { | |
| assert(output); | |
| output->clear(); | |
| string::size_type position = 0; // Where to begin looking for a delimiter | |
| string::size_type new_position; // Position of found delimiter | |
| string token; | |
| while ((new_position = input.find_first_of(delimiters, position)) != | |
| string::npos) { | |
| token = input.substr(position, new_position - position); | |
| output->push_back(token); | |
| // Next time, begin looking right after this delimiter. | |
| position = new_position + 1; | |
| } | |
| // There are no more delimiters in the string. Take everything from the | |
| // final delimiter up to the end of the string as a token. This may be | |
| // an empty string. | |
| token = input.substr(position); | |
| output->push_back(token); | |
| } | |
| } // namespace crash |