VirtualTree.h

/*--------------------------------------------------------------------------------------------
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: VirtualTree
Included in API: True
Author(s): Tyler Parke
 *-----------------------------------------------------------------------------------------**/
#pragma once
#include "RTree.h>
#include "KDTree.h>
 
namespace NDEVR
{
    template<uint01 t_dims, class t_type>
    class VirtualTree
    {
    public:
        enum TreeType
        {
              e_KD      
            , R         
        };
        TreeType m_type;        
        uint04 m_bucket_size;   
        TreeObject* m_object;   

        void createKDTree(uint04 leaf_size)
        {
            switch (leaf_size)
            {
            case 4:   m_object = new KDTree<t_dims, t_type, 4>();
            case 8:   m_object = new KDTree<t_dims, t_type, 8>();
            case 12:  m_object = new KDTree<t_dims, t_type, 12>();
            case 16:  m_object = new KDTree<t_dims, t_type, 16>();
            case 20:  m_object = new KDTree<t_dims, t_type, 20>();
            case 24:  m_object = new KDTree<t_dims, t_type, 24>();
            case 32:  m_object = new KDTree<t_dims, t_type, 32>();
            case 48:  m_object = new KDTree<t_dims, t_type, 48>();
            case 64:  m_object = new KDTree<t_dims, t_type, 64>();
            case 128: m_object = new KDTree<t_dims, t_type, 128>();
            default:
                assert(false, "Uncompiled KD Tree Bucket Size");
            }
        }

        void createRTree(uint04 leaf_size)
        {
            switch (leaf_size)
            {
            case 4:   m_object = new RTree<t_dims, t_type, 4>();
            case 8:   m_object = new RTree<t_dims, t_type, 8>();
            case 12:  m_object = new RTree<t_dims, t_type, 12>();
            case 16:  m_object = new RTree<t_dims, t_type, 16>();
            case 20:  m_object = new RTree<t_dims, t_type, 20>();
            case 24:  m_object = new RTree<t_dims, t_type, 24>();
            case 32:  m_object = new RTree<t_dims, t_type, 32>();
            case 48:  m_object = new RTree<t_dims, t_type, 48>();
            case 64:  m_object = new RTree<t_dims, t_type, 64>();
            case 128: m_object = new RTree<t_dims, t_type, 128>();
            default:
                assert(false, "Uncompiled R Tree Bucket Size");
            }
        }
    };
}