public static <TFirst, TSecond> Pair<TFirst, TSecond> create(final TFirst first, final TSecond second) { return new Pair<>(first, second); } }
public final void add(final String groupName, final INode node) { if (groupName != null && node != null) { _results.add(Pair.create(groupName, node)); } }
public final boolean has(final String groupName) { for (int i = 0; i < _results.size(); i++) { if (StringUtilities.equals(groupName, _results.get(i).getFirst())) { return true; } } return false; }
public final void add(final String groupName, final INode node) { if (groupName != null && node != null) { _results.add(Pair.create(groupName, node)); } }
public static <TFirst, TSecond> Pair<TFirst, TSecond> create(final TFirst first, final TSecond second) { return new Pair<>(first, second); } }
public final boolean has(final String groupName) { for (int i = 0; i < _results.size(); i++) { if (StringUtilities.equals(groupName, _results.get(i).getFirst())) { return true; } } return false; }
startingPoints.add(Pair.create(last, tail)); startingPoints.add(Pair.create(last, previous(tail))); startingPoints.add(Pair.create(last, tail.getNext())); if (forbiddenNodes.contains(_nodeMap.get(startingPoint.getSecond()))) { continue; if (opCodesMatch(startingPoint.getFirst(), startingPoint.getSecond(), instructionCount, _previous)) { tail = startingPoint.getSecond(); matchFound = true; break;
public final void add(final String groupName, final INode node) { if (groupName != null && node != null) { _results.add(Pair.create(groupName, node)); } }
public static <TFirst, TSecond> Pair<TFirst, TSecond> create(final TFirst first, final TSecond second) { return new Pair<>(first, second); } }
public final boolean has(final String groupName) { for (int i = 0; i < _results.size(); i++) { if (StringUtilities.equals(groupName, _results.get(i).getFirst())) { return true; } } return false; }
startingPoints.add(Pair.create(last, tail)); startingPoints.add(Pair.create(last, previous(tail))); startingPoints.add(Pair.create(last, tail.getNext())); if (forbiddenNodes.contains(_nodeMap.get(startingPoint.getSecond()))) { continue; if (opCodesMatch(startingPoint.getFirst(), startingPoint.getSecond(), instructionCount, _previous)) { tail = startingPoint.getSecond(); matchFound = true; break;
private void adaptRecursive(final TypeReference source, final TypeReference target) { final HashSet<Pair<TypeReference, TypeReference>> cache = ADAPT_CACHE.get(); final Pair<TypeReference, TypeReference> pair = Pair.create(source, target); if (cache.add(pair)) { try { visit(source, target); } finally { cache.remove(pair); } } }
private static boolean containsTypeRecursive(final TypeReference t, final TypeReference s) { final HashSet<Pair<TypeReference, TypeReference>> cache = CONTAINS_TYPE_CACHE.get(); final Pair<TypeReference, TypeReference> pair = new Pair<>(t, s); if (cache.add(pair)) { try { return containsType(getTypeArguments(t), getTypeArguments(s)); } finally { cache.remove(pair); } } else { return containsType(getTypeArguments(t), getTypeArguments(rewriteSupers(s))); } }
startingPoints.add(Pair.create(last, tail)); startingPoints.add(Pair.create(last, previous(tail))); startingPoints.add(Pair.create(last, tail.getNext())); if (forbiddenNodes.contains(_nodeMap.get(startingPoint.getSecond()))) { continue; if (opCodesMatch(startingPoint.getFirst(), startingPoint.getSecond(), instructionCount, _previous)) { tail = startingPoint.getSecond(); matchFound = true; break;