• Home
• net.openhft
• chronicle-algorithms
• 2.20.2
• source code
• Access.java

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

net.openhft.chronicle.algo.bytes.Access Maven / Gradle / Ivy

/*
 *     Copyright (C) 2015  higherfrequencytrading.com
 *
 *     This program is free software: you can redistribute it and/or modify
 *     it under the terms of the GNU Lesser General Public License as published by
 *     the Free Software Foundation, either version 3 of the License.
 *
 *     This program 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 Lesser General Public License for more details.
 *
 *     You should have received a copy of the GNU Lesser General Public License
 *     along with this program.  If not, see .
 */

package net.openhft.chronicle.algo.bytes;

import net.openhft.chronicle.bytes.BytesStore;
import net.openhft.chronicle.bytes.RandomDataInput;

import java.nio.ByteBuffer;

public interface Access extends ReadAccess, WriteAccess {

    static  Access nativeAccess() {
        return NativeAccess.instance();
    }

    static Access checkedByteBufferAccess() {
        return ByteBufferAccess.INSTANCE;
    }

    static , U> Access checkedBytesStoreAccess() {
        return BytesAccesses.Full.INSTANCE;
    }

    static ReadAccess checkedRandomDataInputAccess() {
        return BytesAccesses.RandomDataInputReadAccessEnum.INSTANCE;
    }

    static  void copy(ReadAccess sourceAccess, S source, long sourceOffset,
                            WriteAccess targetAccess, T target, long targetOffset,
                            long len) {
        targetAccess.writeFrom(target, targetOffset, sourceAccess, source, sourceOffset, len);
    }

    static  boolean equivalent(ReadAccess access1, T handle1, long offset1,
                                     ReadAccess access2, U handle2, long offset2,
                                     long len) {
        return access1.compareTo(handle1, offset1, access2, handle2, offset2, len);
    }

    /**
     * Default implementation: throws {@code UnsupportedOperationException}.
     */
    boolean compareAndSwapInt(T handle, long offset, int expected, int value);

    /**
     * Default implementation: throws {@code UnsupportedOperationException}.
     */
    boolean compareAndSwapLong(T handle, long offset, long expected, long value);
}