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

jetbrains.exodus.bindings.ComparableSet Maven / Gradle / Ivy

There is a newer version: 10.5.0.78949
Show newest version
/**
 * Copyright 2010 - 2022 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
 *
 * https://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 jetbrains.exodus.bindings;

import org.jetbrains.annotations.NotNull;
import org.jetbrains.annotations.Nullable;

import java.util.Comparator;
import java.util.Iterator;
import java.util.NavigableSet;
import java.util.TreeSet;

public class ComparableSet> implements Comparable>, Iterable {

    @NotNull
    private final NavigableSet set;
    private final ComparableSetItemComparator comparator;
    private boolean isDirty;

    public ComparableSet() {
        comparator = new ComparableSetItemComparator<>();
        this.set = new TreeSet<>(comparator);
        isDirty = false;
    }

    public ComparableSet(@NotNull final Iterable it) {
        comparator = new ComparableSetItemComparator<>();
        this.set = new TreeSet<>(comparator);
        for (final T item : it) {
            set.add(item);
        }
        isDirty = false;
    }

    @Override
    public int compareTo(@NotNull final ComparableSet right) {
        final Iterator thisIt = set.iterator();
        final Iterator rightIt = right.set.iterator();
        while (thisIt.hasNext() && rightIt.hasNext()) {
            final int cmp = comparator.compare(thisIt.next(), rightIt.next());
            if (cmp != 0) {
                return cmp;
            }
        }
        if (thisIt.hasNext()) {
            return 1;
        }
        if (rightIt.hasNext()) {
            return -1;
        }
        return 0;
    }

    public T getMinimum() {
        return set.first();
    }

    public T getMaximum() {
        return set.last();
    }

    /**
     * @return difference between this set and subtrahend.
     */
    public ComparableSet minus(@Nullable final ComparableSet subtrahend) {
        if (subtrahend == null) {
            return this;
        }
        final ComparableSet result = new ComparableSet<>();
        for (final T item : set) {
            if (!subtrahend.set.contains(item)) {
                result.addItem(item);
            }
        }
        return result;
    }

    public boolean containsItem(@NotNull final T item) {
        return set.contains(item);
    }

    public boolean containsItem(@NotNull final Object item) {
        return set.contains(item);
    }

    public boolean addItem(@NotNull final T item) {
        final boolean result = set.add(item);
        isDirty |= result;
        return result;
    }

    public boolean removeItem(@NotNull final T item) {
        final boolean result = set.remove(item);
        isDirty |= result;
        return result;
    }

    public int size() {
        return set.size();
    }

    public boolean isEmpty() {
        return set.isEmpty();
    }

    public boolean isDirty() {
        return isDirty;
    }

    public void forEach(@NotNull final Consumer action) {
        int index = 0;
        for (final T item : set) {
            action.accept(item, index++);
        }
    }

    public T[] toArray() {
        //noinspection unchecked
        return set.toArray((T[]) new Comparable[size()]);
    }

    @SuppressWarnings("EqualsWhichDoesntCheckParameterClass")
    @Override
    public boolean equals(Object o) {
        return o != null && set.equals(((ComparableSet) o).set);
    }

    @Override
    public int hashCode() {
        return set.hashCode();
    }

    @Override
    public String toString() {
        return "ComparableSet" + set;
    }

    @Nullable
    public Class getItemClass() {
        final Iterator it = set.iterator();
        return it.hasNext() ? it.next().getClass() : null;
    }

    void setIsDirty(final boolean isDirty) {
        this.isDirty = isDirty;
    }

    @NotNull
    @Override
    public Iterator iterator() {
        return set.iterator();
    }

    public interface Consumer> {

        void accept(@NotNull final T item, final int index);
    }

    private static class ComparableSetItemComparator> implements Comparator {
        @Override
        public int compare(@NotNull final T o1, @NotNull final T o2) {
            if (o1 instanceof String && o2 instanceof String) {
                return ((String) o1).compareToIgnoreCase((String) o2);
            }
            return o1.compareTo(o2);
        }
    }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy