public ContainEnum(HyperCube hh, RTree tree) { _cubes = tree.Enclosure(hh, tree._file.ReadNode(0)); if (_cubes.Count == 0) { _hasNext = false; } }
public IntersectionEnum(HyperCube hh, RTree tree) { _nodes = tree.Intersection(hh, tree._file.ReadNode(0)); if (_nodes.Count == 0) { _hasNext = false; } }
//////////////////////////////////////////////////////////////////////////// //--------------------------------- REVISIONS ------------------------------ // Date Name Tracking # Description // --------- ------------------- ------------- ---------------------- // 21DEC2008 James Shen Initial Creation //////////////////////////////////////////////////////////////////////////// /** * constructor. */ protected AbstractNode(RTree tree, int parent, int pageNumber, int level) { Parent = parent; Tree = tree; PageNumber = pageNumber; Level = level; Data = new HyperCube[tree.GetNodeCapacity() + 1]; Branches = new int[tree.GetNodeCapacity() + 1]; UsedSpace = 0; }
//////////////////////////////////////////////////////////////////////////// //--------------------------------- REVISIONS ------------------------------ // Date Name Tracking # Description // --------- ------------------- ------------- ---------------------- // 21DEC2008 James Shen Initial Creation //////////////////////////////////////////////////////////////////////////// /** * constructor. */ internal Index(RTree tree, int parent, int pageNumber, int level) : base(tree, parent, pageNumber, level) { }
public PreOrderEnum(RTree tree) { AbstractNode root = tree._file.ReadNode(0); _nodes = tree.TraversePreOrder(root); }
public PreOrderEnum(RTree tree) { AbstractNode root = tree._file.ReadNode(0); _nodes = tree.TraversePreOrder(root); }
public ByLevelEnum(RTree tree) { AbstractNode root = tree._file.ReadNode(0); _nodes = tree.TraverseByLevel(root); }
public ContainEnum(HyperCube hh, RTree tree) { _cubes = tree.Enclosure(hh, tree._file.ReadNode(0)); if (_cubes.Count == 0) { _hasNext = false; } }
public IntersectionEnum(HyperCube hh, RTree tree) { _nodes = tree.Intersection(hh, tree._file.ReadNode(0)); if (_nodes.Count == 0) { _hasNext = false; } }
//////////////////////////////////////////////////////////////////////////// //--------------------------------- REVISIONS ------------------------------ // Date Name Tracking # Description // --------- ------------------- ------------- ---------------------- // 21DEC2008 James Shen Initial Creation //////////////////////////////////////////////////////////////////////////// /** * constructor. */ protected Leaf(RTree tree, int parent) : base(tree, parent, -1, 0) { // Leaf nodes belong by default to level 0. }
public ByLevelEnum(RTree tree) { AbstractNode root = tree._file.ReadNode(0); _nodes = tree.TraverseByLevel(root); }
//////////////////////////////////////////////////////////////////////////// //--------------------------------- REVISIONS ------------------------------ // Date Name Tracking # Description // --------- ------------------- ------------- ---------------------- // 21DEC2008 James Shen Initial Creation //////////////////////////////////////////////////////////////////////////// /** * constructor. */ internal Leaf(RTree tree, int parent, int pageNumber) : base(tree, parent, pageNumber, 0) { // Leaf nodes belong by default to level 0. }
//////////////////////////////////////////////////////////////////////////// //--------------------------------- REVISIONS ------------------------------ // Date Name Tracking # Description // --------- ------------------- ------------- ---------------------- // 21DEC2008 James Shen Initial Creation //////////////////////////////////////////////////////////////////////////// /** * constructor. */ protected Leaf(RTree tree, int parent) : base(tree, parent, -1, 0) { // Leaf nodes belong by default to level 0. }
//////////////////////////////////////////////////////////////////////////// //--------------------------------- REVISIONS ------------------------------ // Date Name Tracking # Description // --------- ------------------- ------------- ---------------------- // 21DEC2008 James Shen Initial Creation //////////////////////////////////////////////////////////////////////////// /** * constructor. */ internal Leaf(RTree tree, int parent, int pageNumber) : base(tree, parent, pageNumber, 0) { // Leaf nodes belong by default to level 0. }
//////////////////////////////////////////////////////////////////////////// //--------------------------------- REVISIONS ------------------------------ // Date Name Tracking # Description // --------- ------------------- ------------- ---------------------- // 21DEC2008 James Shen Initial Creation //////////////////////////////////////////////////////////////////////////// /** * constructor. */ internal Index(RTree tree, int parent, int pageNumber, int level) : base(tree, parent, pageNumber, level) { }
//////////////////////////////////////////////////////////////////////////// //--------------------------------- REVISIONS ------------------------------ // Date Name Tracking # Description // --------- ------------------- ------------- ---------------------- // 21DEC2008 James Shen Initial Creation //////////////////////////////////////////////////////////////////////////// /** * constructor. */ protected AbstractNode(RTree tree, int parent, int pageNumber, int level) { Parent = parent; Tree = tree; PageNumber = pageNumber; Level = level; Data = new HyperCube[tree.GetNodeCapacity() + 1]; Branches = new int[tree.GetNodeCapacity() + 1]; UsedSpace = 0; }