/** * Create a filter around many filters, all of which must match. * * @param list * list of filters to match against. Must contain at least 2 * filters. * @return a filter that must match all input filters. */ public static RevFilter create(Collection<RevFilter> list) { if (list.size() < 2) throw new IllegalArgumentException(JGitText.get().atLeastTwoFiltersNeeded); final RevFilter[] subfilters = new RevFilter[list.size()]; list.toArray(subfilters); if (subfilters.length == 2) return create(subfilters[0], subfilters[1]); return new List(subfilters); }
/** * Create a filter around many filters, all of which must match. * * @param list * list of filters to match against. Must contain at least 2 * filters. * @return a filter that must match all input filters. */ public static RevFilter create(RevFilter[] list) { if (list.length == 2) return create(list[0], list[1]); if (list.length < 2) throw new IllegalArgumentException(JGitText.get().atLeastTwoFiltersNeeded); final RevFilter[] subfilters = new RevFilter[list.length]; System.arraycopy(list, 0, subfilters, 0, list.length); return new List(subfilters); }
PathFilterGroup.create(pathFilters), TreeFilter.ANY_DIFF)); if (skip > -1 && maxCount > -1) walk.setRevFilter(AndRevFilter.create(SkipRevFilter.create(skip), MaxCountRevFilter.create(maxCount))); else if (skip > -1)
/** * Create a filter around many filters, all of which must match. * * @param list * list of filters to match against. Must contain at least 2 * filters. * @return a filter that must match all input filters. */ public static RevFilter create(Collection<RevFilter> list) { if (list.size() < 2) throw new IllegalArgumentException(JGitText.get().atLeastTwoFiltersNeeded); final RevFilter[] subfilters = new RevFilter[list.size()]; list.toArray(subfilters); if (subfilters.length == 2) return create(subfilters[0], subfilters[1]); return new List(subfilters); }
} else rewriteFlag = 0; rf = AndRevFilter.create(new TreeRevFilter(w, tf, rewriteFlag), rf);
/** * Create a filter around many filters, all of which must match. * * @param list * list of filters to match against. Must contain at least 2 * filters. * @return a filter that must match all input filters. */ public static RevFilter create(final Collection<RevFilter> list) { if (list.size() < 2) throw new IllegalArgumentException(JGitText.get().atLeastTwoFiltersNeeded); final RevFilter[] subfilters = new RevFilter[list.size()]; list.toArray(subfilters); if (subfilters.length == 2) return create(subfilters[0], subfilters[1]); return new List(subfilters); }
/** * Create a filter around many filters, all of which must match. * * @param list * list of filters to match against. Must contain at least 2 * filters. * @return a filter that must match all input filters. */ public static RevFilter create(Collection<RevFilter> list) { if (list.size() < 2) throw new IllegalArgumentException(JGitText.get().atLeastTwoFiltersNeeded); final RevFilter[] subfilters = new RevFilter[list.size()]; list.toArray(subfilters); if (subfilters.length == 2) return create(subfilters[0], subfilters[1]); return new List(subfilters); }
/** * Create a filter around many filters, all of which must match. * * @param list * list of filters to match against. Must contain at least 2 * filters. * @return a filter that must match all input filters. */ public static RevFilter create(RevFilter[] list) { if (list.length == 2) return create(list[0], list[1]); if (list.length < 2) throw new IllegalArgumentException(JGitText.get().atLeastTwoFiltersNeeded); final RevFilter[] subfilters = new RevFilter[list.length]; System.arraycopy(list, 0, subfilters, 0, list.length); return new List(subfilters); }
/** * Create a filter around many filters, all of which must match. * * @param list * list of filters to match against. Must contain at least 2 * filters. * @return a filter that must match all input filters. */ public static RevFilter create(final RevFilter[] list) { if (list.length == 2) return create(list[0], list[1]); if (list.length < 2) throw new IllegalArgumentException(JGitText.get().atLeastTwoFiltersNeeded); final RevFilter[] subfilters = new RevFilter[list.length]; System.arraycopy(list, 0, subfilters, 0, list.length); return new List(subfilters); }
/** * Create a filter around many filters, all of which must match. * * @param list * list of filters to match against. Must contain at least 2 * filters. * @return a filter that must match all input filters. */ public static RevFilter create(RevFilter[] list) { if (list.length == 2) return create(list[0], list[1]); if (list.length < 2) throw new IllegalArgumentException(JGitText.get().atLeastTwoFiltersNeeded); final RevFilter[] subfilters = new RevFilter[list.length]; System.arraycopy(list, 0, subfilters, 0, list.length); return new List(subfilters); }
walk.setRevFilter(revLimiter.get(0)); else if (revLimiter.size() > 1) walk.setRevFilter(AndRevFilter.create(revLimiter));
public static String getHashBefore(Date date, Repository repository) throws Exception { try (RevWalk revWalk = new RevWalk(repository)) { revWalk.markStart( revWalk.parseCommit(repository.resolve(Constants.HEAD))); revWalk.setRetainBody(false); revWalk.setRevFilter( AndRevFilter.create( CommitTimeRevFilter.before(date), MaxCountRevFilter.create(1))); RevCommit revCommit = revWalk.next(); if (revCommit == null) { return null; } return revCommit.name(); } }
PathFilterGroup.create(pathFilters), TreeFilter.ANY_DIFF)); if (skip > -1 && maxCount > -1) walk.setRevFilter(AndRevFilter.create(SkipRevFilter.create(skip), MaxCountRevFilter.create(maxCount))); else if (skip > -1)
PathFilterGroup.create(pathFilters), TreeFilter.ANY_DIFF)); if (skip > -1 && maxCount > -1) walk.setRevFilter(AndRevFilter.create(SkipRevFilter.create(skip), MaxCountRevFilter.create(maxCount))); else if (skip > -1)
} else rewriteFlag = 0; rf = AndRevFilter.create(new TreeRevFilter(w, tf, rewriteFlag), rf);
} else rewriteFlag = 0; rf = AndRevFilter.create(new TreeRevFilter(w, tf, rewriteFlag), rf);
} else rewriteFlag = 0; rf = AndRevFilter.create(new TreeRevFilter(w, tf, rewriteFlag), rf);