Lines Matching refs:inputs
173 for (int n = 0; n < descriptor.nodeType.inputs.length; n++) {
175 descriptor.inputs[n] = parseExpression();
177 descriptor.inputs[n] = parseType(false);
180 for (int n = 0; n < descriptor.nodeType.inputs.length; n++) {
181 if (descriptor.inputs[n] == null) {
182 throw new RuleParseError("not enough inputs for " + descriptor.name);
334 * The matchable inputs of the node.
336 final String[] inputs;
353 TypeDescriptor(TypeMirror mirror, String shortName, String nodeClass, String nodePackage, String[] inputs, boolean commutative, boolean shareable) {
358 this.inputs = inputs;
361 assert !commutative || inputs.length == 2;
380 private void declareType(TypeMirror mirror, String shortName, String nodeClass, String nodePackage, String[] inputs, boolean commutative, boolean shareable, Element element) {
381 TypeDescriptor descriptor = new TypeDescriptor(mirror, shortName, nodeClass, nodePackage, inputs, commutative, shareable);
397 MatchDescriptor[] inputs;
403 this.inputs = new MatchDescriptor[nodeType.inputs.length];
405 this.inputs = new MatchDescriptor[0];
410 if (inputs.length == 0) {
414 for (MatchDescriptor desc : inputs) {
420 if (inputs.length == 0) {
423 List<String> currentVariants = inputs[index].generateVariants();
424 if (index == inputs.length - 1) {
442 * swap the inputs for commutative rules, producing all possible permutations.
450 if (inputs.length > 0) {
455 assert inputs.length == 0;
472 if (inputs.length != nodeType.inputs.length) {
475 if (nodeType.inputs.length > 0) {
488 String.join("\", \"", nodeType.inputs));
815 for (String input : matchable.inputs()) {
833 declareType(nodeClassMirror, shortName, nodeClass, nodePackage, matchable.inputs(), matchable.commutative(), matchable.shareable(), element);