1 |
| |
2 |
| |
3 |
| |
4 |
| |
5 |
| package org.easymock.internal; |
6 |
| |
7 |
| public class Range { |
8 |
| private int minimum; |
9 |
| |
10 |
| private int maximum; |
11 |
| |
12 |
121
| public Range(int count) {
|
13 |
121
| this(count, count);
|
14 |
| } |
15 |
| |
16 |
431
| public Range(int minimum, int maximum) {
|
17 |
431
| if (!(minimum <= maximum)) {
|
18 |
1
| throw new RuntimeExceptionWrapper(new IllegalArgumentException(
|
19 |
| "minimum must be <= maximum")); |
20 |
| } |
21 |
| |
22 |
430
| if (!(minimum >= 0)) {
|
23 |
1
| throw new RuntimeExceptionWrapper(new IllegalArgumentException(
|
24 |
| "minimum must be >= 0")); |
25 |
| } |
26 |
| |
27 |
429
| if (!(maximum >= 1)) {
|
28 |
1
| throw new RuntimeExceptionWrapper(new IllegalArgumentException(
|
29 |
| "maximum must be >= 1")); |
30 |
| } |
31 |
428
| this.minimum = minimum;
|
32 |
428
| this.maximum = maximum;
|
33 |
| } |
34 |
| |
35 |
158
| boolean hasFixedCount() {
|
36 |
158
| return minimum == maximum;
|
37 |
| } |
38 |
| |
39 |
578
| int getMaximum() {
|
40 |
578
| return maximum;
|
41 |
| } |
42 |
| |
43 |
328
| int getMinimum() {
|
44 |
328
| return minimum;
|
45 |
| } |
46 |
| |
47 |
132
| public String toString() {
|
48 |
132
| if (hasFixedCount()) {
|
49 |
119
| return "" + minimum;
|
50 |
13
| } else if (hasOpenCount()) {
|
51 |
10
| return "at least " + minimum;
|
52 |
| } else { |
53 |
3
| return "between " + minimum + " and " + maximum;
|
54 |
| } |
55 |
| } |
56 |
| |
57 |
132
| public String expectedAndActual(int count) {
|
58 |
132
| return "expected: " + this.toString() + ", actual: " + count;
|
59 |
| } |
60 |
| |
61 |
215
| boolean contains(int count) {
|
62 |
215
| return minimum <= count && count <= maximum;
|
63 |
| } |
64 |
| |
65 |
650
| boolean hasOpenCount() {
|
66 |
650
| return maximum == Integer.MAX_VALUE;
|
67 |
| } |
68 |
| } |