Merged from 1.5 branch.
git-svn-id: https://svn.apache.org/repos/asf/jakarta/poi/trunk@352660 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
parent
2490325a95
commit
7b23ccd114
@ -161,9 +161,7 @@ public class ContinueRecord
|
|||||||
|
|
||||||
// how many continue records do we need
|
// how many continue records do we need
|
||||||
// System.out.println("In ProcessContinue");
|
// System.out.println("In ProcessContinue");
|
||||||
int records =
|
int records = (data.length / 8214); // we've a 1 offset but we're also off by one due to rounding...so it balances out
|
||||||
(data.length
|
|
||||||
/ 8214); // we've a 1 offset but we're also off by one due to rounding...so it balances out
|
|
||||||
int offset = 8214;
|
int offset = 8214;
|
||||||
|
|
||||||
// System.out.println("we have "+records+" continue records to process");
|
// System.out.println("we have "+records+" continue records to process");
|
||||||
@ -174,8 +172,7 @@ public class ContinueRecord
|
|||||||
for (int cr = 0; cr < records; cr++)
|
for (int cr = 0; cr < records; cr++)
|
||||||
{
|
{
|
||||||
ContinueRecord contrec = new ContinueRecord();
|
ContinueRecord contrec = new ContinueRecord();
|
||||||
int arraysize = Math.min((8214 - 4),
|
int arraysize = Math.min((8214 - 4), (data.length - offset));
|
||||||
(data.length - offset));
|
|
||||||
byte[] crdata = new byte[ arraysize ];
|
byte[] crdata = new byte[ arraysize ];
|
||||||
|
|
||||||
System.arraycopy(data, offset, crdata, 0, arraysize);
|
System.arraycopy(data, offset, crdata, 0, arraysize);
|
||||||
|
202
src/java/org/apache/poi/hssf/record/RecordProcessor.java
Normal file
202
src/java/org/apache/poi/hssf/record/RecordProcessor.java
Normal file
@ -0,0 +1,202 @@
|
|||||||
|
/* ====================================================================
|
||||||
|
* The Apache Software License, Version 1.1
|
||||||
|
*
|
||||||
|
* Copyright (c) 2002 The Apache Software Foundation. All rights
|
||||||
|
* reserved.
|
||||||
|
*
|
||||||
|
* Redistribution and use in source and binary forms, with or without
|
||||||
|
* modification, are permitted provided that the following conditions
|
||||||
|
* are met:
|
||||||
|
*
|
||||||
|
* 1. Redistributions of source code must retain the above copyright
|
||||||
|
* notice, this list of conditions and the following disclaimer.
|
||||||
|
*
|
||||||
|
* 2. 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.
|
||||||
|
*
|
||||||
|
* 3. The end-user documentation included with the redistribution,
|
||||||
|
* if any, must include the following acknowledgment:
|
||||||
|
* "This product includes software developed by the
|
||||||
|
* Apache Software Foundation (http://www.apache.org/)."
|
||||||
|
* Alternately, this acknowledgment may appear in the software itself,
|
||||||
|
* if and wherever such third-party acknowledgments normally appear.
|
||||||
|
*
|
||||||
|
* 4. The names "Apache" and "Apache Software Foundation" and
|
||||||
|
* "Apache POI" must not be used to endorse or promote products
|
||||||
|
* derived from this software without prior written permission. For
|
||||||
|
* written permission, please contact apache@apache.org.
|
||||||
|
*
|
||||||
|
* 5. Products derived from this software may not be called "Apache",
|
||||||
|
* "Apache POI", nor may "Apache" appear in their name, without
|
||||||
|
* prior written permission of the Apache Software Foundation.
|
||||||
|
*
|
||||||
|
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED 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 THE APACHE SOFTWARE FOUNDATION OR
|
||||||
|
* ITS CONTRIBUTORS 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.
|
||||||
|
* ====================================================================
|
||||||
|
*
|
||||||
|
* This software consists of voluntary contributions made by many
|
||||||
|
* individuals on behalf of the Apache Software Foundation. For more
|
||||||
|
* information on the Apache Software Foundation, please see
|
||||||
|
* <http://www.apache.org/>.
|
||||||
|
*/
|
||||||
|
|
||||||
|
package org.apache.poi.hssf.record;
|
||||||
|
|
||||||
|
import org.apache.poi.util.LittleEndianConsts;
|
||||||
|
import org.apache.poi.util.LittleEndian;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Process a single record. That is, an SST record or a continue record.
|
||||||
|
* Refactored from code originally in SSTRecord.
|
||||||
|
*
|
||||||
|
* @author Glen Stampoultzis (glens at apache.org)
|
||||||
|
*/
|
||||||
|
class RecordProcessor
|
||||||
|
{
|
||||||
|
private byte[] data;
|
||||||
|
private int recordOffset;
|
||||||
|
private int available;
|
||||||
|
private SSTRecordHeader sstRecordHeader;
|
||||||
|
|
||||||
|
public RecordProcessor( byte[] data, int available, int numStrings, int numUniqueStrings )
|
||||||
|
{
|
||||||
|
this.data = data;
|
||||||
|
this.available = available;
|
||||||
|
this.sstRecordHeader = new SSTRecordHeader(numStrings, numUniqueStrings);
|
||||||
|
}
|
||||||
|
|
||||||
|
public int getAvailable()
|
||||||
|
{
|
||||||
|
return available;
|
||||||
|
}
|
||||||
|
|
||||||
|
public void writeRecordHeader( int offset, int totalWritten, int recordLength, boolean first_record )
|
||||||
|
{
|
||||||
|
if ( first_record )
|
||||||
|
{
|
||||||
|
available -= 8;
|
||||||
|
recordOffset = sstRecordHeader.writeSSTHeader( data, recordOffset + offset + totalWritten, recordLength );
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
recordOffset = writeContinueHeader( data, recordOffset + offset + totalWritten, recordLength );
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
public byte[] writeStringRemainder( boolean lastStringCompleted, byte[] stringreminant, int offset, int totalWritten )
|
||||||
|
{
|
||||||
|
if ( !lastStringCompleted )
|
||||||
|
{
|
||||||
|
// write reminant -- it'll all fit neatly
|
||||||
|
System.arraycopy( stringreminant, 0, data, recordOffset + offset + totalWritten, stringreminant.length );
|
||||||
|
adjustPointers( stringreminant.length );
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
// write as much of the remnant as possible
|
||||||
|
System.arraycopy( stringreminant, 0, data, recordOffset + offset + totalWritten, available );
|
||||||
|
byte[] leftover = new byte[( stringreminant.length - available ) + LittleEndianConsts.BYTE_SIZE];
|
||||||
|
|
||||||
|
System.arraycopy( stringreminant, available, leftover, LittleEndianConsts.BYTE_SIZE, stringreminant.length - available );
|
||||||
|
leftover[0] = stringreminant[0];
|
||||||
|
stringreminant = leftover;
|
||||||
|
adjustPointers( available ); // Consume all available remaining space
|
||||||
|
}
|
||||||
|
return stringreminant;
|
||||||
|
}
|
||||||
|
|
||||||
|
public void writeWholeString( UnicodeString unistr, int offset, int totalWritten )
|
||||||
|
{
|
||||||
|
unistr.serialize( recordOffset + offset + totalWritten, data );
|
||||||
|
int rsize = unistr.getRecordSize();
|
||||||
|
adjustPointers( rsize );
|
||||||
|
}
|
||||||
|
|
||||||
|
public byte[] writePartString( UnicodeString unistr, int offset, int totalWritten )
|
||||||
|
{
|
||||||
|
byte[] stringReminant;
|
||||||
|
byte[] ucs = unistr.serialize();
|
||||||
|
|
||||||
|
System.arraycopy( ucs, 0, data, recordOffset + offset + totalWritten, available );
|
||||||
|
stringReminant = new byte[( ucs.length - available ) + LittleEndianConsts.BYTE_SIZE];
|
||||||
|
System.arraycopy( ucs, available, stringReminant, LittleEndianConsts.BYTE_SIZE, ucs.length - available );
|
||||||
|
stringReminant[0] = ucs[LittleEndianConsts.SHORT_SIZE];
|
||||||
|
available = 0;
|
||||||
|
return stringReminant;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
private int writeContinueHeader( final byte[] data, final int pos,
|
||||||
|
final int recsize )
|
||||||
|
{
|
||||||
|
int offset = pos;
|
||||||
|
|
||||||
|
LittleEndian.putShort( data, offset, ContinueRecord.sid );
|
||||||
|
offset += LittleEndianConsts.SHORT_SIZE;
|
||||||
|
LittleEndian.putShort( data, offset, (short) ( recsize ) );
|
||||||
|
offset += LittleEndianConsts.SHORT_SIZE;
|
||||||
|
return offset - pos;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
private void adjustPointers( int amount )
|
||||||
|
{
|
||||||
|
recordOffset += amount;
|
||||||
|
available -= amount;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
class SSTRecordHeader
|
||||||
|
{
|
||||||
|
int numStrings;
|
||||||
|
int numUniqueStrings;
|
||||||
|
|
||||||
|
/**
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
public SSTRecordHeader( int numStrings, int numUniqueStrings )
|
||||||
|
{
|
||||||
|
this.numStrings = numStrings;
|
||||||
|
this.numUniqueStrings = numUniqueStrings;
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Writes out the SST record. This consists of the sid, the record size, the number of
|
||||||
|
* strings and the number of unique strings.
|
||||||
|
*
|
||||||
|
* @param data The data buffer to write the header to.
|
||||||
|
* @param bufferIndex The index into the data buffer where the header should be written.
|
||||||
|
* @param recSize The number of records written.
|
||||||
|
*
|
||||||
|
* @return The bufer of bytes modified.
|
||||||
|
*/
|
||||||
|
public int writeSSTHeader( byte[] data, int bufferIndex, int recSize )
|
||||||
|
{
|
||||||
|
int offset = bufferIndex;
|
||||||
|
|
||||||
|
LittleEndian.putShort( data, offset, SSTRecord.sid );
|
||||||
|
offset += LittleEndianConsts.SHORT_SIZE;
|
||||||
|
LittleEndian.putShort( data, offset, (short) ( recSize ) );
|
||||||
|
offset += LittleEndianConsts.SHORT_SIZE;
|
||||||
|
// LittleEndian.putInt( data, offset, getNumStrings() );
|
||||||
|
LittleEndian.putInt( data, offset, numStrings );
|
||||||
|
offset += LittleEndianConsts.INT_SIZE;
|
||||||
|
// LittleEndian.putInt( data, offset, getNumUniqueStrings() );
|
||||||
|
LittleEndian.putInt( data, offset, numUniqueStrings );
|
||||||
|
offset += LittleEndianConsts.INT_SIZE;
|
||||||
|
return offset - bufferIndex;
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
357
src/java/org/apache/poi/hssf/record/SSTDeserializer.java
Normal file
357
src/java/org/apache/poi/hssf/record/SSTDeserializer.java
Normal file
@ -0,0 +1,357 @@
|
|||||||
|
package org.apache.poi.hssf.record;
|
||||||
|
|
||||||
|
import org.apache.poi.util.LittleEndian;
|
||||||
|
import org.apache.poi.util.LittleEndianConsts;
|
||||||
|
import org.apache.poi.util.BinaryTree;
|
||||||
|
import org.apache.poi.util.HexDump;
|
||||||
|
|
||||||
|
import java.io.IOException;
|
||||||
|
|
||||||
|
class SSTDeserializer
|
||||||
|
{
|
||||||
|
|
||||||
|
private BinaryTree strings;
|
||||||
|
/** this is the number of characters we expect in the first sub-record in a subsequent continuation record */
|
||||||
|
private int continuationExpectedChars;
|
||||||
|
/** this is the string we were working on before hitting the end of the current record. This string is NOT finished. */
|
||||||
|
private String unfinishedString;
|
||||||
|
/** this is the total length of the current string being handled */
|
||||||
|
private int totalLengthBytes;
|
||||||
|
/** this is the offset into a string field of the actual string data */
|
||||||
|
private int stringDataOffset;
|
||||||
|
/** this is true if the string uses wide characters */
|
||||||
|
private boolean wideChar;
|
||||||
|
|
||||||
|
|
||||||
|
public SSTDeserializer(BinaryTree strings)
|
||||||
|
{
|
||||||
|
this.strings = strings;
|
||||||
|
setExpectedChars( 0 );
|
||||||
|
unfinishedString = "";
|
||||||
|
totalLengthBytes = 0;
|
||||||
|
stringDataOffset = 0;
|
||||||
|
wideChar = false;
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* This is the starting point where strings are constructed. Note that
|
||||||
|
* strings may span across multiple continuations. Read the SST record
|
||||||
|
* carefully before beginning to hack.
|
||||||
|
*/
|
||||||
|
public void manufactureStrings( final byte[] data, final int index,
|
||||||
|
short size )
|
||||||
|
{
|
||||||
|
int offset = index;
|
||||||
|
|
||||||
|
while ( offset < size )
|
||||||
|
{
|
||||||
|
int remaining = size - offset;
|
||||||
|
|
||||||
|
if ( ( remaining > 0 ) && ( remaining < LittleEndianConsts.SHORT_SIZE ) )
|
||||||
|
{
|
||||||
|
throw new RecordFormatException( "Cannot get length of the last string in SSTRecord" );
|
||||||
|
}
|
||||||
|
if ( remaining == LittleEndianConsts.SHORT_SIZE )
|
||||||
|
{
|
||||||
|
setExpectedChars( LittleEndian.getUShort( data, offset ) );
|
||||||
|
unfinishedString = "";
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
short charCount = LittleEndian.getShort( data, offset );
|
||||||
|
|
||||||
|
setupStringParameters( data, offset, charCount );
|
||||||
|
if ( remaining < totalLengthBytes )
|
||||||
|
{
|
||||||
|
setExpectedChars( calculateCharCount( totalLengthBytes - remaining ) );
|
||||||
|
charCount -= getExpectedChars();
|
||||||
|
totalLengthBytes = remaining;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
setExpectedChars( 0 );
|
||||||
|
}
|
||||||
|
processString( data, offset, charCount );
|
||||||
|
offset += totalLengthBytes;
|
||||||
|
if ( getExpectedChars() != 0 )
|
||||||
|
{
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Detemines the option types for the string (ie, compressed or uncompressed unicode, rich text string or
|
||||||
|
* plain string etc) and calculates the length and offset for the string.
|
||||||
|
*
|
||||||
|
* @param data
|
||||||
|
* @param index
|
||||||
|
* @param char_count
|
||||||
|
*/
|
||||||
|
private void setupStringParameters( final byte[] data, final int index,
|
||||||
|
final int char_count )
|
||||||
|
{
|
||||||
|
byte optionFlag = data[index + LittleEndianConsts.SHORT_SIZE];
|
||||||
|
|
||||||
|
wideChar = ( optionFlag & 1 ) == 1;
|
||||||
|
boolean farEast = ( optionFlag & 4 ) == 4;
|
||||||
|
boolean richText = ( optionFlag & 8 ) == 8;
|
||||||
|
|
||||||
|
totalLengthBytes = SSTRecord.STRING_MINIMAL_OVERHEAD + calculateByteCount( char_count );
|
||||||
|
stringDataOffset = SSTRecord.STRING_MINIMAL_OVERHEAD;
|
||||||
|
if ( richText )
|
||||||
|
{
|
||||||
|
short run_count = LittleEndian.getShort( data, index + stringDataOffset );
|
||||||
|
|
||||||
|
stringDataOffset += LittleEndianConsts.SHORT_SIZE;
|
||||||
|
totalLengthBytes += LittleEndianConsts.SHORT_SIZE + ( LittleEndianConsts.INT_SIZE * run_count );
|
||||||
|
}
|
||||||
|
if ( farEast )
|
||||||
|
{
|
||||||
|
int extension_length = LittleEndian.getInt( data, index + stringDataOffset );
|
||||||
|
|
||||||
|
stringDataOffset += LittleEndianConsts.INT_SIZE;
|
||||||
|
totalLengthBytes += LittleEndianConsts.INT_SIZE + extension_length;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
private void processString( final byte[] data, final int index,
|
||||||
|
final short char_count )
|
||||||
|
{
|
||||||
|
byte[] stringDataBuffer = new byte[totalLengthBytes];
|
||||||
|
int length = SSTRecord.STRING_MINIMAL_OVERHEAD + calculateByteCount( char_count );
|
||||||
|
byte[] bstring = new byte[length];
|
||||||
|
|
||||||
|
System.arraycopy( data, index, stringDataBuffer, 0, stringDataBuffer.length );
|
||||||
|
int offset = 0;
|
||||||
|
|
||||||
|
LittleEndian.putShort( bstring, offset, char_count );
|
||||||
|
offset += LittleEndianConsts.SHORT_SIZE;
|
||||||
|
bstring[offset] = stringDataBuffer[offset];
|
||||||
|
|
||||||
|
// System.out.println( "offset = " + stringDataOffset );
|
||||||
|
// System.out.println( "length = " + (bstring.length - STRING_MINIMAL_OVERHEAD) );
|
||||||
|
// System.out.println( "src.length = " + str_data.length );
|
||||||
|
// try
|
||||||
|
// {
|
||||||
|
// System.out.println( "----------------------- DUMP -------------------------" );
|
||||||
|
// HexDump.dump( stringDataBuffer, (long)stringDataOffset, System.out, 1);
|
||||||
|
// }
|
||||||
|
// catch ( IOException e )
|
||||||
|
// {
|
||||||
|
// }
|
||||||
|
// catch ( ArrayIndexOutOfBoundsException e )
|
||||||
|
// {
|
||||||
|
// }
|
||||||
|
// catch ( IllegalArgumentException e )
|
||||||
|
// {
|
||||||
|
// }
|
||||||
|
System.arraycopy( stringDataBuffer, stringDataOffset, bstring,
|
||||||
|
SSTRecord.STRING_MINIMAL_OVERHEAD,
|
||||||
|
bstring.length - SSTRecord.STRING_MINIMAL_OVERHEAD );
|
||||||
|
UnicodeString string = new UnicodeString( UnicodeString.sid,
|
||||||
|
(short) bstring.length,
|
||||||
|
bstring );
|
||||||
|
|
||||||
|
if ( getExpectedChars() != 0 )
|
||||||
|
{
|
||||||
|
unfinishedString = string.getString();
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
Integer integer = new Integer( strings.size() );
|
||||||
|
addToStringTable( strings, integer, string );
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Okay, we are doing some major cheating here. Because we can't handle rich text strings properly
|
||||||
|
* we end up getting duplicate strings. To get around this I'm doing do things: 1. Converting rich
|
||||||
|
* text to normal text and 2. If there's a duplicate I'm adding a space onto the end. Sneaky perhaps
|
||||||
|
* but it gets the job done until we can handle this a little better.
|
||||||
|
*/
|
||||||
|
static public void addToStringTable( BinaryTree strings, Integer integer, UnicodeString string )
|
||||||
|
{
|
||||||
|
if (string.isRichText())
|
||||||
|
string.setOptionFlags( (byte)(string.getOptionFlags() & (~8) ) );
|
||||||
|
|
||||||
|
boolean added = false;
|
||||||
|
while (added == false)
|
||||||
|
{
|
||||||
|
try
|
||||||
|
{
|
||||||
|
strings.put( integer, string );
|
||||||
|
added = true;
|
||||||
|
}
|
||||||
|
catch( Exception ignore )
|
||||||
|
{
|
||||||
|
string.setString( string.getString() + " " );
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
private int calculateCharCount( final int byte_count )
|
||||||
|
{
|
||||||
|
return byte_count / ( wideChar ? LittleEndianConsts.SHORT_SIZE
|
||||||
|
: LittleEndianConsts.BYTE_SIZE );
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Process a Continue record. A Continue record for an SST record
|
||||||
|
* contains the same kind of data that the SST record contains,
|
||||||
|
* with the following exceptions:
|
||||||
|
* <P>
|
||||||
|
* <OL>
|
||||||
|
* <LI>The string counts at the beginning of the SST record are
|
||||||
|
* not in the Continue record
|
||||||
|
* <LI>The first string in the Continue record might NOT begin
|
||||||
|
* with a size. If the last string in the previous record is
|
||||||
|
* continued in this record, the size is determined by that
|
||||||
|
* last string in the previous record; the first string will
|
||||||
|
* begin with a flag byte, followed by the remaining bytes (or
|
||||||
|
* words) of the last string from the previous
|
||||||
|
* record. Otherwise, the first string in the record will
|
||||||
|
* begin with a string length
|
||||||
|
* </OL>
|
||||||
|
*
|
||||||
|
* @param record the Continue record's byte data
|
||||||
|
*/
|
||||||
|
|
||||||
|
public void processContinueRecord( final byte[] record )
|
||||||
|
{
|
||||||
|
if ( getExpectedChars() == 0 )
|
||||||
|
{
|
||||||
|
unfinishedString = "";
|
||||||
|
totalLengthBytes = 0;
|
||||||
|
stringDataOffset = 0;
|
||||||
|
wideChar = false;
|
||||||
|
manufactureStrings( record, 0, (short) record.length );
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
int data_length = record.length - LittleEndianConsts.BYTE_SIZE;
|
||||||
|
|
||||||
|
if ( calculateByteCount( getExpectedChars() ) > data_length )
|
||||||
|
{
|
||||||
|
|
||||||
|
// create artificial data to create a UnicodeString
|
||||||
|
byte[] input =
|
||||||
|
new byte[record.length + LittleEndianConsts.SHORT_SIZE];
|
||||||
|
short size = (short) ( ( ( record[0] & 1 ) == 1 )
|
||||||
|
? ( data_length / LittleEndianConsts.SHORT_SIZE )
|
||||||
|
: ( data_length / LittleEndianConsts.BYTE_SIZE ) );
|
||||||
|
|
||||||
|
LittleEndian.putShort( input, (byte) 0, size );
|
||||||
|
System.arraycopy( record, 0, input, LittleEndianConsts.SHORT_SIZE, record.length );
|
||||||
|
UnicodeString ucs = new UnicodeString( UnicodeString.sid, (short) input.length, input );
|
||||||
|
|
||||||
|
unfinishedString = unfinishedString + ucs.getString();
|
||||||
|
setExpectedChars( getExpectedChars() - size );
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
setupStringParameters( record, -LittleEndianConsts.SHORT_SIZE,
|
||||||
|
getExpectedChars() );
|
||||||
|
byte[] str_data = new byte[totalLengthBytes];
|
||||||
|
int length = SSTRecord.STRING_MINIMAL_OVERHEAD
|
||||||
|
+ ( calculateByteCount( getExpectedChars() ) );
|
||||||
|
byte[] bstring = new byte[length];
|
||||||
|
|
||||||
|
// Copy data from the record into the string
|
||||||
|
// buffer. Copy skips the length of a short in the
|
||||||
|
// string buffer, to leave room for the string length.
|
||||||
|
System.arraycopy( record, 0, str_data,
|
||||||
|
LittleEndianConsts.SHORT_SIZE,
|
||||||
|
str_data.length
|
||||||
|
- LittleEndianConsts.SHORT_SIZE );
|
||||||
|
|
||||||
|
// write the string length
|
||||||
|
LittleEndian.putShort( bstring, 0,
|
||||||
|
(short) getExpectedChars() );
|
||||||
|
|
||||||
|
// write the options flag
|
||||||
|
bstring[LittleEndianConsts.SHORT_SIZE] =
|
||||||
|
str_data[LittleEndianConsts.SHORT_SIZE];
|
||||||
|
|
||||||
|
// copy the bytes/words making up the string; skipping
|
||||||
|
// past all the overhead of the str_data array
|
||||||
|
System.arraycopy( str_data, stringDataOffset, bstring,
|
||||||
|
SSTRecord.STRING_MINIMAL_OVERHEAD,
|
||||||
|
bstring.length - SSTRecord.STRING_MINIMAL_OVERHEAD );
|
||||||
|
|
||||||
|
// use special constructor to create the final string
|
||||||
|
UnicodeString string =
|
||||||
|
new UnicodeString( UnicodeString.sid,
|
||||||
|
(short) bstring.length, bstring,
|
||||||
|
unfinishedString );
|
||||||
|
Integer integer = new Integer( strings.size() );
|
||||||
|
|
||||||
|
// field_3_strings.put( integer, string );
|
||||||
|
addToStringTable( strings, integer, string );
|
||||||
|
manufactureStrings( record, totalLengthBytes - LittleEndianConsts.SHORT_SIZE, (short) record.length );
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @return the number of characters we expect in the first
|
||||||
|
* sub-record in a subsequent continuation record
|
||||||
|
*/
|
||||||
|
|
||||||
|
int getExpectedChars()
|
||||||
|
{
|
||||||
|
return continuationExpectedChars;
|
||||||
|
}
|
||||||
|
|
||||||
|
private void setExpectedChars( final int count )
|
||||||
|
{
|
||||||
|
continuationExpectedChars = count;
|
||||||
|
}
|
||||||
|
|
||||||
|
private int calculateByteCount( final int character_count )
|
||||||
|
{
|
||||||
|
return character_count * ( wideChar ? LittleEndianConsts.SHORT_SIZE : LittleEndianConsts.BYTE_SIZE );
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @return the unfinished string
|
||||||
|
*/
|
||||||
|
|
||||||
|
String getUnfinishedString()
|
||||||
|
{
|
||||||
|
return unfinishedString;
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @return the total length of the current string
|
||||||
|
*/
|
||||||
|
|
||||||
|
int getTotalLength()
|
||||||
|
{
|
||||||
|
return totalLengthBytes;
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @return offset into current string data
|
||||||
|
*/
|
||||||
|
|
||||||
|
int getStringDataOffset()
|
||||||
|
{
|
||||||
|
return stringDataOffset;
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @return true if current string uses wide characters
|
||||||
|
*/
|
||||||
|
|
||||||
|
boolean isWideChar()
|
||||||
|
{
|
||||||
|
return wideChar;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
}
|
File diff suppressed because it is too large
Load Diff
356
src/java/org/apache/poi/hssf/record/SSTSerializer.java
Normal file
356
src/java/org/apache/poi/hssf/record/SSTSerializer.java
Normal file
@ -0,0 +1,356 @@
|
|||||||
|
/* ====================================================================
|
||||||
|
* The Apache Software License, Version 1.1
|
||||||
|
*
|
||||||
|
* Copyright (c) 2002 The Apache Software Foundation. All rights
|
||||||
|
* reserved.
|
||||||
|
*
|
||||||
|
* Redistribution and use in source and binary forms, with or without
|
||||||
|
* modification, are permitted provided that the following conditions
|
||||||
|
* are met:
|
||||||
|
*
|
||||||
|
* 1. Redistributions of source code must retain the above copyright
|
||||||
|
* notice, this list of conditions and the following disclaimer.
|
||||||
|
*
|
||||||
|
* 2. 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.
|
||||||
|
*
|
||||||
|
* 3. The end-user documentation included with the redistribution,
|
||||||
|
* if any, must include the following acknowledgment:
|
||||||
|
* "This product includes software developed by the
|
||||||
|
* Apache Software Foundation (http://www.apache.org/)."
|
||||||
|
* Alternately, this acknowledgment may appear in the software itself,
|
||||||
|
* if and wherever such third-party acknowledgments normally appear.
|
||||||
|
*
|
||||||
|
* 4. The names "Apache" and "Apache Software Foundation" and
|
||||||
|
* "Apache POI" must not be used to endorse or promote products
|
||||||
|
* derived from this software without prior written permission. For
|
||||||
|
* written permission, please contact apache@apache.org.
|
||||||
|
*
|
||||||
|
* 5. Products derived from this software may not be called "Apache",
|
||||||
|
* "Apache POI", nor may "Apache" appear in their name, without
|
||||||
|
* prior written permission of the Apache Software Foundation.
|
||||||
|
*
|
||||||
|
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED 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 THE APACHE SOFTWARE FOUNDATION OR
|
||||||
|
* ITS CONTRIBUTORS 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.
|
||||||
|
* ====================================================================
|
||||||
|
*
|
||||||
|
* This software consists of voluntary contributions made by many
|
||||||
|
* individuals on behalf of the Apache Software Foundation. For more
|
||||||
|
* information on the Apache Software Foundation, please see
|
||||||
|
* <http://www.apache.org/>.
|
||||||
|
*/
|
||||||
|
|
||||||
|
package org.apache.poi.hssf.record;
|
||||||
|
|
||||||
|
import org.apache.poi.util.BinaryTree;
|
||||||
|
import org.apache.poi.util.LittleEndianConsts;
|
||||||
|
|
||||||
|
import java.util.List;
|
||||||
|
import java.util.ArrayList;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* This class handles serialization of SST records. It utilizes the record processor
|
||||||
|
* class write individual records. This has been refactored from the SSTRecord class.
|
||||||
|
*
|
||||||
|
* @author Glen Stampoultzis (glens at apache.org)
|
||||||
|
*/
|
||||||
|
class SSTSerializer
|
||||||
|
{
|
||||||
|
|
||||||
|
private List recordLengths;
|
||||||
|
private BinaryTree strings;
|
||||||
|
private int numStrings;
|
||||||
|
private int numUniqueStrings;
|
||||||
|
private SSTRecordHeader sstRecordHeader;
|
||||||
|
|
||||||
|
public SSTSerializer( List recordLengths, BinaryTree strings, int numStrings, int numUniqueStrings )
|
||||||
|
{
|
||||||
|
this.recordLengths = recordLengths;
|
||||||
|
this.strings = strings;
|
||||||
|
this.numStrings = numStrings;
|
||||||
|
this.numUniqueStrings = numUniqueStrings;
|
||||||
|
this.sstRecordHeader = new SSTRecordHeader(numStrings, numUniqueStrings);
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Create a byte array consisting of an SST record and any
|
||||||
|
* required Continue records, ready to be written out.
|
||||||
|
* <p>
|
||||||
|
* If an SST record and any subsequent Continue records are read
|
||||||
|
* in to create this instance, this method should produce a byte
|
||||||
|
* array that is identical to the byte array produced by
|
||||||
|
* concatenating the input records' data.
|
||||||
|
*
|
||||||
|
* @return the byte array
|
||||||
|
*/
|
||||||
|
public int serialize( int offset, byte[] data )
|
||||||
|
{
|
||||||
|
int record_size = getRecordSize();
|
||||||
|
int record_length_index = 0;
|
||||||
|
|
||||||
|
if ( calculateUnicodeSize() > SSTRecord.MAX_DATA_SPACE )
|
||||||
|
serializeLargeRecord( record_size, record_length_index, data, offset );
|
||||||
|
else
|
||||||
|
serializeSingleSSTRecord( data, offset, record_length_index );
|
||||||
|
return record_size;
|
||||||
|
}
|
||||||
|
|
||||||
|
private int calculateUnicodeSize()
|
||||||
|
{
|
||||||
|
int retval = 0;
|
||||||
|
|
||||||
|
for ( int k = 0; k < strings.size(); k++ )
|
||||||
|
{
|
||||||
|
retval += getUnicodeString(k).getRecordSize();
|
||||||
|
}
|
||||||
|
return retval;
|
||||||
|
}
|
||||||
|
|
||||||
|
// we can probably simplify this later...this calculates the size
|
||||||
|
// w/o serializing but still is a bit slow
|
||||||
|
public int getRecordSize()
|
||||||
|
{
|
||||||
|
recordLengths = new ArrayList();
|
||||||
|
int retval = 0;
|
||||||
|
int unicodesize = calculateUnicodeSize();
|
||||||
|
|
||||||
|
if ( unicodesize > SSTRecord.MAX_DATA_SPACE )
|
||||||
|
{
|
||||||
|
retval = calcRecordSizesForLongStrings( unicodesize );
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
// short data: write one simple SST record
|
||||||
|
retval = SSTRecord.SST_RECORD_OVERHEAD + unicodesize;
|
||||||
|
recordLengths.add( new Integer( unicodesize ) );
|
||||||
|
}
|
||||||
|
return retval;
|
||||||
|
}
|
||||||
|
|
||||||
|
private int calcRecordSizesForLongStrings( int unicodesize )
|
||||||
|
{
|
||||||
|
int retval;
|
||||||
|
UnicodeString unistr = null;
|
||||||
|
int stringreminant = 0;
|
||||||
|
int unipos = 0;
|
||||||
|
boolean lastneedcontinue = false;
|
||||||
|
int stringbyteswritten = 0;
|
||||||
|
boolean finished = false;
|
||||||
|
boolean first_record = true;
|
||||||
|
int totalWritten = 0;
|
||||||
|
|
||||||
|
while ( !finished )
|
||||||
|
{
|
||||||
|
int record = 0;
|
||||||
|
int pos = 0;
|
||||||
|
|
||||||
|
if ( first_record )
|
||||||
|
{
|
||||||
|
|
||||||
|
// writing SST record
|
||||||
|
record = SSTRecord.MAX_RECORD_SIZE;
|
||||||
|
pos = 12;
|
||||||
|
first_record = false;
|
||||||
|
recordLengths.add( new Integer( record - SSTRecord.STD_RECORD_OVERHEAD ) );
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
|
||||||
|
// writing continue record
|
||||||
|
pos = 0;
|
||||||
|
int to_be_written = ( unicodesize - stringbyteswritten ) + ( lastneedcontinue ? 1 : 0 );
|
||||||
|
int size = Math.min( SSTRecord.MAX_RECORD_SIZE - SSTRecord.STD_RECORD_OVERHEAD, to_be_written );
|
||||||
|
|
||||||
|
if ( size == to_be_written )
|
||||||
|
{
|
||||||
|
finished = true;
|
||||||
|
}
|
||||||
|
record = size + SSTRecord.STD_RECORD_OVERHEAD;
|
||||||
|
recordLengths.add( new Integer( size ) );
|
||||||
|
pos = 4;
|
||||||
|
}
|
||||||
|
if ( lastneedcontinue )
|
||||||
|
{
|
||||||
|
int available = SSTRecord.MAX_RECORD_SIZE - pos;
|
||||||
|
|
||||||
|
if ( stringreminant <= available )
|
||||||
|
{
|
||||||
|
|
||||||
|
// write reminant
|
||||||
|
stringbyteswritten += stringreminant - 1;
|
||||||
|
pos += stringreminant;
|
||||||
|
lastneedcontinue = false;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
|
||||||
|
// write as much of the remnant as possible
|
||||||
|
int toBeWritten = unistr.maxBrokenLength( available );
|
||||||
|
|
||||||
|
if ( available != toBeWritten )
|
||||||
|
{
|
||||||
|
int shortrecord = record - ( available - toBeWritten );
|
||||||
|
recordLengths.set( recordLengths.size() - 1,
|
||||||
|
new Integer( shortrecord - SSTRecord.STD_RECORD_OVERHEAD ) );
|
||||||
|
record = shortrecord;
|
||||||
|
}
|
||||||
|
stringbyteswritten += toBeWritten - 1;
|
||||||
|
pos += toBeWritten;
|
||||||
|
stringreminant -= toBeWritten - 1;
|
||||||
|
lastneedcontinue = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
for ( ; unipos < strings.size(); unipos++ )
|
||||||
|
{
|
||||||
|
int available = SSTRecord.MAX_RECORD_SIZE - pos;
|
||||||
|
Integer intunipos = new Integer( unipos );
|
||||||
|
|
||||||
|
unistr = ( (UnicodeString) strings.get( intunipos ) );
|
||||||
|
if ( unistr.getRecordSize() <= available )
|
||||||
|
{
|
||||||
|
stringbyteswritten += unistr.getRecordSize();
|
||||||
|
pos += unistr.getRecordSize();
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
if ( available >= SSTRecord.STRING_MINIMAL_OVERHEAD )
|
||||||
|
{
|
||||||
|
int toBeWritten =
|
||||||
|
unistr.maxBrokenLength( available );
|
||||||
|
|
||||||
|
stringbyteswritten += toBeWritten;
|
||||||
|
stringreminant =
|
||||||
|
( unistr.getRecordSize() - toBeWritten )
|
||||||
|
+ LittleEndianConsts.BYTE_SIZE;
|
||||||
|
if ( available != toBeWritten )
|
||||||
|
{
|
||||||
|
int shortrecord = record
|
||||||
|
- ( available - toBeWritten );
|
||||||
|
|
||||||
|
recordLengths.set(
|
||||||
|
recordLengths.size() - 1,
|
||||||
|
new Integer(
|
||||||
|
shortrecord - SSTRecord.STD_RECORD_OVERHEAD ) );
|
||||||
|
record = shortrecord;
|
||||||
|
}
|
||||||
|
lastneedcontinue = true;
|
||||||
|
unipos++;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
int shortrecord = record - available;
|
||||||
|
|
||||||
|
recordLengths.set( recordLengths.size() - 1,
|
||||||
|
new Integer( shortrecord - SSTRecord.STD_RECORD_OVERHEAD ) );
|
||||||
|
record = shortrecord;
|
||||||
|
}
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
totalWritten += record;
|
||||||
|
}
|
||||||
|
retval = totalWritten;
|
||||||
|
|
||||||
|
return retval;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
private void serializeSingleSSTRecord( byte[] data, int offset, int record_length_index )
|
||||||
|
{
|
||||||
|
// short data: write one simple SST record
|
||||||
|
|
||||||
|
int len = ( (Integer) recordLengths.get( record_length_index++ ) ).intValue();
|
||||||
|
int recordSize = SSTRecord.SST_RECORD_OVERHEAD + len - SSTRecord.STD_RECORD_OVERHEAD;
|
||||||
|
sstRecordHeader.writeSSTHeader( data, 0 + offset, recordSize );
|
||||||
|
int pos = SSTRecord.SST_RECORD_OVERHEAD;
|
||||||
|
|
||||||
|
for ( int k = 0; k < strings.size(); k++ )
|
||||||
|
{
|
||||||
|
// UnicodeString unistr = ( (UnicodeString) strings.get( new Integer( k ) ) );
|
||||||
|
System.arraycopy( getUnicodeString(k).serialize(), 0, data, pos + offset, getUnicodeString(k).getRecordSize() );
|
||||||
|
pos += getUnicodeString(k).getRecordSize();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Large records are serialized to an SST and to one or more CONTINUE records. Joy. They have the special
|
||||||
|
* characteristic that they can change the option field when a single string is split across to a
|
||||||
|
* CONTINUE record.
|
||||||
|
*/
|
||||||
|
private void serializeLargeRecord( int record_size, int record_length_index, byte[] buffer, int offset )
|
||||||
|
{
|
||||||
|
|
||||||
|
byte[] stringReminant = null;
|
||||||
|
int stringIndex = 0;
|
||||||
|
boolean lastneedcontinue = false;
|
||||||
|
boolean first_record = true;
|
||||||
|
int totalWritten = 0;
|
||||||
|
|
||||||
|
while ( totalWritten != record_size )
|
||||||
|
{
|
||||||
|
int recordLength = ( (Integer) recordLengths.get( record_length_index++ ) ).intValue();
|
||||||
|
RecordProcessor recordProcessor = new RecordProcessor( buffer,
|
||||||
|
recordLength, numStrings, numUniqueStrings );
|
||||||
|
|
||||||
|
// write the appropriate header
|
||||||
|
recordProcessor.writeRecordHeader( offset, totalWritten, recordLength, first_record );
|
||||||
|
first_record = false;
|
||||||
|
|
||||||
|
// now, write the rest of the data into the current
|
||||||
|
// record space
|
||||||
|
if ( lastneedcontinue )
|
||||||
|
{
|
||||||
|
lastneedcontinue = stringReminant.length > recordProcessor.getAvailable();
|
||||||
|
// the last string in the previous record was not written out completely
|
||||||
|
stringReminant = recordProcessor.writeStringRemainder( lastneedcontinue,
|
||||||
|
stringReminant, offset, totalWritten );
|
||||||
|
}
|
||||||
|
|
||||||
|
// last string's remnant, if any, is cleaned up as best as can be done ... now let's try and write
|
||||||
|
// some more strings
|
||||||
|
for ( ; stringIndex < strings.size(); stringIndex++ )
|
||||||
|
{
|
||||||
|
UnicodeString unistr = getUnicodeString( stringIndex );
|
||||||
|
|
||||||
|
if ( unistr.getRecordSize() <= recordProcessor.getAvailable() )
|
||||||
|
{
|
||||||
|
recordProcessor.writeWholeString( unistr, offset, totalWritten );
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
|
||||||
|
// can't write the entire string out
|
||||||
|
if ( recordProcessor.getAvailable() >= SSTRecord.STRING_MINIMAL_OVERHEAD )
|
||||||
|
{
|
||||||
|
|
||||||
|
// we can write some of it
|
||||||
|
stringReminant = recordProcessor.writePartString( unistr, offset, totalWritten );
|
||||||
|
lastneedcontinue = true;
|
||||||
|
stringIndex++;
|
||||||
|
}
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
totalWritten += recordLength + SSTRecord.STD_RECORD_OVERHEAD;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
private UnicodeString getUnicodeString( int index )
|
||||||
|
{
|
||||||
|
Integer intunipos = new Integer( index );
|
||||||
|
return ( (UnicodeString) strings.get( intunipos ) );
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
@ -66,6 +66,7 @@ import org.apache.poi.util.StringUtil;
|
|||||||
* REFERENCE: PG 264 Microsoft Excel 97 Developer's Kit (ISBN: 1-57231-498-2)<P>
|
* REFERENCE: PG 264 Microsoft Excel 97 Developer's Kit (ISBN: 1-57231-498-2)<P>
|
||||||
* @author Andrew C. Oliver
|
* @author Andrew C. Oliver
|
||||||
* @author Marc Johnson (mjohnson at apache dot org)
|
* @author Marc Johnson (mjohnson at apache dot org)
|
||||||
|
* @author Glen Stampoultzis (glens at apache.org)
|
||||||
* @version 2.0-pre
|
* @version 2.0-pre
|
||||||
*/
|
*/
|
||||||
|
|
||||||
@ -77,12 +78,28 @@ public class UnicodeString
|
|||||||
private short field_1_charCount; // = 0;
|
private short field_1_charCount; // = 0;
|
||||||
private byte field_2_optionflags; // = 0;
|
private byte field_2_optionflags; // = 0;
|
||||||
private String field_3_string; // = null;
|
private String field_3_string; // = null;
|
||||||
|
private final int RICH_TEXT_BIT = 8;
|
||||||
|
|
||||||
|
public UnicodeString()
|
||||||
|
{
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
public int hashCode()
|
public int hashCode()
|
||||||
{
|
{
|
||||||
return field_1_charCount;
|
int stringHash = 0;
|
||||||
|
if (field_3_string != null)
|
||||||
|
stringHash = field_3_string.hashCode();
|
||||||
|
return field_1_charCount + stringHash;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Our handling of equals is inconsistent with compareTo. The trouble is because we don't truely understand
|
||||||
|
* rich text fields yet it's difficult to make a sound comparison.
|
||||||
|
*
|
||||||
|
* @param o The object to compare.
|
||||||
|
* @return true if the object is actually equal.
|
||||||
|
*/
|
||||||
public boolean equals(Object o)
|
public boolean equals(Object o)
|
||||||
{
|
{
|
||||||
if ((o == null) || (o.getClass() != this.getClass()))
|
if ((o == null) || (o.getClass() != this.getClass()))
|
||||||
@ -96,10 +113,6 @@ public class UnicodeString
|
|||||||
&& field_3_string.equals(other.field_3_string));
|
&& field_3_string.equals(other.field_3_string));
|
||||||
}
|
}
|
||||||
|
|
||||||
public UnicodeString()
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* construct a unicode string record and fill its fields, ID is ignored
|
* construct a unicode string record and fill its fields, ID is ignored
|
||||||
* @param id - ignored
|
* @param id - ignored
|
||||||
@ -278,19 +291,10 @@ public class UnicodeString
|
|||||||
|
|
||||||
public int serialize(int offset, byte [] data)
|
public int serialize(int offset, byte [] data)
|
||||||
{
|
{
|
||||||
int charsize = 1;
|
|
||||||
|
|
||||||
if (getOptionFlags() == 1)
|
|
||||||
{
|
|
||||||
charsize = 2;
|
|
||||||
}
|
|
||||||
|
|
||||||
// byte[] retval = new byte[ 3 + (getString().length() * charsize) ];
|
|
||||||
LittleEndian.putShort(data, 0 + offset, getCharCount());
|
LittleEndian.putShort(data, 0 + offset, getCharCount());
|
||||||
data[ 2 + offset ] = getOptionFlags();
|
data[ 2 + offset ] = getOptionFlags();
|
||||||
|
|
||||||
// System.out.println("Unicode: We've got "+retval[2]+" for our option flag");
|
if (!isUncompressedUnicode())
|
||||||
if (getOptionFlags() == 0)
|
|
||||||
{
|
{
|
||||||
StringUtil.putCompressedUnicode(getString(), data, 0x3 + offset);
|
StringUtil.putCompressedUnicode(getString(), data, 0x3 + offset);
|
||||||
}
|
}
|
||||||
@ -302,14 +306,14 @@ public class UnicodeString
|
|||||||
return getRecordSize();
|
return getRecordSize();
|
||||||
}
|
}
|
||||||
|
|
||||||
|
private boolean isUncompressedUnicode()
|
||||||
|
{
|
||||||
|
return (getOptionFlags() & 0x01) == 1;
|
||||||
|
}
|
||||||
|
|
||||||
public int getRecordSize()
|
public int getRecordSize()
|
||||||
{
|
{
|
||||||
int charsize = 1;
|
int charsize = isUncompressedUnicode() ? 2 : 1;
|
||||||
|
|
||||||
if (getOptionFlags() == 1)
|
|
||||||
{
|
|
||||||
charsize = 2;
|
|
||||||
}
|
|
||||||
return 3 + (getString().length() * charsize);
|
return 3 + (getString().length() * charsize);
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -338,11 +342,16 @@ public class UnicodeString
|
|||||||
return this.getString().compareTo(str.getString());
|
return this.getString().compareTo(str.getString());
|
||||||
}
|
}
|
||||||
|
|
||||||
|
public boolean isRichText()
|
||||||
|
{
|
||||||
|
return (getOptionFlags() & RICH_TEXT_BIT) != 0;
|
||||||
|
}
|
||||||
|
|
||||||
int maxBrokenLength(final int proposedBrokenLength)
|
int maxBrokenLength(final int proposedBrokenLength)
|
||||||
{
|
{
|
||||||
int rval = proposedBrokenLength;
|
int rval = proposedBrokenLength;
|
||||||
|
|
||||||
if ((field_2_optionflags & 1) == 1)
|
if (isUncompressedUnicode())
|
||||||
{
|
{
|
||||||
int proposedStringLength = proposedBrokenLength - 3;
|
int proposedStringLength = proposedBrokenLength - 3;
|
||||||
|
|
||||||
@ -355,12 +364,4 @@ public class UnicodeString
|
|||||||
return rval;
|
return rval;
|
||||||
}
|
}
|
||||||
|
|
||||||
// public boolean equals(Object obj) {
|
|
||||||
// if (!(obj instanceof UnicodeString)) return false;
|
|
||||||
//
|
|
||||||
// UnicodeString str = (UnicodeString)obj;
|
|
||||||
//
|
|
||||||
//
|
|
||||||
// return this.getString().equals(str.getString());
|
|
||||||
// }
|
|
||||||
}
|
}
|
||||||
|
@ -617,4 +617,5 @@ public class LittleEndian
|
|||||||
return copy;
|
return copy;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
}
|
}
|
||||||
|
BIN
src/testcases/org/apache/poi/hssf/data/duprich1.xls
Normal file
BIN
src/testcases/org/apache/poi/hssf/data/duprich1.xls
Normal file
Binary file not shown.
BIN
src/testcases/org/apache/poi/hssf/data/duprich2.xls
Normal file
BIN
src/testcases/org/apache/poi/hssf/data/duprich2.xls
Normal file
Binary file not shown.
@ -1,4 +1,3 @@
|
|||||||
|
|
||||||
/* ====================================================================
|
/* ====================================================================
|
||||||
* The Apache Software License, Version 1.1
|
* The Apache Software License, Version 1.1
|
||||||
*
|
*
|
||||||
@ -55,24 +54,28 @@
|
|||||||
|
|
||||||
package org.apache.poi.hssf.record;
|
package org.apache.poi.hssf.record;
|
||||||
|
|
||||||
import org.apache.poi.util.*;
|
import junit.framework.TestCase;
|
||||||
|
import org.apache.poi.util.LittleEndian;
|
||||||
import junit.framework.*;
|
import org.apache.poi.util.LittleEndianConsts;
|
||||||
|
import org.apache.poi.hssf.usermodel.HSSFWorkbook;
|
||||||
|
import org.apache.poi.hssf.usermodel.HSSFSheet;
|
||||||
|
|
||||||
import java.io.*;
|
import java.io.*;
|
||||||
|
import java.util.ArrayList;
|
||||||
import java.util.*;
|
import java.util.Arrays;
|
||||||
|
import java.util.Iterator;
|
||||||
|
import java.util.List;
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* @author Marc Johnson (mjohnson at apache dot org)
|
* @author Marc Johnson (mjohnson at apache dot org)
|
||||||
*/
|
*/
|
||||||
|
|
||||||
public class TestSSTRecord
|
public class TestSSTRecord
|
||||||
extends TestCase
|
extends TestCase
|
||||||
{
|
{
|
||||||
private String _test_file_path;
|
private String _test_file_path;
|
||||||
private static final String _test_file_path_property =
|
private static final String _test_file_path_property =
|
||||||
"HSSF.testdata.path";
|
"HSSF.testdata.path";
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Creates new TestSSTRecord
|
* Creates new TestSSTRecord
|
||||||
@ -80,10 +83,10 @@ public class TestSSTRecord
|
|||||||
* @param name
|
* @param name
|
||||||
*/
|
*/
|
||||||
|
|
||||||
public TestSSTRecord(String name)
|
public TestSSTRecord( String name )
|
||||||
{
|
{
|
||||||
super(name);
|
super( name );
|
||||||
_test_file_path = System.getProperty(_test_file_path_property);
|
_test_file_path = System.getProperty( _test_file_path_property );
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
@ -93,118 +96,118 @@ public class TestSSTRecord
|
|||||||
*/
|
*/
|
||||||
|
|
||||||
public void testProcessContinueRecord()
|
public void testProcessContinueRecord()
|
||||||
throws IOException
|
throws IOException
|
||||||
{
|
{
|
||||||
byte[] testdata = readTestData("BigSSTRecord");
|
byte[] testdata = readTestData( "BigSSTRecord" );
|
||||||
byte[] input = new byte[ testdata.length - 4 ];
|
byte[] input = new byte[testdata.length - 4];
|
||||||
|
|
||||||
System.arraycopy(testdata, 4, input, 0, input.length);
|
System.arraycopy( testdata, 4, input, 0, input.length );
|
||||||
SSTRecord record =
|
SSTRecord record =
|
||||||
new SSTRecord(LittleEndian.getShort(testdata, 0),
|
new SSTRecord( LittleEndian.getShort( testdata, 0 ),
|
||||||
LittleEndian.getShort(testdata, 2), input);
|
LittleEndian.getShort( testdata, 2 ), input );
|
||||||
byte[] continueRecord = readTestData("BigSSTRecordCR");
|
byte[] continueRecord = readTestData( "BigSSTRecordCR" );
|
||||||
|
|
||||||
input = new byte[ continueRecord.length - 4 ];
|
input = new byte[continueRecord.length - 4];
|
||||||
System.arraycopy(continueRecord, 4, input, 0, input.length);
|
System.arraycopy( continueRecord, 4, input, 0, input.length );
|
||||||
record.processContinueRecord(input);
|
record.processContinueRecord( input );
|
||||||
assertEquals(1464, record.getNumStrings());
|
assertEquals( 1464, record.getNumStrings() );
|
||||||
assertEquals(688, record.getNumUniqueStrings());
|
assertEquals( 688, record.getNumUniqueStrings() );
|
||||||
assertEquals(688, record.countStrings());
|
assertEquals( 688, record.countStrings() );
|
||||||
byte[] ser_output = record.serialize();
|
byte[] ser_output = record.serialize();
|
||||||
int offset = 0;
|
int offset = 0;
|
||||||
short type = LittleEndian.getShort(ser_output, offset);
|
short type = LittleEndian.getShort( ser_output, offset );
|
||||||
|
|
||||||
offset += LittleEndianConsts.SHORT_SIZE;
|
offset += LittleEndianConsts.SHORT_SIZE;
|
||||||
short length = LittleEndian.getShort(ser_output, offset);
|
short length = LittleEndian.getShort( ser_output, offset );
|
||||||
|
|
||||||
offset += LittleEndianConsts.SHORT_SIZE;
|
offset += LittleEndianConsts.SHORT_SIZE;
|
||||||
byte[] recordData = new byte[ length ];
|
byte[] recordData = new byte[length];
|
||||||
|
|
||||||
System.arraycopy(ser_output, offset, recordData, 0, length);
|
System.arraycopy( ser_output, offset, recordData, 0, length );
|
||||||
offset += length;
|
offset += length;
|
||||||
SSTRecord testRecord = new SSTRecord(type, length, recordData);
|
SSTRecord testRecord = new SSTRecord( type, length, recordData );
|
||||||
|
|
||||||
assertEquals(ContinueRecord.sid,
|
assertEquals( ContinueRecord.sid,
|
||||||
LittleEndian.getShort(ser_output, offset));
|
LittleEndian.getShort( ser_output, offset ) );
|
||||||
offset += LittleEndianConsts.SHORT_SIZE;
|
offset += LittleEndianConsts.SHORT_SIZE;
|
||||||
length = LittleEndian.getShort(ser_output, offset);
|
length = LittleEndian.getShort( ser_output, offset );
|
||||||
offset += LittleEndianConsts.SHORT_SIZE;
|
offset += LittleEndianConsts.SHORT_SIZE;
|
||||||
byte[] cr = new byte[ length ];
|
byte[] cr = new byte[length];
|
||||||
|
|
||||||
System.arraycopy(ser_output, offset, cr, 0, length);
|
System.arraycopy( ser_output, offset, cr, 0, length );
|
||||||
offset += length;
|
offset += length;
|
||||||
assertEquals(offset, ser_output.length);
|
assertEquals( offset, ser_output.length );
|
||||||
testRecord.processContinueRecord(cr);
|
testRecord.processContinueRecord( cr );
|
||||||
assertEquals(record, testRecord);
|
assertEquals( record, testRecord );
|
||||||
|
|
||||||
// testing based on new bug report
|
// testing based on new bug report
|
||||||
testdata = readTestData("BigSSTRecord2");
|
testdata = readTestData( "BigSSTRecord2" );
|
||||||
input = new byte[ testdata.length - 4 ];
|
input = new byte[testdata.length - 4];
|
||||||
System.arraycopy(testdata, 4, input, 0, input.length);
|
System.arraycopy( testdata, 4, input, 0, input.length );
|
||||||
record = new SSTRecord(LittleEndian.getShort(testdata, 0),
|
record = new SSTRecord( LittleEndian.getShort( testdata, 0 ),
|
||||||
LittleEndian.getShort(testdata, 2), input);
|
LittleEndian.getShort( testdata, 2 ), input );
|
||||||
byte[] continueRecord1 = readTestData("BigSSTRecord2CR1");
|
byte[] continueRecord1 = readTestData( "BigSSTRecord2CR1" );
|
||||||
|
|
||||||
input = new byte[ continueRecord1.length - 4 ];
|
input = new byte[continueRecord1.length - 4];
|
||||||
System.arraycopy(continueRecord1, 4, input, 0, input.length);
|
System.arraycopy( continueRecord1, 4, input, 0, input.length );
|
||||||
record.processContinueRecord(input);
|
record.processContinueRecord( input );
|
||||||
byte[] continueRecord2 = readTestData("BigSSTRecord2CR2");
|
byte[] continueRecord2 = readTestData( "BigSSTRecord2CR2" );
|
||||||
|
|
||||||
input = new byte[ continueRecord2.length - 4 ];
|
input = new byte[continueRecord2.length - 4];
|
||||||
System.arraycopy(continueRecord2, 4, input, 0, input.length);
|
System.arraycopy( continueRecord2, 4, input, 0, input.length );
|
||||||
record.processContinueRecord(input);
|
record.processContinueRecord( input );
|
||||||
byte[] continueRecord3 = readTestData("BigSSTRecord2CR3");
|
byte[] continueRecord3 = readTestData( "BigSSTRecord2CR3" );
|
||||||
|
|
||||||
input = new byte[ continueRecord3.length - 4 ];
|
input = new byte[continueRecord3.length - 4];
|
||||||
System.arraycopy(continueRecord3, 4, input, 0, input.length);
|
System.arraycopy( continueRecord3, 4, input, 0, input.length );
|
||||||
record.processContinueRecord(input);
|
record.processContinueRecord( input );
|
||||||
byte[] continueRecord4 = readTestData("BigSSTRecord2CR4");
|
byte[] continueRecord4 = readTestData( "BigSSTRecord2CR4" );
|
||||||
|
|
||||||
input = new byte[ continueRecord4.length - 4 ];
|
input = new byte[continueRecord4.length - 4];
|
||||||
System.arraycopy(continueRecord4, 4, input, 0, input.length);
|
System.arraycopy( continueRecord4, 4, input, 0, input.length );
|
||||||
record.processContinueRecord(input);
|
record.processContinueRecord( input );
|
||||||
byte[] continueRecord5 = readTestData("BigSSTRecord2CR5");
|
byte[] continueRecord5 = readTestData( "BigSSTRecord2CR5" );
|
||||||
|
|
||||||
input = new byte[ continueRecord5.length - 4 ];
|
input = new byte[continueRecord5.length - 4];
|
||||||
System.arraycopy(continueRecord5, 4, input, 0, input.length);
|
System.arraycopy( continueRecord5, 4, input, 0, input.length );
|
||||||
record.processContinueRecord(input);
|
record.processContinueRecord( input );
|
||||||
byte[] continueRecord6 = readTestData("BigSSTRecord2CR6");
|
byte[] continueRecord6 = readTestData( "BigSSTRecord2CR6" );
|
||||||
|
|
||||||
input = new byte[ continueRecord6.length - 4 ];
|
input = new byte[continueRecord6.length - 4];
|
||||||
System.arraycopy(continueRecord6, 4, input, 0, input.length);
|
System.arraycopy( continueRecord6, 4, input, 0, input.length );
|
||||||
record.processContinueRecord(input);
|
record.processContinueRecord( input );
|
||||||
byte[] continueRecord7 = readTestData("BigSSTRecord2CR7");
|
byte[] continueRecord7 = readTestData( "BigSSTRecord2CR7" );
|
||||||
|
|
||||||
input = new byte[ continueRecord7.length - 4 ];
|
input = new byte[continueRecord7.length - 4];
|
||||||
System.arraycopy(continueRecord7, 4, input, 0, input.length);
|
System.arraycopy( continueRecord7, 4, input, 0, input.length );
|
||||||
record.processContinueRecord(input);
|
record.processContinueRecord( input );
|
||||||
assertEquals(158642, record.getNumStrings());
|
assertEquals( 158642, record.getNumStrings() );
|
||||||
assertEquals(5249, record.getNumUniqueStrings());
|
assertEquals( 5249, record.getNumUniqueStrings() );
|
||||||
assertEquals(5249, record.countStrings());
|
assertEquals( 5249, record.countStrings() );
|
||||||
ser_output = record.serialize();
|
ser_output = record.serialize();
|
||||||
offset = 0;
|
offset = 0;
|
||||||
type = LittleEndian.getShort(ser_output, offset);
|
type = LittleEndian.getShort( ser_output, offset );
|
||||||
offset += LittleEndianConsts.SHORT_SIZE;
|
offset += LittleEndianConsts.SHORT_SIZE;
|
||||||
length = LittleEndian.getShort(ser_output, offset);
|
length = LittleEndian.getShort( ser_output, offset );
|
||||||
offset += LittleEndianConsts.SHORT_SIZE;
|
offset += LittleEndianConsts.SHORT_SIZE;
|
||||||
recordData = new byte[ length ];
|
recordData = new byte[length];
|
||||||
System.arraycopy(ser_output, offset, recordData, 0, length);
|
System.arraycopy( ser_output, offset, recordData, 0, length );
|
||||||
offset += length;
|
offset += length;
|
||||||
testRecord = new SSTRecord(type, length, recordData);
|
testRecord = new SSTRecord( type, length, recordData );
|
||||||
for (int count = 0; count < 7; count++)
|
for ( int count = 0; count < 7; count++ )
|
||||||
{
|
{
|
||||||
assertEquals(ContinueRecord.sid,
|
assertEquals( ContinueRecord.sid,
|
||||||
LittleEndian.getShort(ser_output, offset));
|
LittleEndian.getShort( ser_output, offset ) );
|
||||||
offset += LittleEndianConsts.SHORT_SIZE;
|
offset += LittleEndianConsts.SHORT_SIZE;
|
||||||
length = LittleEndian.getShort(ser_output, offset);
|
length = LittleEndian.getShort( ser_output, offset );
|
||||||
offset += LittleEndianConsts.SHORT_SIZE;
|
offset += LittleEndianConsts.SHORT_SIZE;
|
||||||
cr = new byte[ length ];
|
cr = new byte[length];
|
||||||
System.arraycopy(ser_output, offset, cr, 0, length);
|
System.arraycopy( ser_output, offset, cr, 0, length );
|
||||||
testRecord.processContinueRecord(cr);
|
testRecord.processContinueRecord( cr );
|
||||||
offset += length;
|
offset += length;
|
||||||
}
|
}
|
||||||
assertEquals(offset, ser_output.length);
|
assertEquals( offset, ser_output.length );
|
||||||
assertEquals(record, testRecord);
|
assertEquals( record, testRecord );
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
@ -214,23 +217,23 @@ public class TestSSTRecord
|
|||||||
*/
|
*/
|
||||||
|
|
||||||
public void testHugeStrings()
|
public void testHugeStrings()
|
||||||
throws IOException
|
throws IOException
|
||||||
{
|
{
|
||||||
SSTRecord record = new SSTRecord();
|
SSTRecord record = new SSTRecord();
|
||||||
byte[][] bstrings =
|
byte[][] bstrings =
|
||||||
{
|
{
|
||||||
new byte[ 9000 ], new byte[ 7433 ], new byte[ 9002 ],
|
new byte[9000], new byte[7433], new byte[9002],
|
||||||
new byte[ 16998 ]
|
new byte[16998]
|
||||||
};
|
};
|
||||||
String[] strings = new String[ bstrings.length ];
|
String[] strings = new String[bstrings.length];
|
||||||
int total_length = 0;
|
int total_length = 0;
|
||||||
|
|
||||||
for (int k = 0; k < bstrings.length; k++)
|
for ( int k = 0; k < bstrings.length; k++ )
|
||||||
{
|
{
|
||||||
Arrays.fill(bstrings[ k ], ( byte ) ('a' + k));
|
Arrays.fill( bstrings[k], (byte) ( 'a' + k ) );
|
||||||
strings[ k ] = new String(bstrings[ k ]);
|
strings[k] = new String( bstrings[k] );
|
||||||
record.addString(strings[ k ]);
|
record.addString( strings[k] );
|
||||||
total_length += 3 + bstrings[ k ].length;
|
total_length += 3 + bstrings[k].length;
|
||||||
}
|
}
|
||||||
|
|
||||||
// add overhead of SST record
|
// add overhead of SST record
|
||||||
@ -240,88 +243,88 @@ public class TestSSTRecord
|
|||||||
total_length += 4;
|
total_length += 4;
|
||||||
|
|
||||||
// add overhead of six records
|
// add overhead of six records
|
||||||
total_length += (6 * 4);
|
total_length += ( 6 * 4 );
|
||||||
byte[] content = new byte[ record.getRecordSize() ];
|
byte[] content = new byte[record.getRecordSize()];
|
||||||
|
|
||||||
record.serialize(0, content);
|
record.serialize( 0, content );
|
||||||
assertEquals(total_length, content.length);
|
assertEquals( total_length, content.length );
|
||||||
for (int index = 0; index != content.length; )
|
for ( int index = 0; index != content.length; )
|
||||||
{
|
{
|
||||||
short record_type = LittleEndian.getShort(content, index);
|
short record_type = LittleEndian.getShort( content, index );
|
||||||
|
|
||||||
index += LittleEndianConsts.SHORT_SIZE;
|
index += LittleEndianConsts.SHORT_SIZE;
|
||||||
short record_length = LittleEndian.getShort(content, index);
|
short record_length = LittleEndian.getShort( content, index );
|
||||||
|
|
||||||
index += LittleEndianConsts.SHORT_SIZE;
|
index += LittleEndianConsts.SHORT_SIZE;
|
||||||
byte[] data = new byte[ record_length ];
|
byte[] data = new byte[record_length];
|
||||||
|
|
||||||
System.arraycopy(content, index, data, 0, record_length);
|
System.arraycopy( content, index, data, 0, record_length );
|
||||||
index += record_length;
|
index += record_length;
|
||||||
if (record_type == SSTRecord.sid)
|
if ( record_type == SSTRecord.sid )
|
||||||
{
|
{
|
||||||
record = new SSTRecord(record_type, record_length, data);
|
record = new SSTRecord( record_type, record_length, data );
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
record.processContinueRecord(data);
|
record.processContinueRecord( data );
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
assertEquals(strings.length, record.getNumStrings());
|
assertEquals( strings.length, record.getNumStrings() );
|
||||||
assertEquals(strings.length, record.getNumUniqueStrings());
|
assertEquals( strings.length, record.getNumUniqueStrings() );
|
||||||
assertEquals(strings.length, record.countStrings());
|
assertEquals( strings.length, record.countStrings() );
|
||||||
for (int k = 0; k < strings.length; k++)
|
for ( int k = 0; k < strings.length; k++ )
|
||||||
{
|
{
|
||||||
assertEquals(strings[ k ], record.getString(k));
|
assertEquals( strings[k], record.getString( k ) );
|
||||||
}
|
}
|
||||||
record = new SSTRecord();
|
record = new SSTRecord();
|
||||||
bstrings[ 1 ] = new byte[ bstrings[ 1 ].length - 1 ];
|
bstrings[1] = new byte[bstrings[1].length - 1];
|
||||||
for (int k = 0; k < bstrings.length; k++)
|
for ( int k = 0; k < bstrings.length; k++ )
|
||||||
{
|
{
|
||||||
if ((bstrings[ k ].length % 2) == 1)
|
if ( ( bstrings[k].length % 2 ) == 1 )
|
||||||
{
|
{
|
||||||
Arrays.fill(bstrings[ k ], ( byte ) ('a' + k));
|
Arrays.fill( bstrings[k], (byte) ( 'a' + k ) );
|
||||||
strings[ k ] = new String(bstrings[ k ]);
|
strings[k] = new String( bstrings[k] );
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
char[] data = new char[ bstrings[ k ].length / 2 ];
|
char[] data = new char[bstrings[k].length / 2];
|
||||||
|
|
||||||
Arrays.fill(data, ( char ) ('\u2122' + k));
|
Arrays.fill( data, (char) ( '\u2122' + k ) );
|
||||||
strings[ k ] = new String(data);
|
strings[k] = new String( data );
|
||||||
}
|
}
|
||||||
record.addString(strings[ k ]);
|
record.addString( strings[k] );
|
||||||
}
|
}
|
||||||
content = new byte[ record.getRecordSize() ];
|
content = new byte[record.getRecordSize()];
|
||||||
record.serialize(0, content);
|
record.serialize( 0, content );
|
||||||
total_length--;
|
total_length--;
|
||||||
assertEquals(total_length, content.length);
|
assertEquals( total_length, content.length );
|
||||||
for (int index = 0; index != content.length; )
|
for ( int index = 0; index != content.length; )
|
||||||
{
|
{
|
||||||
short record_type = LittleEndian.getShort(content, index);
|
short record_type = LittleEndian.getShort( content, index );
|
||||||
|
|
||||||
index += LittleEndianConsts.SHORT_SIZE;
|
index += LittleEndianConsts.SHORT_SIZE;
|
||||||
short record_length = LittleEndian.getShort(content, index);
|
short record_length = LittleEndian.getShort( content, index );
|
||||||
|
|
||||||
index += LittleEndianConsts.SHORT_SIZE;
|
index += LittleEndianConsts.SHORT_SIZE;
|
||||||
byte[] data = new byte[ record_length ];
|
byte[] data = new byte[record_length];
|
||||||
|
|
||||||
System.arraycopy(content, index, data, 0, record_length);
|
System.arraycopy( content, index, data, 0, record_length );
|
||||||
index += record_length;
|
index += record_length;
|
||||||
if (record_type == SSTRecord.sid)
|
if ( record_type == SSTRecord.sid )
|
||||||
{
|
{
|
||||||
record = new SSTRecord(record_type, record_length, data);
|
record = new SSTRecord( record_type, record_length, data );
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
record.processContinueRecord(data);
|
record.processContinueRecord( data );
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
assertEquals(strings.length, record.getNumStrings());
|
assertEquals( strings.length, record.getNumStrings() );
|
||||||
assertEquals(strings.length, record.getNumUniqueStrings());
|
assertEquals( strings.length, record.getNumUniqueStrings() );
|
||||||
assertEquals(strings.length, record.countStrings());
|
assertEquals( strings.length, record.countStrings() );
|
||||||
for (int k = 0; k < strings.length; k++)
|
for ( int k = 0; k < strings.length; k++ )
|
||||||
{
|
{
|
||||||
assertEquals(strings[ k ], record.getString(k));
|
assertEquals( strings[k], record.getString( k ) );
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -332,7 +335,7 @@ public class TestSSTRecord
|
|||||||
*/
|
*/
|
||||||
|
|
||||||
public void testSSTRecordBug()
|
public void testSSTRecordBug()
|
||||||
throws IOException
|
throws IOException
|
||||||
{
|
{
|
||||||
|
|
||||||
// create an SSTRecord and write a certain pattern of strings
|
// create an SSTRecord and write a certain pattern of strings
|
||||||
@ -342,22 +345,22 @@ public class TestSSTRecord
|
|||||||
// the record will start with two integers, then this string
|
// the record will start with two integers, then this string
|
||||||
// ... that will eat up 16 of the 8224 bytes that the record
|
// ... that will eat up 16 of the 8224 bytes that the record
|
||||||
// can hold
|
// can hold
|
||||||
record.addString("Hello");
|
record.addString( "Hello" );
|
||||||
|
|
||||||
// now we have an additional 8208 bytes, which is an exact
|
// now we have an additional 8208 bytes, which is an exact
|
||||||
// multiple of 16 bytes
|
// multiple of 16 bytes
|
||||||
long testvalue = 1000000000000L;
|
long testvalue = 1000000000000L;
|
||||||
|
|
||||||
for (int k = 0; k < 2000; k++)
|
for ( int k = 0; k < 2000; k++ )
|
||||||
{
|
{
|
||||||
record.addString(String.valueOf(testvalue++));
|
record.addString( String.valueOf( testvalue++ ) );
|
||||||
}
|
}
|
||||||
byte[] content = new byte[ record.getRecordSize() ];
|
byte[] content = new byte[record.getRecordSize()];
|
||||||
|
|
||||||
record.serialize(0, content);
|
record.serialize( 0, content );
|
||||||
assertEquals(( byte ) 13, content[ 4 + 8228 ]);
|
assertEquals( (byte) 13, content[4 + 8228] );
|
||||||
assertEquals(( byte ) 13, content[ 4 + 8228 * 2 ]);
|
assertEquals( (byte) 13, content[4 + 8228 * 2] );
|
||||||
assertEquals(( byte ) 13, content[ 4 + 8228 * 3 ]);
|
assertEquals( (byte) 13, content[4 + 8228 * 3] );
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
@ -367,43 +370,43 @@ public class TestSSTRecord
|
|||||||
public void testSimpleAddString()
|
public void testSimpleAddString()
|
||||||
{
|
{
|
||||||
SSTRecord record = new SSTRecord();
|
SSTRecord record = new SSTRecord();
|
||||||
String s1 = "Hello world";
|
String s1 = "Hello world";
|
||||||
|
|
||||||
// \u2122 is the encoding of the trademark symbol ...
|
// \u2122 is the encoding of the trademark symbol ...
|
||||||
String s2 = "Hello world\u2122";
|
String s2 = "Hello world\u2122";
|
||||||
|
|
||||||
assertEquals(0, record.addString(s1));
|
assertEquals( 0, record.addString( s1 ) );
|
||||||
assertEquals(s1, record.getString(0));
|
assertEquals( s1, record.getString( 0 ) );
|
||||||
assertEquals(1, record.countStrings());
|
assertEquals( 1, record.countStrings() );
|
||||||
assertEquals(1, record.getNumStrings());
|
assertEquals( 1, record.getNumStrings() );
|
||||||
assertEquals(1, record.getNumUniqueStrings());
|
assertEquals( 1, record.getNumUniqueStrings() );
|
||||||
assertEquals(0, record.addString(s1));
|
assertEquals( 0, record.addString( s1 ) );
|
||||||
assertEquals(s1, record.getString(0));
|
assertEquals( s1, record.getString( 0 ) );
|
||||||
assertEquals(1, record.countStrings());
|
assertEquals( 1, record.countStrings() );
|
||||||
assertEquals(2, record.getNumStrings());
|
assertEquals( 2, record.getNumStrings() );
|
||||||
assertEquals(1, record.getNumUniqueStrings());
|
assertEquals( 1, record.getNumUniqueStrings() );
|
||||||
assertEquals(1, record.addString(s2));
|
assertEquals( 1, record.addString( s2 ) );
|
||||||
assertEquals(s2, record.getString(1));
|
assertEquals( s2, record.getString( 1 ) );
|
||||||
assertEquals(2, record.countStrings());
|
assertEquals( 2, record.countStrings() );
|
||||||
assertEquals(3, record.getNumStrings());
|
assertEquals( 3, record.getNumStrings() );
|
||||||
assertEquals(2, record.getNumUniqueStrings());
|
assertEquals( 2, record.getNumUniqueStrings() );
|
||||||
Iterator iter = record.getStrings();
|
Iterator iter = record.getStrings();
|
||||||
|
|
||||||
while (iter.hasNext())
|
while ( iter.hasNext() )
|
||||||
{
|
{
|
||||||
UnicodeString ucs = ( UnicodeString ) iter.next();
|
UnicodeString ucs = (UnicodeString) iter.next();
|
||||||
|
|
||||||
if (ucs.getString().equals(s1))
|
if ( ucs.getString().equals( s1 ) )
|
||||||
{
|
{
|
||||||
assertEquals(( byte ) 0, ucs.getOptionFlags());
|
assertEquals( (byte) 0, ucs.getOptionFlags() );
|
||||||
}
|
}
|
||||||
else if (ucs.getString().equals(s2))
|
else if ( ucs.getString().equals( s2 ) )
|
||||||
{
|
{
|
||||||
assertEquals(( byte ) 1, ucs.getOptionFlags());
|
assertEquals( (byte) 1, ucs.getOptionFlags() );
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
fail("cannot match string: " + ucs.getString());
|
fail( "cannot match string: " + ucs.getString() );
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@ -415,25 +418,25 @@ public class TestSSTRecord
|
|||||||
*/
|
*/
|
||||||
|
|
||||||
public void testReaderConstructor()
|
public void testReaderConstructor()
|
||||||
throws IOException
|
throws IOException
|
||||||
{
|
{
|
||||||
byte[] testdata = readTestData("BigSSTRecord");
|
byte[] testdata = readTestData( "BigSSTRecord" );
|
||||||
byte[] input = new byte[ testdata.length - 4 ];
|
byte[] input = new byte[testdata.length - 4];
|
||||||
|
|
||||||
System.arraycopy(testdata, 4, input, 0, input.length);
|
System.arraycopy( testdata, 4, input, 0, input.length );
|
||||||
SSTRecord record = new SSTRecord(LittleEndian.getShort(testdata, 0),
|
SSTRecord record = new SSTRecord( LittleEndian.getShort( testdata, 0 ),
|
||||||
LittleEndian.getShort(testdata, 2),
|
LittleEndian.getShort( testdata, 2 ),
|
||||||
input);
|
input );
|
||||||
|
|
||||||
assertEquals(1464, record.getNumStrings());
|
assertEquals( 1464, record.getNumStrings() );
|
||||||
assertEquals(688, record.getNumUniqueStrings());
|
assertEquals( 688, record.getNumUniqueStrings() );
|
||||||
assertEquals(492, record.countStrings());
|
assertEquals( 492, record.countStrings() );
|
||||||
assertEquals(1, record.getExpectedChars());
|
assertEquals( 1, record.getDeserializer().getExpectedChars() );
|
||||||
assertEquals("Consolidated B-24J Liberator The Dragon & His Tai",
|
assertEquals( "Consolidated B-24J Liberator The Dragon & His Tai",
|
||||||
record.getUnfinishedString());
|
record.getDeserializer().getUnfinishedString() );
|
||||||
assertEquals(52, record.getTotalLength());
|
assertEquals( 52, record.getDeserializer().getTotalLength() );
|
||||||
assertEquals(3, record.getStringDataOffset());
|
assertEquals( 3, record.getDeserializer().getStringDataOffset() );
|
||||||
assertTrue(!record.isWideChar());
|
assertTrue( !record.getDeserializer().isWideChar() );
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
@ -444,26 +447,26 @@ public class TestSSTRecord
|
|||||||
{
|
{
|
||||||
SSTRecord record = new SSTRecord();
|
SSTRecord record = new SSTRecord();
|
||||||
|
|
||||||
assertEquals(0, record.getNumStrings());
|
assertEquals( 0, record.getNumStrings() );
|
||||||
assertEquals(0, record.getNumUniqueStrings());
|
assertEquals( 0, record.getNumUniqueStrings() );
|
||||||
assertEquals(0, record.countStrings());
|
assertEquals( 0, record.countStrings() );
|
||||||
assertEquals(0, record.getExpectedChars());
|
assertEquals( 0, record.getDeserializer().getExpectedChars() );
|
||||||
assertEquals("", record.getUnfinishedString());
|
assertEquals( "", record.getDeserializer().getUnfinishedString() );
|
||||||
assertEquals(0, record.getTotalLength());
|
assertEquals( 0, record.getDeserializer().getTotalLength() );
|
||||||
assertEquals(0, record.getStringDataOffset());
|
assertEquals( 0, record.getDeserializer().getStringDataOffset() );
|
||||||
assertTrue(!record.isWideChar());
|
assertTrue( !record.getDeserializer().isWideChar() );
|
||||||
byte[] output = record.serialize();
|
byte[] output = record.serialize();
|
||||||
byte[] expected =
|
byte[] expected =
|
||||||
{
|
{
|
||||||
( byte ) record.getSid(), ( byte ) (record.getSid() >> 8),
|
(byte) record.getSid(), (byte) ( record.getSid() >> 8 ),
|
||||||
( byte ) 8, ( byte ) 0, ( byte ) 0, ( byte ) 0, ( byte ) 0,
|
(byte) 8, (byte) 0, (byte) 0, (byte) 0, (byte) 0,
|
||||||
( byte ) 0, ( byte ) 0, ( byte ) 0, ( byte ) 0, ( byte ) 0
|
(byte) 0, (byte) 0, (byte) 0, (byte) 0, (byte) 0
|
||||||
};
|
};
|
||||||
|
|
||||||
assertEquals(expected.length, output.length);
|
assertEquals( expected.length, output.length );
|
||||||
for (int k = 0; k < expected.length; k++)
|
for ( int k = 0; k < expected.length; k++ )
|
||||||
{
|
{
|
||||||
assertEquals(String.valueOf(k), expected[ k ], output[ k ]);
|
assertEquals( String.valueOf( k ), expected[k], output[k] );
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -473,87 +476,87 @@ public class TestSSTRecord
|
|||||||
* @param ignored_args
|
* @param ignored_args
|
||||||
*/
|
*/
|
||||||
|
|
||||||
public static void main(String [] ignored_args)
|
public static void main( String[] ignored_args )
|
||||||
{
|
{
|
||||||
System.out.println("Testing hssf.record.SSTRecord functionality");
|
System.out.println( "Testing hssf.record.SSTRecord functionality" );
|
||||||
junit.textui.TestRunner.run(TestSSTRecord.class);
|
junit.textui.TestRunner.run( TestSSTRecord.class );
|
||||||
}
|
}
|
||||||
|
|
||||||
private byte [] readTestData(String filename)
|
private byte[] readTestData( String filename )
|
||||||
throws IOException
|
throws IOException
|
||||||
{
|
{
|
||||||
File file = new File(_test_file_path
|
File file = new File( _test_file_path
|
||||||
+ File.separator
|
+ File.separator
|
||||||
+ filename);
|
+ filename );
|
||||||
FileInputStream stream = new FileInputStream(file);
|
FileInputStream stream = new FileInputStream( file );
|
||||||
int characterCount = 0;
|
int characterCount = 0;
|
||||||
byte b = ( byte ) 0;
|
byte b = (byte) 0;
|
||||||
List bytes = new ArrayList();
|
List bytes = new ArrayList();
|
||||||
boolean done = false;
|
boolean done = false;
|
||||||
|
|
||||||
while (!done)
|
while ( !done )
|
||||||
{
|
{
|
||||||
int count = stream.read();
|
int count = stream.read();
|
||||||
|
|
||||||
switch (count)
|
switch ( count )
|
||||||
{
|
{
|
||||||
|
|
||||||
case '0' :
|
case '0':
|
||||||
case '1' :
|
case '1':
|
||||||
case '2' :
|
case '2':
|
||||||
case '3' :
|
case '3':
|
||||||
case '4' :
|
case '4':
|
||||||
case '5' :
|
case '5':
|
||||||
case '6' :
|
case '6':
|
||||||
case '7' :
|
case '7':
|
||||||
case '8' :
|
case '8':
|
||||||
case '9' :
|
case '9':
|
||||||
b <<= 4;
|
b <<= 4;
|
||||||
b += ( byte ) (count - '0');
|
b += (byte) ( count - '0' );
|
||||||
characterCount++;
|
characterCount++;
|
||||||
if (characterCount == 2)
|
if ( characterCount == 2 )
|
||||||
{
|
{
|
||||||
bytes.add(new Byte(b));
|
bytes.add( new Byte( b ) );
|
||||||
characterCount = 0;
|
characterCount = 0;
|
||||||
b = ( byte ) 0;
|
b = (byte) 0;
|
||||||
}
|
}
|
||||||
break;
|
break;
|
||||||
|
|
||||||
case 'A' :
|
case 'A':
|
||||||
case 'B' :
|
case 'B':
|
||||||
case 'C' :
|
case 'C':
|
||||||
case 'D' :
|
case 'D':
|
||||||
case 'E' :
|
case 'E':
|
||||||
case 'F' :
|
case 'F':
|
||||||
b <<= 4;
|
b <<= 4;
|
||||||
b += ( byte ) (count + 10 - 'A');
|
b += (byte) ( count + 10 - 'A' );
|
||||||
characterCount++;
|
characterCount++;
|
||||||
if (characterCount == 2)
|
if ( characterCount == 2 )
|
||||||
{
|
{
|
||||||
bytes.add(new Byte(b));
|
bytes.add( new Byte( b ) );
|
||||||
characterCount = 0;
|
characterCount = 0;
|
||||||
b = ( byte ) 0;
|
b = (byte) 0;
|
||||||
}
|
}
|
||||||
break;
|
break;
|
||||||
|
|
||||||
case 'a' :
|
case 'a':
|
||||||
case 'b' :
|
case 'b':
|
||||||
case 'c' :
|
case 'c':
|
||||||
case 'd' :
|
case 'd':
|
||||||
case 'e' :
|
case 'e':
|
||||||
case 'f' :
|
case 'f':
|
||||||
b <<= 4;
|
b <<= 4;
|
||||||
b += ( byte ) (count + 10 - 'a');
|
b += (byte) ( count + 10 - 'a' );
|
||||||
characterCount++;
|
characterCount++;
|
||||||
if (characterCount == 2)
|
if ( characterCount == 2 )
|
||||||
{
|
{
|
||||||
bytes.add(new Byte(b));
|
bytes.add( new Byte( b ) );
|
||||||
characterCount = 0;
|
characterCount = 0;
|
||||||
b = ( byte ) 0;
|
b = (byte) 0;
|
||||||
}
|
}
|
||||||
break;
|
break;
|
||||||
|
|
||||||
case -1 :
|
case -1:
|
||||||
done = true;
|
done = true;
|
||||||
break;
|
break;
|
||||||
|
|
||||||
@ -562,13 +565,55 @@ public class TestSSTRecord
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
stream.close();
|
stream.close();
|
||||||
Byte[] polished = ( Byte [] ) bytes.toArray(new Byte[ 0 ]);
|
Byte[] polished = (Byte[]) bytes.toArray( new Byte[0] );
|
||||||
byte[] rval = new byte[ polished.length ];
|
byte[] rval = new byte[polished.length];
|
||||||
|
|
||||||
for (int j = 0; j < polished.length; j++)
|
for ( int j = 0; j < polished.length; j++ )
|
||||||
{
|
{
|
||||||
rval[ j ] = polished[ j ].byteValue();
|
rval[j] = polished[j].byteValue();
|
||||||
}
|
}
|
||||||
return rval;
|
return rval;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Tests that workbooks with rich text that duplicates a non rich text cell can be read and written.
|
||||||
|
*/
|
||||||
|
public void testReadWriteDuplicatedRichText1()
|
||||||
|
throws Exception
|
||||||
|
{
|
||||||
|
File file = new File( _test_file_path + File.separator + "duprich1.xls" );
|
||||||
|
InputStream stream = new FileInputStream(file);
|
||||||
|
HSSFWorkbook wb = new HSSFWorkbook(stream);
|
||||||
|
stream.close();
|
||||||
|
HSSFSheet sheet = wb.getSheetAt(1);
|
||||||
|
assertEquals("01/05 (Wed) ", sheet.getRow(0).getCell((short)8).getStringCellValue());
|
||||||
|
assertEquals("01/05 (Wed)", sheet.getRow(1).getCell((short)8).getStringCellValue());
|
||||||
|
|
||||||
|
file = File.createTempFile("testout", "xls");
|
||||||
|
FileOutputStream outStream = new FileOutputStream(file);
|
||||||
|
wb.write(outStream);
|
||||||
|
outStream.close();
|
||||||
|
file.delete();
|
||||||
|
|
||||||
|
// test the second file.
|
||||||
|
file = new File( _test_file_path + File.separator + "duprich2.xls" );
|
||||||
|
stream = new FileInputStream(file);
|
||||||
|
wb = new HSSFWorkbook(stream);
|
||||||
|
stream.close();
|
||||||
|
sheet = wb.getSheetAt(0);
|
||||||
|
int row = 0;
|
||||||
|
assertEquals("Testing ", sheet.getRow(row++).getCell((short)0).getStringCellValue());
|
||||||
|
assertEquals("rich", sheet.getRow(row++).getCell((short)0).getStringCellValue());
|
||||||
|
assertEquals("text", sheet.getRow(row++).getCell((short)0).getStringCellValue());
|
||||||
|
assertEquals("strings", sheet.getRow(row++).getCell((short)0).getStringCellValue());
|
||||||
|
assertEquals("Testing ", sheet.getRow(row++).getCell((short)0).getStringCellValue());
|
||||||
|
assertEquals("Testing", sheet.getRow(row++).getCell((short)0).getStringCellValue());
|
||||||
|
|
||||||
|
// file = new File("/tryme.xls");
|
||||||
|
file = File.createTempFile("testout", ".xls");
|
||||||
|
outStream = new FileOutputStream(file);
|
||||||
|
wb.write(outStream);
|
||||||
|
outStream.close();
|
||||||
|
file.delete();
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
@ -479,6 +479,12 @@ public class TestLittleEndian
|
|||||||
return result;
|
return result;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
public void testUnsignedShort()
|
||||||
|
throws Exception
|
||||||
|
{
|
||||||
|
assertEquals(0xffff, LittleEndian.getUShort(new byte[] { (byte)0xff, (byte)0xff }, 0));
|
||||||
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* main method to run the unit tests
|
* main method to run the unit tests
|
||||||
*
|
*
|
||||||
|
Loading…
Reference in New Issue
Block a user