View Javadoc
1   /*
2    * Copyright (C) 2011, Garmin International
3    * Copyright (C) 2011, Jesse Greenwald <jesse.greenwald@gmail.com>
4    * and other copyright owners as documented in the project's IP log.
5    *
6    * This program and the accompanying materials are made available
7    * under the terms of the Eclipse Distribution License v1.0 which
8    * accompanies this distribution, is reproduced below, and is
9    * available at http://www.eclipse.org/org/documents/edl-v10.php
10   *
11   * All rights reserved.
12   *
13   * Redistribution and use in source and binary forms, with or
14   * without modification, are permitted provided that the following
15   * conditions are met:
16   *
17   * - Redistributions of source code must retain the above copyright
18   *   notice, this list of conditions and the following disclaimer.
19   *
20   * - Redistributions in binary form must reproduce the above
21   *   copyright notice, this list of conditions and the following
22   *   disclaimer in the documentation and/or other materials provided
23   *   with the distribution.
24   *
25   * - Neither the name of the Eclipse Foundation, Inc. nor the
26   *   names of its contributors may be used to endorse or promote
27   *   products derived from this software without specific prior
28   *   written permission.
29   *
30   * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
31   * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
32   * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
33   * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
34   * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
35   * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
36   * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
37   * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
38   * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
39   * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
40   * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
41   * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
42   * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
43   */
44  
45  package org.eclipse.jgit.treewalk;
46  
47  import static org.junit.Assert.assertEquals;
48  
49  import org.eclipse.jgit.dircache.DirCache;
50  import org.eclipse.jgit.dircache.DirCacheBuilder;
51  import org.eclipse.jgit.dircache.DirCacheEntry;
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.ObjectReader;
57  import org.junit.Test;
58  
59  public class ForPathTest extends RepositoryTestCase {
60  
61  	private static final FileMode SYMLINK = FileMode.SYMLINK;
62  
63  	private static final FileMode REGULAR_FILE = FileMode.REGULAR_FILE;
64  
65  	private static final FileMode EXECUTABLE_FILE = FileMode.EXECUTABLE_FILE;
66  
67  	@Test
68  	public void testFindObjects() throws Exception {
69  		final DirCache tree0 = DirCache.newInCore();
70  		final DirCacheBuilder b0 = tree0.builder();
71  		try (ObjectReader or = db.newObjectReader();
72  				ObjectInserter oi = db.newObjectInserter()) {
73  
74  			DirCacheEntry aDotB = createEntry("a.b", EXECUTABLE_FILE);
75  			b0.add(aDotB);
76  			DirCacheEntry aSlashB = createEntry("a/b", REGULAR_FILE);
77  			b0.add(aSlashB);
78  			DirCacheEntry aSlashCSlashD = createEntry("a/c/d", REGULAR_FILE);
79  			b0.add(aSlashCSlashD);
80  			DirCacheEntry aZeroB = createEntry("a0b", SYMLINK);
81  			b0.add(aZeroB);
82  			b0.finish();
83  			assertEquals(4, tree0.getEntryCount());
84  			ObjectId tree = tree0.writeTree(oi);
85  
86  			// Find the directories that were implicitly created above.
87  			ObjectId a = null;
88  			ObjectId aSlashC = null;
89  			try (TreeWalk tw = new TreeWalk(or)) {
90  				tw.addTree(tree);
91  				while (tw.next()) {
92  					if (tw.getPathString().equals("a")) {
93  						a = tw.getObjectId(0);
94  						tw.enterSubtree();
95  						while (tw.next()) {
96  							if (tw.getPathString().equals("a/c")) {
97  								aSlashC = tw.getObjectId(0);
98  								break;
99  							}
100 						}
101 						break;
102 					}
103 				}
104 			}
105 
106 			assertEquals(a, TreeWalk.forPath(or, "a", tree).getObjectId(0));
107 			assertEquals(a, TreeWalk.forPath(or, "a/", tree).getObjectId(0));
108 			assertEquals(null, TreeWalk.forPath(or, "/a", tree));
109 			assertEquals(null, TreeWalk.forPath(or, "/a/", tree));
110 
111 			assertEquals(aDotB.getObjectId(),
112 					TreeWalk.forPath(or, "a.b", tree).getObjectId(0));
113 			assertEquals(null, TreeWalk.forPath(or, "/a.b", tree));
114 			assertEquals(null, TreeWalk.forPath(or, "/a.b/", tree));
115 			assertEquals(aDotB.getObjectId(),
116 					TreeWalk.forPath(or, "a.b/", tree).getObjectId(0));
117 
118 			assertEquals(aZeroB.getObjectId(),
119 					TreeWalk.forPath(or, "a0b", tree).getObjectId(0));
120 
121 			assertEquals(aSlashB.getObjectId(),
122 					TreeWalk.forPath(or, "a/b", tree).getObjectId(0));
123 			assertEquals(aSlashB.getObjectId(),
124 					TreeWalk.forPath(or, "b", a).getObjectId(0));
125 
126 			assertEquals(aSlashC,
127 					TreeWalk.forPath(or, "a/c", tree).getObjectId(0));
128 			assertEquals(aSlashC, TreeWalk.forPath(or, "c", a).getObjectId(0));
129 
130 			assertEquals(aSlashCSlashD.getObjectId(),
131 					TreeWalk.forPath(or, "a/c/d", tree).getObjectId(0));
132 			assertEquals(aSlashCSlashD.getObjectId(),
133 					TreeWalk.forPath(or, "c/d", a).getObjectId(0));
134 		}
135 	}
136 
137 }