// Path: collection/src/main/java/com/github/andrewoma/dexx/collection/Function.java
// public interface Function<P, R> {
//     R invoke(P parameter);
// }
// 
// Path: collection/src/main/java/com/github/andrewoma/dexx/collection/KeyFunction.java
// public interface KeyFunction<K, V> {
//     @NotNull
//     K key(@NotNull V value);
// }
// 
// 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;
//     }
// }


import com.github.andrewoma.dexx.collection.Function;
import com.github.andrewoma.dexx.collection.KeyFunction;
import com.github.andrewoma.dexx.collection.Pair;
import org.jetbrains.annotations.NotNull;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.Iterator;
import java.util.List;
import java.util.NoSuchElementException;
    public Tree<K, V> until(Tree<K, V> tree, K key, boolean inclusive) {
        return blacken(doUntil(tree, key, inclusive));
    }

    public Tree<K, V> drop(Tree<K, V> tree, int n) {
        return blacken(doDrop(tree, n));
    }

    public Tree<K, V> take(Tree<K, V> tree, int n) {
        return blacken(doTake(tree, n));
    }

    public Tree<K, V> slice(Tree<K, V> tree, int from, int until) {
        return blacken(doSlice(tree, from, until));
    }

    public Tree<K, V> smallest(Tree<K, V> tree) {
        if (tree == null) throw new NoSuchElementException("empty map");
        Tree<K, V> result = tree;
        while (result.getLeft() != null) result = result.getLeft();
        return result;
    }

    public Tree<K, V> greatest(Tree<K, V> tree) {
        if (tree == null) throw new NoSuchElementException("empty map");
        Tree<K, V> result = tree;
        while (result.getRight() != null) result = result.getRight();
        return result;
    }

// Path: collection/src/main/java/com/github/andrewoma/dexx/collection/Function.java
// public interface Function<P, R> {
//     R invoke(P parameter);
// }
// 
// Path: collection/src/main/java/com/github/andrewoma/dexx/collection/KeyFunction.java
// public interface KeyFunction<K, V> {
//     @NotNull
//     K key(@NotNull V value);
// }
// 
// 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/internal/redblack/RedBlackTree.java
import com.github.andrewoma.dexx.collection.Function;
import com.github.andrewoma.dexx.collection.KeyFunction;
import com.github.andrewoma.dexx.collection.Pair;
import org.jetbrains.annotations.NotNull;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.Iterator;
import java.util.List;
import java.util.NoSuchElementException;

    public Tree<K, V> until(Tree<K, V> tree, K key, boolean inclusive) {
        return blacken(doUntil(tree, key, inclusive));
    }

    public Tree<K, V> drop(Tree<K, V> tree, int n) {
        return blacken(doDrop(tree, n));
    }

    public Tree<K, V> take(Tree<K, V> tree, int n) {
        return blacken(doTake(tree, n));
    }

    public Tree<K, V> slice(Tree<K, V> tree, int from, int until) {
        return blacken(doSlice(tree, from, until));
    }

    public Tree<K, V> smallest(Tree<K, V> tree) {
        if (tree == null) throw new NoSuchElementException("empty map");
        Tree<K, V> result = tree;
        while (result.getLeft() != null) result = result.getLeft();
        return result;
    }

    public Tree<K, V> greatest(Tree<K, V> tree) {
        if (tree == null) throw new NoSuchElementException("empty map");
        Tree<K, V> result = tree;
        while (result.getRight() != null) result = result.getRight();
        return result;
    }

    public <U> void forEach(Tree<K, V> tree, Function<Pair<K, V>, U> f) {