Spatial_DynamicTree.h

/*
 * Gamedev Framework (gf)
 * Copyright (C) 2016-2021 Julien Bernard
 *
 * This software is provided 'as-is', without any express or implied
 * warranty.  In no event will the authors be held liable for any damages
 * arising from the use of this software.
 *
 * Permission is granted to anyone to use this software for any purpose,
 * including commercial applications, and to alter it and redistribute it
 * freely, subject to the following restrictions:
 *
 * 1. The origin of this software must not be misrepresented; you must not
 *    claim that you wrote the original software. If you use this software
 *    in a product, an acknowledgment in the product documentation would be
 *    appreciated but is not required.
 * 2. Altered source versions must be plainly marked as such, and must not be
 *    misrepresented as being the original software.
 * 3. This notice may not be removed or altered from any source distribution.
 */
#ifndef GF_SPATIAL_DYNAMIC_TREE_H
#define GF_SPATIAL_DYNAMIC_TREE_H

#include <cassert>
#include <vector>

#include "BlockAllocator.h"
#include "CoreApi.h"
#include "Handle.h"
#include "Rect.h"
#include "SpatialTypes.h"

namespace gf {
#ifndef DOXYGEN_SHOULD_SKIP_THIS
inline namespace v1 {
#endif

  class GF_CORE_API DynamicTree {
  public:
    DynamicTree();

    SpatialId insert(Handle handle, const RectF& bounds);

    void modify(SpatialId id, RectF bounds);

    std::size_t query(const RectF& bounds, SpatialQueryCallback callback, SpatialQuery kind = SpatialQuery::Intersect);

    void remove(SpatialId id);

    void clear();

    Handle operator[](SpatialId id);

  private:
    std::size_t allocateNode();
    void disposeNode(std::size_t index);

    void doInsert(std::size_t leaf);
    void doRemove(std::size_t leaf);

    std::size_t balance(std::size_t iA);

  private:
    struct Node {
      Handle handle;
      RectF bounds;
      std::size_t parent;
      std::size_t child1;
      std::size_t child2;
      int32_t height;

      bool isLeaf() const {
        return child1 == NullIndex;
      }
    };

    BlockAllocator<Node> m_nodes;

    std::size_t m_root;
  };

#ifndef DOXYGEN_SHOULD_SKIP_THIS
}
#endif
}

#endif // GF_SPATIAL_DYNAMIC_TREE_H