/** * Create a filter that negates the result of another filter. * * @param a * filter to negate. * @return a filter that does the reverse of <code>a</code>. */ public static TreeFilter create(TreeFilter a) { return new NotTreeFilter(a); }
/** * Create a new filter that does the opposite of this filter. * * @return a new filter that includes tree entries this filter rejects. */ public TreeFilter negate() { return NotTreeFilter.create(this); }
/** {@inheritDoc} */ @Override public boolean include(TreeWalk walker) throws MissingObjectException, IncorrectObjectTypeException, IOException { return matchFilter(walker) == 0; }
/** {@inheritDoc} */ @Override public TreeFilter clone() { final TreeFilter n = a.clone(); return n == a ? this : new NotTreeFilter(n); }
/** * Create a new filter that does the opposite of this filter. * * @return a new filter that includes tree entries this filter rejects. */ public TreeFilter negate() { return NotTreeFilter.create(this); }
/** {@inheritDoc} */ @Override public boolean include(TreeWalk walker) throws MissingObjectException, IncorrectObjectTypeException, IOException { return matchFilter(walker) == 0; }
/** * Create a filter that negates the result of another filter. * * @param a * filter to negate. * @return a filter that does the reverse of <code>a</code>. */ public static TreeFilter create(final TreeFilter a) { return new NotTreeFilter(a); }
/** * Create a new filter that does the opposite of this filter. * * @return a new filter that includes tree entries this filter rejects. */ public TreeFilter negate() { return NotTreeFilter.create(this); }
/** * Create a filter that negates the result of another filter. * * @param a * filter to negate. * @return a filter that does the reverse of <code>a</code>. */ public static TreeFilter create(TreeFilter a) { return new NotTreeFilter(a); }
/** {@inheritDoc} */ @Override public TreeFilter clone() { final TreeFilter n = a.clone(); return n == a ? this : new NotTreeFilter(n); }
@Override public TreeFilter clone() { final TreeFilter n = a.clone(); return n == a ? this : new NotTreeFilter(n); }