2 * Copyright (C) 2008, Google Inc.
6 * Redistribution and use in source and binary forms, with or
7 * without modification, are permitted provided that the following
10 * - Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
13 * - Redistributions in binary form must reproduce the above
14 * copyright notice, this list of conditions and the following
15 * disclaimer in the documentation and/or other materials provided
16 * with the distribution.
18 * - Neither the name of the Git Development Community nor the
19 * names of its contributors may be used to endorse or promote
20 * products derived from this software without specific prior
23 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
24 * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
25 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
26 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
28 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
29 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
30 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
31 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
32 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
33 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
34 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
35 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
38 package org
.spearce
.jgit
.dircache
;
40 import java
.util
.Collections
;
42 import org
.spearce
.jgit
.lib
.FileMode
;
43 import org
.spearce
.jgit
.lib
.RepositoryTestCase
;
44 import org
.spearce
.jgit
.treewalk
.TreeWalk
;
45 import org
.spearce
.jgit
.treewalk
.filter
.PathFilterGroup
;
47 public class DirCacheBuilderIteratorTest
extends RepositoryTestCase
{
48 public void testPathFilterGroup_DoesNotSkipTail() throws Exception
{
49 final DirCache dc
= DirCache
.read(db
);
51 final FileMode mode
= FileMode
.REGULAR_FILE
;
52 final String
[] paths
= { "a.", "a/b", "a/c", "a/d", "a0b" };
53 final DirCacheEntry
[] ents
= new DirCacheEntry
[paths
.length
];
54 for (int i
= 0; i
< paths
.length
; i
++) {
55 ents
[i
] = new DirCacheEntry(paths
[i
]);
56 ents
[i
].setFileMode(mode
);
59 final DirCacheBuilder b
= dc
.builder();
60 for (int i
= 0; i
< ents
.length
; i
++)
66 final DirCacheBuilder b
= dc
.builder();
67 final TreeWalk tw
= new TreeWalk(db
);
69 tw
.addTree(new DirCacheBuildIterator(b
));
70 tw
.setRecursive(true);
71 tw
.setFilter(PathFilterGroup
.createFromStrings(Collections
72 .singleton(paths
[expIdx
])));
74 assertTrue("found " + paths
[expIdx
], tw
.next());
75 final DirCacheIterator c
= tw
.getTree(0, DirCacheIterator
.class);
77 assertEquals(expIdx
, c
.cachePos
);
78 assertSame(ents
[expIdx
], c
.getDirCacheEntry());
79 assertEquals(paths
[expIdx
], tw
.getPathString());
80 assertEquals(mode
.getBits(), tw
.getRawMode(0));
81 assertSame(mode
, tw
.getFileMode(0));
82 b
.add(c
.getDirCacheEntry());
84 assertFalse("no more entries", tw
.next());
87 assertEquals(ents
.length
, dc
.getEntryCount());
88 for (int i
= 0; i
< ents
.length
; i
++)
89 assertSame(ents
[i
], dc
.getEntry(i
));