interlace /source/library/Interlace/Geo/Indexing/RTree.cs

Language C# Lines 129
MD5 Hash 8c23db82a47c454ded70115c3ebe2ace Estimated Cost $1,581 (why?)
Repository https://bitbucket.org/VahidN/interlace.git View Raw File View Project SPDX
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
#region Using Directives and Copyright Notice

// Copyright (c) 2007-2010, Computer Consultancy Pty Ltd
// All rights reserved.
// 
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//     * Redistributions of source code must retain the above copyright
//       notice, this list of conditions and the following disclaimer.
//     * Redistributions in binary form must reproduce the above copyright
//       notice, this list of conditions and the following disclaimer in the
//       documentation and/or other materials provided with the distribution.
//     * Neither the name of the Computer Consultancy Pty Ltd nor the
//       names of its contributors may be used to endorse or promote products
//       derived from this software without specific prior written permission.
// 
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 
// ARE DISCLAIMED. IN NO EVENT SHALL COMPUTER CONSULTANCY PTY LTD BE LIABLE 
// FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 
// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR 
// SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER 
// CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 
// LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 
// OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
// DAMAGE.

using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.Text;

#endregion

namespace Interlace.Geo.Indexing
{
    /// <summary>
    /// A visitor for RTree nodes.
    /// </summary>
    public delegate void RTreeVisitorDelegate<T>(T obj);
    
    [Serializable]
    public class RTree
    {
        RTreeNode _root;

        int _nodeCapacity;
        int _nodeMinimum;

        /// <summary>
        /// Initializes a new instance of the <see cref="T:RTree"/> class.
        /// </summary>
        /// <param name="nodeCapacity">The node capacity.</param>
        /// <param name="nodeMinimum">The node minimum.</param>
        public RTree(int nodeCapacity, int nodeMinimum)
        {
            if (nodeMinimum > nodeCapacity / 2)
            {
                throw new ArgumentException("The node minimum must be less than or equal to " +
                    "half of the node capacity.", "nodeMinimum");
            }
            
            _nodeCapacity = nodeCapacity;
            _nodeMinimum = nodeMinimum;

            _root = new RTreeLeaf(this);
            _root.Parent = null;
        }

        public int NodeCapacity
        {
            get
            {
                return _nodeCapacity;
            }
        }

        public int NodeMinimum
        {
            get
            {
                return _nodeMinimum;
            }
        }

        /// <summary>
        /// Inserts the specified object.
        /// </summary>
        /// <param name="bounds">The bounding box of the object.</param>
        /// <param name="obj">The object.</param>
        public void Insert<T>(Box bounds, T obj)
        {
            _root.Insert(new RTreeObject(bounds, obj));
        }

        /// <summary>
        /// Finds objects intersecting the supplied bounding box.
        /// </summary>
        public void Find<T>(RTreeVisitorDelegate<T> visitor, Box bounds) 
        {
            _root.Find<T>(visitor, bounds);
        }

        public bool DoesBoxExist(Box bounds)
        {
            return _root.DoesBoxExist(bounds);
        }

        internal void ReplaceRootWithSplitResult(RTreeNode lhsNode, RTreeNode rhsNode)
        {
            RTreeNonLeaf newRoot = new RTreeNonLeaf(this);

            newRoot.ReplaceNodeWithSplitResult(null, lhsNode, rhsNode);

            _root = newRoot;
        }

        public void ThrowOnInvariantsViolated()
        {
            if (_root == null) throw new InvalidOperationException();

            if (_root.Parent != null) throw new InvalidOperationException();

            _root.ThrowOnInvariantsViolated(null);
        }
    }
}
Back to Top