/*

 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.

 *

 * This code is free software; you can redistribute it and/or modify it

 * under the terms of the GNU General Public License version 2 only, as

 * published by the Free Software Foundation.

 *

 * This code is distributed in the hope that it will be useful, but WITHOUT

 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or

 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License

 * version 2 for more details (a copy is included in the LICENSE file that

 * accompanied this code).

 *

 * You should have received a copy of the GNU General Public License version

 * 2 along with this work; if not, write to the Free Software Foundation,

 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.

 *

 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA

 * or visit www.oracle.com if you need additional information or have any

 * questions.

 */

/*

 * This file is available under and governed by the GNU General Public

 * License version 2 only, as published by the Free Software Foundation.

 * However, the following notice accompanied the original version of this

 * file:

 *

 * Written by Doug Lea with assistance from members of JCP JSR-166

 * Expert Group and released to the public domain, as explained at

 * http://creativecommons.org/publicdomain/zero/1.0/

 */

import java.util.Arrays;

import java.util.BitSet;

import java.util.Collection;

import java.util.Comparator;

import java.util.Iterator;

import java.util.NavigableSet;

import java.util.NoSuchElementException;

import java.util.Random;

import java.util.Set;

import java.util.SortedSet;

import java.util.TreeSet;

import junit.framework.Test;

import junit.framework.TestSuite;

public class TreeSetTest extends JSR166TestCase {

    public static void main(String[] args) {

        main(suite(), args);

    }

    public static Test suite() {

        return new TestSuite(TreeSetTest.class);

    }

    static class MyReverseComparator implements Comparator {

        public int compare(Object x, Object y) {

            return ((Comparable)y).compareTo(x);

        }

    }

    /**

     * The number of elements to place in collections, arrays, etc.

     */

    static final int SIZE = 20;

    /**

     * Returns a new set of given size containing consecutive

     * Integers 0 ... n.

     */

    private TreeSet<Integer> populatedSet(int n) {

        TreeSet<Integer> q = new TreeSet<Integer>();

        assertTrue(q.isEmpty());

        for (int i = n - 1; i >= 0; i -= 2)

            assertTrue(q.add(new Integer(i)));

        for (int i = (n & 1); i < n; i += 2)

            assertTrue(q.add(new Integer(i)));

        assertFalse(q.isEmpty());

        assertEquals(n, q.size());

        return q;

    }

    /**

     * Returns a new set of first 5 ints.

     */

    private TreeSet set5() {

        TreeSet q = new TreeSet();

        assertTrue(q.isEmpty());

        q.add(one);

        q.add(two);

        q.add(three);

        q.add(four);

        q.add(five);

        assertEquals(5, q.size());

        return q;

    }

    /**

     * A new set has unbounded capacity

     */

    public void testConstructor1() {

        assertEquals(0, new TreeSet().size());

    }

    /**

     * Initializing from null Collection throws NPE

     */

    public void testConstructor3() {

        try {

            new TreeSet((Collection)null);

            shouldThrow();

        } catch (NullPointerException success) {}

    }

    /**

     * Initializing from Collection of null elements throws NPE

     */

    public void testConstructor4() {

        try {

            new TreeSet(Arrays.asList(new Integer[SIZE]));

            shouldThrow();

        } catch (NullPointerException success) {}

    }

    /**

     * Initializing from Collection with some null elements throws NPE

     */

    public void testConstructor5() {

        Integer[] ints = new Integer[SIZE];

        for (int i = 0; i < SIZE - 1; ++i)

            ints[i] = new Integer(i);

        try {

            new TreeSet(Arrays.asList(ints));

            shouldThrow();

        } catch (NullPointerException success) {}

    }

    /**

     * Set contains all elements of collection used to initialize

     */

    public void testConstructor6() {

        Integer[] ints = new Integer[SIZE];

        for (int i = 0; i < SIZE; ++i)

            ints[i] = new Integer(i);

        TreeSet q = new TreeSet(Arrays.asList(ints));

        for (int i = 0; i < SIZE; ++i)

            assertEquals(ints[i], q.pollFirst());

    }

    /**

     * The comparator used in constructor is used

     */

    public void testConstructor7() {

        MyReverseComparator cmp = new MyReverseComparator();

        TreeSet q = new TreeSet(cmp);

        assertEquals(cmp, q.comparator());

        Integer[] ints = new Integer[SIZE];

        for (int i = 0; i < SIZE; ++i)

            ints[i] = new Integer(i);

        q.addAll(Arrays.asList(ints));

        for (int i = SIZE - 1; i >= 0; --i)

            assertEquals(ints[i], q.pollFirst());

    }

    /**

     * isEmpty is true before add, false after

     */

    public void testEmpty() {

        TreeSet q = new TreeSet();

        assertTrue(q.isEmpty());

        q.add(new Integer(1));

        assertFalse(q.isEmpty());

        q.add(new Integer(2));

        q.pollFirst();

        q.pollFirst();

        assertTrue(q.isEmpty());

    }

    /**

     * size changes when elements added and removed

     */

    public void testSize() {

        TreeSet q = populatedSet(SIZE);

        for (int i = 0; i < SIZE; ++i) {

            assertEquals(SIZE - i, q.size());

            q.pollFirst();

        }

        for (int i = 0; i < SIZE; ++i) {

            assertEquals(i, q.size());

            q.add(new Integer(i));

        }

    }

    /**

     * add(null) throws NPE if nonempty

     */

    public void testAddNull() {

        TreeSet q = populatedSet(SIZE);

        try {

            q.add(null);

            shouldThrow();

        } catch (NullPointerException success) {}

    }

    /**

     * Add of comparable element succeeds

     */

    public void testAdd() {

        TreeSet q = new TreeSet();

        assertTrue(q.add(zero));

        assertTrue(q.add(one));

    }

    /**

     * Add of duplicate element fails

     */

    public void testAddDup() {

        TreeSet q = new TreeSet();

        assertTrue(q.add(zero));

        assertFalse(q.add(zero));

    }

    /**

     * Add of non-Comparable throws CCE

     */

    public void testAddNonComparable() {

        TreeSet q = new TreeSet();

        try {

            q.add(new Object());

            q.add(new Object());

            shouldThrow();

        } catch (ClassCastException success) {}

    }

    /**

     * addAll(null) throws NPE

     */

    public void testAddAll1() {

        TreeSet q = new TreeSet();

        try {

            q.addAll(null);

            shouldThrow();

        } catch (NullPointerException success) {}

    }

    /**

     * addAll of a collection with null elements throws NPE

     */

    public void testAddAll2() {

        TreeSet q = new TreeSet();

        Integer[] ints = new Integer[SIZE];

        try {

            q.addAll(Arrays.asList(ints));

            shouldThrow();

        } catch (NullPointerException success) {}

    }

    /**

     * addAll of a collection with any null elements throws NPE after

     * possibly adding some elements

     */

    public void testAddAll3() {

        TreeSet q = new TreeSet();

        Integer[] ints = new Integer[SIZE];

        for (int i = 0; i < SIZE - 1; ++i)

            ints[i] = new Integer(i);

        try {

            q.addAll(Arrays.asList(ints));

            shouldThrow();

        } catch (NullPointerException success) {}

    }

    /**

     * Set contains all elements of successful addAll

     */

    public void testAddAll5() {

        Integer[] empty = new Integer[0];

        Integer[] ints = new Integer[SIZE];

        for (int i = 0; i < SIZE; ++i)

            ints[i] = new Integer(SIZE - 1 - i);

        TreeSet q = new TreeSet();

        assertFalse(q.addAll(Arrays.asList(empty)));

        assertTrue(q.addAll(Arrays.asList(ints)));

        for (int i = 0; i < SIZE; ++i)

            assertEquals(new Integer(i), q.pollFirst());

    }

    /**

     * pollFirst succeeds unless empty

     */

    public void testPollFirst() {

        TreeSet q = populatedSet(SIZE);

        for (int i = 0; i < SIZE; ++i) {

            assertEquals(i, q.pollFirst());

        }

        assertNull(q.pollFirst());

    }

    /**

     * pollLast succeeds unless empty

     */

    public void testPollLast() {

        TreeSet q = populatedSet(SIZE);

        for (int i = SIZE - 1; i >= 0; --i) {

            assertEquals(i, q.pollLast());

        }

        assertNull(q.pollFirst());

    }

    /**

     * remove(x) removes x and returns true if present

     */

    public void testRemoveElement() {

        TreeSet q = populatedSet(SIZE);

        for (int i = 1; i < SIZE; i += 2) {

            assertTrue(q.contains(i));

            assertTrue(q.remove(i));

            assertFalse(q.contains(i));

            assertTrue(q.contains(i - 1));

        }

        for (int i = 0; i < SIZE; i += 2) {

            assertTrue(q.contains(i));

            assertTrue(q.remove(i));

            assertFalse(q.contains(i));

            assertFalse(q.remove(i + 1));

            assertFalse(q.contains(i + 1));

        }

        assertTrue(q.isEmpty());

    }

    /**

     * contains(x) reports true when elements added but not yet removed

     */

    public void testContains() {

        TreeSet q = populatedSet(SIZE);

        for (int i = 0; i < SIZE; ++i) {

            assertTrue(q.contains(new Integer(i)));

            q.pollFirst();

            assertFalse(q.contains(new Integer(i)));

        }

    }

    /**

     * clear removes all elements

     */

    public void testClear() {

        TreeSet q = populatedSet(SIZE);

        q.clear();

        assertTrue(q.isEmpty());

        assertEquals(0, q.size());

        q.add(new Integer(1));

        assertFalse(q.isEmpty());

        q.clear();

        assertTrue(q.isEmpty());

    }

    /**

     * containsAll(c) is true when c contains a subset of elements

     */

    public void testContainsAll() {

        TreeSet q = populatedSet(SIZE);

        TreeSet p = new TreeSet();

        for (int i = 0; i < SIZE; ++i) {

            assertTrue(q.containsAll(p));

            assertFalse(p.containsAll(q));

            p.add(new Integer(i));

        }

        assertTrue(p.containsAll(q));

    }

    /**

     * retainAll(c) retains only those elements of c and reports true if changed

     */

    public void testRetainAll() {

        TreeSet q = populatedSet(SIZE);

        TreeSet p = populatedSet(SIZE);

        for (int i = 0; i < SIZE; ++i) {

            boolean changed = q.retainAll(p);

            if (i == 0)

                assertFalse(changed);

            else

                assertTrue(changed);

            assertTrue(q.containsAll(p));

            assertEquals(SIZE - i, q.size());

            p.pollFirst();

        }

    }

    /**

     * removeAll(c) removes only those elements of c and reports true if changed

     */

    public void testRemoveAll() {

        for (int i = 1; i < SIZE; ++i) {

            TreeSet q = populatedSet(SIZE);

            TreeSet p = populatedSet(i);

            assertTrue(q.removeAll(p));

            assertEquals(SIZE - i, q.size());

            for (int j = 0; j < i; ++j) {

                Integer x = (Integer)(p.pollFirst());

                assertFalse(q.contains(x));

            }

        }

    }

    /**

     * lower returns preceding element

     */

    public void testLower() {

        TreeSet q = set5();

        Object e1 = q.lower(three);

        assertEquals(two, e1);

        Object e2 = q.lower(six);

        assertEquals(five, e2);

        Object e3 = q.lower(one);

        assertNull(e3);

        Object e4 = q.lower(zero);

        assertNull(e4);

    }

    /**

     * higher returns next element

     */

    public void testHigher() {

        TreeSet q = set5();

        Object e1 = q.higher(three);

        assertEquals(four, e1);

        Object e2 = q.higher(zero);

        assertEquals(one, e2);

        Object e3 = q.higher(five);

        assertNull(e3);

        Object e4 = q.higher(six);

        assertNull(e4);

    }

    /**

     * floor returns preceding element

     */

    public void testFloor() {

        TreeSet q = set5();

        Object e1 = q.floor(three);

        assertEquals(three, e1);

        Object e2 = q.floor(six);

        assertEquals(five, e2);

        Object e3 = q.floor(one);

        assertEquals(one, e3);

        Object e4 = q.floor(zero);

        assertNull(e4);

    }

    /**

     * ceiling returns next element

     */

    public void testCeiling() {

        TreeSet q = set5();

        Object e1 = q.ceiling(three);

        assertEquals(three, e1);

        Object e2 = q.ceiling(zero);

        assertEquals(one, e2);

        Object e3 = q.ceiling(five);

        assertEquals(five, e3);

        Object e4 = q.ceiling(six);

        assertNull(e4);

    }

    /**

     * toArray contains all elements in sorted order

     */

    public void testToArray() {

        TreeSet q = populatedSet(SIZE);

        Object[] o = q.toArray();

        for (int i = 0; i < o.length; i++)

            assertSame(o[i], q.pollFirst());

    }

    /**

     * toArray(a) contains all elements in sorted order

     */

    public void testToArray2() {

        TreeSet<Integer> q = populatedSet(SIZE);

        Integer[] ints = new Integer[SIZE];

        Integer[] array = q.toArray(ints);

        assertSame(ints, array);

        for (int i = 0; i < ints.length; i++)

            assertSame(ints[i], q.pollFirst());

    }

    /**

     * iterator iterates through all elements

     */

    public void testIterator() {

        TreeSet q = populatedSet(SIZE);

        Iterator it = q.iterator();

        int i;

        for (i = 0; it.hasNext(); i++)

            assertTrue(q.contains(it.next()));

        assertEquals(i, SIZE);

        assertIteratorExhausted(it);

    }

    /**

     * iterator of empty set has no elements

     */

    public void testEmptyIterator() {

        assertIteratorExhausted(new TreeSet().iterator());

    }

    /**

     * iterator.remove removes current element

     */

    public void testIteratorRemove() {

        final TreeSet q = new TreeSet();

        q.add(new Integer(2));

        q.add(new Integer(1));

        q.add(new Integer(3));