IntervalTreeNode.java.html
2.76 KB
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
<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"><html xmlns="http://www.w3.org/1999/xhtml" lang="en"><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8"/><link rel="stylesheet" href="../jacoco-resources/report.css" type="text/css"/><link rel="shortcut icon" href="../jacoco-resources/report.gif" type="image/gif"/><title>IntervalTreeNode.java</title><link rel="stylesheet" href="../jacoco-resources/prettify.css" type="text/css"/><script type="text/javascript" src="../jacoco-resources/prettify.js"></script></head><body onload="window['PR_TAB_WIDTH']=4;prettyPrint()"><div class="breadcrumb" id="breadcrumb"><span class="info"><a href="../jacoco-sessions.html" class="el_session">Sessions</a></span><a href="../index.html" class="el_report">MTAS</a> > <a href="index.source.html" class="el_package">mtas.codec.tree</a> > <span class="el_source">IntervalTreeNode.java</span></div><h1>IntervalTreeNode.java</h1><pre class="source lang-java linenums">package mtas.codec.tree;
import java.util.ArrayList;
import mtas.codec.util.CodecSearchTree.MtasTreeHit;
/**
* The Class IntervalTreeNode.
*
* @param <T> the generic type
* @param <N> the number type
*/
abstract public class IntervalTreeNode<T, N extends IntervalTreeNode<T, N>> {
/** The left. */
public int left;
/** The right. */
public int right;
/** The max. */
public int max;
/** The min. */
public int min;
/** The left child. */
public N leftChild;
/** The right child. */
public N rightChild;
/** The lists. */
public ArrayList<ArrayList<MtasTreeHit<T>>> lists;
// node with start and end position
/**
* Instantiates a new interval tree node.
*
* @param left the left
* @param right the right
*/
<span class="fc" id="L43"> public IntervalTreeNode(int left, int right) {</span>
<span class="fc" id="L44"> this.left = left;</span>
<span class="fc" id="L45"> this.right = right;</span>
<span class="fc" id="L46"> min = left;</span>
<span class="fc" id="L47"> max = right;</span>
<span class="fc" id="L48"> lists = new ArrayList<ArrayList<MtasTreeHit<T>>>();</span>
<span class="fc" id="L49"> }</span>
// add id to node
/**
* Adds the list.
*
* @param list the list
*/
final public void addList(ArrayList<MtasTreeHit<T>> list) {
<span class="pc bpc" id="L58" title="1 of 2 branches missed."> if (list != null) {</span>
<span class="fc" id="L59"> lists.add(list);</span>
}
<span class="fc" id="L61"> }</span>
}
</pre><div class="footer"><span class="right">Created with <a href="http://www.jacoco.org/jacoco">JaCoCo</a> 0.7.9.201702052155</span></div></body></html>