-
Notifications
You must be signed in to change notification settings - Fork 0
/
LineOfCode.java
144 lines (107 loc) Β· 2.81 KB
/
LineOfCode.java
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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
/*
* This file is part of Jeso.
* Copyright (c) 2019-2021 Jonathan Bradley Whited
*
* SPDX-License-Identifier: LGPL-3.0-or-later
*/
package com.esotericpig.jeso.code;
/**
* @author Jonathan Bradley Whited
*/
public final class LineOfCode {
public static final LineOfCode FIRST = new LineOfCode();
private final int column;
private final int number;
protected LineOfCode() {
this(1,1);
}
public LineOfCode(final int number,final int column) {
this.column = column;
this.number = number;
}
public LineOfCode next() {
return new LineOfCode(number + 1,1);
}
public LineOfCode next(final int maxColumn) {
return next(maxColumn,1);
}
public LineOfCode next(final int maxColumn,int columnInc) {
columnInc = Math.abs(columnInc);
final int col = column + columnInc;
if(col > maxColumn) {
return new LineOfCode(number + 1,1);
}
return new LineOfCode(number,col);
}
public LineOfCode nextColumn() {
return nextColumn(1);
}
public LineOfCode nextColumn(final int columnInc) {
return new LineOfCode(number,column + columnInc);
}
public LineOfCode nextNumber() {
return nextNumber(1);
}
public LineOfCode nextNumber(final int numberInc) {
return new LineOfCode(number + numberInc,column);
}
public LineOfCode prev() {
return (number <= 1) ? FIRST : (new LineOfCode(number - 1,1));
}
public LineOfCode prev(final int maxColumn) {
return prev(maxColumn,1);
}
public LineOfCode prev(final int maxColumn,int columnDec) {
columnDec = Math.abs(columnDec);
final int col = column - columnDec;
if(col < 1) {
if(number <= 1) {
return FIRST;
}
return new LineOfCode(number - 1,maxColumn);
}
return new LineOfCode(number,col);
}
public LineOfCode prevColumn() {
return prevColumn(1);
}
public LineOfCode prevColumn(final int columnDec) {
return new LineOfCode(number,column - columnDec);
}
public LineOfCode prevNumber() {
return prevNumber(1);
}
public LineOfCode prevNumber(final int numberDec) {
return new LineOfCode(number - numberDec,column);
}
public int getColumn() {
return column;
}
public int getNumber() {
return number;
}
@Override
public boolean equals(Object obj) {
if(obj == this) {
return true;
}
if(!(obj instanceof LineOfCode)) {
return false;
}
LineOfCode loc = (LineOfCode)obj;
return column == loc.column && number == loc.number;
}
@Override
public int hashCode() {
int result = 1;
result = 31 * result + column;
result = 31 * result + number;
return result;
}
@Override
public String toString() {
StringBuilder str = new StringBuilder(9);
str.append('(').append(number).append(':').append(column).append(')');
return str.toString();
}
}