Add support for creating detached heads
[jgit.git] / org.eclipse.jgit.test / tst / org / eclipse / jgit / lib / TreeIteratorPreOrderTest.java
blob79d090d8a04b197506ab63263f5dd6f5ef910aea
1 /*
2 * Copyright (C) 2008, Robin Rosenberg <robin.rosenberg@dewire.com>
3 * Copyright (C) 2006, Shawn O. Pearce <spearce@spearce.org>
4 * and other copyright owners as documented in the project's IP log.
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
11 * All rights reserved.
13 * Redistribution and use in source and binary forms, with or
14 * without modification, are permitted provided that the following
15 * conditions are met:
17 * - Redistributions of source code must retain the above copyright
18 * notice, this list of conditions and the following disclaimer.
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.
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.
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.
45 package org.eclipse.jgit.lib;
47 import java.io.IOException;
49 public class TreeIteratorPreOrderTest extends RepositoryTestCase {
51 /** Empty tree */
52 public void testEmpty() {
53 Tree tree = new Tree(db);
54 TreeIterator i = makeIterator(tree);
55 assertTrue(i.hasNext());
56 assertEquals("", i.next().getFullName());
57 assertFalse(i.hasNext());
60 /**
61 * one file
63 * @throws IOException
65 public void testSimpleF1() throws IOException {
66 Tree tree = new Tree(db);
67 tree.addFile("x");
68 TreeIterator i = makeIterator(tree);
69 assertTrue(i.hasNext());
70 assertEquals("", i.next().getFullName());
71 assertTrue(i.hasNext());
72 assertEquals("x", i.next().getName());
73 assertFalse(i.hasNext());
76 /**
77 * two files
79 * @throws IOException
81 public void testSimpleF2() throws IOException {
82 Tree tree = new Tree(db);
83 tree.addFile("a");
84 tree.addFile("x");
85 TreeIterator i = makeIterator(tree);
86 assertTrue(i.hasNext());
87 assertEquals("", i.next().getFullName());
88 assertTrue(i.hasNext());
89 assertEquals("a", i.next().getName());
90 assertEquals("x", i.next().getName());
91 assertFalse(i.hasNext());
94 /**
95 * Empty tree
97 * @throws IOException
99 public void testSimpleT() throws IOException {
100 Tree tree = new Tree(db);
101 tree.addTree("a");
102 TreeIterator i = makeIterator(tree);
103 assertTrue(i.hasNext());
104 assertEquals("", i.next().getFullName());
105 assertTrue(i.hasNext());
106 assertEquals("a", i.next().getFullName());
107 assertFalse(i.hasNext());
110 public void testTricky() throws IOException {
111 Tree tree = new Tree(db);
112 tree.addFile("a.b");
113 tree.addFile("a.c");
114 tree.addFile("a/b.b/b");
115 tree.addFile("a/b");
116 tree.addFile("a/c");
117 tree.addFile("a=c");
118 tree.addFile("a=d");
120 TreeIterator i = makeIterator(tree);
121 assertTrue(i.hasNext());
122 assertEquals("", i.next().getFullName());
123 assertTrue(i.hasNext());
124 assertEquals("a.b", i.next().getFullName());
125 assertTrue(i.hasNext());
126 assertEquals("a.c", i.next().getFullName());
127 assertTrue(i.hasNext());
128 assertEquals("a", i.next().getFullName());
129 assertTrue(i.hasNext());
130 assertEquals("a/b", i.next().getFullName());
131 assertTrue(i.hasNext());
132 assertEquals("a/b.b", i.next().getFullName());
133 assertTrue(i.hasNext());
134 assertEquals("a/b.b/b", i.next().getFullName());
135 assertTrue(i.hasNext());
136 assertEquals("a/c", i.next().getFullName());
137 assertTrue(i.hasNext());
138 assertEquals("a=c", i.next().getFullName());
139 assertTrue(i.hasNext());
140 assertEquals("a=d", i.next().getFullName());
141 assertFalse(i.hasNext());
144 private TreeIterator makeIterator(Tree tree) {
145 return new TreeIterator(tree, TreeIterator.Order.PREORDER);