net.hasor.dataql.runtime.mem.DataHeap Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of hasor-dataql Show documentation
the hasor DataQL project.
There is a newer version: 4.2.5
/*
 * Copyright 2008-2009 the original author or authors.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package net.hasor.dataql.runtime.mem;
/**
 * 堆数据
 * @author 赵永春 ([email protected])
 * @version : 2019-11-22
 */
public class DataHeap implements Cloneable {
    private DataHeap parent        = null;
    private int      depth         = 0;
    private Object[] heapDataPool  = new Object[10];
    private String[] heapDataNames = new String[10];

    public DataHeap() {
        this(null);
    }

    public DataHeap(DataHeap parent) {
        if (parent != null) {
            this.parent = parent;
            this.depth = parent.depth + 1;
        }
    }

    public void defineName(int position, String name) {
        if (position >= this.heapDataNames.length) {
            String[] newHeapDataPool = new String[heapDataNames.length + 5];
            System.arraycopy(this.heapDataNames, 0, newHeapDataPool, 0, heapDataNames.length);
            this.heapDataNames = newHeapDataPool;
        }
        this.heapDataNames[position] = name;
    }

    public void saveData(int position, Object data) {
        if (position >= this.heapDataPool.length) {
            Object[] newHeapDataPool = new Object[heapDataPool.length + 5];
            System.arraycopy(this.heapDataPool, 0, newHeapDataPool, 0, heapDataPool.length);
            this.heapDataPool = newHeapDataPool;
        }
        this.heapDataPool[position] = data;
    }

    public Object loadData(int depth, int position) {
        DataHeap heapData = this;
        for (int i = 0; i <= depth; i++) {
            if (i == depth) {
                return heapData.heapDataPool[position];
            }
            heapData = heapData.parent;
            if (heapData == null) {
                break;
            }
        }
        return null;
    }

    @Override
    public DataHeap clone() {
        DataHeap parent = null;
        if (this.parent != null) {
            parent = this.parent.clone();
        }
        DataHeap dataHeap = new DataHeap(parent);
        dataHeap.depth = this.depth;
        dataHeap.heapDataPool = this.heapDataPool.clone();
        return dataHeap;
    }
}