root
/
cesium-native
mirror of https://github.com/CesiumGS/cesium-native.git
1
0
Fork 0
Code Issues Actions 3 Packages Projects Releases Wiki Activity

fix wrong endianness when counting available bits

This commit is contained in:
Nithin Pranesh 2022-01-13 15:13:44 -05:00
parent 71c680e89b
commit 4b3e7af9b2
2 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
CesiumGeometry/src/OctreeAvailability.cpp
View File

@ -151,7 +151,7 @@ uint8_t OctreeAvailability::computeAvailability(
AvailabilityUtilities::countOnesInBuffer(
clippedSubtreeAvailability) +
AvailabilityUtilities::countOnesInByte(
static_cast<uint8_t>(availabilityByte >> (8 - bitIndex)));
static_cast<uint8_t>(availabilityByte << (8 - bitIndex)));
}
} else {
// INVALID AVAILABILITY ACCESSOR
@ -258,7 +258,7 @@ bool OctreeAvailability::addSubtree(
AvailabilityUtilities::countOnesInBuffer(
clippedSubtreeAvailability) +
AvailabilityUtilities::countOnesInByte(
static_cast<uint8_t>(availabilityByte >> (8 - bitIndex)));
static_cast<uint8_t>(availabilityByte << (8 - bitIndex)));
}
} else {
// INVALID AVAILABILITY ACCESSOR
@ -433,7 +433,7 @@ AvailabilityNode* OctreeAvailability::addNode(
// availability, instead of iterating through the buffer each time.
AvailabilityUtilities::countOnesInBuffer(clippedSubtreeAvailability) +
AvailabilityUtilities::countOnesInByte(
static_cast<uint8_t>(availabilityByte >> (8 - bitIndex)));
static_cast<uint8_t>(availabilityByte << (8 - bitIndex)));
} else {
// This subtree is not supposed to be available.
return nullptr;
@ -504,7 +504,7 @@ std::optional<uint32_t> OctreeAvailability::findChildNodeIndex(
// availability, instead of iterating through the buffer each time.
AvailabilityUtilities::countOnesInBuffer(clippedSubtreeAvailability) +
AvailabilityUtilities::countOnesInByte(
static_cast<uint8_t>(availabilityByte >> (8 - bitIndex)));
static_cast<uint8_t>(availabilityByte << (8 - bitIndex)));
}
}

8
CesiumGeometry/src/QuadtreeAvailability.cpp
View File

@ -163,7 +163,7 @@ uint8_t QuadtreeAvailability::computeAvailability(
AvailabilityUtilities::countOnesInBuffer(
clippedSubtreeAvailability) +
AvailabilityUtilities::countOnesInByte(
static_cast<uint8_t>(availabilityByte >> (8 - bitIndex)));
static_cast<uint8_t>(availabilityByte << (8 - bitIndex)));
}
} else {
// INVALID AVAILABILITY ACCESSOR
@ -269,7 +269,7 @@ bool QuadtreeAvailability::addSubtree(
AvailabilityUtilities::countOnesInBuffer(
clippedSubtreeAvailability) +
AvailabilityUtilities::countOnesInByte(
static_cast<uint8_t>(availabilityByte >> (8 - bitIndex)));
static_cast<uint8_t>(availabilityByte << (8 - bitIndex)));
}
} else {
// INVALID AVAILABILITY ACCESSOR
@ -442,7 +442,7 @@ AvailabilityNode* QuadtreeAvailability::addNode(
// availability, instead of iterating through the buffer each time.
AvailabilityUtilities::countOnesInBuffer(clippedSubtreeAvailability) +
AvailabilityUtilities::countOnesInByte(
static_cast<uint8_t>(availabilityByte >> (8 - bitIndex)));
static_cast<uint8_t>(availabilityByte << (8 - bitIndex)));
} else {
// This subtree is not supposed to be available.
return nullptr;
@ -512,7 +512,7 @@ std::optional<uint32_t> QuadtreeAvailability::findChildNodeIndex(
// availability, instead of iterating through the buffer each time.
AvailabilityUtilities::countOnesInBuffer(clippedSubtreeAvailability) +
AvailabilityUtilities::countOnesInByte(
static_cast<uint8_t>(availabilityByte >> (8 - bitIndex)));
static_cast<uint8_t>(availabilityByte << (8 - bitIndex)));
}
}