How to use

getInitialDesire

method

in

org.grouplens.grapht.Dependency

public static boolean edgeIsTransient(DAGEdge<?, Dependency> input) {
  Desire desire = input.getLabel().getInitialDesire();
  return desireIsTransient(desire);
}

private static List<String> extractOrderKey(DAGEdge<Component,Dependency> node) {
  Desire desire = node.getLabel().getInitialDesire();
  InjectionPoint ip = desire.getInjectionPoint();
  List<String> key = new ArrayList<>(4);
  Member member = ip.getMember();
  if (member instanceof Constructor) {
    key.add("0: constructor");
    key.add(Integer.toString(ip.getParameterIndex()));
  } else if (member instanceof Method) {
    key.add("1: setter");
    key.add(member.getName());
    key.add(Integer.toString(ip.getParameterIndex()));
  } else if (member instanceof Field) {
    key.add("2: field");
    key.add(member.getName());
  } else if (ip instanceof SimpleInjectionPoint) {
    key.add("5: simple");
  } else {
    key.add("9: unknown");
    key.add(ip.getClass().getName());
  }
  return key;
}

  /**
   * Find a node with a satisfaction for a specified type. Does a breadth-first
   * search to find the closest matching one.
   *
   * @param type The type to look for.
   * @return A node whose satisfaction is compatible with {@code type}.
   */
  @Nullable
  public static DAGNode<Component,Dependency> findSatisfyingNode(DAGNode<Component,Dependency> graph,
                                  final QualifierMatcher qmatch,
                                  final Class<?> type) {
    Optional<DAGEdge<Component, Dependency>> edge =
        graph.breadthFirstEdges()
           .filter(e -> type.isAssignableFrom(e.getTail()
                             .getLabel()
                             .getSatisfaction()
                             .getErasedType()))
           .filter(e -> qmatch.apply(e.getLabel()
                        .getInitialDesire()
                        .getInjectionPoint()
                        .getQualifier()))
        .findFirst();

    return edge.map(DAGEdge::getTail)
          .orElse(null);
  }
}

Collections.sort(edges, GraphtUtils.DEP_EDGE_ORDER);
for (DAGEdge<Component, Dependency> e: edges) {
  Desire dep = e.getLabel().getInitialDesire();
  Annotation q = dep.getInjectionPoint().getQualifier();
  DAGNode<Component, Dependency> targetNode = e.getTail();

  @Override
  public boolean apply(@Nullable Dependency input) {
    return input != null && input.getInitialDesire().equals(d);
  }
};

  @Nullable
  @Override
  public Instantiator apply(@Nullable Desire input) {
    for (DAGEdge<Component,Dependency> edge: edges) {
      if (edge.getLabel().getInitialDesire().equals(input)) {
        return makeInstantiator(edge.getTail(), backEdges);
      }
    }
    return null;
  }
}

private Map<Desire, Instantiator> makeDependencyMap(DAGNode<Component, Dependency> node, SetMultimap<DAGNode<Component, Dependency>, DAGEdge<Component, Dependency>> backEdges) {
  Set<DAGEdge<Component,Dependency>> edges = node.getOutgoingEdges();
  if (backEdges.containsKey(node)) {
    ImmutableSet.Builder<DAGEdge<Component,Dependency>> bld = ImmutableSet.builder();
    edges = bld.addAll(edges)
          .addAll(backEdges.get(node))
          .build();
  }
  ImmutableSet.Builder<Desire> desires = ImmutableSet.builder();
  for (DAGEdge<Component,Dependency> edge: edges) {
    desires.add(edge.getLabel().getInitialDesire());
  }
  return Maps.asMap(desires.build(), new DepLookup(edges, backEdges));
}

private static List<String> extractOrderKey(DAGEdge<Component,Dependency> node) {
  Desire desire = node.getLabel().getInitialDesire();
  InjectionPoint ip = desire.getInjectionPoint();
  List<String> key = new ArrayList<>(4);
  Member member = ip.getMember();
  if (member instanceof Constructor) {
    key.add("0: constructor");
    key.add(Integer.toString(ip.getParameterIndex()));
  } else if (member instanceof Method) {
    key.add("1: setter");
    key.add(member.getName());
    key.add(Integer.toString(ip.getParameterIndex()));
  } else if (member instanceof Field) {
    key.add("2: field");
    key.add(member.getName());
  } else if (ip instanceof SimpleInjectionPoint) {
    key.add("5: simple");
  } else {
    key.add("9: unknown");
    key.add(ip.getClass().getName());
  }
  return key;
}

public static boolean edgeIsTransient(DAGEdge<?, Dependency> input) {
  Desire desire = input.getLabel().getInitialDesire();
  return desireIsTransient(desire);
}

  /**
   * Find a node with a satisfaction for a specified type. Does a breadth-first
   * search to find the closest matching one.
   *
   * @param type The type to look for.
   * @return A node whose satisfaction is compatible with {@code type}.
   */
  @Nullable
  public static DAGNode<Component,Dependency> findSatisfyingNode(DAGNode<Component,Dependency> graph,
                                  final QualifierMatcher qmatch,
                                  final Class<?> type) {
    Optional<DAGEdge<Component, Dependency>> edge =
        graph.breadthFirstEdges()
           .filter(e -> type.isAssignableFrom(e.getTail()
                             .getLabel()
                             .getSatisfaction()
                             .getErasedType()))
           .filter(e -> qmatch.apply(e.getLabel()
                        .getInitialDesire()
                        .getInjectionPoint()
                        .getQualifier()))
        .findFirst();

    return edge.map(DAGEdge::getTail)
          .orElse(null);
  }
}

Collections.sort(edges, GraphtUtils.DEP_EDGE_ORDER);
for (DAGEdge<Component, Dependency> e: edges) {
  Desire dep = e.getLabel().getInitialDesire();
  Annotation q = dep.getInjectionPoint().getQualifier();
  DAGNode<Component, Dependency> targetNode = e.getTail();