| 1 |
|
|
| 2 |
|
|
| 3 |
|
|
| 4 |
|
|
| 5 |
|
|
| 6 |
|
|
| 7 |
|
|
| 8 |
|
|
| 9 |
|
package com.atlassian.core.util.bean; |
| 10 |
|
|
| 11 |
|
import java.io.Serializable; |
| 12 |
|
import java.util.ArrayList; |
| 13 |
|
import java.util.Collection; |
| 14 |
|
import java.util.Collections; |
| 15 |
|
import java.util.List; |
| 16 |
|
|
| 17 |
|
|
| 18 |
|
|
| 19 |
|
|
| 20 |
|
|
| 21 |
|
|
|
|
|
| 0% |
Uncovered Elements: 32 (32) |
Complexity: 12 |
Complexity Density: 0.67 |
|
| 22 |
|
public class PagerFilter implements Serializable |
| 23 |
|
{ |
| 24 |
|
int max = 20; |
| 25 |
|
int start = 0; |
| 26 |
|
|
| 27 |
|
|
| 28 |
|
|
| 29 |
|
|
|
|
|
| 0% |
Uncovered Elements: 17 (17) |
Complexity: 5 |
Complexity Density: 0.45 |
|
| 30 |
0
|
public Collection getCurrentPage(Collection itemsCol)... |
| 31 |
|
{ |
| 32 |
0
|
List items = null; |
| 33 |
|
|
| 34 |
0
|
if (itemsCol instanceof List) |
| 35 |
0
|
items = (List) itemsCol; |
| 36 |
|
else |
| 37 |
0
|
items = new ArrayList(itemsCol); |
| 38 |
|
|
| 39 |
0
|
if (items == null || items.size() == 0) |
| 40 |
|
{ |
| 41 |
0
|
start = 0; |
| 42 |
0
|
return Collections.EMPTY_LIST; |
| 43 |
|
} |
| 44 |
|
|
| 45 |
|
|
| 46 |
|
|
| 47 |
0
|
if (start > items.size()) |
| 48 |
|
{ |
| 49 |
0
|
start = 0; |
| 50 |
0
|
return items.subList(0, max); |
| 51 |
|
} |
| 52 |
|
else |
| 53 |
|
{ |
| 54 |
0
|
return items.subList(start, Math.min(start + max, items.size())); |
| 55 |
|
} |
| 56 |
|
} |
| 57 |
|
|
|
|
|
| 0% |
Uncovered Elements: 1 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 58 |
0
|
public int getMax()... |
| 59 |
|
{ |
| 60 |
0
|
return max; |
| 61 |
|
} |
| 62 |
|
|
|
|
|
| 0% |
Uncovered Elements: 1 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 63 |
0
|
public void setMax(int max)... |
| 64 |
|
{ |
| 65 |
0
|
this.max = max; |
| 66 |
|
} |
| 67 |
|
|
|
|
|
| 0% |
Uncovered Elements: 1 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 68 |
0
|
public int getStart()... |
| 69 |
|
{ |
| 70 |
0
|
return start; |
| 71 |
|
} |
| 72 |
|
|
|
|
|
| 0% |
Uncovered Elements: 1 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 73 |
0
|
public void setStart(int start)... |
| 74 |
|
{ |
| 75 |
0
|
this.start = start; |
| 76 |
|
} |
| 77 |
|
|
|
|
|
| 0% |
Uncovered Elements: 1 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 78 |
0
|
public int getEnd()... |
| 79 |
|
{ |
| 80 |
0
|
return start + max; |
| 81 |
|
} |
| 82 |
|
|
|
|
|
| 0% |
Uncovered Elements: 1 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 83 |
0
|
public int getNextStart()... |
| 84 |
|
{ |
| 85 |
0
|
return start + max; |
| 86 |
|
} |
| 87 |
|
|
|
|
|
| 0% |
Uncovered Elements: 1 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 88 |
0
|
public int getPreviousStart()... |
| 89 |
|
{ |
| 90 |
0
|
return Math.max(0, start - max); |
| 91 |
|
} |
| 92 |
|
} |