apoc.coll.SetBackedList Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of apoc-common Show documentation
Data types package for Neo4j Procedures
There is a newer version: 5.25.1
/*
 * Copyright (c) "Neo4j"
 * Neo4j Sweden AB [http://neo4j.com]
 *
 * This file is part of Neo4j.
 *
 * 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 apoc.coll;

import java.util.*;

/**
 * @author mh
 * @since 10.04.16
 */
public class SetBackedList extends AbstractSequentialList implements Set {

    private final Set set;

    public SetBackedList(Set set) {
        this.set = set;
    }

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

    public ListIterator listIterator(int index) {
        return new ListIterator() {
            Iterator it = set.iterator();
            T current = null;
            int idx = 0;

            {
                moveTo(index);
            }

            @Override
            public boolean hasNext() {
                return it.hasNext();
            }

            @Override
            public T next() {
                idx++;
                return current = it.next();
            }

            @Override
            public boolean hasPrevious() {
                return idx > 0;
            }

            @Override
            public T previous() {
                if (!hasPrevious()) throw new NoSuchElementException();
                T tmp = current;
                moveTo(idx - 1);
                return tmp;
            }

            private void moveTo(int pos) {
                Iterator it2 = set.iterator();
                T value = null;
                int i = 0;
                while (i++ < pos) {
                    value = it2.next();
                }
                ;
                this.it = it2;
                this.idx = pos;
                this.current = value;
            }

            @Override
            public int nextIndex() {
                return idx;
            }

            @Override
            public int previousIndex() {
                return idx - 1;
            }

            @Override
            public void remove() {
                throw new UnsupportedOperationException("remove");
            }

            @Override
            public void set(Object o) {
                throw new UnsupportedOperationException("set");
            }

            @Override
            public void add(Object o) {
                throw new UnsupportedOperationException("add");
            }
        };
    }

    @Override
    public boolean contains(Object o) {
        return set.contains(o);
    }

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

    @Override
    public boolean equals(Object o) {
        if (o instanceof Set) return set.equals(o);
        return o instanceof Iterable && super.equals(o);
    }

    @Override
    public Spliterator spliterator() {
        return set.spliterator();
    }
}