Lines Matching defs:const

31   const T& Cast() const;
40 const TypeId type_id_;
113 V8_EXPORT_PRIVATE static const TypeId id;
125 const T& ParseResultHolderBase::Cast() const {
127 return static_cast<const ParseResultHolder<T>*>(this)->value_;
136 const T& Cast() const& {
152 using InputPosition = const char*;
160 std::string ToString() const { return {begin, end}; }
169 ParseResultIterator(const ParseResultIterator&) = delete;
170 ParseResultIterator& operator=(const ParseResultIterator&) = delete;
180 bool HasNext() const { return i_ < results_.size(); }
182 const MatchedInput& matched_input() const { return matched_input_; }
221 Symbol* left() const {
225 const std::vector<Symbol*>& right() const { return right_hand_side_; }
233 const Item* completed_item, const LexerResult& tokens) const;
254 Symbol(const Symbol&) = delete;
255 Symbol& operator=(const Symbol&) = delete;
259 bool IsTerminal() const { return rules_.empty(); }
260 Rule* rule(size_t index) const { return rules_[index].get(); }
261 size_t rule_number() const { return rules_.size(); }
263 void AddRule(const Rule& rule) {
269 const Item* item, const LexerResult& tokens);
283 Item(const Rule* rule, size_t mark, size_t start, size_t pos)
290 bool IsComplete() const {
297 Symbol* NextSymbol() const {
307 Item Advance(size_t new_pos, const Item* child = nullptr) const {
321 std::vector<const Item*> Children() const;
323 std::string SplitByChildren(const LexerResult& tokens) const;
325 void CheckAmbiguity(const Item& other, const LexerResult& tokens) const;
327 MatchedInput GetMatchedInput(const LexerResult& tokens) const {
328 const MatchedInput& start = tokens.token_contents[start_];
329 const MatchedInput& end = start_ == pos_ ? tokens.token_contents[start_]
339 bool operator==(const Item& other) const {
344 friend size_t hash_value(const Item& i) {
348 const Rule* rule() const { return rule_; }
349 Symbol* left() const { return rule_->left(); }
350 const std::vector<Symbol*>& right() const { return rule_->right(); }
351 size_t pos() const { return pos_; }
352 size_t start() const { return start_; }
355 const Rule* rule_;
360 const Item* prev_ = nullptr;
361 const Item* child_ = nullptr;
365 const Item* item, const LexerResult& tokens) {
371 V8_EXPORT_PRIVATE const Item* RunEarleyAlgorithm(
372 Symbol* start, const LexerResult& tokens,
376 const LexerResult& tokens) {
378 const Item* final_item = RunEarleyAlgorithm(start, tokens, &table);
405 Symbol* Token(const std::string& keyword) { return &keywords_[keyword]; }
406 V8_EXPORT_PRIVATE LexerResult RunLexer(const std::string& input);
424 base::Optional<ParseResult> Parse(const std::string& input) {
430 Symbol* Token(const std::string& s) { return lexer_.Token(s); }
450 V8_EXPORT_PRIVATE static bool MatchString(const char* s, InputPosition* pos);