Uses of Interface
net.sourceforge.nrl.parser.ast.constraints.ICardinalityConstraint

Packages that use ICardinalityConstraint
net.sourceforge.nrl.parser.ast.action The fully resolved extended abstract syntax tree (AST) representation for the action language. 
net.sourceforge.nrl.parser.ast.constraints   
net.sourceforge.nrl.parser.ast.constraints.impl   
net.sourceforge.nrl.parser.type Abstract type assignment and type checking for the completed AST. 
 

Uses of ICardinalityConstraint in net.sourceforge.nrl.parser.ast.action
 

Methods in net.sourceforge.nrl.parser.ast.action with parameters of type ICardinalityConstraint
 void INRLActionDetailVisitor.Stub.visitCardinalityConstraint(ICardinalityConstraint constraint)
           
 

Uses of ICardinalityConstraint in net.sourceforge.nrl.parser.ast.constraints
 

Methods in net.sourceforge.nrl.parser.ast.constraints that return ICardinalityConstraint
 ICardinalityConstraint IExistsStatement.getCount()
          Return the cardinality constraint (one, two, three, at least one, etc.), if there is one.
 

Methods in net.sourceforge.nrl.parser.ast.constraints with parameters of type ICardinalityConstraint
 void INRLConstraintDetailVisitor.visitCardinalityConstraint(ICardinalityConstraint constraint)
           
 void INRLConstraintDetailVisitor.Stub.visitCardinalityConstraint(ICardinalityConstraint constraint)
           
 

Uses of ICardinalityConstraint in net.sourceforge.nrl.parser.ast.constraints.impl
 

Classes in net.sourceforge.nrl.parser.ast.constraints.impl that implement ICardinalityConstraint
 class CardinalityConstraintImpl
           
 

Methods in net.sourceforge.nrl.parser.ast.constraints.impl that return ICardinalityConstraint
 ICardinalityConstraint ExistsStatementImpl.getCount()
           
 

Uses of ICardinalityConstraint in net.sourceforge.nrl.parser.type
 

Methods in net.sourceforge.nrl.parser.type with parameters of type ICardinalityConstraint
 void ConstraintTypeChecker.visitCardinalityConstraint(ICardinalityConstraint constraint)
           
 



Copyright © 2006-2013. All Rights Reserved.