com.github.scr.hashmap.maps.EntrySet Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of memory-mapped-hashmap Show documentation
Readonly Set and Map that use a MappedByteBuffer to load quickly and use minimal Java Heap.
There is a newer version: 1.2.0
Show newest version
/*
The MIT License (MIT)

Copyright (c) 2015 Sheridan C Rawlins

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
 */

package com.github.scr.hashmap.maps;

import com.github.scr.hashmap.collections.IndexedCollection;
import org.jetbrains.annotations.NotNull;
import sun.reflect.generics.reflectiveObjects.NotImplementedException;

import java.util.*;

/**
 * Created by scr on 7/3/15.
 */
public class EntrySet implements Set> {
    private final Set KEYS;
    private final IndexedCollection VALUES;

    public EntrySet(Set keys, IndexedCollection values) {
        KEYS = keys;
        VALUES = values;
    }

    @Override
    public int size() {
        return KEYS.size();
    }

    @Override
    public boolean isEmpty() {
        return KEYS.isEmpty();
    }

    @Override
    public boolean contains(Object o) {
        @SuppressWarnings("unchecked")
        Map.Entry oEntry = (Map.Entry) o;
        return KEYS.contains(oEntry.getKey()) && VALUES.contains(oEntry.getValue());
    }

    @NotNull
    @Override
    public Iterator> iterator() {
        return new EntryIterator<>(KEYS.iterator(), VALUES.iterator());
    }

    @NotNull
    @Override
    public Object[] toArray() {
        Object[] ret = new Object[KEYS.size()];
        int i = 0;
        for (Map.Entry charSequenceIntegerEntry : this) {
            ret[i++] = charSequenceIntegerEntry;
        }
        return ret;
    }

    @NotNull
    @Override
    public  T[] toArray(@NotNull T[] a) {
        {
            if (a.length < KEYS.size()) {
                a = Arrays.copyOf(a, KEYS.size());
            }
            int i = 0;
            for (Map.Entry entry : this) {
                @SuppressWarnings("unchecked")
                T tEntry = (T) entry;
                a[i++] = tEntry;
            }
            return a;
        }
    }

    @Override
    public boolean add(Map.Entry charSequenceVEntry) {
        throw new NotImplementedException();
    }

    @Override
    public boolean remove(Object o) {
        throw new NotImplementedException();
    }

    @Override
    public boolean containsAll(@NotNull Collection c) {
        for (Object o : c) {
            if (!contains(o)) {
                return false;
            }
        }
        return true;
    }

    @Override
    public boolean addAll(@NotNull Collection> c) {
        throw new NotImplementedException();
    }

    @Override
    public boolean retainAll(@NotNull Collection c) {
        throw new NotImplementedException();
    }

    @Override
    public boolean removeAll(@NotNull Collection c) {
        throw new NotImplementedException();
    }

    @Override
    public void clear() {
        throw new NotImplementedException();
    }
}