public static <TFirst, TSecond> Pair<TFirst, TSecond> create(final TFirst first, final TSecond second) { return new Pair<>(first, second); } }
public static <TFirst, TSecond> Pair<TFirst, TSecond> create(final TFirst first, final TSecond second) { return new Pair<>(first, second); } }
public static <TFirst, TSecond> Pair<TFirst, TSecond> create(final TFirst first, final TSecond second) { return new Pair<>(first, second); } }
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))); } }
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))); } }
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))); } }