@Override
	public boolean isConsistent(String tableName, TaskMonitor monitor)
			throws IOException, CancelledException {
		boolean consistent = true;
		Field prevKey = null;
		for (int i = 0; i < keyCount; i++) {
			// Compare each key entry with the previous key
			Field key = getKeyField(i);
			if (prevKey != null && key.compareTo(prevKey) <= 0) {
				consistent = false;
				logConsistencyError(tableName, "key[" + i + "] <= key[" + (i - 1) + "]", null);
				Msg.debug(this, "  key[" + i + "].minKey = " + key.getValueAsString());
				Msg.debug(this, "  key[" + (i - 1) + "].minKey = " + prevKey.getValueAsString());
			}
			prevKey = key;
		}

		Field key0 = getKeyField(0);
		if ((parent == null || parent.isLeftmostKey(key0)) && getPreviousLeaf() != null) {
			consistent = false;
			logConsistencyError(tableName, "previous-leaf should not exist", null);
		}

		FixedKeyRecordNode node = getNextLeaf();
		if (node != null) {
			if (parent == null || parent.isRightmostKey(key0)) {
				consistent = false;
				logConsistencyError(tableName, "next-leaf should not exist", null);
			}
			else {
				FixedKeyRecordNode me = node.getPreviousLeaf();
				if (me != this) {
					consistent = false;
					logConsistencyError(tableName, "next-leaf is not linked to this leaf", null);
				}
			}
		}
		else if (parent != null && !parent.isRightmostKey(key0)) {
			consistent = false;
			logConsistencyError(tableName, "this leaf is not linked to next-leaf", null);
		}

		return consistent;
	}
Construct a new fixed-length key record leaf node.
@param nodeMgr table node manager instance
@param nodeType node type
@param prevLeafId node buffer id for previous leaf - left sibling ( &lt; 0: no leaf)
@param nextLeafId node buffer id for next leaf - right sibling ( &lt; 0 : no leaf)
@throws IOException thrown if an IO error occurs
Ghidra/Framework/DB/src/main/java/db/FixedKeyRecordNode.java