/*

 * Copyright (c) 2000, 2008, Oracle and/or its affiliates. All rights reserved.

 * 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.

 */

/* Type-specific source code for unit test

 *

 * Regenerate the BasicX classes via genBasic.sh whenever this file changes.

 * We check in the generated source files so that the test tree can be used

 * independently of the rest of the source tree.

 */

// -- This file was mechanically generated: Do not edit! -- //

import java.nio.*;

import java.lang.reflect.Method;

public class BasicLong

    extends Basic

{

    private static final long[] VALUES = {

        Long.MIN_VALUE,

        (long) -1,

        (long) 0,

        (long) 1,

        Long.MAX_VALUE,

    };

    private static void relGet(LongBuffer b) {

        int n = b.capacity();

        long v;

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

            ck(b, (long)b.get(), (long)((long)ic(i)));

        b.rewind();

    }

    private static void relGet(LongBuffer b, int start) {

        int n = b.remaining();

        long v;

        for (int i = start; i < n; i++)

            ck(b, (long)b.get(), (long)((long)ic(i)));

        b.rewind();

    }

    private static void absGet(LongBuffer b) {

        int n = b.capacity();

        long v;

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

            ck(b, (long)b.get(), (long)((long)ic(i)));

        b.rewind();

    }

    private static void bulkGet(LongBuffer b) {

        int n = b.capacity();

        long[] a = new long[n + 7];

        b.get(a, 7, n);

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

            ck(b, (long)a[i + 7], (long)((long)ic(i)));

    }

    private static void relPut(LongBuffer b) {

        int n = b.capacity();

        b.clear();

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

            b.put((long)ic(i));

        b.flip();

    }

    private static void absPut(LongBuffer b) {

        int n = b.capacity();

        b.clear();

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

            b.put(i, (long)ic(i));

        b.limit(n);

        b.position(0);

    }

    private static void bulkPutArray(LongBuffer b) {

        int n = b.capacity();

        b.clear();

        long[] a = new long[n + 7];

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

            a[i + 7] = (long)ic(i);

        b.put(a, 7, n);

        b.flip();

    }

    private static void bulkPutBuffer(LongBuffer b) {

        int n = b.capacity();

        b.clear();

        LongBuffer c = LongBuffer.allocate(n + 7);

        c.position(7);

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

            c.put((long)ic(i));

        c.flip();

        c.position(7);

        b.put(c);

        b.flip();

    }

    //6231529

    private static void callReset(LongBuffer b) {

        b.position(0);

        b.mark();

        b.duplicate().reset();

        b.asReadOnlyBuffer().reset();

    }

    // 6221101-6234263

    private static void putBuffer() {

        final int cap = 10;

        LongBuffer direct1 = ByteBuffer.allocateDirect(cap).asLongBuffer();

        LongBuffer nondirect1 = ByteBuffer.allocate(cap).asLongBuffer();

        direct1.put(nondirect1);

        LongBuffer direct2 = ByteBuffer.allocateDirect(cap).asLongBuffer();

        LongBuffer nondirect2 = ByteBuffer.allocate(cap).asLongBuffer();

        nondirect2.put(direct2);

        LongBuffer direct3 = ByteBuffer.allocateDirect(cap).asLongBuffer();

        LongBuffer direct4 = ByteBuffer.allocateDirect(cap).asLongBuffer();

        direct3.put(direct4);

        LongBuffer nondirect3 = ByteBuffer.allocate(cap).asLongBuffer();

        LongBuffer nondirect4 = ByteBuffer.allocate(cap).asLongBuffer();

        nondirect3.put(nondirect4);

    }

    private static void checkSlice(LongBuffer b, LongBuffer slice) {

        ck(slice, 0, slice.position());

        ck(slice, b.remaining(), slice.limit());

        ck(slice, b.remaining(), slice.capacity());

        if (b.isDirect() != slice.isDirect())

            fail("Lost direction", slice);

        if (b.isReadOnly() != slice.isReadOnly())

            fail("Lost read-only", slice);

    }

    private static void fail(String problem,

                             LongBuffer xb, LongBuffer yb,

                             long x, long y) {

        fail(problem + String.format(": x=%s y=%s", x, y), xb, yb);

    }

        boolean caught = false;

        try {

            thunk.run();

        } catch (Throwable x) {

            if (ex.isAssignableFrom(x.getClass())) {

                caught = true;

            } else {

                fail(x.getMessage() + " not expected");

            }

        }

        if (!caught)

            fail(ex.getName() + " not thrown", b);

    }

        tryCatch(LongBuffer.wrap(t), ex, thunk);

    }

    public static void test(int level, final LongBuffer b, boolean direct) {

        show(level, b);

        if (direct != b.isDirect())

            fail("Wrong direction", b);

        // Gets and puts

        relPut(b);

        relGet(b);

        absGet(b);

        bulkGet(b);

        absPut(b);

        relGet(b);

        absGet(b);

        bulkGet(b);

        bulkPutArray(b);

        relGet(b);

        bulkPutBuffer(b);

        relGet(b);

        // Compact

        relPut(b);

        b.position(13);

        b.compact();

        b.flip();

        relGet(b, 13);

        // Exceptions

        relPut(b);

        b.limit(b.capacity() / 2);

        b.position(b.limit());

        tryCatch(b, BufferUnderflowException.class, new Runnable() {

                public void run() {

                    b.get();

                }});

        tryCatch(b, BufferOverflowException.class, new Runnable() {

                public void run() {

                    b.put((long)42);

                }});

        // The index must be non-negative and lesss than the buffer's limit.

        tryCatch(b, IndexOutOfBoundsException.class, new Runnable() {

                public void run() {

                    b.get(b.limit());

                }});

        tryCatch(b, IndexOutOfBoundsException.class, new Runnable() {

                public void run() {

                    b.get(-1);

                }});

        tryCatch(b, IndexOutOfBoundsException.class, new Runnable() {

                public void run() {

                    b.put(b.limit(), (long)42);

                }});

        tryCatch(b, InvalidMarkException.class, new Runnable() {

                public void run() {

                    b.position(0);

                    b.mark();

                    b.compact();

                    b.reset();

                }});

        // Values

        b.clear();

        b.put((long)0);

        b.put((long)-1);

        b.put((long)1);

        b.put(Long.MAX_VALUE);

        b.put(Long.MIN_VALUE);

        long v;

        b.flip();

        ck(b, b.get(), 0);

        ck(b, b.get(), (long)-1);

        ck(b, b.get(), 1);

        ck(b, b.get(), Long.MAX_VALUE);

        ck(b, b.get(), Long.MIN_VALUE);

        // Comparison