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

   1 /*
   2  * Copyright (C) 2007, Dave Watson <dwatson@mimvista.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.File;
  42 import java.io.IOException;
  43 import java.util.ArrayList;
  44
  45 import org.spearce.jgit.lib.GitIndex.Entry;
  46
  47 public class IndexTreeWalkerTest extends RepositoryTestCase {
  48         private ArrayList<String> treeOnlyEntriesVisited = new ArrayList<String>();
  49         private ArrayList<String> bothVisited = new ArrayList<String>();
  50         private ArrayList<String> indexOnlyEntriesVisited = new ArrayList<String>();
  51
  52         private class TestIndexTreeVisitor extends AbstractIndexTreeVisitor {
  53                 public void visitEntry(TreeEntry treeEntry, Entry indexEntry, File file) {
  54                         if (treeEntry == null)
  55                                 indexOnlyEntriesVisited.add(indexEntry.getName());
  56                         else if (indexEntry == null)
  57                                 treeOnlyEntriesVisited.add(treeEntry.getFullName());
  58                         else bothVisited.add(indexEntry.getName());
  59                 }
  60         }
  61
  62         /*
  63          * Need to think about what I really need to be able to do....
  64          *
  65          * 1) Visit all entries in index and tree
  66          * 2) Get all directories that exist in the index, but not in the tree
  67          *    -- I'm pretty sure that I don't need to do the other way around
  68          *       because I already
  69          */
  70
  71         public void testTreeOnlyOneLevel() throws IOException {
  72                 GitIndex index = new GitIndex(db);
  73                 Tree tree = new Tree(db);
  74                 tree.addFile("foo");
  75                 tree.addFile("bar");
  76
  77                 new IndexTreeWalker(index, tree, trash, new TestIndexTreeVisitor()).walk();
  78
  79                 assertTrue(treeOnlyEntriesVisited.get(0).equals("bar"));
  80                 assertTrue(treeOnlyEntriesVisited.get(1).equals("foo"));
  81         }
  82
  83         public void testIndexOnlyOneLevel() throws IOException {
  84                 GitIndex index = new GitIndex(db);
  85                 Tree tree = new Tree(db);
  86
  87                 index.add(trash, writeTrashFile("foo", "foo"));
  88                 index.add(trash, writeTrashFile("bar", "bar"));
  89                 new IndexTreeWalker(index, tree, trash, new TestIndexTreeVisitor()).walk();
  90
  91                 assertTrue(indexOnlyEntriesVisited.get(0).equals("bar"));
  92                 assertTrue(indexOnlyEntriesVisited.get(1).equals("foo"));
  93         }
  94
  95         public void testBoth() throws IOException {
  96                 GitIndex index = new GitIndex(db);
  97                 Tree tree = new Tree(db);
  98
  99                 index.add(trash, writeTrashFile("a", "a"));
 100                 tree.addFile("b/b");
 101                 index.add(trash, writeTrashFile("c", "c"));
 102                 tree.addFile("c");
 103
 104                 new IndexTreeWalker(index, tree, trash, new TestIndexTreeVisitor()).walk();
 105                 assertTrue(indexOnlyEntriesVisited.contains("a"));
 106                 assertTrue(treeOnlyEntriesVisited.contains("b/b"));
 107                 assertTrue(bothVisited.contains("c"));
 108
 109         }
 110
 111         public void testIndexOnlySubDirs() throws IOException {
 112                 GitIndex index = new GitIndex(db);
 113                 Tree tree = new Tree(db);
 114
 115                 index.add(trash, writeTrashFile("foo/bar/baz", "foobar"));
 116                 index.add(trash, writeTrashFile("asdf", "asdf"));
 117                 new IndexTreeWalker(index, tree, trash, new TestIndexTreeVisitor()).walk();
 118
 119                 assertEquals("asdf", indexOnlyEntriesVisited.get(0));
 120                 assertEquals("foo/bar/baz", indexOnlyEntriesVisited.get(1));
 121         }
 122
 123         public void testLeavingTree() throws IOException {
 124                 GitIndex index = new GitIndex(db);
 125                 index.add(trash, writeTrashFile("foo/bar", "foo/bar"));
 126                 index.add(trash, writeTrashFile("foobar", "foobar"));
 127
 128                 new IndexTreeWalker(index, db.mapTree(index.writeTree()), trash, new AbstractIndexTreeVisitor() {
 129                         @Override
 130                         public void visitEntry(TreeEntry entry, Entry indexEntry, File f) {
 131                                 if (entry == null || indexEntry == null)
 132                                         fail();
 133                         }
 134
 135                         @Override
 136                         public void finishVisitTree(Tree tree, int i, String curDir)
 137                                         throws IOException {
 138                                 if (tree.memberCount() == 0)
 139                                         fail();
 140                                 if (i == 0)
 141                                         fail();
 142                         }
 143
 144                 }).walk();
 145         }
 146 }