All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.google.errorprone.refaster.UContinue Maven / Gradle / Ivy

There is a newer version: 2.28.0
Show newest version
/*
 * Copyright 2014 The Error Prone Authors.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *   http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package com.google.errorprone.refaster;

import com.google.auto.value.AutoValue;
import com.sun.source.tree.ContinueTree;
import com.sun.source.tree.TreeVisitor;
import com.sun.tools.javac.tree.JCTree.JCContinue;
import javax.annotation.Nullable;

/**
 * {@code UTree} representation of {@code ContinueTree}.
 *
 * @author [email protected] (Louis Wasserman)
 */
@AutoValue
abstract class UContinue extends USimpleStatement implements ContinueTree {
  static UContinue create(@Nullable CharSequence label) {
    return new AutoValue_UContinue((label == null) ? null : StringName.of(label));
  }

  @Override
  @Nullable
  public abstract StringName getLabel();

  @Override
  public Kind getKind() {
    return Kind.CONTINUE;
  }

  @Override
  public  R accept(TreeVisitor visitor, D data) {
    return visitor.visitContinue(this, data);
  }

  private ULabeledStatement.Key key() {
    return new ULabeledStatement.Key(getLabel());
  }

  @Override
  public JCContinue inline(Inliner inliner) {
    return inliner.maker().Continue(ULabeledStatement.inlineLabel(getLabel(), inliner));
  }

  @Override
  public Choice visitContinue(ContinueTree node, Unifier unifier) {
    if (getLabel() == null) {
      return Choice.condition(node.getLabel() == null, unifier);
    } else {
      CharSequence boundName = unifier.getBinding(key());
      return Choice.condition(
          boundName != null && node.getLabel().contentEquals(boundName), unifier);
    }
  }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy