Revision: 5872
http://jnode.svn.sourceforge.net/jnode/?rev=5872&view=rev
Author: galatnm
Date: 2011-12-09 15:48:02 +0000 (Fri, 09 Dec 2011)
Log Message:
-----------
Fix doc and method name.
Modified Paths:
--------------
trunk/fs/src/fs/org/jnode/fs/ntfs/CompressedDataRun.java
Modified: trunk/fs/src/fs/org/jnode/fs/ntfs/CompressedDataRun.java
===================================================================
--- trunk/fs/src/fs/org/jnode/fs/ntfs/CompressedDataRun.java 2011-12-09 15:38:49 UTC (rev 5871)
+++ trunk/fs/src/fs/org/jnode/fs/ntfs/CompressedDataRun.java 2011-12-09 15:48:02 UTC (rev 5872)
@@ -127,7 +127,7 @@
final byte[] tempUncompressed = new byte[compressionUnitSize * clusterSize];
// XXX: We could potentially reduce the overhead by modifying the compression
// routine such that it's capable of skipping chunks that aren't needed.
- uncompressUnit(tempCompressed, tempUncompressed);
+ unCompressUnit(tempCompressed, tempUncompressed);
System.arraycopy(tempUncompressed, vcnOffsetWithinUnit * clusterSize,
dst, dstOffset + (int) (actFirstVcn - vcn) * clusterSize,
@@ -141,10 +141,9 @@
*
* @param compressed the compressed data (in.)
* @param uncompressed the uncompressed data (out.)
- * @param requiredBytes the number of bytes needed before the read can stop.
* @throws IOException if the decompression fails.
*/
- private static void uncompressUnit(final byte[] compressed,
+ private static void unCompressUnit(final byte[] compressed,
final byte[] uncompressed) throws IOException {
// This is just a convenient way to simulate the original code's pointer arithmetic.
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|