/** * Create a collection of path filters. * <p> * Paths may appear in any order within the collection. Sorting may be done * internally when the group is constructed if doing so will improve path * matching performance. * * @param paths * the paths to test against. Must have at least one entry. * @return a new filter for the list of paths supplied. */ public static TreeFilter create(Collection<PathFilter> paths) { if (paths.isEmpty()) throw new IllegalArgumentException( JGitText.get().atLeastOnePathIsRequired); final PathFilter[] p = new PathFilter[paths.size()]; paths.toArray(p); return create(p); }
/** * Create a collection of path filters from Java strings. * <p> * Path strings are relative to the root of the repository. If the user's * input should be assumed relative to a subdirectory of the repository the * caller must prepend the subdirectory's path prior to creating the filter. * <p> * Path strings use '/' to delimit directories on all platforms. * <p> * Paths may appear in any order within the collection. Sorting may be done * internally when the group is constructed if doing so will improve path * matching performance. * * @param paths * the paths to test against. Must have at least one entry. * @return a new filter for the list of paths supplied. */ public static TreeFilter createFromStrings(Collection<String> paths) { if (paths.isEmpty()) throw new IllegalArgumentException( JGitText.get().atLeastOnePathIsRequired); final PathFilter[] p = new PathFilter[paths.size()]; int i = 0; for (String s : paths) p[i++] = PathFilter.create(s); return create(p); }
/** * Create a collection of path filters from Java strings. * <p> * Path strings are relative to the root of the repository. If the user's * input should be assumed relative to a subdirectory of the repository the * caller must prepend the subdirectory's path prior to creating the filter. * <p> * Path strings use '/' to delimit directories on all platforms. * <p> * Paths may appear in any order. Sorting may be done internally when the * group is constructed if doing so will improve path matching performance. * * @param paths * the paths to test against. Must have at least one entry. * @return a new filter for the paths supplied. */ public static TreeFilter createFromStrings(String... paths) { if (paths.length == 0) throw new IllegalArgumentException( JGitText.get().atLeastOnePathIsRequired); final int length = paths.length; final PathFilter[] p = new PathFilter[length]; for (int i = 0; i < length; i++) p[i] = PathFilter.create(paths[i]); return create(p); }
if (pathFilters.size() > 0) walk.setTreeFilter(AndTreeFilter.create( PathFilterGroup.create(pathFilters), TreeFilter.ANY_DIFF)); if (skip > -1 && maxCount > -1) walk.setRevFilter(AndRevFilter.create(SkipRevFilter.create(skip),
private static TreeFilter group(final String... paths) { final int length = paths.length; final List<PathFilter> filters = new ArrayList<PathFilter>(length); for (int i = 0; i < length; i++) filters.add(PathFilter.create(paths[i])); return PathFilterGroup.create(filters); }
/** * Create a collection of path filters. * <p> * Paths may appear in any order within the collection. Sorting may be done * internally when the group is constructed if doing so will improve path * matching performance. * * @param paths * the paths to test against. Must have at least one entry. * @return a new filter for the list of paths supplied. */ public static TreeFilter create(final Collection<PathFilter> paths) { if (paths.isEmpty()) throw new IllegalArgumentException( JGitText.get().atLeastOnePathIsRequired); final PathFilter[] p = new PathFilter[paths.size()]; paths.toArray(p); return create(p); }
/** * Create a collection of path filters. * <p> * Paths may appear in any order within the collection. Sorting may be done * internally when the group is constructed if doing so will improve path * matching performance. * * @param paths * the paths to test against. Must have at least one entry. * @return a new filter for the list of paths supplied. */ public static TreeFilter create(Collection<PathFilter> paths) { if (paths.isEmpty()) throw new IllegalArgumentException( JGitText.get().atLeastOnePathIsRequired); final PathFilter[] p = new PathFilter[paths.size()]; paths.toArray(p); return create(p); }
private TreeFilter createPathFilter(final Collection<? extends IResource> rs) { if (rs == null || rs.isEmpty()) return null; final List<PathFilter> filters = new ArrayList<PathFilter>(); for (IResource r : rs) { RepositoryMapping rm = RepositoryMapping.getMapping(r); String repoRelativePath = rm.getRepoRelativePath(r); if (repoRelativePath != null) if (repoRelativePath.equals("")) //$NON-NLS-1$ // repository selected return TreeFilter.ALL; else filters.add(PathFilter.create(repoRelativePath)); } if (filters.size() == 0) return null; if (filters.size() == 1) return filters.get(0); return PathFilterGroup.create(filters); }
/** * Create a collection of path filters from Java strings. * <p> * Path strings are relative to the root of the repository. If the user's * input should be assumed relative to a subdirectory of the repository the * caller must prepend the subdirectory's path prior to creating the filter. * <p> * Path strings use '/' to delimit directories on all platforms. * <p> * Paths may appear in any order within the collection. Sorting may be done * internally when the group is constructed if doing so will improve path * matching performance. * * @param paths * the paths to test against. Must have at least one entry. * @return a new filter for the list of paths supplied. */ public static TreeFilter createFromStrings(Collection<String> paths) { if (paths.isEmpty()) throw new IllegalArgumentException( JGitText.get().atLeastOnePathIsRequired); final PathFilter[] p = new PathFilter[paths.size()]; int i = 0; for (String s : paths) p[i++] = PathFilter.create(s); return create(p); }
/** * Create a collection of path filters from Java strings. * <p> * Path strings are relative to the root of the repository. If the user's * input should be assumed relative to a subdirectory of the repository the * caller must prepend the subdirectory's path prior to creating the filter. * <p> * Path strings use '/' to delimit directories on all platforms. * <p> * Paths may appear in any order. Sorting may be done internally when the * group is constructed if doing so will improve path matching performance. * * @param paths * the paths to test against. Must have at least one entry. * @return a new filter for the paths supplied. */ public static TreeFilter createFromStrings(String... paths) { if (paths.length == 0) throw new IllegalArgumentException( JGitText.get().atLeastOnePathIsRequired); final int length = paths.length; final PathFilter[] p = new PathFilter[length]; for (int i = 0; i < length; i++) p[i] = PathFilter.create(paths[i]); return create(p); }
/** * Create a collection of path filters from Java strings. * <p> * Path strings are relative to the root of the repository. If the user's * input should be assumed relative to a subdirectory of the repository the * caller must prepend the subdirectory's path prior to creating the filter. * <p> * Path strings use '/' to delimit directories on all platforms. * <p> * Paths may appear in any order within the collection. Sorting may be done * internally when the group is constructed if doing so will improve path * matching performance. * * @param paths * the paths to test against. Must have at least one entry. * @return a new filter for the list of paths supplied. */ public static TreeFilter createFromStrings(final Collection<String> paths) { if (paths.isEmpty()) throw new IllegalArgumentException( JGitText.get().atLeastOnePathIsRequired); final PathFilter[] p = new PathFilter[paths.size()]; int i = 0; for (final String s : paths) p[i++] = PathFilter.create(s); return create(p); }
/** * Create a collection of path filters from Java strings. * <p> * Path strings are relative to the root of the repository. If the user's * input should be assumed relative to a subdirectory of the repository the * caller must prepend the subdirectory's path prior to creating the filter. * <p> * Path strings use '/' to delimit directories on all platforms. * <p> * Paths may appear in any order. Sorting may be done internally when the * group is constructed if doing so will improve path matching performance. * * @param paths * the paths to test against. Must have at least one entry. * @return a new filter for the paths supplied. */ public static TreeFilter createFromStrings(final String... paths) { if (paths.length == 0) throw new IllegalArgumentException( JGitText.get().atLeastOnePathIsRequired); final int length = paths.length; final PathFilter[] p = new PathFilter[length]; for (int i = 0; i < length; i++) p[i] = PathFilter.create(paths[i]); return create(p); }
@Override public int parseArguments(final Parameters params) throws CmdLineException { final List<PathFilter> filters = new ArrayList<PathFilter>(); for (int idx = 0;; idx++) { final String path; try { path = params.getParameter(idx); } catch (CmdLineException cle) { break; } filters.add(PathFilter.create(path)); } if (filters.size() == 0) return 0; if (filters.size() == 1) { setter.addValue(filters.get(0)); return 1; } setter.addValue(PathFilterGroup.create(filters)); return filters.size(); }
if (pathFilters.size() > 0) walk.setTreeFilter(AndTreeFilter.create( PathFilterGroup.create(pathFilters), TreeFilter.ANY_DIFF)); if (skip > -1 && maxCount > -1) walk.setRevFilter(AndRevFilter.create(SkipRevFilter.create(skip),
if (pathFilters.size() > 0) walk.setTreeFilter(AndTreeFilter.create( PathFilterGroup.create(pathFilters), TreeFilter.ANY_DIFF)); if (skip > -1 && maxCount > -1) walk.setRevFilter(AndRevFilter.create(SkipRevFilter.create(skip),