com.scudata.dm.cursor.PJoinCursor Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of esproc Show documentation
SPL(Structured Process Language) A programming language specially for structured data computing.
There is a newer version: 20240823
package com.scudata.dm.cursor;

import com.scudata.common.MessageManager;
import com.scudata.common.RQException;
import com.scudata.dm.BaseRecord;
import com.scudata.dm.Context;
import com.scudata.dm.DataStruct;
import com.scudata.dm.Sequence;
import com.scudata.dm.Table;
import com.scudata.resources.EngineMessage;

/**
 * ??λ?ö??α???й??????α?
 * @author RunQian
 *
 */
public class PJoinCursor extends ICursor {
	private ICursor []cursors; // ?α?????
	private String []names; // ?ֶ???????
	private DataStruct ds; // ????????ݽṹ
	private boolean isEnd = false; // ?Ƿ?ȡ??????

	/**
	 * ??????λ?ù????α?
	 * @param cursors ?α?????
	 * @param names ?ֶ???????
	 */
	public PJoinCursor(ICursor []cursors, String []names) {
		this.cursors = cursors;
		this.names = names;
		
		if (names != null) {
			ds = new DataStruct(names);
			setDataStruct(ds);
		}
	}
	
	/**
	 * ??????λ?ù????α?
	 * @param cursors ?α?????
	 */
	public PJoinCursor(ICursor []cursors) {
		this(cursors, null);
	}
	
	// ???м???ʱ??Ҫ?ı???????
	// ?̳???????õ??˱???ʽ????Ҫ?????????????½???????ʽ
	public void resetContext(Context ctx) {
		if (this.ctx != ctx) {
			for (ICursor cursor : cursors) {
				cursor.resetContext(ctx);
			}
			
			super.resetContext(ctx);
		}
	}

	private Sequence get_p(int n) {
		int minLen = n;
		int fcount = cursors.length;
		Sequence []tables = new Sequence[fcount];
	
		for (int i = 0; i < fcount; ++i) {
			Sequence table = cursors[i].fetch(n);
			if (table == null || table.length() == 0) {
				return null;
			}

			tables[i] = table;

			if (table.length() < minLen) minLen = table.length();
		}

		Table table = new Table(ds, minLen);
		for (int i = 1; i <= minLen; ++i) {
			BaseRecord r = table.newLast();
			for (int f = 0; f < fcount; ++f) {
				r.setNormalFieldValue(f, tables[f].getMem(i));
			}
		}

		return table;
	}
	
	/**
	 * ??ȡָ???????????ݷ???
	 * @param n ????
	 * @return Sequence
	 */
	protected Sequence get(int n) {
		if (isEnd || n < 1) return null;

		if (names != null) return get_p(n);
		
		int minLen = n;
		int tcount = cursors.length;
		Sequence []tables = new Sequence[tcount];
		int []fcounts = new int[tcount];
		int fcount = 0;
		
		for (int i = 0; i < tcount; ++i) {
			Sequence table = cursors[i].fetch(n);
			if (table == null || table.length() == 0) {
				return null;
			}

			DataStruct ds = table.dataStruct();
			if (ds == null) {
				MessageManager mm = EngineMessage.get();
				throw new RQException(mm.getMessage("engine.needPurePmt"));
			}

			tables[i] = table;
			fcounts[i] = ds.getFieldCount();
			fcount += fcounts[i];

			if (table.length() < minLen) minLen = table.length();
		}

		if (ds == null) {
			String[] fnames = new String[fcount];
			int findex = 0;
			for (int i = 0; i < tcount; ++i) {
				String[] curNames = tables[i].dataStruct().getFieldNames();
				System.arraycopy(curNames, 0, fnames, findex, fcounts[i]);
				findex += fcounts[i];
			}

			ds = new DataStruct(fnames);
		}

		Table table = new Table(ds, minLen);
		Object []values = new Object[fcount];
		for (int i = 1; i <= minLen; ++i) {
			int findex = 0;
			for (int t = 0; t < tcount; ++t) {
				BaseRecord r = (BaseRecord)tables[t].getMem(i);
				Object []curVals = r.getFieldValues();
				System.arraycopy(curVals, 0, values, findex, fcounts[t]);
				findex += fcounts[t];
			}

			table.newLast(values);
		}

		return table;
	}

	/**
	 * ????ָ????????????
	 * @param n ????
	 * @return long ʵ????????????
	 */
	protected long skipOver(long n) {
		if (isEnd || n < 1) return 0;

		ICursor []cursors = this.cursors;
		long minLen = n;
		int tcount = cursors.length;

		for (int i = 0; i < tcount; ++i) {
			long curLen = cursors[i].skip(n);
			if (curLen < 1) {
				return 0;
			}

			if (curLen < minLen) minLen = curLen;
		}

		return minLen;
	}

	/**
	 * ?ر??α?
	 */
	public synchronized void close() {
		super.close();
		if (cursors != null) {
			for (int i = 0, count = cursors.length; i < count; ++i) {
				cursors[i].close();
			}

			isEnd = true;
		}
	}

	/**
	 * ?????α?
	 * @return ?????Ƿ?ɹ???true???α???Դ?ͷ????ȡ????false???????Դ?ͷ????ȡ??
	 */
	public boolean reset() {
		close();
		
		for (int i = 0, count = cursors.length; i < count; ++i) {
			if (!cursors[i].reset()) {
				return false;
			}
		}
		
		isEnd = false;
		return true;
	}
}