1 |
|
|
2 |
|
|
3 |
|
|
4 |
|
|
5 |
|
|
6 |
|
|
7 |
|
|
8 |
|
|
9 |
|
|
10 |
|
|
11 |
|
|
12 |
|
|
13 |
|
|
14 |
|
|
15 |
|
|
16 |
|
|
17 |
|
|
18 |
|
|
19 |
|
|
20 |
|
package org.xwiki.rendering.wikimodel.util.tmp; |
21 |
|
|
22 |
|
import java.util.ArrayDeque; |
23 |
|
import java.util.Deque; |
24 |
|
|
25 |
|
|
26 |
|
@version |
27 |
|
@since |
28 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (48) |
Complexity: 15 |
Complexity Density: 0.52 |
|
29 |
|
public class TreeBuilder1<T> |
30 |
|
{ |
|
|
| - |
Uncovered Elements: 0 (0) |
Complexity: 0 |
Complexity Density: - |
|
31 |
|
public interface ITreeBuilderListener<T> |
32 |
|
{ |
33 |
|
void beginItem(int depth, T data); |
34 |
|
|
35 |
|
void beginLevel(int depth, T prev); |
36 |
|
|
37 |
|
void endItem(int depth, T data); |
38 |
|
|
39 |
|
void endLevel(int i, T prev); |
40 |
|
} |
41 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (3) |
Complexity: 1 |
Complexity Density: 0.5 |
|
42 |
|
private static class Slot<T> |
43 |
|
{ |
44 |
|
private final T data; |
45 |
|
|
46 |
|
private final int val; |
47 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
48 |
7 |
public Slot(int pos, T data)... |
49 |
|
{ |
50 |
7 |
this.val = pos; |
51 |
7 |
this.data = data; |
52 |
|
} |
53 |
|
} |
54 |
|
|
55 |
|
private static final int MIN = Integer.MIN_VALUE; |
56 |
|
|
57 |
|
private boolean fIn; |
58 |
|
|
59 |
|
private boolean fInitialized; |
60 |
|
|
61 |
|
private ITreeBuilderListener<T> fListener; |
62 |
|
|
63 |
|
private T fPrev; |
64 |
|
|
65 |
|
private Deque<Slot<T>> fStack = new ArrayDeque<Slot<T>>(); |
66 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
67 |
1 |
public TreeBuilder1(ITreeBuilderListener<T> listener)... |
68 |
|
{ |
69 |
1 |
fListener = listener; |
70 |
|
} |
71 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (16) |
Complexity: 3 |
Complexity Density: 0.25 |
|
72 |
7 |
public void align(int val, T data)... |
73 |
|
{ |
74 |
7 |
trim(val, true); |
75 |
7 |
if (!fInitialized) { |
76 |
1 |
fInitialized = true; |
77 |
1 |
fIn = true; |
78 |
1 |
val = MIN; |
79 |
|
} |
80 |
7 |
Slot<T> slot = new Slot<T>(val, data); |
81 |
7 |
if (fIn) { |
82 |
3 |
fListener.beginLevel(fStack.size(), data); |
83 |
|
} |
84 |
7 |
fStack.push(slot); |
85 |
7 |
fListener.beginItem(fStack.size(), data); |
86 |
7 |
fPrev = data; |
87 |
7 |
fIn = true; |
88 |
|
} |
89 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
90 |
1 |
public void finish()... |
91 |
|
{ |
92 |
1 |
trim(MIN, true); |
93 |
|
} |
94 |
|
|
95 |
|
|
96 |
|
@param |
97 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
98 |
1 |
public void trim(int val)... |
99 |
|
{ |
100 |
1 |
trim(val, true); |
101 |
|
} |
102 |
|
|
103 |
|
|
104 |
|
@param |
105 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (24) |
Complexity: 9 |
Complexity Density: 0.64 |
|
106 |
10 |
public void trim(int val, boolean includeValue)... |
107 |
|
{ |
108 |
15 |
while (!fStack.isEmpty()) { |
109 |
14 |
Slot<T> peek = fStack.peek(); |
110 |
14 |
if (peek.val < val || peek.val == val && !includeValue) { |
111 |
7 |
break; |
112 |
|
} |
113 |
7 |
if (!fIn) { |
114 |
2 |
fListener.endLevel(fStack.size(), fPrev); |
115 |
|
} |
116 |
7 |
fStack.pop(); |
117 |
7 |
fListener.endItem(fStack.size(), peek.data); |
118 |
7 |
fIn = false; |
119 |
7 |
fPrev = peek.data; |
120 |
|
|
121 |
7 |
if (peek.val == val) { |
122 |
2 |
break; |
123 |
|
} |
124 |
|
} |
125 |
10 |
if (fInitialized && fStack.isEmpty()) { |
126 |
1 |
fListener.endLevel(fStack.size(), fPrev); |
127 |
|
} |
128 |
|
} |
129 |
|
} |