package com.planet_ink.coffee_mud.core.collections;
import java.util.*;
/*
Copyright 2015-2019 Bo Zimmerman
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.
*/
public class SafeChildNavigableSet<K> implements NavigableSet<K>
{
private final NavigableSet<K> set;
private final SafeCollectionHost host;
public SafeChildNavigableSet(final NavigableSet<K> s, final SafeCollectionHost host)
{
this.set=s;
this.host=host;
}
@Override
public K ceiling(final K arg0)
{
return set.ceiling(arg0);
}
@Override
public Iterator<K> descendingIterator()
{
return new SafeFeedbackIterator<K>(set.descendingIterator(), host);
}
@Override
public NavigableSet<K> descendingSet()
{
return new SafeChildNavigableSet<K>(set.descendingSet(), host);
}
@Override
public K floor(final K arg0)
{
return set.floor(arg0);
}
@Override
public SortedSet<K> headSet(final K arg0)
{
return new SafeChildSortedSet<K>(set.headSet(arg0), host);
}
@Override
public NavigableSet<K> headSet(final K arg0, final boolean arg1)
{
return new SafeChildNavigableSet<K>(set.headSet(arg0, arg1), host);
}
@Override
public K higher(final K arg0)
{
return set.higher(arg0);
}
@Override
public Iterator<K> iterator()
{
return new SafeFeedbackIterator<K>(set.iterator(), host);
}
@Override
public K lower(final K arg0)
{
return set.lower(arg0);
}
@Override
public K pollFirst()
{
throw new java.lang.IllegalArgumentException();
}
@Override
public K pollLast()
{
throw new java.lang.IllegalArgumentException();
}
@Override
public SortedSet<K> subSet(final K arg0, final K arg1)
{
return new SafeChildSortedSet<K>(set.subSet(arg0,arg1), host);
}
@Override
public NavigableSet<K> subSet(final K arg0, final boolean arg1, final K arg2, final boolean arg3)
{
return new SafeChildNavigableSet<K>(set.subSet(arg0,arg1,arg2,arg3), host);
}
@Override
public SortedSet<K> tailSet(final K arg0)
{
return new SafeChildSortedSet<K>(set.tailSet(arg0), host);
}
@Override
public NavigableSet<K> tailSet(final K arg0, final boolean arg1)
{
return new SafeChildNavigableSet<K>(set.tailSet(arg0,arg1), host);
}
@Override
public Comparator<? super K> comparator()
{
return set.comparator();
}
@Override
public K first()
{
return set.first();
}
@Override
public K last()
{
return set.last();
}
@Override
public boolean add(final K arg0)
{
throw new java.lang.IllegalArgumentException();
}
@Override
public boolean addAll(final Collection<? extends K> arg0)
{
throw new java.lang.IllegalArgumentException();
}
@Override
public void clear()
{
throw new java.lang.IllegalArgumentException();
}
@Override
public boolean contains(final Object arg0)
{
return set.contains(arg0);
}
@Override
public boolean containsAll(final Collection<?> arg0)
{
return set.containsAll(arg0);
}
@Override
public boolean isEmpty()
{
return set.isEmpty();
}
@Override
public boolean remove(final Object arg0)
{
throw new java.lang.IllegalArgumentException();
}
@Override
public boolean removeAll(final Collection<?> arg0)
{
throw new java.lang.IllegalArgumentException();
}
@Override
public boolean retainAll(final Collection<?> arg0)
{
throw new java.lang.IllegalArgumentException();
}
@Override
public int size()
{
return set.size();
}
@Override
public Object[] toArray()
{
return set.toArray();
}
@Override
public <T> T[] toArray(final T[] arg0)
{
return set.toArray(arg0);
}
}
