From b691c43c44ff180d10e7d4a9afc83b98551ff586 Mon Sep 17 00:00:00 2001
From: daoge_cmd <3523206925@qq.com>
Date: Sun, 1 Mar 2026 12:16:08 +0800
Subject: Initial commit

---
 Minecraft.World/TickNextTickData.h | 46 ++++++++++++++++++++++++++++++++++++++
 1 file changed, 46 insertions(+)
 create mode 100644 Minecraft.World/TickNextTickData.h

(limited to 'Minecraft.World/TickNextTickData.h')

diff --git a/Minecraft.World/TickNextTickData.h b/Minecraft.World/TickNextTickData.h
new file mode 100644
index 00000000..41ee99da
--- /dev/null
+++ b/Minecraft.World/TickNextTickData.h
@@ -0,0 +1,46 @@
+#pragma once
+
+// 4J Stu - In Java TickNextTickData implements Comparable<TickNextTickData>
+// We don't need to do that as it is only as helper for the java sdk sorting operations
+
+class TickNextTickData
+{
+private:
+	static __int64 C;
+
+public:
+	int x, y, z, tileId;
+	__int64 m_delay;
+
+private:
+	__int64 c;
+
+public:
+	TickNextTickData(int x, int y, int z, int tileId);
+
+	bool equals(const void *o) const;
+	int hashCode() const;
+	TickNextTickData *delay(__int64 l);
+	int compareTo(const TickNextTickData *tnd) const;
+
+	static bool compare_fnct(const TickNextTickData &x, const TickNextTickData &y);
+	static int hash_fnct(const TickNextTickData &k);
+	static bool eq_test(const TickNextTickData &x, const TickNextTickData &y);
+};
+
+typedef struct
+{
+	int operator() (const TickNextTickData &k) const { return TickNextTickData::hash_fnct (k); }
+
+} TickNextTickDataKeyHash;
+
+typedef struct
+{
+	bool operator() (const TickNextTickData &x, const TickNextTickData &y) const { return TickNextTickData::eq_test (x, y); }
+} TickNextTickDataKeyEq;
+
+typedef struct
+{
+	bool operator() (const TickNextTickData &x, const TickNextTickData &y) const { return TickNextTickData::compare_fnct (x, y); }
+
+} TickNextTickDataKeyCompare;
\ No newline at end of file
-- 
cgit v1.2.3