MtasTreeNode.java.html
2.85 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
65
66
67
68
69
70
<?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="../.resources/report.css" type="text/css"/><link rel="shortcut icon" href="../.resources/report.gif" type="image/gif"/><title>MtasTreeNode.java</title><link rel="stylesheet" href="../.resources/prettify.css" type="text/css"/><script type="text/javascript" src="../.resources/prettify.js"></script></head><body onload="window['PR_TAB_WIDTH']=4;prettyPrint()"><div class="breadcrumb" id="breadcrumb"><span class="info"><a href="../.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">MtasTreeNode.java</span></div><h1>MtasTreeNode.java</h1><pre class="source lang-java linenums">package mtas.codec.tree;
import java.util.HashMap;
/**
* The Class MtasTreeNode.
*
* @param <N>
* the number type
*/
abstract public class MtasTreeNode<N extends MtasTreeNode<N>> {
/** The left. */
public int left;
/** The right. */
public int right;
/** The max. */
public int max;
/** The left child. */
public N leftChild;
/** The right child. */
public N rightChild;
/** The ids. */
public HashMap<Integer, MtasTreeNodeId> ids;
// node with start and end position
/**
* Instantiates a new mtas tree node.
*
* @param left
* the left
* @param right
* the right
*/
<span class="fc" id="L40"> public MtasTreeNode(int left, int right) {</span>
<span class="fc" id="L41"> this.left = left;</span>
<span class="fc" id="L42"> this.right = right;</span>
<span class="fc" id="L43"> this.max = right;</span>
<span class="fc" id="L44"> this.ids = new HashMap<Integer, MtasTreeNodeId>();</span>
<span class="fc" id="L45"> }</span>
// add id to node
/**
* Adds the id and ref.
*
* @param id
* the id
* @param ref
* the ref
* @param additionalId
* the additional id
* @param additionalRef
* the additional ref
*/
final public void addIdAndRef(Integer id, Long ref, int additionalId,
long additionalRef) {
<span class="pc bpc" id="L62" title="1 of 2 branches missed."> if (id != null) {</span>
<span class="fc" id="L63"> MtasTreeNodeId tnId = new MtasTreeNodeId(ref, additionalId,</span>
additionalRef);
<span class="fc" id="L65"> ids.put(id, tnId);</span>
}
<span class="fc" id="L67"> }</span>
}
</pre><div class="footer"><span class="right">Created with <a href="http://www.eclemma.org/jacoco">JaCoCo</a> 0.7.5.201505241946</span></div></body></html>