本文整理汇总了Java中gnu.trove.list.TByteList类的典型用法代码示例。如果您正苦于以下问题：Java TByteList类的具体用法？Java TByteList怎么用？Java TByteList使用的例子？那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。
TByteList类属于gnu.trove.list包，在下文中一共展示了TByteList类的15个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: subList
import gnu.trove.list.TByteList; //导入依赖的package包/类
/** {@inheritDoc} */
public TByteList subList( int begin, int end ) {
if ( end < begin ) {
throw new IllegalArgumentException( "end index " + end +
" greater than begin index " + begin );
}
if ( begin < 0 ) {
throw new IndexOutOfBoundsException( "begin index can not be < 0" );
}
if ( end > _data.length ) {
throw new IndexOutOfBoundsException( "end index < " + _data.length );
}
TByteArrayList list = new TByteArrayList( end - begin );
for ( int i = begin; i < end; i++ ) {
list.add( _data[ i ] );
}
return list;
}
示例2: subList
import gnu.trove.list.TByteList; //导入依赖的package包/类
/** {@inheritDoc} */
public TByteList subList(int begin, int end) {
if (end < begin) {
throw new IllegalArgumentException("begin index " + begin +
" greater than end index " + end);
}
if (size < begin) {
throw new IllegalArgumentException("begin index " + begin +
" greater than last index " + size);
}
if (begin < 0) {
throw new IndexOutOfBoundsException("begin index can not be < 0");
}
if (end > size) {
throw new IndexOutOfBoundsException("end index < " + size);
}
TByteLinkedList ret = new TByteLinkedList();
TByteLink tmp = getLinkAt(begin);
for (int i = begin; i < end; i++) {
ret.add(tmp.getValue()); // copy
tmp = tmp.getNext();
}
return ret;
}
示例3: equals
import gnu.trove.list.TByteList; //导入依赖的package包/类
/** {@inheritDoc} */
@Override
public boolean equals( Object other ) {
if ( other == this ) {
return true;
}
if ( !( other instanceof TByteList ) ) return false;
TByteList that = ( TByteList )other;
if ( size() != that.size() ) return false;
for( int i = 0; i < size(); i++ ) {
if ( get( i ) != that.get( i ) ) {
return false;
}
}
return true;
}
示例4: subList
import gnu.trove.list.TByteList; //导入依赖的package包/类
/** {@inheritDoc} */
@Override
public TByteList subList( int begin, int end ) {
if ( end < begin ) {
throw new IllegalArgumentException( "end index " + end +
" greater than begin index " + begin );
}
if ( begin < 0 ) {
throw new IndexOutOfBoundsException( "begin index can not be < 0" );
}
if ( end > _data.length ) {
throw new IndexOutOfBoundsException( "end index < " + _data.length );
}
TByteArrayList list = new TByteArrayList( end - begin );
for ( int i = begin; i < end; i++ ) {
list.add( _data[ i ] );
}
return list;
}
示例5: set
import gnu.trove.list.TByteList; //导入依赖的package包/类
public void set(final TByteList value) {
final Command command = new Command(Command.SETALL, (short) value.size());
commands.add(command);
++baselineCommandCount;
//Is this the best way to do this?
v.clear();
v.addAll(value);
for (int i = 0, size = value.size(); i < size; ++i) {
final Command subCommand = new Command(Command.SET, (short) i, value.get(i));
commands.add(subCommand);
++baselineCommandCount;
}
touch();
onChanged();
}
示例6: set
import gnu.trove.list.TByteList; //导入依赖的package包/类
public void set(final TByteList value) {
final Command command = new Command(Command.SETALL, (short) value.size());
commands.add(command);
++baselineCommandCount;
//Is this the best way to do this?
v.clear();
v.addAll(value);
for (int i = 0, size = value.size(); i < size; ++i) {
final Command subCommand = new Command(Command.SET, (short) i, value.get(i) != 0);
commands.add(subCommand);
++baselineCommandCount;
}
touch();
onChanged();
}
示例7: grep
import gnu.trove.list.TByteList; //导入依赖的package包/类
/** {@inheritDoc} */
public TByteList grep( TByteProcedure condition ) {
TByteArrayList list = new TByteArrayList();
for ( int i = 0; i < _pos; i++ ) {
if ( condition.execute( _data[ i ] ) ) {
list.add( _data[ i ] );
}
}
return list;
}
示例8: inverseGrep
import gnu.trove.list.TByteList; //导入依赖的package包/类
/** {@inheritDoc} */
public TByteList inverseGrep( TByteProcedure condition ) {
TByteArrayList list = new TByteArrayList();
for ( int i = 0; i < _pos; i++ ) {
if ( !condition.execute( _data[ i ] ) ) {
list.add( _data[ i ] );
}
}
return list;
}
示例9: TByteLinkedList
import gnu.trove.list.TByteList; //导入依赖的package包/类
public TByteLinkedList(TByteList list) {
no_entry_value = list.getNoEntryValue();
//
for (TByteIterator iterator = list.iterator(); iterator.hasNext();) {
byte next = iterator.next();
add(next);
}
}
示例10: sort
import gnu.trove.list.TByteList; //导入依赖的package包/类
/** {@inheritDoc} */
public void sort(int fromIndex, int toIndex) {
TByteList tmp = subList(fromIndex, toIndex);
byte[] vals = tmp.toArray();
Arrays.sort(vals);
set(fromIndex, vals);
}
示例11: grep
import gnu.trove.list.TByteList; //导入依赖的package包/类
/** {@inheritDoc} */
public TByteList grep(TByteProcedure condition) {
TByteList ret = new TByteLinkedList();
for (TByteLink l = head; got(l); l = l.getNext()) {
if (condition.execute(l.getValue()))
ret.add(l.getValue());
}
return ret;
}
示例12: inverseGrep
import gnu.trove.list.TByteList; //导入依赖的package包/类
/** {@inheritDoc} */
public TByteList inverseGrep(TByteProcedure condition) {
TByteList ret = new TByteLinkedList();
for (TByteLink l = head; got(l); l = l.getNext()) {
if (!condition.execute(l.getValue()))
ret.add(l.getValue());
}
return ret;
}
示例13: readExternal
import gnu.trove.list.TByteList; //导入依赖的package包/类
public void readExternal( ObjectInput in )
throws IOException, ClassNotFoundException {
// VERSION
in.readByte();
// LIST
list = ( TByteList ) in.readObject();
}
示例14: grep
import gnu.trove.list.TByteList; //导入依赖的package包/类
/** {@inheritDoc} */
@Override
public TByteList grep( TByteProcedure condition ) {
TByteArrayList list = new TByteArrayList();
for ( int i = 0; i < _pos; i++ ) {
if ( condition.execute( _data[ i ] ) ) {
list.add( _data[ i ] );
}
}
return list;
}
示例15: inverseGrep
import gnu.trove.list.TByteList; //导入依赖的package包/类
/** {@inheritDoc} */
@Override
public TByteList inverseGrep( TByteProcedure condition ) {
TByteArrayList list = new TByteArrayList();
for ( int i = 0; i < _pos; i++ ) {
if ( !condition.execute( _data[ i ] ) ) {
list.add( _data[ i ] );
}
}
return list;
}