mirrors/cdt
1
0
Fork 0
mirror of https://github.com/eclipse-cdt/cdt synced 2025-07-19 06:55:23 +02:00
Code Issues Wiki Activity

Cosmetics.

Browse source
This commit is contained in:
Sergey Prigogin 2010-03-14 01:24:55 +00:00
parent 68dea21be0
commit 80c40cd4d1
1 changed files with 10 additions and 10 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

20
core/org.eclipse.cdt.core/parser/org/eclipse/cdt/internal/core/parser/scanner/LazyCharArray.java
View file

@ -22,7 +22,7 @@ import java.util.List;
public abstract class LazyCharArray extends AbstractCharArray { public abstract class LazyCharArray extends AbstractCharArray {
private final static int CHUNK_BITS= 16; // 2^16 == 64K private final static int CHUNK_BITS= 16; // 2^16 == 64K
protected final static int CHUNK_SIZE= 1 << CHUNK_BITS; protected final static int CHUNK_SIZE= 1 << CHUNK_BITS;
protected static class Chunk { protected static class Chunk {
final int fDataLength; final int fDataLength;
final long fFileOffset; final long fFileOffset;
@ -36,7 +36,7 @@ public abstract class LazyCharArray extends AbstractCharArray {
fData= new SoftReference<char[]>(data); fData= new SoftReference<char[]>(data);
} }
} }
private int fLength= -1; private int fLength= -1;
private List<Chunk> fChunks= new ArrayList<Chunk>(); private List<Chunk> fChunks= new ArrayList<Chunk>();
private StreamHasher hasher; private StreamHasher hasher;
@ -65,7 +65,7 @@ public abstract class LazyCharArray extends AbstractCharArray {
readUpTo(offset); readUpTo(offset);
if (fLength >= 0) if (fLength >= 0)
return offset < fLength; return offset < fLength;
assert offset < fChunks.size() << CHUNK_BITS; assert offset < fChunks.size() << CHUNK_BITS;
return true; return true;
} }
@ -83,7 +83,7 @@ public abstract class LazyCharArray extends AbstractCharArray {
private void readUpTo(int offset) { private void readUpTo(int offset) {
if (fLength >= 0) if (fLength >= 0)
return; return;
final int chunkOffset= offset >> CHUNK_BITS; final int chunkOffset= offset >> CHUNK_BITS;
getChunkData(chunkOffset); getChunkData(chunkOffset);
} }
@ -108,14 +108,14 @@ public abstract class LazyCharArray extends AbstractCharArray {
System.arraycopy(data, loffset, destination, destinationPos, canCopy); System.arraycopy(data, loffset, destination, destinationPos, canCopy);
arraycopy(offset+canCopy, destination, destinationPos+canCopy, length-canCopy); arraycopy(offset+canCopy, destination, destinationPos+canCopy, length-canCopy);
} }
private char[] getChunkData(int chunkOffset) { private char[] getChunkData(int chunkOffset) {
Chunk chunk= getChunk(chunkOffset); Chunk chunk= getChunk(chunkOffset);
if (chunk != null) { if (chunk != null) {
char[] data= chunk.fData.get(); char[] data= chunk.fData.get();
if (data != null) if (data != null)
return data; return data;
return loadChunkData(chunk); return loadChunkData(chunk);
} }
return null; return null;
@ -125,13 +125,13 @@ public abstract class LazyCharArray extends AbstractCharArray {
final int chunkCount = fChunks.size(); final int chunkCount = fChunks.size();
if (chunkOffset < chunkCount) if (chunkOffset < chunkCount)
return fChunks.get(chunkOffset); return fChunks.get(chunkOffset);
if (fLength >=0) if (fLength >=0)
return null; return null;
return createChunk(chunkOffset); return createChunk(chunkOffset);
} }
/** /**
* Called when a chunk is requested for the first time. There is no * Called when a chunk is requested for the first time. There is no
* need to override this method. * need to override this method.
@ -183,7 +183,7 @@ public abstract class LazyCharArray extends AbstractCharArray {
* the source. * the source.
*/ */
protected abstract char[] readChunkData(long sourceOffset, long[] sourceEndOffsetHolder) throws Exception; protected abstract char[] readChunkData(long sourceOffset, long[] sourceEndOffsetHolder) throws Exception;
/** /**
* Read the chunk data at the given source range. In case the source range no longer (fully) exists, * Read the chunk data at the given source range. In case the source range no longer (fully) exists,
* read as much as possible. * read as much as possible.