1 /*
2 * Copyright (C) 2008, Shawn O. Pearce <spearce@spearce.org>
3 * and other copyright owners as documented in the project's IP log.
4 *
5 * This program and the accompanying materials are made available
6 * under the terms of the Eclipse Distribution License v1.0 which
7 * accompanies this distribution, is reproduced below, and is
8 * available at http://www.eclipse.org/org/documents/edl-v10.php
9 *
10 * All rights reserved.
11 *
12 * Redistribution and use in source and binary forms, with or
13 * without modification, are permitted provided that the following
14 * conditions are met:
15 *
16 * - Redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer.
18 *
19 * - Redistributions in binary form must reproduce the above
20 * copyright notice, this list of conditions and the following
21 * disclaimer in the documentation and/or other materials provided
22 * with the distribution.
23 *
24 * - Neither the name of the Eclipse Foundation, Inc. nor the
25 * names of its contributors may be used to endorse or promote
26 * products derived from this software without specific prior
27 * written permission.
28 *
29 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
30 * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
31 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
32 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
33 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
34 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
35 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
36 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
37 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
38 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
39 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
40 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
41 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
42 */
43
44 package org.eclipse.jgit.revwalk;
45
46 import java.util.AbstractSet;
47 import java.util.ArrayList;
48 import java.util.Collection;
49 import java.util.Iterator;
50 import java.util.List;
51
52 /**
53 * Multiple application level mark bits for {@link RevObject}s.
54 *
55 * @see RevFlag
56 */
57 public class RevFlagSet extends AbstractSet<RevFlag> {
58 int mask;
59
60 private final List<RevFlag> active;
61
62 /** Create an empty set of flags. */
63 public RevFlagSet() {
64 active = new ArrayList<RevFlag>();
65 }
66
67 /**
68 * Create a set of flags, copied from an existing set.
69 *
70 * @param s
71 * the set to copy flags from.
72 */
73 public RevFlagSet(final RevFlagSet s) {
74 mask = s.mask;
75 active = new ArrayList<RevFlag>(s.active);
76 }
77
78 /**
79 * Create a set of flags, copied from an existing collection.
80 *
81 * @param s
82 * the collection to copy flags from.
83 */
84 public RevFlagSet(final Collection<RevFlag> s) {
85 this();
86 addAll(s);
87 }
88
89 @Override
90 public boolean contains(final Object o) {
91 if (o instanceof RevFlag)
92 return (mask & ((RevFlag) o).mask) != 0;
93 return false;
94 }
95
96 @Override
97 public boolean containsAll(final Collection<?> c) {
98 if (c instanceof RevFlagSet) {
99 final int cMask = ((RevFlagSet) c).mask;
100 return (mask & cMask) == cMask;
101 }
102 return super.containsAll(c);
103 }
104
105 @Override
106 public boolean add(final RevFlag flag) {
107 if ((mask & flag.mask) != 0)
108 return false;
109 mask |= flag.mask;
110 int p = 0;
111 while (p < active.size() && active.get(p).mask < flag.mask)
112 p++;
113 active.add(p, flag);
114 return true;
115 }
116
117 @Override
118 public boolean remove(final Object o) {
119 final RevFlag flag = (RevFlag) o;
120 if ((mask & flag.mask) == 0)
121 return false;
122 mask &= ~flag.mask;
123 for (int i = 0; i < active.size(); i++)
124 if (active.get(i).mask == flag.mask)
125 active.remove(i);
126 return true;
127 }
128
129 @Override
130 public Iterator<RevFlag> iterator() {
131 final Iterator<RevFlag> i = active.iterator();
132 return new Iterator<RevFlag>() {
133 private RevFlag current;
134
135 public boolean hasNext() {
136 return i.hasNext();
137 }
138
139 public RevFlag next() {
140 return current = i.next();
141 }
142
143 public void remove() {
144 mask &= ~current.mask;
145 i.remove();
146 }
147 };
148 }
149
150 @Override
151 public int size() {
152 return active.size();
153 }
154 }