From 18e62290f3b7ea9a71afa8b65f1ff0f46d4fd365 Mon Sep 17 00:00:00 2001
From: Brad Hefta-Gaub <brad@highfidelity.io>
Date: Fri, 4 Dec 2015 08:37:46 -0800
Subject: [PATCH] fix warnings
---
libraries/octree/src/Octree.cpp | 10 ----------
1 file changed, 10 deletions(-)
diff --git a/libraries/octree/src/Octree.cpp b/libraries/octree/src/Octree.cpp
index 64a2eaccc4..aacb57f31d 100644
--- a/libraries/octree/src/Octree.cpp
+++ b/libraries/octree/src/Octree.cpp
@@ -1442,10 +1442,6 @@ int Octree::encodeTreeBitstreamRecursion(OctreeElementPointer element,
// final packet in standard order. So what we're going to do is keep track of how big each subtree was in bytes,
// and then later reshuffle these sections of our output buffer back into normal order. This allows us to make
// a single recursive pass in distance sorted order, but retain standard order in our encoded packet
- int recursiveSliceSizes[NUMBER_OF_CHILDREN];
- const unsigned char* recursiveSliceStarts[NUMBER_OF_CHILDREN];
- int firstRecursiveSliceOffset = packetData->getUncompressedByteOffset();
- int allSlicesSize = 0;
// for each child element in Distance sorted order..., check to see if they exist, are colored, and in view, and if so
// add them to our distance ordered array of children
@@ -1456,8 +1452,6 @@ int Octree::encodeTreeBitstreamRecursion(OctreeElementPointer element,
if (oneAtBit(childrenExistInPacketBits, originalIndex)) {
int thisLevel = currentEncodeLevel;
- // remember this for reshuffling
- recursiveSliceStarts[originalIndex] = packetData->getUncompressedData() + packetData->getUncompressedSize();
int childTreeBytesOut = 0;
@@ -1478,10 +1472,6 @@ int Octree::encodeTreeBitstreamRecursion(OctreeElementPointer element,
}
}
- // remember this for reshuffling
- recursiveSliceSizes[originalIndex] = childTreeBytesOut;
- allSlicesSize += childTreeBytesOut;
-
// if the child wrote 0 bytes, it means that nothing below exists or was in view, or we ran out of space,
// basically, the children below don't contain any info.