1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321
|
#ifndef SOURCETOOLS_CURSOR_TOKEN_CURSOR_H
#define SOURCETOOLS_CURSOR_TOKEN_CURSOR_H
#include <cstring>
#include <algorithm>
#include <sourcetools/collection/Position.h>
#include <sourcetools/tokenization/Token.h>
namespace sourcetools {
namespace cursors {
class TokenCursor {
private:
typedef collections::Position Position;
typedef tokens::Token Token;
public:
TokenCursor(const std::vector<Token>& tokens)
: tokens_(tokens),
offset_(0),
n_(tokens.size()),
noSuchToken_(tokens::END)
{}
bool moveToNextToken()
{
if (UNLIKELY(offset_ >= n_ - 1))
return false;
++offset_;
return true;
}
bool moveToNextSignificantToken()
{
if (!moveToNextToken())
return false;
if (!fwdOverWhitespaceAndComments())
return false;
return true;
}
bool moveToPreviousToken()
{
if (UNLIKELY(offset_ == 0))
return false;
--offset_;
return true;
}
bool moveToPreviousSignificantToken()
{
if (!moveToPreviousToken())
return false;
if (!bwdOverWhitespaceAndComments())
return false;
return true;
}
const Token& peekFwd(std::size_t offset = 1) const
{
std::size_t index = offset_ + offset;
if (UNLIKELY(index >= n_))
return noSuchToken_;
return tokens_[index];
}
const Token& peekBwd(std::size_t offset = 1) const
{
if (UNLIKELY(offset > offset_))
return noSuchToken_;
std::size_t index = offset_ - offset;
return tokens_[index];
}
const Token& currentToken() const
{
if (UNLIKELY(offset_ >= n_))
return noSuchToken_;
return tokens_[offset_];
}
operator const Token&() const { return currentToken(); }
bool fwdOverWhitespace()
{
while (isType(tokens::WHITESPACE))
if (!moveToNextToken())
return false;
return true;
}
bool bwdOverWhitespace()
{
while (isType(tokens::WHITESPACE))
if (!moveToPreviousToken())
return false;
return true;
}
bool fwdOverComments()
{
while (isType(tokens::COMMENT))
if (!moveToNextToken())
return false;
return true;
}
bool bwdOverComments()
{
while (isType(tokens::COMMENT))
if (!moveToPreviousToken())
return false;
return true;
}
bool fwdOverWhitespaceAndComments()
{
while (isType(tokens::COMMENT) || isType(tokens::WHITESPACE))
if (!moveToNextToken())
return false;
return true;
}
bool bwdOverWhitespaceAndComments()
{
while (isType(tokens::COMMENT) || isType(tokens::WHITESPACE))
if (!moveToPreviousToken())
return false;
return true;
}
const Token& nextSignificantToken(std::size_t times = 1) const
{
TokenCursor clone(*this);
for (std::size_t i = 0; i < times; ++i)
clone.moveToNextSignificantToken();
return clone;
}
const Token& previousSignificantToken(std::size_t times = 1) const
{
TokenCursor clone(*this);
for (std::size_t i = 0; i < times; ++i)
clone.moveToPreviousSignificantToken();
return clone;
}
bool moveToPosition(std::size_t row, std::size_t column)
{
return moveToPosition(Position(row, column));
}
bool moveToPosition(const Position& target)
{
if (UNLIKELY(n_ == 0))
return false;
if (UNLIKELY(tokens_[n_ - 1].position() <= target))
{
offset_ = n_ - 1;
return true;
}
std::size_t start = 0;
std::size_t end = n_;
std::size_t offset = 0;
while (true)
{
offset = (start + end) / 2;
const Position& current = tokens_[offset].position();
if (current == target || start == end)
break;
else if (current < target)
start = offset + 1;
else
end = offset - 1;
}
offset_ = offset;
return true;
}
template <typename F>
bool findFwd(F f)
{
do {
if (f(this))
return true;
} while (moveToNextToken());
return false;
}
template <typename F>
bool findBwd(F f)
{
do {
if (f(this))
return true;
} while (moveToPreviousToken());
return false;
}
bool findFwd(const char* contents)
{
return findFwd(std::string(contents, std::strlen(contents)));
}
bool findFwd(const std::string& contents)
{
do {
if (currentToken().contentsEqual(contents))
return true;
} while (moveToNextToken());
return false;
}
bool findBwd(const char* contents)
{
return findBwd(std::string(contents, std::strlen(contents)));
}
bool findBwd(const std::string& contents)
{
do {
if (currentToken().contentsEqual(contents))
return true;
} while (moveToPreviousToken());
return false;
}
bool fwdToMatchingBracket()
{
using namespace tokens;
if (!isLeftBracket(currentToken()))
return false;
TokenType lhs = currentToken().type();
TokenType rhs = complement(lhs);
std::size_t balance = 1;
while (moveToNextSignificantToken())
{
TokenType type = currentToken().type();
balance += type == lhs;
balance -= type == rhs;
if (balance == 0) return true;
}
return false;
}
bool bwdToMatchingBracket()
{
using namespace tokens;
if (!isRightBracket(currentToken()))
return false;
TokenType lhs = currentToken().type();
TokenType rhs = complement(lhs);
std::size_t balance = 1;
while (moveToPreviousSignificantToken())
{
TokenType type = currentToken().type();
balance += type == lhs;
balance -= type == rhs;
if (balance == 0) return true;
}
return false;
}
friend std::ostream& operator<<(std::ostream& os, const TokenCursor& cursor)
{
return os << toString(cursor.currentToken());
}
tokens::TokenType type() const { return currentToken().type(); }
bool isType(tokens::TokenType type) const { return currentToken().isType(type); }
collections::Position position() const { return currentToken().position(); }
std::size_t offset() const { return offset_; }
std::size_t row() const { return currentToken().row(); }
std::size_t column() const { return currentToken().column(); }
private:
const std::vector<Token>& tokens_;
std::size_t offset_;
std::size_t n_;
Token noSuchToken_;
};
} // namespace cursors
inline std::string toString(const cursors::TokenCursor& cursor)
{
return toString(cursor.currentToken());
}
} // namespace sourcetools
#endif /* SOURCETOOLS_CURSOR_TOKEN_CURSOR_H */
|