thepigeongenerator/mcaselector-lite
1
0
Fork 0
mirror of https://github.com/thepigeongenerator/mcaselector-lite.git synced 2025-12-17 06:15:47 +01:00
Code Issues Packages Projects Releases Wiki Activity

refactor via swapping values to instead have n * len, to be len * n

Browse Source 
it is like this in other code, and makes it more obvious what the actual
unique value is.
At least to me, which is what mostly matters.
This commit is contained in:
Quinn
2025-08-20 18:41:47 +02:00
parent f53e4315ee
commit df3720b966
1 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
src/dat/nbt.c
View File

@@ -52,17 +52,17 @@ const u8 *nbt_nexttag(const u8 *restrict buf) {
case NBT_END: dpt--; break;
case NBT_COMPOUND: dpt++; break;
// TODO: move this into it's own function for readability.
case NBT_LIST: {
tag = ptr; // temporarily store the tag to cache later
switch (*(ptr++)) {
case NBT_END: break;
case NBT_I8: ptr += 1 * (i32)be32toh(*(u32 *)ptr); break;
case NBT_I16: ptr += 2 * (i32)be32toh(*(u32 *)ptr); break;
case NBT_I8: ptr += (i32)be32toh(*(u32 *)ptr) * 1; break;
case NBT_I16: ptr += (i32)be32toh(*(u32 *)ptr) * 2; break;
case NBT_I32: // fall through
case NBT_F32: ptr += 4 * (i32)be32toh(*(u32 *)ptr); break;
case NBT_F32: ptr += (i32)be32toh(*(u32 *)ptr) * 4; break;
case NBT_I64: // fall through
case NBT_F64: ptr += 8 * (i32)be32toh(*(u32 *)ptr); break;
case NBT_F64: ptr += (i32)be32toh(*(u32 *)ptr) * 8; break;
default:
// TODO: handle out of bounds... Might not be required if we use flexible array member
dpt++;