| /* |
| * Copyright 2000-2009 JetBrains s.r.o. |
| * |
| * Licensed under the Apache License, Version 2.0 (the "License"); |
| * you may not use this file except in compliance with the License. |
| * You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, software |
| * distributed under the License is distributed on an "AS IS" BASIS, |
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| * See the License for the specific language governing permissions and |
| * limitations under the License. |
| */ |
| package com.intellij.util.containers; |
| |
| import com.intellij.util.PairProcessor; |
| import gnu.trove.TObjectHashingStrategy; |
| import org.jetbrains.annotations.NotNull; |
| |
| import java.util.Map; |
| |
| /** |
| * @author peter |
| */ |
| public class SoftArrayHashMap<T,V> implements Cloneable { |
| private SoftHashMap<T, SoftArrayHashMap<T,V>> myContinuationMap; |
| private SoftHashMap<T,V> myValuesMap; |
| private V myEmptyValue; |
| private final TObjectHashingStrategy<T> myStrategy; |
| |
| public SoftArrayHashMap() { |
| this(ContainerUtil.<T>canonicalStrategy()); |
| } |
| |
| public SoftArrayHashMap(@NotNull TObjectHashingStrategy<T> strategy) { |
| myStrategy = strategy; |
| } |
| |
| private V get(T[] array, int index) { |
| if (index == array.length - 1) { |
| return myValuesMap != null ? myValuesMap.get(array[index]) : null; |
| } |
| |
| if (myContinuationMap != null) { |
| final SoftArrayHashMap<T, V> map = myContinuationMap.get(array[index]); |
| if (map != null) { |
| return map.get(array, index + 1); |
| } |
| } |
| |
| return null; |
| } |
| |
| public final V get(T[] key) { |
| if (key.length == 0) { |
| return myEmptyValue; |
| } |
| return get(key, 0); |
| } |
| |
| public boolean processLeafEntries(final PairProcessor<T, V> processor) { |
| if (myValuesMap != null) { |
| for (T t : myValuesMap.keySet()) { |
| if (!processor.process(t, myValuesMap.get(t))) return false; |
| } |
| } |
| if (myContinuationMap != null) { |
| for (SoftArrayHashMap<T, V> map : myContinuationMap.values()) { |
| if (!map.processLeafEntries(processor)) return false; |
| } |
| } |
| return true; |
| } |
| |
| private void put(T[] array, int index, V value) { |
| final T key = array[index]; |
| if (index == array.length - 1) { |
| if (myValuesMap == null) { |
| myValuesMap = new SoftHashMap<T, V>(myStrategy); |
| } |
| myValuesMap.put(key, value); |
| } else { |
| if (myContinuationMap == null) { |
| myContinuationMap = new SoftHashMap<T, SoftArrayHashMap<T, V>>(myStrategy); |
| } |
| SoftArrayHashMap<T, V> softArrayHashMap = myContinuationMap.get(key); |
| if (softArrayHashMap == null) { |
| myContinuationMap.put(key, softArrayHashMap = new SoftArrayHashMap<T, V>(myStrategy)); |
| } |
| softArrayHashMap.put(array, index + 1, value); |
| } |
| } |
| |
| public final void put(T[] key, V value) { |
| if (key.length == 0) { |
| myEmptyValue = value; |
| } else { |
| put(key, 0, value); |
| } |
| } |
| |
| public final void clear() { |
| myContinuationMap = null; |
| myValuesMap = null; |
| myEmptyValue = null; |
| } |
| |
| public final boolean containsKey(final T[] path) { |
| return get(path) != null; |
| } |
| |
| @Override |
| public final SoftArrayHashMap<T,V> clone() { |
| final SoftArrayHashMap<T, V> copy = new SoftArrayHashMap<T, V>(myStrategy); |
| copy.myContinuationMap = copyMap(myContinuationMap); |
| copy.myValuesMap = copyMap(myValuesMap); |
| copy.myEmptyValue = myEmptyValue; |
| return copy; |
| } |
| |
| private <X> SoftHashMap<T, X> copyMap(final SoftHashMap<T, X> map) { |
| final SoftHashMap<T, X> copy = new SoftHashMap<T, X>(); |
| for (final Map.Entry<T, X> entry : map.entrySet()) { |
| copy.put(entry.getKey(), entry.getValue()); |
| } |
| return copy; |
| } |
| } |