TreeIterator.hpp

/*--------------------------------------------------------------------------------------------
Copyright (c) 2019, NDEVR LLC
tyler.parke@ndevr.org
  __    __   ____     _____ __     __  _______
 |  \  |  | |  __ \  |  ___|\ \   / / |   __  \
 |   \ |  | | |  \ \ | |___  \ \ / /  |  |__)  |
 |  . \|  | | |__/ / | |___   \ V /   |   _   /
 |  |\    |_|_____/__|_____|___\_/____|  | \  \
 |__| \__________________________________|  \__\
 
Subject to the terms of the Enterprise+ Agreement, NDEVR hereby grants 
Licensee a limited, non-exclusive, non-transferable, royalty-free license 
(without the right to sublicense) to use the API solely for the purpose of 
Licensee's internal development efforts to develop applications for which 
the API was provided.
 
The above copyright notice and this permission notice shall be included in all 
copies or substantial portions of the Software.
 
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE
FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE.
 
Library: Tree
File: TreeIterator
Included in API: True
Author(s): Tyler Parke
 *-----------------------------------------------------------------------------------------**/
#pragma once
#include <NDEVR/BaseValues.h>
 
namespace NDEVR
{
    class TreeIterator
    {
    public:
        explicit TreeIterator(uint04 start_index)
            : m_depth(0)
        {
            node_stack[0] = start_index;
        }
        uint04 get() const
        {
            return node_stack[m_depth];
        }
        bool valid() const
        {
            return m_depth != 255;
        }
        void pop()
        {
            --m_depth;
        }
        uint01 depth()
        {
            return m_depth;
        }
        void addAndGoToIndex(uint04 index)
        {
            node_stack[++m_depth] = index;
        }
        void addAndGoToIndex(uint04 index_a, uint04 index_b)
        {
            node_stack[++m_depth] = index_b;
            node_stack[++m_depth] = index_a;
        }
 
        void addAndGoToIndices(uint04 start, uint04 size)
        {
            const uint04 end = size + start;
            for(uint04 i = start; i < end; i++)
                node_stack[++m_depth] = i;
        }
 
    private:
        uint04 node_stack[256];
        uint01 m_depth;
    };
}