Method push

ZezeJava/ZezeJava/src/main/java/Zeze/Collections/Queue.java:333–353

用作stack, 值追加到头节点的首位, 满则追加一个头节点

(V value)

	 * 用作stack, 值追加到头节点的首位, 满则追加一个头节点
	 */
	public void push(V value) {
		var root = getOrAddRoot();
		var headNodeKey = root.getHeadNodeKey();
		var head = headNodeKey.getNodeId() != 0 ? getNode(headNodeKey) : null;
		if (head == null || head.getValues().size() >= nodeSize) {
			var newNodeId = root.getLastNodeId() + 1;
			root.setLastNodeId(newNodeId);
			var newNodeKey = new BQueueNodeKey(name, newNodeId);
			root.setHeadNodeKey(newNodeKey);
			if (root.getTailNodeKey().getNodeId() == 0)
				root.setTailNodeKey(newNodeKey);
			module._tQueueNodes.insert(newNodeKey, head = new BQueueNode());
			root.setCount(root.getCount() + 1);
			if (headNodeKey.getNodeId() != 0)
				head.setNextNodeKey(headNodeKey);
		}
		var nodeValue = new BQueueNodeValue();
		nodeValue.setTimestamp(System.currentTimeMillis());
		nodeValue.getValue().setBean(value);
		head.getValues().add(0, nodeValue);
	}

	/**
	 * 删除并返回头节点中的首个值