2 * (C) Copyright 2016 Pantheon Technologies, s.r.o. and others.
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
16 package org.opendaylight.yangtools.triemap;
18 import java.util.AbstractMap.SimpleImmutableEntry;
19 import java.util.Iterator;
20 import java.util.Map.Entry;
21 import java.util.NoSuchElementException;
24 * Mimic immutable ListMap in Scala
26 * @author Roman Levenstein <romixlev@gmail.com>
30 final class ListMap<K, V> {
34 // Modified during remove0 only
35 private ListMap<K, V> next;
37 private ListMap(final K k, final V v) {
41 private ListMap(final K k, final V v, final ListMap<K, V> next) {
47 static <K,V> ListMap<K, V> map(final K k1, final V v1, final K k2, final V v2) {
48 return new ListMap<>(k1, v1, new ListMap<>(k2, v2));
53 for (ListMap<?, ?> wlk = next; wlk != null; wlk = wlk.next) {
59 Option<V> get(final K key) {
61 return Option.makeOption(v);
64 // We do not perform recursion on purpose here, so we do not run out of stack if the key hashing fails.
65 for (ListMap<K, V> m = next; m != null; m = m.next) {
66 if (key.equals(m.k)) {
67 return Option.makeOption(m.v);
71 return Option.makeOption();
74 ListMap<K,V> add(final K key, final V value) {
75 return new ListMap<>(key, value, remove(key));
78 ListMap<K, V> remove(final K key) {
86 private boolean contains(final K key) {
91 // We do not perform recursion on purpose here, so we do not run out of stack if the key hashing fails.
92 for (ListMap<K, V> m = next; m != null; m = m.next) {
93 if (key.equals(m.k)) {
101 private ListMap<K, V> remove0(final K key) {
102 ListMap<K, V> n = this;
103 ListMap<K, V> ret = null;
104 ListMap<K, V> lastN = null;
106 if (key.equals(n.k)) {
112 lastN.next = new ListMap<>(n.k, n.v);
115 ret = new ListMap<>(n.k, n.v);
123 Iterator<Entry<K, V>> iterator() {
124 return new NodeIterator<>(this);
127 static final class NodeIterator<K,V> implements Iterator<Entry<K, V>> {
128 private ListMap<K, V> n;
130 NodeIterator(final ListMap<K, V> n) {
135 public boolean hasNext() {
140 public Entry<K, V> next() {
142 throw new NoSuchElementException();
145 final Entry<K, V> res = new SimpleImmutableEntry<>(n.k, n.v);