Sha256: 76660c46f77c15140ebf9c2230882b9db665d9ef2bcada6e57ce2c2e79e23300
Contents?: true
Size: 1.5 KB
Versions: 19
Compression:
Stored size: 1.5 KB
Contents
/* 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;
}
Version data entries
19 entries across 19 versions & 3 rubygems