All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.scudata.dm.MemoryFile Maven / Gradle / Ivy

Go to download

SPL(Structured Process Language) A programming language specially for structured data computing.

The newest version!
package com.scudata.dm;

import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.RandomAccessFile;

import com.scudata.common.IOUtils;
import com.scudata.common.RQException;

/**
 * ?ڴ??ļ?
 * @author WangXiaoJun
 *
 */
public class MemoryFile implements IFile {
	private final int blockSize = 1024 * 1024 * 64; // ???С
	
	private IFile file;
	private byte [][]blocks; // ??¼?ֽڹ??ɵĿ?????
	private int blockCount; // ????
	private long total; // ???ֽ???
	
	// ?ڴ??ļ???????
	private class MemoryFileInputStream extends InputStream {
		long pos; // ??ǰ???λ??
		int curBlockSeq; // ??ǰ?????Ӧ?Ŀ??
		int curBlockPos; // ??һ?ֽ???buffer?е?????
		
		private boolean nextBlock() {
			curBlockSeq++;
			curBlockPos = 0;
			return curBlockSeq < blockCount;
		}

		public int available() {
			long count = total - pos;
			if (count > Integer.MAX_VALUE) {
				return Integer.MAX_VALUE;
			} else {
				return (int)count;
			}
		}
		
		public void close() {
			//MemoryFile.this = null;
		}
		
		public int read() {
			if (pos >= total) return -1;
			
			if (curBlockPos >= blocks[curBlockSeq].length) {
				nextBlock();
			}

			pos++;
			return blocks[curBlockSeq][curBlockPos++] & 0xff;
		}
		
		public int read(byte b[]) {
			return read(b, 0, b.length);
		}
		
		public int read(byte b[], int off, int len) {
			if (pos >= total) return -1;
			
			int total = blocks[curBlockSeq].length - curBlockPos;
			if (total >= len) {
				System.arraycopy(blocks[curBlockSeq], curBlockPos, b, off, len);
				curBlockPos += len;
				pos += len;
				return len;
			} else {
				if (total != 0) {
					System.arraycopy(blocks[curBlockSeq], curBlockPos, b, off, total);
				}
				
				while (nextBlock()) {
					int rest = len - total;
					if (blocks[curBlockSeq].length >= rest) {
						System.arraycopy(blocks[curBlockSeq], 0, b, off + total, rest);
						curBlockPos = rest;
						pos += len;
						return len;
					} else {
						System.arraycopy(blocks[curBlockSeq], 0, b, off + total, blocks[curBlockSeq].length);
						total += blocks[curBlockSeq].length;
					}
				}

				pos += total;
				return total > 0 ? total : -1;
			}
		}
		
		public long skip(long n) {
			if (n < 1) return 0;
			if (pos >= total) return -1;
			
			long total = blocks[curBlockSeq].length - curBlockPos;
			if (total >= n) {
				curBlockPos += n;
				pos += n;
				return n;
			} else {
				for (++curBlockSeq; curBlockSeq < blocks.length; ++curBlockSeq) {
					long dif = n - total;
					if (dif <= blocks[curBlockSeq].length) {
						curBlockPos = (int)dif;
						pos += n;
						return n;
					} else {
						total += blocks[curBlockSeq].length;
					}
				}
				
				pos += total;
				return total;
			}
		}
	}
	
	/**
	 * ???ļ????ݹ????ڴ??ļ?
	 * @param blocks
	 */
	public MemoryFile(byte [][]blocks) {
		this.blocks = blocks;
		this.blockCount = blocks.length;
		for (byte [] block : blocks) {
			total += block.length;
		}
	}
	
	/**
	 * ???ļ????󹹽??ڴ??ļ?
	 * @param fo ?ļ?????
	 */
	public MemoryFile(FileObject fo) {
		this(fo.getFile());
	}
	
	/**
	 * ???ļ??????ڴ??ļ?
	 * @param file ?ļ?
	 */
	public MemoryFile(IFile file) {
		this.file = file;
		long size = file.size();
		if (size == 0) {
			blocks = new byte[0][];
			return;
		}
		
		total = size;
		blockCount = (int)(size / blockSize);
		int rest = (int)(size % blockSize);
		
		InputStream is = file.getInputStream();
		try {
			if (rest > 0) {
				blocks = new byte[blockCount + 1][];
				for (int i = 0; i < blockCount; ++i) {
					blocks[i] = new byte[blockSize];
					IOUtils.readFully(is, blocks[i]);
				}
				
				blocks[blockCount] = new byte[rest];
				IOUtils.readFully(is, blocks[blockCount]);
				blockCount++;
			} else {
				blocks = new byte[blockCount][];
				for (int i = 0; i < blockCount; ++i) {
					blocks[i] = new byte[blockSize];
					IOUtils.readFully(is, blocks[i]);
				}
			}
		} catch (IOException e) {
			throw new RQException(e.getMessage(), e);
		} finally {
			try {
				is.close();
			} catch (IOException e) {
			}
		}
	}
	
	public void setFileName(String fileName) {
	}
	
	/**
	 * ȡ??????
	 * @return InputStream
	 */
	public InputStream getInputStream() {
		return new MemoryFileInputStream();
	}
	
	public OutputStream getOutputStream(boolean isAppend) {
		throw new RuntimeException("nonsupport");
	}
	
	public RandomOutputStream getRandomOutputStream(boolean isAppend) {
		throw new RuntimeException("nonsupport");
	}
	
	public boolean exists() {
		return true;
	}
	
	public long size() {
		return total;
	}
	
	public long lastModified() {
		if (file != null) {
			return file.lastModified();
		} else {
			return 0;
		}
	}
	
	public boolean delete() {
		return false;
	}
	
	public boolean deleteDir() {
		return false;
	}
	
	public boolean move(String path, String opt) {
		return false;
	}
	
	public String createTempFile(String prefix) {
		return null;
	}
	
	/**
	 * ȡ????????ļ??????????֧???򷵻?null
	 * @return RandomAccessFile
	 */
	public RandomAccessFile getRandomAccessFile() {
		return null;
	}
	
	/**
	 * ?????Ƿ??????ļ?
	 * @return true???????ļ???false?????????ļ?
	 */
	public boolean isCloudFile() {
		return false;
	}
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy