View Javadoc
1   /*
2    * Copyright (C) 2008, Google Inc.
3    * and other copyright owners as documented in the project's IP log.
4    *
5    * This program and the accompanying materials are made available
6    * under the terms of the Eclipse Distribution License v1.0 which
7    * accompanies this distribution, is reproduced below, and is
8    * available at http://www.eclipse.org/org/documents/edl-v10.php
9    *
10   * All rights reserved.
11   *
12   * Redistribution and use in source and binary forms, with or
13   * without modification, are permitted provided that the following
14   * conditions are met:
15   *
16   * - Redistributions of source code must retain the above copyright
17   *   notice, this list of conditions and the following disclaimer.
18   *
19   * - Redistributions in binary form must reproduce the above
20   *   copyright notice, this list of conditions and the following
21   *   disclaimer in the documentation and/or other materials provided
22   *   with the distribution.
23   *
24   * - Neither the name of the Eclipse Foundation, Inc. nor the
25   *   names of its contributors may be used to endorse or promote
26   *   products derived from this software without specific prior
27   *   written permission.
28   *
29   * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
30   * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
31   * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
32   * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
33   * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
34   * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
35   * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
36   * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
37   * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
38   * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
39   * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
40   * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
41   * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
42   */
43  
44  package org.eclipse.jgit.treewalk.filter;
45  
46  import static org.eclipse.jgit.junit.Assert.assertEquals;
47  import static org.junit.Assert.assertFalse;
48  import static org.junit.Assert.assertNotNull;
49  import static org.junit.Assert.assertNotSame;
50  import static org.junit.Assert.assertSame;
51  import static org.junit.Assert.assertTrue;
52  
53  import org.eclipse.jgit.junit.RepositoryTestCase;
54  import org.eclipse.jgit.treewalk.TreeWalk;
55  import org.junit.Test;
56  
57  public class NotTreeFilterTest extends RepositoryTestCase {
58  	@Test
59  	public void testWrap() throws Exception {
60  		final TreeWalk tw = new TreeWalk(db);
61  		final TreeFilter a = TreeFilter.ALL;
62  		final TreeFilter n = NotTreeFilter.create(a);
63  		assertNotNull(n);
64  		assertTrue(a.include(tw));
65  		assertFalse(n.include(tw));
66  	}
67  
68  	@Test
69  	public void testNegateIsUnwrap() throws Exception {
70  		final TreeFilter a = PathFilter.create("a/b");
71  		final TreeFilter n = NotTreeFilter.create(a);
72  		assertSame(a, n.negate());
73  	}
74  
75  	@Test
76  	public void testShouldBeRecursive_ALL() throws Exception {
77  		final TreeFilter a = TreeFilter.ALL;
78  		final TreeFilter n = NotTreeFilter.create(a);
79  		assertEquals(a.shouldBeRecursive(), n.shouldBeRecursive());
80  	}
81  
82  	@Test
83  	public void testShouldBeRecursive_PathFilter() throws Exception {
84  		final TreeFilter a = PathFilter.create("a/b");
85  		assertTrue(a.shouldBeRecursive());
86  		final TreeFilter n = NotTreeFilter.create(a);
87  		assertTrue(n.shouldBeRecursive());
88  	}
89  
90  	@Test
91  	public void testCloneIsDeepClone() throws Exception {
92  		final TreeFilter a = new AlwaysCloneTreeFilter();
93  		assertNotSame(a, a.clone());
94  		final TreeFilter n = NotTreeFilter.create(a);
95  		assertNotSame(n, n.clone());
96  	}
97  
98  	@Test
99  	public void testCloneIsSparseWhenPossible() throws Exception {
100 		final TreeFilter a = TreeFilter.ALL;
101 		assertSame(a, a.clone());
102 		final TreeFilter n = NotTreeFilter.create(a);
103 		assertSame(n, n.clone());
104 	}
105 }