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;
45  
46  import static org.eclipse.jgit.lib.Constants.OBJ_BLOB;
47  import static org.eclipse.jgit.lib.Constants.encode;
48  import static org.junit.Assert.assertEquals;
49  import static org.junit.Assert.assertFalse;
50  import static org.junit.Assert.assertTrue;
51  
52  import org.eclipse.jgit.junit.RepositoryTestCase;
53  import org.eclipse.jgit.lib.FileMode;
54  import org.eclipse.jgit.lib.ObjectId;
55  import org.eclipse.jgit.lib.ObjectInserter;
56  import org.eclipse.jgit.lib.TreeFormatter;
57  import org.eclipse.jgit.treewalk.filter.TreeFilter;
58  import org.junit.Test;
59  
60  public class TreeWalkBasicDiffTest extends RepositoryTestCase {
61  	@Test
62  	public void testMissingSubtree_DetectFileAdded_FileModified()
63  			throws Exception {
64  		final ObjectId oldTree, newTree, bFileId, cFileId1, cFileId2;
65  		try (ObjectInserter inserter = db.newObjectInserter()) {
66  			final ObjectId aFileId = inserter.insert(OBJ_BLOB, encode("a"));
67  			bFileId = inserter.insert(OBJ_BLOB, encode("b"));
68  			cFileId1 = inserter.insert(OBJ_BLOB, encode("c-1"));
69  			cFileId2 = inserter.insert(OBJ_BLOB, encode("c-2"));
70  
71  			// Create sub-a/empty, sub-c/empty = hello.
72  			{
73  				TreeFormatter root = new TreeFormatter();
74  				{
75  					TreeFormatter subA = new TreeFormatter();
76  					subA.append("empty", FileMode.REGULAR_FILE, aFileId);
77  					root.append("sub-a", FileMode.TREE, inserter.insert(subA));
78  				}
79  				{
80  					TreeFormatter subC = new TreeFormatter();
81  					subC.append("empty", FileMode.REGULAR_FILE, cFileId1);
82  					root.append("sub-c", FileMode.TREE, inserter.insert(subC));
83  				}
84  				oldTree = inserter.insert(root);
85  			}
86  
87  			// Create sub-a/empty, sub-b/empty, sub-c/empty.
88  			{
89  				TreeFormatter root = new TreeFormatter();
90  				{
91  					TreeFormatter subA = new TreeFormatter();
92  					subA.append("empty", FileMode.REGULAR_FILE, aFileId);
93  					root.append("sub-a", FileMode.TREE, inserter.insert(subA));
94  				}
95  				{
96  					TreeFormatter subB = new TreeFormatter();
97  					subB.append("empty", FileMode.REGULAR_FILE, bFileId);
98  					root.append("sub-b", FileMode.TREE, inserter.insert(subB));
99  				}
100 				{
101 					TreeFormatter subC = new TreeFormatter();
102 					subC.append("empty", FileMode.REGULAR_FILE, cFileId2);
103 					root.append("sub-c", FileMode.TREE, inserter.insert(subC));
104 				}
105 				newTree = inserter.insert(root);
106 			}
107 			inserter.flush();
108 		}
109 
110 		try (TreeWalk tw = new TreeWalk(db)) {
111 			tw.reset(oldTree, newTree);
112 			tw.setRecursive(true);
113 			tw.setFilter(TreeFilter.ANY_DIFF);
114 
115 			assertTrue(tw.next());
116 			assertEquals("sub-b/empty", tw.getPathString());
117 			assertEquals(FileMode.MISSING, tw.getFileMode(0));
118 			assertEquals(FileMode.REGULAR_FILE, tw.getFileMode(1));
119 			assertEquals(ObjectId.zeroId(), tw.getObjectId(0));
120 			assertEquals(bFileId, tw.getObjectId(1));
121 
122 			assertTrue(tw.next());
123 			assertEquals("sub-c/empty", tw.getPathString());
124 			assertEquals(FileMode.REGULAR_FILE, tw.getFileMode(0));
125 			assertEquals(FileMode.REGULAR_FILE, tw.getFileMode(1));
126 			assertEquals(cFileId1, tw.getObjectId(0));
127 			assertEquals(cFileId2, tw.getObjectId(1));
128 
129 			assertFalse(tw.next());
130 		}
131 	}
132 }