com.scudata.dm.HashIndexSequence 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;

import com.scudata.array.BoolArray;
import com.scudata.array.IArray;
import com.scudata.util.HashUtil;

/**
 * ???й?ϣ????????????contains??pos????
 * @author WangXiaoJun
 *
 */
public class HashIndexSequence extends IndexTable {
	private IArray valueArray; // ????Ԫ??ֵ????
	protected HashUtil hashUtil; // ???ڼ????ϣֵ
	private int []entries; // ??ϣ????????Ź?ϣֵ??Ӧ?????һ????¼??λ??
	private int []linkArray; // ??ϣֵ??ͬ?ļ?¼????
	
	public HashIndexSequence(Sequence code) {
		IArray valueArray = code.getMems();
		int len = valueArray.size();
		HashUtil hashUtil = new HashUtil(len);
		int []entries = new int[hashUtil.getCapacity()];
		int []linkArray = new int[len + 1];
		
		this.valueArray = valueArray;
		this.hashUtil = hashUtil;
		this.entries = entries;
		this.linkArray = linkArray;
		
		for (int i = 1; i <= len; ++i) {
			int hash = hashUtil.hashCode(valueArray.hashCode(i));
			linkArray[i] = entries[hash];
			entries[hash] = i;
		}
	}
	
	/**
	 * ȡ??ϣ??????
	 * @return
	 */
	public int getCapacity() {
		return hashUtil.getCapacity();
	}
	
	/**
	 * ?ɼ?????Ԫ?أ??Ҳ??????ؿ?
	 * @param key ??ֵ
	 */
	public Object find(Object key) {
		int seq = hashUtil.hashCode(key);
		seq = entries[seq];
		
		while (seq != 0) {
			if (valueArray.isEquals(seq, key)) {
				return valueArray.get(seq);
			} else {
				seq = linkArray[seq];
			}
		}
		
		return null; // key not found
	}

	/**
	 * ?ɼ?????Ԫ?أ??Ҳ??????ؿ?
	 * @param keys ????Ϊ1?ļ?ֵ????
	 */
	public Object find(Object []keys) {
		return find(keys[0]);
	}
	
	/**
	 * ?ɼ?????Ԫ????ţ??Ҳ???????0
	 * @param key ??ֵ
	 */
	public int findPos(Object key) {
		int seq = hashUtil.hashCode(key);
		seq = entries[seq];
		
		while (seq != 0) {
			if (valueArray.isEquals(seq, key)) {
				return seq;
			} else {
				seq = linkArray[seq];
			}
		}
		
		return 0; // key not found
	}
	
	/**
	 * ?ɼ?????Ԫ????ţ??Ҳ???????01
	 * @param key ??ֵ
	 */
	public int findPos(Object[] keys) {
		return findPos(keys[0]);
	}
	
	public void contains(IArray keys, BoolArray result) {
		IArray valueArray = this.valueArray;
		HashUtil hashUtil = this.hashUtil;
		int []entries = this.entries;
		int []linkArray = this.linkArray;
		
		Next:
		for (int i = 1, size = result.size(); i <= size; ++i) {
			if (result.isTrue(i)) {
				int seq = hashUtil.hashCode(keys.hashCode(i));
				seq = entries[seq];

				while (seq != 0) {
					if (valueArray.isEquals(seq, keys, i)) {
						continue Next;
					} else {
						seq = linkArray[seq];
					}
				}
				
				result.set(i, false);
			}
		}
	}
	
	public int[] findAllPos(IArray keys) {
		if (keys == null) {
			return null;
		}

		IArray valueArray = this.valueArray;
		HashUtil hashUtil = this.hashUtil;
		int []entries = this.entries;
		int []linkArray = this.linkArray;
		int len = keys.size();
		int[] pos = new int[len + 1];
		
		for (int i = 1; i <= len; i++) {
			int seq = hashUtil.hashCode(keys.hashCode(i));
			seq = entries[seq];
			
			while (seq != 0) {
				if (valueArray.isEquals(seq, keys, i)) {
					pos[i] =  seq;
					break;
				} else {
					seq = linkArray[seq];
				}
			}
		}
		
		return pos;
	}

	public int[] findAllPos(IArray[] keys) {
		return findAllPos(keys[0]);
	}

	public int[] findAllPos(IArray keys, BoolArray signArray) {
		if (keys == null) {
			return null;
		}

		IArray valueArray = this.valueArray;
		HashUtil hashUtil = this.hashUtil;
		int []entries = this.entries;
		int []linkArray = this.linkArray;
		int len = keys.size();
		int[] pos = new int[len + 1];
		
		for (int i = 1; i <= len; i++) {
			if (signArray.isTrue(i)) {
				int seq = hashUtil.hashCode(keys.hashCode(i));
				seq = entries[seq];
				
				while (seq != 0) {
					if (valueArray.isEquals(seq, keys, i)) {
						pos[i] =  seq;
						break;
					} else {
						seq = linkArray[seq];
					}
				}
			}
		}
		
		return pos;
	}

	public int[] findAllPos(IArray[] keys, BoolArray signArray) {
		return findAllPos(keys[0], signArray);
	}
}