本文整理了Java中com.sun.tools.javac.util.List.intersect()方法的一些代码示例，展示了List.intersect()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。List.intersect()方法的具体详情如下：
包路径：com.sun.tools.javac.util.List
类名称：List
方法名：intersect

List.intersect介绍

暂无

代码示例

代码示例来源：origin: konsoletyper/teavm-javac

/**
 * Solve at least one variable in given list.
 */
public void solveAny(List<Type> varsToSolve, Map<Type, Set<Type>> optDeps, Warner warn) {
  solve(new BestLeafSolver(varsToSolve.intersect(restvars())) {
    public boolean done() {
      return instvars().intersect(varsToSolve).nonEmpty();
    }
  }, optDeps, warn);
}

代码示例来源：origin: org.kohsuke.sorcerer/sorcerer-javac

/**
 * Solve at least one variable in given list.
 */
public void solveAny(List<Type> varsToSolve, Map<Type, Set<Type>> optDeps, Warner warn) {
  solve(new BestLeafSolver(varsToSolve.intersect(restvars())) {
    public boolean done() {
      return instvars().intersect(varsToSolve).nonEmpty();
    }
  }, optDeps, warn);
}

代码示例来源：origin: konsoletyper/teavm-javac

public boolean done() {
    return instvars().intersect(varsToSolve).nonEmpty();
  }
}, optDeps, warn);

代码示例来源：origin: org.kohsuke.sorcerer/sorcerer-javac

public boolean done() {
    return instvars().intersect(varsToSolve).nonEmpty();
  }
}, optDeps, warn);

代码示例来源：origin: org.kohsuke.sorcerer/sorcerer-javac

private boolean solveBasic(List<Type> varsToSolve, EnumSet<InferenceStep> steps) {
  boolean changed = false;
  for (Type t : varsToSolve.intersect(restvars())) {
    UndetVar uv = (UndetVar)asFree(t);
    for (InferenceStep step : steps) {
      if (step.accepts(uv, this)) {
        uv.inst = step.solve(uv, this);
        changed = true;
        break;
      }
    }
  }
  return changed;
}

代码示例来源：origin: konsoletyper/teavm-javac

private boolean solveBasic(List<Type> varsToSolve, EnumSet<InferenceStep> steps) {
  boolean changed = false;
  for (Type t : varsToSolve.intersect(restvars())) {
    UndetVar uv = (UndetVar)asUndetVar(t);
    for (InferenceStep step : steps) {
      if (step.accepts(uv, this)) {
        uv.inst = step.solve(uv, this);
        changed = true;
        break;
      }
    }
  }
  return changed;
}

代码示例来源：origin: konsoletyper/teavm-javac

List<Type> restStuckVars =
    List.from(deferredAttrNode.deferredStuckPolicy.stuckVars())
    .intersect(inferenceContext.restvars());
stuckVars = stuckVars.prependList(restStuckVars);
    .intersect(inferenceContext.restvars())) {
  Set<Type> prevDeps = depVarsMap.get(t);
  if (prevDeps == null) {

代码示例来源：origin: org.kohsuke.sorcerer/sorcerer-javac

List<Type> restStuckVars =
    List.from(deferredAttrNode.deferredStuckPolicy.stuckVars())
    .intersect(inferenceContext.restvars());
stuckVars = stuckVars.prependList(restStuckVars);
    .intersect(inferenceContext.restvars())) {
  Set<Type> prevDeps = depVarsMap.get(t);
  if (prevDeps == null) {