std::pair<bool, ResidualGraph::Token> ResidualGraph::pathSatisfiesTokenSpecs(const Path& p) const
{
TokenSet collectedTokens;
TokenSet forbiddenTokens;
// walk in reverse order as we build the path back to front in findShortestPath()
for(auto af = p.rbegin(); af != p.rend(); ++af)
{
Arc a = af->first;
bool forward = af->second > 0;
ResidualArcCandidate ac = undirectedArcToPair(a, forward);
const TokenSet& arcForbiddenTokens = residualArcForbidsTokens_.at(ac);
const TokenSet& providedTokens = residualArcProvidesTokens_.at(ac);
// update collected tokens
collectedTokens.insert(providedTokens.begin(), providedTokens.end());
forbiddenTokens.insert(arcForbiddenTokens.begin(), arcForbiddenTokens.end());
}
// no forbidden token is allowed in collected
for(Token t : collectedTokens)
{
if(forbiddenTokens.count(t) > 0)
return std::make_pair(false, t);
}
return std::make_pair(true, 0);
}
std::string PrintTokens( const TokenSet& setTokens )
{
std::string strTokens( " " );
for ( TokenSet::const_iterator i = setTokens.begin() ; i != setTokens.end() ; i++ )
strTokens += PrintToken( *i, true ) + " ";
return strTokens;
}
TokenSet Union( const TokenSet& setTokens1, const TokenSet& setTokens2 )
{
TokenSet setResult( setTokens1 );
for ( TokenSet::const_iterator i = setTokens2.begin() ; i != setTokens2.end() ; ++i )
setResult.insert( *i );
return setResult;
}
bool Contains( const TokenSet& setTokens1, const TokenSet& setTokens2 )
{
if ( setTokens2.empty() )
return setTokens1.empty();
for ( TokenSet::const_iterator i = setTokens2.begin() ; i != setTokens2.end() ; ++i )
if ( ! Contains( setTokens1, *i ) )
return false;
return true;
}
TokenSet tokenize(const string& str,const string& delimiters,bool trimEmpty)
{
TokenSet tokens;
size_t pos, lastPos = 0;
while(true){
pos = str.find_first_of(delimiters, lastPos);
if(pos == std::string::npos){
pos = str.length();
if(pos != lastPos || !trimEmpty){
tokens.push_back(string(str.data()+lastPos,pos-lastPos));
}
break;
}
else{
if(pos != lastPos || !trimEmpty){
tokens.push_back(string(str.data()+lastPos,pos-lastPos));
}
}
lastPos = pos + 1;
}
return tokens;
}
int RouteNode::matchRoute(TokenSet tokens,Json::Value& pathValues){
return matchRoute(tokens.begin(),tokens.end(),pathValues);
}
void RouteNode::addRoute(TokenSet tokens,int matchId){
addRoute(tokens.begin(),tokens.end(),matchId);
}
void InitializeTokenSets()
{
if ( ! bTokenSetInitialized ) {
First_name.insert( IDENTIFIER );
First_typeName.insert( IDENTIFIER );
First_colon.insert( COLON );
First_inputend.insert( INPUTEND );
First_inv.insert( INV );
First_right_parenthesis.insert( RIGHT_PARENTHESIS );
First_left_parenthesis.insert( LEFT_PARENTHESIS );
First_prePost.insert( CLASS_PREPOST );
First_in.insert( INN );
First_equal.insert( EQUAL );
First_then.insert( THEN );
First_else.insert( ELSE );
First_endif.insert( ENDIF );
First_delimiter.insert( DELIMITER );
First_right_bracket.insert( RIGHT_BRACKET );
First_left_brace.insert( LEFT_BRACE );
First_right_brace.insert( RIGHT_BRACE );
First_literal.insert( STRING );
First_literal.insert( REAL );
First_literal.insert( INTEGER );
First_literal.insert( POUND );
First_literal.insert( CLASS_BOOLEAN );
First_primaryExpression = First_literal;
First_primaryExpression .insert( IDENTIFIER );
First_primaryExpression .insert( LEFT_PARENTHESIS );
First_primaryExpression .insert( IF );
First_contextDeclarationHelper.insert( IDENTIFIER );
First_formalParameter.insert( IDENTIFIER );
First_formalParameterList = First_formalParameter;
First_featureCallParameters.insert( LEFT_PARENTHESIS );
First_featureCall.insert( IDENTIFIER );
First_postfixExpression = Union( First_primaryExpression, First_featureCall );
First_unaryExpression = First_postfixExpression;
First_unaryExpression.insert( CLASS_UNARY );
First_multiplicativeExpression = First_unaryExpression;
First_additiveExpression = First_multiplicativeExpression;
First_relationalExpression = First_additiveExpression;
First_andExpression = First_relationalExpression;
First_xorExpression = First_andExpression;
First_orExpression = First_xorExpression;
First_implicationExpression = First_orExpression;
First_letExpression.insert( LET );
First_expression = Union( First_letExpression, First_implicationExpression );
First_featureCallParametersHelper = First_expression;
First_featureCallParametersHelper.insert( IDENTIFIER );
First_featureCallParametersHelper.insert( RIGHT_PARENTHESIS );
First_actualParameterList = First_expression;
First_expressionListOrRange = First_expression;
First_qualifiers.insert( LEFT_BRACKET );
//<udmoclpat changes
First_fileNode.insert( PAT_OPEN );
First_handleNode.insert( PAT_SWITCH );
First_printNode.insert( PAT_PRINT );
First_textNode.insert( SEPARATOR );
First_extendedExpression = Union( First_expression, First_fileNode );
First_extendedExpression = Union( First_extendedExpression, First_handleNode );
First_extendedExpression = Union( First_extendedExpression, First_printNode );
First_enumeratedExpression = Union( First_expression, First_left_brace );
//udmoclpat changes>
bTokenSetInitialized = true;
Last_contextDeclarationHelper.insert( CLASS_STEREOTYPES );
Last_literal.insert( STRING );
Last_literal.insert( REAL );
Last_literal.insert( INTEGER );
Last_literal.insert( IDENTIFIER );
Last_literal.insert( CLASS_BOOLEAN );
Last_primaryExpression = Last_literal;
Last_primaryExpression.insert( RIGHT_BRACE );
Last_primaryExpression.insert( RIGHT_PARENTHESIS );
Last_primaryExpression.insert( ENDIF );
Last_featureCall.insert( IDENTIFIER );
Last_featureCall.insert( RIGHT_PARENTHESIS );
Last_implicationExpression = Union( Last_primaryExpression, Last_featureCall );
Last_expression = Last_implicationExpression;
Last_featureCallParametersHelper = Last_expression;
}
}
bool Contains( const TokenSet& setTokens, int iToken )
{
if ( setTokens.empty() )
return false;
switch ( iToken ) {
case MULTIPLE : case DIVIDE : case DIVIDEINT : case PERCENT : case MODULO :
{
TokenSet::const_iterator i = setTokens.find( CLASS_MULTIPLICATIVE );
if ( i != setTokens.end() )
return true;
break;
}
case NOT :
{
TokenSet::const_iterator i = setTokens.find( CLASS_UNARY );
if ( i != setTokens.end() )
return true;
break;
}
case MINUS :
{
TokenSet::const_iterator i = setTokens.find( CLASS_UNARY );
if ( i != setTokens.end() )
return true;
i = setTokens.find( CLASS_ADDITIVE );
if ( i != setTokens.end() )
return true;
break;
}
case PLUS :
{
TokenSet::const_iterator i = setTokens.find( CLASS_ADDITIVE );
if ( i != setTokens.end() )
return true;
break;
}
case LESS : case LESSEQUAL : case LESSGREATER : case EQUAL : case DOUBLEEQUAL : case NONEQUAL : case GREATER : case GREATEREQUAL :
{
TokenSet::const_iterator i = setTokens.find( CLASS_RELATIONAL );
if ( i != setTokens.end() )
return true;
break;
}
case XOR :
{
TokenSet::const_iterator i = setTokens.find( CLASS_LOGICAL );
if ( i != setTokens.end() )
return true;
break;
}
case AND : case SC_AND :
{
TokenSet::const_iterator i = setTokens.find( CLASS_LOGICAL_AND );
if ( i != setTokens.end() )
return true;
i = setTokens.find( CLASS_LOGICAL );
if ( i != setTokens.end() )
return true;
break;
}
case OR : case SC_OR :
{
TokenSet::const_iterator i = setTokens.find( CLASS_LOGICAL_OR );
if ( i != setTokens.end() )
return true;
i = setTokens.find( CLASS_LOGICAL );
if ( i != setTokens.end() )
return true;
break;
}
case IMPLIES : case SC_IMPLIES :
{
TokenSet::const_iterator i = setTokens.find( CLASS_LOGICAL_IMPLIES );
if ( i != setTokens.end() )
return true;
i = setTokens.find( CLASS_LOGICAL );
if ( i != setTokens.end() )
return true;
break;
}
case TRUEE: case FALSEE :
{
TokenSet::const_iterator i = setTokens.find( CLASS_BOOLEAN );
if ( i != setTokens.end() )
return true;
break;
}
case DOT : case ARROWW :
{
TokenSet::const_iterator i = setTokens.find( CLASS_CALLKIND );
if ( i != setTokens.end() )
return true;
break;
}
case PRE : case POST : case DEFATTRIBUTE : case DEFMETHOD :
{
TokenSet::const_iterator i = setTokens.find( CLASS_PREPOST );
if ( i != setTokens.end() )
return true;
}
case INV :
{
TokenSet::const_iterator i = setTokens.find( CLASS_STEREOTYPES );
if ( i != setTokens.end() )
return true;
break;
}
}
TokenSet::const_iterator i = setTokens.find( iToken );
return i != setTokens.end();
}
