org.spearce.jgit.test/tst/org/spearce/jgit/lib/TreeIteratorLeafOnlyTest.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 TreeIteratorLeafOnlyTest extends RepositoryTestCase {
  44
  45         /** Empty tree */
  46         public void testEmpty() {
  47                 Tree tree = new Tree(db);
  48                 TreeIterator i = makeIterator(tree);
  49                 assertFalse(i.hasNext());
  50         }
  51
  52         /**
  53          * one file
  54          *
  55          * @throws IOException
  56          */
  57         public void testSimpleF1() throws IOException {
  58                 Tree tree = new Tree(db);
  59                 tree.addFile("x");
  60                 TreeIterator i = makeIterator(tree);
  61                 assertTrue(i.hasNext());
  62                 assertEquals("x", i.next().getName());
  63         }
  64
  65         /**
  66          * two files
  67          *
  68          * @throws IOException
  69          */
  70         public void testSimpleF2() throws IOException {
  71                 Tree tree = new Tree(db);
  72                 tree.addFile("a");
  73                 tree.addFile("x");
  74                 TreeIterator i = makeIterator(tree);
  75                 assertTrue(i.hasNext());
  76                 assertEquals("a", i.next().getName());
  77                 assertEquals("x", i.next().getName());
  78         }
  79
  80         /**
  81          * Empty tree
  82          *
  83          * @throws IOException
  84          */
  85         public void testSimpleT() throws IOException {
  86                 Tree tree = new Tree(db);
  87                 tree.addTree("a");
  88                 TreeIterator i = makeIterator(tree);
  89                 assertFalse(i.hasNext());
  90         }
  91
  92         public void testTricky() throws IOException {
  93                 Tree tree = new Tree(db);
  94                 tree.addFile("a.b");
  95                 tree.addFile("a.c");
  96                 tree.addFile("a/b.b/b");
  97                 tree.addFile("a/b");
  98                 tree.addFile("a/c");
  99                 tree.addFile("a=c");
 100                 tree.addFile("a=d");
 101
 102                 TreeIterator i = makeIterator(tree);
 103                 assertTrue(i.hasNext());
 104                 assertEquals("a.b", i.next().getFullName());
 105                 assertTrue(i.hasNext());
 106                 assertEquals("a.c", i.next().getFullName());
 107                 assertTrue(i.hasNext());
 108                 assertEquals("a/b", i.next().getFullName());
 109                 assertTrue(i.hasNext());
 110                 assertEquals("a/b.b/b", i.next().getFullName());
 111                 assertTrue(i.hasNext());
 112                 assertEquals("a/c", i.next().getFullName());
 113                 assertTrue(i.hasNext());
 114                 assertEquals("a=c", i.next().getFullName());
 115                 assertTrue(i.hasNext());
 116                 assertEquals("a=d", i.next().getFullName());
 117                 assertFalse(i.hasNext());
 118         }
 119
 120         private TreeIterator makeIterator(Tree tree) {
 121                 return new TreeIterator(tree);
 122         }
 123 }