lbug 0.16.0

An in-process property graph database management system built for query speed and scalability
Documentation 
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

/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
 * Use of this file is governed by the BSD 3-clause license that
 * can be found in the LICENSE.txt file in the project root.
 */

#include "atn/ATN.h"
#include "atn/Transition.h"
#include "misc/IntervalSet.h"
#include "support/CPPUtils.h"

#include "atn/ATNState.h"

using namespace antlr4::atn;
using namespace antlrcpp;

size_t ATNState::hashCode() const {
  return stateNumber;
}

bool ATNState::equals(const ATNState &other) const {
  return stateNumber == other.stateNumber;
}

bool ATNState::isNonGreedyExitState() const {
  return false;
}

std::string ATNState::toString() const {
  return std::to_string(stateNumber);
}

void ATNState::addTransition(ConstTransitionPtr e) {
  addTransition(transitions.size(), std::move(e));
}

void ATNState::addTransition(size_t index, ConstTransitionPtr e) {
  for (const auto &transition : transitions)
    if (transition->target->stateNumber == e->target->stateNumber) {
      return;
    }

  if (transitions.empty()) {
    epsilonOnlyTransitions = e->isEpsilon();
  } else if (epsilonOnlyTransitions != e->isEpsilon()) {
    std::cerr << "ATN state %d has both epsilon and non-epsilon transitions.\n" << stateNumber;
    epsilonOnlyTransitions = false;
  }

  transitions.insert(transitions.begin() + index, std::move(e));
}

ConstTransitionPtr ATNState::removeTransition(size_t index) {
  ConstTransitionPtr result = std::move(transitions[index]);
  transitions.erase(transitions.begin() + index);
  return result;
}