com.metsci.glimpse.util.primitives.BooleansArray Maven / Gradle / Ivy
The newest version!
/*
* Copyright (c) 2020, Metron, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of Metron, Inc. nor the
* names of its contributors may be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL METRON, INC. BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package com.metsci.glimpse.util.primitives;
import static java.lang.Math.max;
import static java.lang.Math.min;
/**
* @author hogye
*/
public class BooleansArray implements BooleansModifiable
{
public boolean[] a;
public int n;
// Instantiation
/**
* For efficiency, does not clone the array arg.
*/
public BooleansArray( boolean[] a )
{
this( a, a.length );
}
public BooleansArray( int n )
{
this( new boolean[n], 0 );
}
public BooleansArray( )
{
this( new boolean[0], 0 );
}
/**
* For efficiency, does not clone the array arg.
*/
public BooleansArray( boolean[] a, int n )
{
this.a = a;
this.n = n;
}
/**
* Clones the sequence arg.
*/
public BooleansArray( Booleans xs )
{
n = xs.n( );
a = new boolean[n];
xs.copyTo( 0, a, 0, n );
}
// Accessors
@Override
public boolean v( int i )
{
// Skip bounds check for speed
//if (i >= n) throw new ArrayIndexOutOfBoundsException("Array index out of range: index = " + i + ", length = " + n);
return a[i];
}
@Override
public int n( )
{
return n;
}
@Override
public void copyTo( int i, boolean[] dest, int iDest, int c )
{
System.arraycopy( a, i, dest, iDest, c );
}
@Override
public boolean[] copyOf( int i, int c )
{
boolean[] copy = new boolean[c];
System.arraycopy( a, i, copy, 0, c );
return copy;
}
@Override
public boolean[] copyOf( )
{
boolean[] copy = new boolean[n];
System.arraycopy( a, 0, copy, 0, n );
return copy;
}
@Override
public BooleansArray copy( )
{
return new BooleansArray( this.a.clone( ), this.n );
}
@Override
public boolean isEmpty( )
{
return ( n == 0 );
}
@Override
public boolean first( )
{
return a[0];
}
@Override
public boolean last( )
{
return a[n - 1];
}
// Mutators
@Override
public void set( int i, boolean v )
{
a[i] = v;
}
@Override
public void set( int i, boolean[] vs )
{
set( i, vs, 0, vs.length );
}
@Override
public void set( int i, boolean[] vs, int from, int to )
{
int c = to - from;
ensureCapacity( i + c );
System.arraycopy( vs, from, a, i, c );
n = i + c;
}
@Override
public void insert( int i, boolean v )
{
prepForInsert( i, 1 );
a[i] = v;
}
@Override
public void insert( int i, Booleans vs )
{
insert( i, vs, 0, vs.n( ) );
}
@Override
public void insert( int i, Booleans vs, int from, int to )
{
int c = to - from;
prepForInsert( i, c );
vs.copyTo( from, a, i, c );
}
@Override
public void insert( int i, boolean[] vs )
{
insert( i, vs, 0, vs.length );
}
@Override
public void insert( int i, boolean[] vs, int from, int to )
{
int c = to - from;
prepForInsert( i, c );
System.arraycopy( vs, from, a, i, c );
}
/**
* Makes room in this array for new values to be inserted.
*
* When this call returns, the values in this.a on [i,i+c)
* are undefined. Writing meaningful values to these indices is up to the
* caller.
*
* @param i The index at which new values will be inserted
* @param c The count of new values that will be inserted
*/
public void prepForInsert( int i, int c )
{
boolean[] a = this.a;
int capacity = a.length;
int n = this.n;
int nNew;
if ( i >= n )
{
nNew = i + c;
if ( nNew > capacity )
{
boolean[] aNew = newArray( capacity, nNew );
System.arraycopy( a, 0, aNew, 0, n );
this.a = aNew;
}
}
else
{
nNew = n + c;
if ( nNew > capacity )
{
boolean[] aNew = newArray( capacity, nNew );
System.arraycopy( a, 0, aNew, 0, i );
System.arraycopy( a, i, aNew, i + c, n - i );
this.a = aNew;
}
else
{
System.arraycopy( a, i, a, i + c, n - i );
}
}
this.n = nNew;
}
@Override
public void prepend( boolean v )
{
prepForPrepend( 1 );
a[0] = v;
}
@Override
public void prepend( Booleans vs )
{
prepend( vs, 0, vs.n( ) );
}
@Override
public void prepend( Booleans vs, int from, int to )
{
int c = to - from;
prepForPrepend( c );
vs.copyTo( from, a, 0, c );
}
@Override
public void prepend( boolean[] vs )
{
prepend( vs, 0, vs.length );
}
@Override
public void prepend( boolean[] vs, int from, int to )
{
int c = to - from;
prepForPrepend( c );
System.arraycopy( vs, from, a, 0, c );
}
/**
* Makes room in this array for new values to be prepended.
*
* When this call returns, the values in this.a on [0,c)
* are undefined. Writing meaningful values to these indices is up to the
* caller.
*
* @param c The count of new values that will be inserted
*/
public void prepForPrepend( int c )
{
boolean[] a = this.a;
int capacity = a.length;
int n = this.n;
int nNew = n + c;
if ( nNew > capacity )
{
boolean[] aNew = newArray( capacity, nNew );
System.arraycopy( a, 0, aNew, c, n );
this.a = aNew;
}
else
{
System.arraycopy( a, 0, a, c, n );
}
this.n = nNew;
}
@Override
public void append( boolean v )
{
prepForAppend( 1 );
a[n - 1] = v;
}
@Override
public void append( Booleans vs )
{
append( vs, 0, vs.n( ) );
}
@Override
public void append( Booleans vs, int from, int to )
{
int c = to - from;
prepForAppend( c );
vs.copyTo( from, a, n - c, c );
}
@Override
public void append( boolean[] vs )
{
append( vs, 0, vs.length );
}
@Override
public void append( boolean[] vs, int from, int to )
{
int c = to - from;
prepForAppend( c );
System.arraycopy( vs, from, a, n - c, c );
}
/**
* Makes room in this array for new values to be appended.
*
* When this call returns, the values in this.a on [this.n-c,this.n)
* are undefined. Writing meaningful values to these indices is up to the
* caller.
*
* @param c The count of new values that will be appended
*/
public void prepForAppend( int c )
{
boolean[] a = this.a;
int capacity = a.length;
int n = this.n;
int nNew = n + c;
if ( nNew > capacity )
{
boolean[] aNew = newArray( capacity, nNew );
System.arraycopy( a, 0, aNew, 0, n );
this.a = aNew;
}
this.n = nNew;
}
@Override
public void remove( boolean v )
{
for ( int i = 0; i < n; i++ )
{
if ( a[i] == v )
{
System.arraycopy( a, i + 1, a, i, n - ( i + 1 ) );
n--;
return;
}
}
}
@Override
public void removeRange( int from, int to )
{
int length = n - to;
System.arraycopy( a, to, a, from, length );
n -= to - from;
}
@Override
public void removeIndex( int index )
{
removeRange( index, index + 1 );
}
@Override
public void clear( )
{
n = 0;
}
@Override
public void ensureCapacity( int minCapacity )
{
int capacity = a.length;
if ( minCapacity > capacity )
{
boolean[] aNew = newArray( capacity, minCapacity );
System.arraycopy( a, 0, aNew, 0, n );
this.a = aNew;
}
}
@Override
public void compact( )
{
boolean[] compact = new boolean[n];
System.arraycopy( a, 0, compact, 0, n );
a = compact;
}
/**
* Creates a new array whose capacity is at least minNewCapacity, and at least
* 1.618 * oldCapacity, up to Integer.MAX_VALUE.
*/
public static boolean[] newArray( int oldCapacity, int minNewCapacity )
{
int newCapacity = ( int ) max( minNewCapacity, min( Integer.MAX_VALUE, ( 106039L * oldCapacity ) >>> 16 ) );
return new boolean[newCapacity];
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy