Refine search
public void writeExternal( ObjectOutput out ) throws IOException { // VERSION out.writeByte( 0 ); // POSITION out.writeInt( _pos ); // NO_ENTRY_VALUE out.writeChar( no_entry_value ); // ENTRIES int len = _data.length; out.writeInt( len ); for( int i = 0; i < len; i++ ) { out.writeChar( _data[ i ] ); } }
/** {@inheritDoc} */ public void writeExternal(ObjectOutput out) throws IOException { // VERSION out.writeByte( 0 ); // SUPER super.writeExternal( out ); // NUMBER OF ENTRIES out.writeInt( _size ); // ENTRIES for ( int i = _states.length; i-- > 0; ) { if ( _states[i] == FULL ) { out.writeChar( _set[i] ); out.writeChar( _values[i] ); } } }
protected void walkToSave(ObjectOutput out) throws IOException { out.writeChar(c); out.writeInt(status.ordinal()); if (status == Status.WORD_END_3 || status == Status.WORD_MIDDLE_2) { out.writeObject(value); } int childSize = 0; if (child != null) childSize = child.length; out.writeInt(childSize); if (child == null) return; for (BaseNode node : child) { node.walkToSave(out); } }
/** {@inheritDoc} */ public void writeExternal(ObjectOutput out) throws IOException { // VERSION out.writeByte( 0 ); // SUPER super.writeExternal( out ); // NUMBER OF ENTRIES out.writeInt( _size ); // ENTRIES for ( int i = _states.length; i-- > 0; ) { if ( _states[i] == FULL ) { out.writeChar( _set[i] ); out.writeInt( _values[i] ); } } }
public void writeExternal(ObjectOutput out) throws IOException { out.writeInt(this.size()); int zeroToThirtyOne = this.zeroToThirtyOne; while (zeroToThirtyOne != 0) { char value = (char) Integer.numberOfTrailingZeros(zeroToThirtyOne); out.writeChar(value); zeroToThirtyOne &= ~(1 << value); } for (char value : this.table) { if (isNonSentinel(value)) { out.writeChar(value); } } }