protected String getMessageWithReducedStackTrace(final Throwable t, final Function1<? super Throwable, ? extends String> getMessage) { final StackTraceElement[] stackTrace = t.getStackTrace(); final ArrayList<StackTraceElement> reducedStackTrace = CollectionLiterals.<StackTraceElement>newArrayList(); for (final StackTraceElement it : stackTrace) { { if ((it.getClassName().contains(AnnotationProcessor.class.getName()) || it.getClassName().contains(ProblemSupportImpl.class.getName()))) { try { t.setStackTrace(((StackTraceElement[])Conversions.unwrapArray(reducedStackTrace, StackTraceElement.class))); return getMessage.apply(t); } finally { t.setStackTrace(stackTrace); } } reducedStackTrace.add(it); } } return getMessage.apply(t); }
public void appendModifiers(final ASTNode node, final Iterable<IExtendedModifier> ext, final Function1<? super ASTNode, ? extends StringBuffer> callBack) { final Procedure1<IExtendedModifier> _function = (IExtendedModifier p) -> { ((ASTNode) p).accept(this); }; final Procedure1<IExtendedModifier> appender = _function; final Function1<IExtendedModifier, Boolean> _function_1 = (IExtendedModifier it) -> { return Boolean.valueOf((it.isAnnotation() && (!Objects.equal(((Annotation) it).getTypeName().toString(), "Override")))); }; IterableExtensions.<IExtendedModifier>forEach(IterableExtensions.<IExtendedModifier>filter(ext, _function_1), appender); if ((callBack != null)) { callBack.apply(node); } final Function1<IExtendedModifier, Boolean> _function_2 = (IExtendedModifier it) -> { return Boolean.valueOf((it.isModifier() && (!Objects.equal(((Modifier) it).getKeyword().toString(), "default")))); }; IterableExtensions.<IExtendedModifier>forEach(IterableExtensions.<IExtendedModifier>filter(ext, _function_2), appender); }
@Override protected T computeNext() { while (!headFound) { if (!iterator.hasNext()) return endOfData(); T next = iterator.next(); if (!predicate.apply(next)) { headFound = true; return next; } } if (iterator.hasNext()) { return iterator.next(); } else { return endOfData(); } } };
/** * Returns {@code true} if one or more elements in {@code iterator} satisfy the predicate. * * @param iterator * the iterator. May not be <code>null</code>. * @param predicate * the predicate. May not be <code>null</code>. * @return <code>true</code> if one or more elements in {@code iterator} satisfy the predicate. */ public static <T> boolean exists(Iterator<T> iterator, Function1<? super T, Boolean> predicate) { if (predicate == null) throw new NullPointerException("predicate"); while(iterator.hasNext()) { if (predicate.apply(iterator.next())) return true; } return false; }
@Override protected T computeNext() { while (!headFound) { if (!iterator.hasNext()) return endOfData(); T next = iterator.next(); if (!predicate.apply(next)) { headFound = true; return next; } } if (iterator.hasNext()) { return iterator.next(); } else { return endOfData(); } } };
/** * Returns {@code true} if one or more elements in {@code iterator} satisfy the predicate. * * @param iterator * the iterator. May not be <code>null</code>. * @param predicate * the predicate. May not be <code>null</code>. * @return <code>true</code> if one or more elements in {@code iterator} satisfy the predicate. */ public static <T> boolean exists(Iterator<T> iterator, Function1<? super T, Boolean> predicate) { if (predicate == null) throw new NullPointerException("predicate"); while(iterator.hasNext()) { if (predicate.apply(iterator.next())) return true; } return false; }
private <T extends Object> T recursiveFindType(final String qualifiedName, final Iterable<? extends T> typeDeclarations, final Function1<? super T, ? extends String> qualifiedNameProvider, final Function1<? super T, ? extends Iterable<? extends T>> subTypeProvider) { final char dot = '.'; for (final T type : typeDeclarations) { { final String name = qualifiedNameProvider.apply(type); boolean _equals = Objects.equal(qualifiedName, name); if (_equals) { return type; } if ((qualifiedName.startsWith(name) && (qualifiedName.charAt(name.length()) == dot))) { return this.<T>recursiveFindType(qualifiedName, subTypeProvider.apply(type), qualifiedNameProvider, subTypeProvider); } } } return null; }
/** * return the index (0-based) of the first element that satisfies the predicate. -1 if not found. */ public <A extends Object> int indexOfFirst(final Iterable<A> iterable, final Function1<? super A, ? extends Boolean> predicate) { final Function1<Pair<Integer, A>, Boolean> _function = (Pair<Integer, A> it) -> { return predicate.apply(it.getValue()); }; Pair<Integer, A> _findFirst = IterableExtensions.<Pair<Integer, A>>findFirst(IterableExtensions.<A>indexed(iterable), _function); Integer _key = null; if (_findFirst!=null) { _key=_findFirst.getKey(); } return (Optional.<Integer>ofNullable(_key).orElse(Integer.valueOf((-1)))).intValue(); }
public <P,T> T invoke1WithSuperAndExtends(Functions.Function1<? super P,? extends T> fun, P p1) { return fun.apply(p1); }
public <P,T> T invoke1WithExtends(Functions.Function1<P, ? extends T> fun, P p1) { return fun.apply(p1); }
public <P,T> T invoke1WithSuper(Functions.Function1<? super P,T> fun, P p1) { return fun.apply(p1); }
public <P,T> T invoke1(Functions.Function1<P, T> fun, P p1) { return fun.apply(p1); }
public static <T> boolean should_be(T obj, Functions.Function1<T, Boolean> func){ return func.apply(obj); }
private <IN extends Object, OUT extends Object> OUT getOrCreate(final IN in, final Function1<? super IN, ? extends OUT> provider) { this.checkCanceled(); if ((in == null)) { return null; } boolean _containsKey = this.identityCache.containsKey(in); if (_containsKey) { Object _get = this.identityCache.get(in); return ((OUT) _get); } final OUT result = provider.apply(in); this.identityCache.put(in, result); return result; }
@Deprecated public void setResponseMethodResolver(final Function1<? super String, ? extends String> responseMethodResolver) { MethodResolver _xifexpression = null; if ((responseMethodResolver == null)) { _xifexpression = null; } else { final MethodResolver _function = (String it) -> { return responseMethodResolver.apply(it); }; _xifexpression = _function; } this.methodResolver = _xifexpression; }
@Override public RESULT apply() { return function.apply(argument); } };
@Override protected T computeNext() { if (!iterator.hasNext()) return endOfData(); T next = iterator.next(); if (predicate.apply(next)) { return next; } else { return endOfData(); } } };