Quotes around otherwise ambiguous (underline containing) name
[geos.git] / include / geos / index / intervalrtree / IntervalRTreeBranchNode.h
blob22fd12964c2b3a5023cdb9e6deab4181996a6c33
1 /**********************************************************************
3 * GEOS - Geometry Engine Open Source
4 * http://geos.osgeo.org
6 * Copyright (C) 2006 Refractions Research Inc.
8 * This is free software; you can redistribute and/or modify it under
9 * the terms of the GNU Lesser General Public Licence as published
10 * by the Free Software Foundation.
11 * See the COPYING file for more information.
14 **********************************************************************/
16 #ifndef GEOS_INDEX_INTERVALRTREE_INTERVALRTREEBRANCHNODE_H
17 #define GEOS_INDEX_INTERVALRTREE_INTERVALRTREEBRANCHNODE_H
19 #include <geos/index/intervalrtree/IntervalRTreeNode.h> // inherited
21 #include <algorithm>
23 // forward declarations
24 namespace geos {
25 namespace index {
26 class ItemVisitor;
31 namespace geos {
32 namespace index {
33 namespace intervalrtree {
35 class IntervalRTreeBranchNode : public IntervalRTreeNode
37 private:
38 const IntervalRTreeNode * node1;
39 const IntervalRTreeNode * node2;
41 //void buildExtent( IntervalRTreeNode * n1, IntervalRTreeNode * n2)
42 //{
43 // min = std::min( n1->min, n2->min);
44 // max = std::max( n1->max, n2->max);
45 //}
47 protected:
48 public:
49 IntervalRTreeBranchNode( const IntervalRTreeNode * n1, const IntervalRTreeNode * n2)
50 : IntervalRTreeNode( std::min( n1->getMin(), n2->getMin()), std::max( n1->getMax(), n2->getMax())),
51 node1( n1),
52 node2( n2)
53 { }
55 ~IntervalRTreeBranchNode()
57 delete node1;
58 delete node2;
62 void query(double queryMin, double queryMax, index::ItemVisitor * visitor) const;
65 } // geos::intervalrtree
66 } // geos::index
67 } // geos
69 #endif // GEOS_INDEX_INTERVALRTREE_INTERVALRTREEBRANCHNODE_H