1 /*
2 * Copyright (C) 2017, Thomas Wolf <thomas.wolf@paranor.ch>
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.events;
45
46 import static org.junit.Assert.assertArrayEquals;
47 import static org.junit.Assert.assertEquals;
48
49 import java.util.Arrays;
50 import java.util.HashSet;
51 import java.util.Set;
52
53 /**
54 * A {@link WorkingTreeModifiedListener} that can be used in tests to check
55 * expected events.
56 */
57 public class ChangeRecorder implements WorkingTreeModifiedListener {
58
59 public static final String[] EMPTY = new String[0];
60
61 private Set<String> modified = new HashSet<>();
62
63 private Set<String> deleted = new HashSet<>();
64
65 private int eventCount;
66
67 @Override
68 public void onWorkingTreeModified(WorkingTreeModifiedEvent event) {
69 eventCount++;
70 modified.removeAll(event.getDeleted());
71 deleted.removeAll(event.getModified());
72 modified.addAll(event.getModified());
73 deleted.addAll(event.getDeleted());
74 }
75
76 private String[] getModified() {
77 return modified.toArray(new String[modified.size()]);
78 }
79
80 private String[] getDeleted() {
81 return deleted.toArray(new String[deleted.size()]);
82 }
83
84 private void reset() {
85 eventCount = 0;
86 modified.clear();
87 deleted.clear();
88 }
89
90 public void assertNoEvent() {
91 assertEquals("Unexpected WorkingTreeModifiedEvent ", 0, eventCount);
92 }
93
94 public void assertEvent(String[] expectedModified,
95 String[] expectedDeleted) {
96 String[] actuallyModified = getModified();
97 String[] actuallyDeleted = getDeleted();
98 Arrays.sort(actuallyModified);
99 Arrays.sort(expectedModified);
100 Arrays.sort(actuallyDeleted);
101 Arrays.sort(expectedDeleted);
102 assertArrayEquals("Unexpected modifications reported", expectedModified,
103 actuallyModified);
104 assertArrayEquals("Unexpected deletions reported", expectedDeleted,
105 actuallyDeleted);
106 reset();
107 }
108 }