blob: e2c31db329cc42f956bf5860994f20f176975057 (
plain) (
blame)
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
|
//===--------------------- StringLexer.h -------------------------*- C++
//-*-===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
#ifndef utility_StringLexer_h_
#define utility_StringLexer_h_
#include <initializer_list> // for initializer_list
#include <string> // for string
#include <utility> // for pair
namespace lldb_utility {
class StringLexer {
public:
typedef std::string::size_type Position;
typedef std::string::size_type Size;
typedef std::string::value_type Character;
StringLexer(std::string s);
StringLexer(const StringLexer &rhs);
// These APIs are not bounds-checked. Use HasAtLeast() if you're not sure.
Character Peek();
bool NextIf(Character c);
std::pair<bool, Character> NextIf(std::initializer_list<Character> cs);
bool AdvanceIf(const std::string &token);
Character Next();
bool HasAtLeast(Size s);
bool HasAny(Character c);
std::string GetUnlexed();
// This will assert if there are less than s characters preceding the cursor.
void PutBack(Size s);
StringLexer &operator=(const StringLexer &rhs);
private:
std::string m_data;
Position m_position;
void Consume();
};
} // namespace lldb_private
#endif // #ifndef utility_StringLexer_h_
|
