com.bigdata.btree.raba.ReadOnlyValuesRaba Maven / Gradle / Ivy
/*
Copyright (C) SYSTAP, LLC DBA Blazegraph 2006-2016. All rights reserved.
Contact:
SYSTAP, LLC DBA Blazegraph
2501 Calvert ST NW #106
Washington, DC 20008
[email protected]
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; version 2 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
/*
* Created on Aug 7, 2009
*/
package com.bigdata.btree.raba;
import com.bigdata.btree.proc.IKeyArrayIndexProcedure;
import com.bigdata.util.BytesUtil;
/**
* Immutable implementation allows nulls but does not support
* search.
*
* @author Bryan Thompson
* @version $Id$
*/
public class ReadOnlyValuesRaba extends AbstractRaba {
/**
* A read-only empty values raba.
*/
public static final transient ReadOnlyValuesRaba EMPTY = new ReadOnlyValuesRaba(
BytesUtil.EMPTY2);
/**
* This view is read-only.
*/
final public boolean isReadOnly() {
return true;
}
/**
* No.
*/
final public boolean isKeys() {
return false;
}
/**
* Create a view of a byte[][]. All elements in the array are visible in the
* view.
*
* @param a
* The backing byte[][].
*/
public ReadOnlyValuesRaba(final byte[][] a) {
this(0/* fromIndex */, a.length/* toIndex */, a.length/* capacity */, a);
}
/**
* Create a view of a byte[][]. All elements in the array are visible in the
* view. The elements in the array from index ZERO (0) through index
* size-1 are assumed to have valid data.
*
* @param size
* The #of elements with valid data.
* @param a
* The backing byte[][].
*/
public ReadOnlyValuesRaba(final int size, final byte[][] a) {
this(0/* fromIndex */, size/* toIndex */, a.length/* capacity */, a);
}
/**
* Create a view of a byte[][] slice. The slice will include
* only those elements between the fromIndex and the toIndex. The capacity
* will be the #of elements. {@link #isFull()} will report true
* .
*
* Note: This constructor is used when we split an
* {@link IKeyArrayIndexProcedure} based on a key-range partitioned index.
*
* @param fromIndex
* The index of the first visible in the view (inclusive lower
* bound).
* @param toIndex
* The index of the first element beyond the view (exclusive
* upper bound). If toIndex == fromIndex then the view is empty.
* @param a
* The backing byte[][].
*/
public ReadOnlyValuesRaba(final int fromIndex, final int toIndex,
final byte[][] a) {
this(fromIndex, toIndex, a.length - fromIndex, a);
}
/**
* Create a view from a slice of a byte[][].
*
* @param fromIndex
* The index of the first element in the byte[][] which is
* visible in the view (inclusive lower bound).
* @param toIndex
* The index of the first element in the byte[][] which lies
* beyond the view (exclusive upper bound).
* @param capacity
* The #of elements which may be used in the view.
* @param a
* The backing byte[][].
*/
public ReadOnlyValuesRaba(final int fromIndex, final int toIndex,
final int capacity, final byte[][] a) {
super(fromIndex, toIndex, capacity, a);
}
}