All Downloads are FREE. Search and download functionalities are using the official Maven repository.

net.openhft.collect.impl.CommonShortObjMapOps Maven / Gradle / Ivy

The newest version!
/*
 * Copyright 2014 the original author or authors.
 *
 * 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 net.openhft.collect.impl;

import net.openhft.function.ShortObjPredicate;
import net.openhft.function.ShortObjConsumer;
import net.openhft.collect.map.ShortObjMap;

import java.util.Map;


public final class CommonShortObjMapOps {

    public static boolean containsAllEntries(final InternalShortObjMapOps map,
            Map another) {
        if ( map == another )
            throw new IllegalArgumentException();
        if (another instanceof ShortObjMap) {
            ShortObjMap m2 = (ShortObjMap) another;
            if (
                
                    NullableObjects.equals(m2.valueEquivalence(), map.valueEquivalence())
            ) {
                if (map.size() < m2.size())
                    return false;
                if (m2 instanceof InternalShortObjMapOps) {
                    //noinspection unchecked
                    return ((InternalShortObjMapOps) m2).allEntriesContainingIn(map);
                }
            }
            // noinspection unchecked
            return m2.forEachWhile(new
                   ShortObjPredicate() {
                @Override
                public boolean test(short a, Object b) {
                    return map.containsEntry(a, b);
                }
            });
        }
        for ( Map.Entry e : another.entrySet() ) {
            if ( !map.containsEntry((Short) e.getKey(),
                    e.getValue()))
                return false;
        }
        return true;
    }

    public static  void putAll(final InternalShortObjMapOps map,
            Map another) {
        if (map == another)
            throw new IllegalArgumentException();
        long maxPossibleSize = map.sizeAsLong() + Containers.sizeAsLong(another);
        map.ensureCapacity(maxPossibleSize);
        if (another instanceof ShortObjMap) {
            if (another instanceof InternalShortObjMapOps) {
                ((InternalShortObjMapOps) another).reversePutAllTo(map);
            } else {
                ((ShortObjMap) another).forEach(new ShortObjConsumer() {
                    @Override
                    public void accept(short key, V value) {
                        map.justPut(key, value);
                    }
                });
            }
        } else {
            for (Map.Entry e : another.entrySet()) {
                map.justPut(e.getKey(), e.getValue());
            }
        }
    }

    private CommonShortObjMapOps() {}
}





© 2015 - 2025 Weber Informatics LLC | Privacy Policy