rtree/PointerPoolNode.h

Go to the documentation of this file.

/******************************************************************************
 * Project:  libspatialindex - A C++ library for spatial indexing
 * Author:   Marios Hadjieleftheriou, mhadji@gmail.com
 ******************************************************************************
 * Copyright (c) 2002, Marios Hadjieleftheriou
 *
 * All rights reserved.
 *
 * Permission is hereby granted, free of charge, to any person obtaining a
 * copy of this software and associated documentation files (the "Software"),
 * to deal in the Software without restriction, including without limitation
 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
 * and/or sell copies of the Software, and to permit persons to whom the
 * Software is furnished to do so, subject to the following conditions:
 *
 * 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.
******************************************************************************/
 
#ifndef __spatialindex_rtree_pointer_pool_node_h
#define __spatialindex_rtree_pointer_pool_node_h
 
#include "Node.h"
 
namespace Tools
{
    using namespace SpatialIndex;
    template<> class PointerPool<RTree::Node>
    {
    public:
        explicit PointerPool(uint32_t capacity) : m_capacity(capacity)
        {
        }
 
        ~PointerPool()
        {
            assert(m_pool.size() <= m_capacity);
 
            while (! m_pool.empty())
            {
                RTree::Node* x = m_pool.top(); m_pool.pop();
                delete x;
            }
        }
 
        PoolPointer<RTree::Node> acquire()
        {
            if (! m_pool.empty())
            {
                RTree::Node* p = m_pool.top(); m_pool.pop();
                return PoolPointer<RTree::Node>(p, this);
            }
            return PoolPointer<RTree::Node>();
        }
 
        void release(RTree::Node* p)
        {
            if (p != nullptr)
            {
                if (m_pool.size() < m_capacity)
                {
                    if (p->m_pData != nullptr)
                    {
                        for (uint32_t cChild = 0; cChild < p->m_children; ++cChild)
                        {
                            // there is no need to set the pointer to zero, after deleting it,
                            // since it will be redeleted only if it is actually initialized again,
                            // a fact that will be depicted by variable m_children.
                            if (p->m_pData[cChild] != nullptr) delete[] p->m_pData[cChild];
                        }
                    }
 
                    p->m_level = 0;
                    p->m_identifier = -1;
                    p->m_children = 0;
                    p->m_totalDataLength = 0;
 
                    m_pool.push(p);
                }
                else
                {
                    delete p;
                }
 
                assert(m_pool.size() <= m_capacity);
            }
        }
 
        uint32_t getCapacity() const { return m_capacity; }
        void setCapacity(uint32_t c)
        {
            assert (c >= 0);
            m_capacity = c;
        }
 
    protected:
        uint32_t m_capacity;
        std::stack<RTree::Node*> m_pool;
 
    };
}
 
#endif /* __spatialindex_rtree_pointer_pool_node_h */