org.spearce.jgit.test/tst/org/spearce/jgit/lib/TreeIteratorPostOrderTest.java

   1 /*
   2  * Copyright (C) 2008, Robin Rosenberg <robin.rosenberg@dewire.com>
   3  * Copyright (C) 2006, Shawn O. Pearce <spearce@spearce.org>
   4  *
   5  * All rights reserved.
   6  *
   7  * Redistribution and use in source and binary forms, with or
   8  * without modification, are permitted provided that the following
   9  * conditions are met:
  10  *
  11  * - Redistributions of source code must retain the above copyright
  12  *   notice, this list of conditions and the following disclaimer.
  13  *
  14  * - Redistributions in binary form must reproduce the above
  15  *   copyright notice, this list of conditions and the following
  16  *   disclaimer in the documentation and/or other materials provided
  17  *   with the distribution.
  18  *
  19  * - Neither the name of the Git Development Community nor the
  20  *   names of its contributors may be used to endorse or promote
  21  *   products derived from this software without specific prior
  22  *   written permission.
  23  *
  24  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
  25  * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
  26  * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  27  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  28  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
  29  * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  30  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  31  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  32  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  33  * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  34  * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  35  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
  36  * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  37  */
  38
  39 package org.spearce.jgit.lib;
  40
  41 import java.io.IOException;
  42
  43 public class TreeIteratorPostOrderTest extends RepositoryTestCase {
  44
  45         /** Empty tree */
  46         public void testEmpty() {
  47                 Tree tree = new Tree(db);
  48                 TreeIterator i = makeIterator(tree);
  49                 assertTrue(i.hasNext());
  50                 assertEquals("", i.next().getFullName());
  51                 assertFalse(i.hasNext());
  52         }
  53
  54         /**
  55          * one file
  56          *
  57          * @throws IOException
  58          */
  59         public void testSimpleF1() throws IOException {
  60                 Tree tree = new Tree(db);
  61                 tree.addFile("x");
  62                 TreeIterator i = makeIterator(tree);
  63                 assertTrue(i.hasNext());
  64                 assertEquals("x", i.next().getName());
  65                 assertTrue(i.hasNext());
  66                 assertEquals("", i.next().getFullName());
  67                 assertFalse(i.hasNext());
  68         }
  69
  70         /**
  71          * two files
  72          *
  73          * @throws IOException
  74          */
  75         public void testSimpleF2() throws IOException {
  76                 Tree tree = new Tree(db);
  77                 tree.addFile("a");
  78                 tree.addFile("x");
  79                 TreeIterator i = makeIterator(tree);
  80                 assertTrue(i.hasNext());
  81                 assertEquals("a", i.next().getName());
  82                 assertEquals("x", i.next().getName());
  83                 assertTrue(i.hasNext());
  84                 assertEquals("", i.next().getFullName());
  85                 assertFalse(i.hasNext());
  86         }
  87
  88         /**
  89          * Empty tree
  90          *
  91          * @throws IOException
  92          */
  93         public void testSimpleT() throws IOException {
  94                 Tree tree = new Tree(db);
  95                 tree.addTree("a");
  96                 TreeIterator i = makeIterator(tree);
  97                 assertTrue(i.hasNext());
  98                 assertEquals("a", i.next().getFullName());
  99                 assertTrue(i.hasNext());
 100                 assertEquals("", i.next().getFullName());
 101                 assertFalse(i.hasNext());
 102         }
 103
 104         public void testTricky() throws IOException {
 105                 Tree tree = new Tree(db);
 106                 tree.addFile("a.b");
 107                 tree.addFile("a.c");
 108                 tree.addFile("a/b.b/b");
 109                 tree.addFile("a/b");
 110                 tree.addFile("a/c");
 111                 tree.addFile("a=c");
 112                 tree.addFile("a=d");
 113
 114                 TreeIterator i = makeIterator(tree);
 115                 assertTrue(i.hasNext());
 116                 assertEquals("a.b", i.next().getFullName());
 117                 assertTrue(i.hasNext());
 118                 assertEquals("a.c", i.next().getFullName());
 119                 assertTrue(i.hasNext());
 120                 assertEquals("a/b", i.next().getFullName());
 121                 assertTrue(i.hasNext());
 122                 assertEquals("a/b.b/b", i.next().getFullName());
 123                 assertTrue(i.hasNext());
 124                 assertEquals("a/b.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=c", i.next().getFullName());
 131                 assertTrue(i.hasNext());
 132                 assertEquals("a=d", i.next().getFullName());
 133                 assertTrue(i.hasNext());
 134                 assertEquals("", i.next().getFullName());
 135                 assertFalse(i.hasNext());
 136         }
 137
 138         private TreeIterator makeIterator(Tree tree) {
 139                 return new TreeIterator(tree, TreeIterator.Order.POSTORDER);
 140         }
 141 }