View Javadoc
1   /*
2    * Copyright (C) 2009, Google Inc.
3    * Copyright (C) 2008, Shawn O. Pearce <spearce@spearce.org>
4    * and other copyright owners as documented in the project's IP log.
5    *
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
10   *
11   * All rights reserved.
12   *
13   * Redistribution and use in source and binary forms, with or
14   * without modification, are permitted provided that the following
15   * conditions are met:
16   *
17   * - Redistributions of source code must retain the above copyright
18   *   notice, this list of conditions and the following disclaimer.
19   *
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.
24   *
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.
29   *
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.
43   */
44  
45  package org.eclipse.jgit.revwalk;
46  
47  import java.io.IOException;
48  
49  import org.eclipse.jgit.errors.IncorrectObjectTypeException;
50  import org.eclipse.jgit.errors.MissingObjectException;
51  
52  /**
53   * A queue of commits in LIFO order.
54   */
55  public class LIFORevQueue extends BlockRevQueue {
56  	private Block head;
57  
58  	/**
59  	 * Create an empty LIFO queue.
60  	 */
61  	public LIFORevQueue() {
62  		super();
63  	}
64  
65  	LIFORevQueue(Generator s) throws MissingObjectException,
66  			IncorrectObjectTypeException, IOException {
67  		super(s);
68  	}
69  
70  	/** {@inheritDoc} */
71  	@Override
72  	public void add(RevCommit c) {
73  		Block b = head;
74  		if (b == null || !b.canUnpop()) {
75  			b = free.newBlock();
76  			b.resetToEnd();
77  			b.next = head;
78  			head = b;
79  		}
80  		b.unpop(c);
81  	}
82  
83  	/** {@inheritDoc} */
84  	@Override
85  	public RevCommit next() {
86  		final Block b = head;
87  		if (b == null)
88  			return null;
89  
90  		final RevCommit c = b.pop();
91  		if (b.isEmpty()) {
92  			head = b.next;
93  			free.freeBlock(b);
94  		}
95  		return c;
96  	}
97  
98  	/** {@inheritDoc} */
99  	@Override
100 	public void clear() {
101 		head = null;
102 		free.clear();
103 	}
104 
105 	@Override
106 	boolean everbodyHasFlag(int f) {
107 		for (Block b = head; b != null; b = b.next) {
108 			for (int i = b.headIndex; i < b.tailIndex; i++)
109 				if ((b.commits[i].flags & f) == 0)
110 					return false;
111 		}
112 		return true;
113 	}
114 
115 	@Override
116 	boolean anybodyHasFlag(int f) {
117 		for (Block b = head; b != null; b = b.next) {
118 			for (int i = b.headIndex; i < b.tailIndex; i++)
119 				if ((b.commits[i].flags & f) != 0)
120 					return true;
121 		}
122 		return false;
123 	}
124 
125 	/** {@inheritDoc} */
126 	@Override
127 	public String toString() {
128 		final StringBuilder s = new StringBuilder();
129 		for (Block q = head; q != null; q = q.next) {
130 			for (int i = q.headIndex; i < q.tailIndex; i++)
131 				describe(s, q.commits[i]);
132 		}
133 		return s.toString();
134 	}
135 }