@Override
		public int compareTo(LeastAreaEnlargementThenLeastArea that) {
			int result;
			result = Double.compare(this.areaEnlargement, that.areaEnlargement);
			if (result != 0) {
				return result;
			}
			result = Double.compare(this.area, that.area);
			if (result != 0) {
				return result;
			}
			return 0;
		}
An R*-Tree implementation of {@link AbstractConstraintsTree}

<p>
The implementation follows
<a href="http://dbs.mathematik.uni-marburg.de/publications/myPapers/1990/BKSS90.pdf">The R*-tree:
An Efficient and Robust Access Method for Points and Rectangles</a>. Comments in code referring
to "the paper", specific sections, or steps of algorithms, are referring specifically to that
paper.

@param <DS> The shape of each data entry
@param <DR> The record type for each data entry
@param <NS> The shape of each node
@param <NR> The record type for each node
@param <T> The type of value stored in a data entry
@param <Q> The type of supported queries
Ghidra/Debug/ProposedUtils/src/main/java/ghidra/util/database/spatial/AbstractRStarConstraintsTree.java