Miko/baritone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

refactor and integrate redblacknode repo

Browse Source
This commit is contained in:
Leijurv
2023-03-21 00:36:43 -07:00
parent 3549a55f1e
commit 06590f487b
18 changed files with 334 additions and 148 deletions
Download Patch File Download Diff File Expand all files Collapse all files

23
src/test/java/com/github/btrekkie/interval_tree/IntervalTreeNode.java
View File

@@ -1,19 +1,30 @@
/*
* This file was originally written by btrekkie under the MIT license, which is compatible with the LGPL license for this usage within Baritone
* https://github.com/btrekkie/RedBlackNode/
*/
package com.github.btrekkie.interval_tree;
import com.github.btrekkie.red_black_node.RedBlackNode;
import baritone.builder.utils.com.github.btrekkie.red_black_node.RedBlackNode;
/**
* A node in an IntervalTree. See the comments for the implementation of IntervalTree. Its compareTo method orders
* nodes as suggested in the comments for the implementation of IntervalTree.
*/
class IntervalTreeNode extends RedBlackNode<IntervalTreeNode> {
/** The dummy leaf node. */
/**
* The dummy leaf node.
*/
public static final IntervalTreeNode LEAF = new IntervalTreeNode();
/** The interval stored in this node. */
/**
* The interval stored in this node.
*/
public IntervalTreeInterval interval;
/** The maximum ending value of an interval in the subtree rooted at this node. */
/**
* The maximum ending value of an interval in the subtree rooted at this node.
*/
public double maxEnd;
public IntervalTreeNode(IntervalTreeInterval interval) {
@@ -21,7 +32,9 @@ class IntervalTreeNode extends RedBlackNode<IntervalTreeNode> {
maxEnd = interval.end;
}
/** Constructs a new dummy leaf node. */
/**
* Constructs a new dummy leaf node.
*/
private IntervalTreeNode() {
interval = null;
maxEnd = Double.NEGATIVE_INFINITY;