| OLD | NEW |
| (Empty) |
| 1 /* | |
| 2 * Copyright (C) 2013 Google Inc. All rights reserved. | |
| 3 * | |
| 4 * Redistribution and use in source and binary forms, with or without | |
| 5 * modification, are permitted provided that the following conditions are | |
| 6 * met: | |
| 7 * | |
| 8 * * Redistributions of source code must retain the above copyright | |
| 9 * notice, this list of conditions and the following disclaimer. | |
| 10 * * Redistributions in binary form must reproduce the above | |
| 11 * copyright notice, this list of conditions and the following disclaimer | |
| 12 * in the documentation and/or other materials provided with the | |
| 13 * distribution. | |
| 14 * * Neither the name of Google Inc. nor the names of its | |
| 15 * contributors may be used to endorse or promote products derived from | |
| 16 * this software without specific prior written permission. | |
| 17 * | |
| 18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
| 19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
| 20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
| 21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
| 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
| 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
| 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
| 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
| 29 */ | |
| 30 | |
| 31 #ifndef ParsingUtilities_h | |
| 32 #define ParsingUtilities_h | |
| 33 | |
| 34 template<typename CharType> | |
| 35 bool skipExactly(const CharType*& position, const CharType* end, CharType delimi
ter) | |
| 36 { | |
| 37 if (position < end && *position == delimiter) { | |
| 38 ++position; | |
| 39 return true; | |
| 40 } | |
| 41 return false; | |
| 42 } | |
| 43 | |
| 44 template<typename CharType, bool characterPredicate(CharType)> | |
| 45 bool skipExactly(const CharType*& position, const CharType* end) | |
| 46 { | |
| 47 if (position < end && characterPredicate(*position)) { | |
| 48 ++position; | |
| 49 return true; | |
| 50 } | |
| 51 return false; | |
| 52 } | |
| 53 | |
| 54 template <typename CharType> | |
| 55 bool skipToken(const CharType*& position, const CharType* end, const char* token
) | |
| 56 { | |
| 57 const CharType* current = position; | |
| 58 while (current < end && *token) { | |
| 59 if (*current != *token) | |
| 60 return false; | |
| 61 ++current; | |
| 62 ++token; | |
| 63 } | |
| 64 if (*token) | |
| 65 return false; | |
| 66 | |
| 67 position = current; | |
| 68 return true; | |
| 69 } | |
| 70 | |
| 71 template <typename CharType> | |
| 72 void skipUntil(const CharType*& position, const CharType* end, CharType delimite
r) | |
| 73 { | |
| 74 while (position < end && *position != delimiter) | |
| 75 ++position; | |
| 76 } | |
| 77 | |
| 78 template<typename CharType, bool characterPredicate(CharType)> | |
| 79 void skipUntil(const CharType*& position, const CharType* end) | |
| 80 { | |
| 81 while (position < end && !characterPredicate(*position)) | |
| 82 ++position; | |
| 83 } | |
| 84 | |
| 85 template<typename CharType, bool characterPredicate(CharType)> | |
| 86 void skipWhile(const CharType*& position, const CharType* end) | |
| 87 { | |
| 88 while (position < end && characterPredicate(*position)) | |
| 89 ++position; | |
| 90 } | |
| 91 | |
| 92 template<typename CharType, bool characterPredicate(CharType)> | |
| 93 void reverseSkipWhile(const CharType*& position, const CharType* start) | |
| 94 { | |
| 95 while (position >= start && characterPredicate(*position)) | |
| 96 --position; | |
| 97 } | |
| 98 | |
| 99 #endif | |
| 100 | |
| OLD | NEW |