blob: e24b244871a8c3ed7b2357a416308c86e4a58bf8 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
|
/*******************************************************************************
* Copyright (c) 2004-2008 Gabor Bergmann and Daniel Varro
* This program and the accompanying materials are made available under the
* terms of the Eclipse Public License v. 2.0 which is available at
* http://www.eclipse.org/legal/epl-v20.html.
*
* SPDX-License-Identifier: EPL-2.0
*******************************************************************************/
package tools.refinery.viatra.runtime.matchers.util;
import java.util.Iterator;
import java.util.Set;
import java.util.function.BiConsumer;
import org.eclipse.collections.impl.map.mutable.primitive.ObjectIntHashMap;
/**
* Eclipse Collections-based multiset for tuples. Can contain duplicate occurrences of the same matching.
*
* <p>Inherits Eclipse Collections' Object-to-Int primitive hashmap and counts the number of occurrences of each value.
* Element is deleted if # of occurences drops to 0.
*
* @author Gabor Bergmann.
* @since 1.7
* @noreference
*/
public abstract class EclipseCollectionsBagMemory<T> extends ObjectIntHashMap<T> implements IMemory<T> {
public EclipseCollectionsBagMemory() {
super();
}
@Override
public int getCount(T value) {
return super.getIfAbsent(value, 0);
}
@Override
public int getCountUnsafe(Object value) {
return super.getIfAbsent(value, 0);
}
@Override
public boolean containsNonZero(T value) {
return super.containsKey(value);
}
@Override
public boolean containsNonZeroUnsafe(Object value) {
return super.containsKey(value);
}
@Override
public void clearAllOf(T value) {
super.remove(value);
}
@Override
public Iterator<T> iterator() {
return super.keySet().iterator();
}
@Override
public String toString() {
return "TM" + super.toString();
}
@Override
public Set<T> distinctValues() {
return super.keySet();
}
@Override
public void forEachEntryWithMultiplicities(BiConsumer<T, Integer> entryConsumer) {
super.forEachKeyValue(entryConsumer::accept);
}
@Override
public int hashCode() {
return IMemoryView.hashCode(this);
}
@Override
public boolean equals(Object obj) {
return IMemoryView.equals(this, obj);
}
}
|
