org.bytedeco.javacpp.indexer.ULongRawIndexer Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of javacpp Show documentation
Show all versions of javacpp Show documentation
The missing bridge between Java and native C++
/*
* Copyright (C) 2020 Samuel Audet
*
* Licensed either under the Apache License, Version 2.0, or (at your option)
* under the terms of the GNU General Public License as published by
* the Free Software Foundation (subject to the "Classpath" exception),
* either version 2, or any later version (collectively, the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
* http://www.gnu.org/licenses/
* http://www.gnu.org/software/classpath/license.html
*
* or as provided in the LICENSE.txt file that accompanied this code.
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.bytedeco.javacpp.indexer;
import java.math.BigInteger;
import org.bytedeco.javacpp.LongPointer;
import org.bytedeco.javacpp.Pointer;
/**
* An indexer for a {@link LongPointer} using the {@link Raw} instance, treated as unsigned.
*
* @author Samuel Audet
*/
public class ULongRawIndexer extends ULongIndexer {
/** The instance for the raw memory interface. */
protected static final Raw RAW = Raw.getInstance();
/** The backing pointer. */
protected LongPointer pointer;
/** Base address and number of elements accessible. */
final long base, size;
/** Calls {@code ULongRawIndexer(pointer, Index.create(pointer.limit() - pointer.position()))}. */
public ULongRawIndexer(LongPointer pointer) {
this(pointer, Index.create(pointer.limit() - pointer.position()));
}
/** Calls {@code ULongRawIndexer(pointer, Index.create(sizes))}. */
public ULongRawIndexer(LongPointer pointer, long... sizes) {
this(pointer, Index.create(sizes));
}
/** Calls {@code ULongRawIndexer(pointer, Index.create(sizes, strides))}. */
public ULongRawIndexer(LongPointer pointer, long[] sizes, long[] strides) {
this(pointer, Index.create(sizes, strides));
}
/** Constructor to set the {@link #pointer} and {@link #index}. */
public ULongRawIndexer(LongPointer pointer, Index index) {
super(index);
this.pointer = pointer;
this.base = pointer.address() + pointer.position() * VALUE_BYTES;
this.size = pointer.limit() - pointer.position();
}
@Override public Pointer pointer() {
return pointer;
}
@Override public ULongIndexer reindex(Index index) {
return new ULongRawIndexer(pointer, index);
}
public BigInteger getRaw(long i) {
return toBigInteger(RAW.getLong(base + checkIndex(i, size) * VALUE_BYTES));
}
@Override public BigInteger get(long i) {
return getRaw(index(i));
}
@Override public ULongIndexer get(long i, BigInteger[] l, int offset, int length) {
for (int n = 0; n < length; n++) {
l[offset + n] = getRaw(index(i) + n);
}
return this;
}
@Override public BigInteger get(long i, long j) {
return getRaw(index(i, j));
}
@Override public ULongIndexer get(long i, long j, BigInteger[] l, int offset, int length) {
for (int n = 0; n < length; n++) {
l[offset + n] = getRaw(index(i, j) + n);
}
return this;
}
@Override public BigInteger get(long i, long j, long k) {
return getRaw(index(i, j, k));
}
@Override public BigInteger get(long... indices) {
return getRaw(index(indices));
}
@Override public ULongIndexer get(long[] indices, BigInteger[] l, int offset, int length) {
for (int n = 0; n < length; n++) {
l[offset + n] = getRaw(index(indices) + n);
}
return this;
}
public ULongIndexer putRaw(long i, BigInteger l) {
RAW.putLong(base + checkIndex(i, size) * VALUE_BYTES, fromBigInteger(l));
return this;
}
@Override public ULongIndexer put(long i, BigInteger l) {
return putRaw(index(i), l);
}
@Override public ULongIndexer put(long i, BigInteger[] l, int offset, int length) {
for (int n = 0; n < length; n++) {
putRaw(index(i) + n, l[offset + n]);
}
return this;
}
@Override public ULongIndexer put(long i, long j, BigInteger l) {
putRaw(index(i, j), l);
return this;
}
@Override public ULongIndexer put(long i, long j, BigInteger[] l, int offset, int length) {
for (int n = 0; n < length; n++) {
putRaw(index(i, j) + n, l[offset + n]);
}
return this;
}
@Override public ULongIndexer put(long i, long j, long k, BigInteger l) {
putRaw(index(i, j, k), l);
return this;
}
@Override public ULongIndexer put(long[] indices, BigInteger l) {
putRaw(index(indices), l);
return this;
}
@Override public ULongIndexer put(long[] indices, BigInteger[] l, int offset, int length) {
for (int n = 0; n < length; n++) {
putRaw(index(indices) + n, l[offset + n]);
}
return this;
}
@Override public void release() { pointer = null; }
}