// Path: collection/src/main/java/com/github/andrewoma/dexx/collection/Pair.java
// public class Pair<C1, C2> {
//     private final C1 component1;
//     private final C2 component2;
// 
//     public Pair(C1 component1, C2 component2) {
//         this.component1 = component1;
//         this.component2 = component2;
//     }
// 
//     public C1 component1() {
//         return component1;
//     }
// 
//     public C2 component2() {
//         return component2;
//     }
// 
//     @Override
//     public String toString() {
//         return "(" + component1 + ", " + component2 + ")";
//     }
// 
//     @Override
//     public boolean equals(Object o) {
//         if (this == o) return true;
//         if (o == null || getClass() != o.getClass()) return false;
// 
//         Pair pair = (Pair) o;
//         return !(component1 != null ? !component1.equals(pair.component1) : pair.component1 != null)
//                 && !(component2 != null ? !component2.equals(pair.component2) : pair.component2 != null);
//     }
// 
//     @Override
//     public int hashCode() {
//         int result = component1 != null ? component1.hashCode() : 0;
//         result = 31 * result + (component2 != null ? component2.hashCode() : 0);
//         return result;
//     }
// }
// 
// Path: collection/src/main/java/com/github/andrewoma/dexx/collection/SortedMap.java
// public interface SortedMap<K, V> extends Map<K, V> {
//     @NotNull
//     SortedMap<K, V> put(@NotNull K key, V value);
// 
//     @NotNull
//     SortedMap<K, V> remove(@NotNull K key);
// 
//     /**
//      * Returns the bottom of the map starting from the key specified.
//      *
//      * @param inclusive if true, the key will be included in the result, otherwise it will be excluded
//      */
//     @NotNull
//     SortedMap<K, V> from(@NotNull K key, boolean inclusive);
// 
//     /**
//      * Returns the top of the map up until the key specified.
//      *
//      * @param inclusive if true, the key will be included in the result, otherwise it will be excluded
//      */
//     @NotNull
//     SortedMap<K, V> to(@NotNull K key, boolean inclusive);
// 
//     /**
//      * Returns a subset of the map between the {@code from} and {@code to} keys specified.
//      *
//      * @param fromInclusive if true, the key will be included in the result, otherwise it will be excluded
//      * @param toInclusive   if true, the key will be included in the result, otherwise it will be excluded
//      */
//     @NotNull
//     SortedMap<K, V> range(@NotNull K from, boolean fromInclusive, @NotNull K to, boolean toInclusive);
// 
//     /**
//      * Returns the comparator associated with this map, or {@code null} if the default ordering is used.
//      */
//     Comparator<? super K> comparator();
// 
//     /**
//      * Returns the first entry in the map or {@code null} if the map is empty.
//      */
//     @Nullable
//     Pair<K, V> first();
// 
//     /**
//      * Returns the last entry in the map or {@code null} if the map is empty.
//      */
//     @Nullable
//     Pair<K, V> last();
// 
//     /**
//      * Returns a map containing all elements in this map, excluding the first {@code number} of elements.
//      */
//     @NotNull
//     SortedMap<K, V> drop(int number);
// 
//     /**
//      * Returns a list containing the first {@code number} of elements from this list.
//      */
//     @NotNull
//     SortedMap<K, V> take(int number);
// 
//     /**
//      * Returns an immutable view of this map as an instance of {@code java.util.SortedMap}.
//      */
//     @NotNull
//     java.util.SortedMap<K, V> asSortedMap();
// }


import com.github.andrewoma.dexx.collection.Pair;
import com.github.andrewoma.dexx.collection.SortedMap;
import org.jetbrains.annotations.NotNull;
import java.util.Comparator;
import java.util.NoSuchElementException;
/*
 * Copyright (c) 2014 Andrew O'Malley
 *
 * 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.andrewoma.dexx.collection.internal.adapter;



/**
 *
 */
public class SortedMapAdapter<K, V> extends MapAdapter<K, V> implements java.util.SortedMap<K, V> {
    private SortedMap<K, V> map;

    public SortedMapAdapter(SortedMap<K, V> map) {
        super(map);
        this.map = map;
    }

    @SuppressWarnings("NullableProblems") // JetBrains annotation doesn't match the spec
    @Override
    public Comparator<? super K> comparator() {
        return map.comparator();
    }

    @NotNull
    @Override
    public java.util.SortedMap<K, V> subMap(@NotNull K fromKey, @NotNull K toKey) {
        return new SortedMapAdapter<K, V>(map.range(fromKey, true, toKey, false));
    }

    @NotNull
    @Override
    public java.util.SortedMap<K, V> headMap(@NotNull K toKey) {
        return new SortedMapAdapter<K, V>(map.to(toKey, false));
    }

    @NotNull
    @Override
    public java.util.SortedMap<K, V> tailMap(@NotNull K fromKey) {
        return new SortedMapAdapter<K, V>(map.from(fromKey, true));
    }

    @Override
    public K firstKey() {
// Path: collection/src/main/java/com/github/andrewoma/dexx/collection/Pair.java
// public class Pair<C1, C2> {
//     private final C1 component1;
//     private final C2 component2;
// 
//     public Pair(C1 component1, C2 component2) {
//         this.component1 = component1;
//         this.component2 = component2;
//     }
// 
//     public C1 component1() {
//         return component1;
//     }
// 
//     public C2 component2() {
//         return component2;
//     }
// 
//     @Override
//     public String toString() {
//         return "(" + component1 + ", " + component2 + ")";
//     }
// 
//     @Override
//     public boolean equals(Object o) {
//         if (this == o) return true;
//         if (o == null || getClass() != o.getClass()) return false;
// 
//         Pair pair = (Pair) o;
//         return !(component1 != null ? !component1.equals(pair.component1) : pair.component1 != null)
//                 && !(component2 != null ? !component2.equals(pair.component2) : pair.component2 != null);
//     }
// 
//     @Override
//     public int hashCode() {
//         int result = component1 != null ? component1.hashCode() : 0;
//         result = 31 * result + (component2 != null ? component2.hashCode() : 0);
//         return result;
//     }
// }
// 
// Path: collection/src/main/java/com/github/andrewoma/dexx/collection/SortedMap.java
// public interface SortedMap<K, V> extends Map<K, V> {
//     @NotNull
//     SortedMap<K, V> put(@NotNull K key, V value);
// 
//     @NotNull
//     SortedMap<K, V> remove(@NotNull K key);
// 
//     /**
//      * Returns the bottom of the map starting from the key specified.
//      *
//      * @param inclusive if true, the key will be included in the result, otherwise it will be excluded
//      */
//     @NotNull
//     SortedMap<K, V> from(@NotNull K key, boolean inclusive);
// 
//     /**
//      * Returns the top of the map up until the key specified.
//      *
//      * @param inclusive if true, the key will be included in the result, otherwise it will be excluded
//      */
//     @NotNull
//     SortedMap<K, V> to(@NotNull K key, boolean inclusive);
// 
//     /**
//      * Returns a subset of the map between the {@code from} and {@code to} keys specified.
//      *
//      * @param fromInclusive if true, the key will be included in the result, otherwise it will be excluded
//      * @param toInclusive   if true, the key will be included in the result, otherwise it will be excluded
//      */
//     @NotNull
//     SortedMap<K, V> range(@NotNull K from, boolean fromInclusive, @NotNull K to, boolean toInclusive);
// 
//     /**
//      * Returns the comparator associated with this map, or {@code null} if the default ordering is used.
//      */
//     Comparator<? super K> comparator();
// 
//     /**
//      * Returns the first entry in the map or {@code null} if the map is empty.
//      */
//     @Nullable
//     Pair<K, V> first();
// 
//     /**
//      * Returns the last entry in the map or {@code null} if the map is empty.
//      */
//     @Nullable
//     Pair<K, V> last();
// 
//     /**
//      * Returns a map containing all elements in this map, excluding the first {@code number} of elements.
//      */
//     @NotNull
//     SortedMap<K, V> drop(int number);
// 
//     /**
//      * Returns a list containing the first {@code number} of elements from this list.
//      */
//     @NotNull
//     SortedMap<K, V> take(int number);
// 
//     /**
//      * Returns an immutable view of this map as an instance of {@code java.util.SortedMap}.
//      */
//     @NotNull
//     java.util.SortedMap<K, V> asSortedMap();
// }


// Path: collection/src/main/java/com/github/andrewoma/dexx/collection/internal/adapter/SortedMapAdapter.java
import com.github.andrewoma.dexx.collection.Pair;
import com.github.andrewoma.dexx.collection.SortedMap;
import org.jetbrains.annotations.NotNull;
import java.util.Comparator;
import java.util.NoSuchElementException;

/*
 * Copyright (c) 2014 Andrew O'Malley
 *
 * 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.andrewoma.dexx.collection.internal.adapter;



/**
 *
 */
public class SortedMapAdapter<K, V> extends MapAdapter<K, V> implements java.util.SortedMap<K, V> {
    private SortedMap<K, V> map;

    public SortedMapAdapter(SortedMap<K, V> map) {
        super(map);
        this.map = map;
    }

    @SuppressWarnings("NullableProblems") // JetBrains annotation doesn't match the spec
    @Override
    public Comparator<? super K> comparator() {
        return map.comparator();
    }

    @NotNull
    @Override
    public java.util.SortedMap<K, V> subMap(@NotNull K fromKey, @NotNull K toKey) {
        return new SortedMapAdapter<K, V>(map.range(fromKey, true, toKey, false));
    }

    @NotNull
    @Override
    public java.util.SortedMap<K, V> headMap(@NotNull K toKey) {
        return new SortedMapAdapter<K, V>(map.to(toKey, false));
    }

    @NotNull
    @Override
    public java.util.SortedMap<K, V> tailMap(@NotNull K fromKey) {
        return new SortedMapAdapter<K, V>(map.from(fromKey, true));
    }

    @Override
    public K firstKey() {
        Pair<K, V> first = map.first();