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

com.adrninistrator.javacg2.dto.frame.JavaCG2OperandStack Maven / Gradle / Ivy

package com.adrninistrator.javacg2.dto.frame;

import com.adrninistrator.javacg2.dto.element.BaseElement;
import com.adrninistrator.javacg2.exceptions.JavaCG2RuntimeException;
import com.adrninistrator.javacg2.util.JavaCG2ElementUtil;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;

import java.util.Set;

/**
 * @author adrninistrator
 * @date 2022/5/13
 * @description: 操作数栈
 */
public class JavaCG2OperandStack {

    private static final Logger logger = LoggerFactory.getLogger(JavaCG2OperandStack.class);

    private final BaseElement[] elements;

    private int head;

    private final int capacity;

    public JavaCG2OperandStack(int capacity) {
        head = 0;
        elements = new BaseElement[capacity];
        this.capacity = capacity;
    }

    public int size() {
        return head;
    }

    public boolean isEmpty() {
        return head == 0;
    }

    public void push(BaseElement element) {
        if (element == null) {
            logger.error("push的元素为null {}", head);
            throw new JavaCG2RuntimeException("push的元素为null");
        }

        if (head >= capacity) {
            logger.error("栈已满 {} {}", head, element);
            throw new JavaCG2RuntimeException("栈已满");
        }

        elements[head++] = element;

        logger.debug("入操作数栈后 size: {} {}", head, element);
    }

    public BaseElement pop() {
        if (head == 0) {
            logger.error("栈为空,不支持pop");
            throw new JavaCG2RuntimeException("栈为空,不支持pop");
        }

        BaseElement element = elements[--head];

        logger.debug("出操作数栈后 size: {} {}", head, element);

        elements[head] = null;
        return element;
    }

    public BaseElement peek() {
        if (head == 0) {
            logger.error("栈为空,不支持peek");
            throw new JavaCG2RuntimeException("栈为空,不支持peek");
        }

        return elements[head - 1];
    }

    /**
     * 从栈顶开始获取元素
     *
     * @param interval 距离栈顶的位置
     * @return
     */
    public BaseElement getFromTop(int interval) {
        int index = head - 1 - interval;
        if (index < 0) {
            return null;
        }

        return elements[index];
    }

    public void clear() {
        for (int i = 0; i < head; i++) {
            elements[i] = null;
        }
        head = 0;
    }

    public JavaCG2OperandStack copy() {
        JavaCG2OperandStack javaCG2OperandStackCopy = new JavaCG2OperandStack(capacity);
        for (int i = 0; i < this.head; i++) {
            javaCG2OperandStackCopy.elements[i] = this.elements[i].copyElement();
        }
        javaCG2OperandStackCopy.head = this.head;
        return javaCG2OperandStackCopy;
    }

    /**
     * 比较当前对象与另一个对象值是否相同,宽松模式
     *
     * @param existed
     * @param added
     * @param sameStackSeqSet
     */
    public static void compareLooseMode(JavaCG2OperandStack existed, JavaCG2OperandStack added, Set sameStackSeqSet) {
        // 比较栈长度
        if (existed.head != added.head) {
            return;
        }

        // 比较栈中的每一个元素
        for (int i = 0; i < existed.head; i++) {
            if (added.elements[i] == null ||
                    (existed.elements[i] != null && JavaCG2ElementUtil.compare(existed.elements[i], added.elements[i]))) {
                sameStackSeqSet.add(i);
            }
        }
    }

    @Override
    public String toString() {
        StringBuilder stringBuilder = new StringBuilder();
        stringBuilder.append("head: ").append(head).append("\n");

        for (int i = 0; i < head; i++) {
            BaseElement baseElement = elements[i];
            stringBuilder.append(i).append(" ");
            if (baseElement != null) {
                stringBuilder.append(baseElement);
            } else {
                stringBuilder.append("null");
            }
            stringBuilder.append("\n");
        }

        return stringBuilder.toString();
    }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy