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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
|
/*
* Copyright 2015 Anton Tananaev (anton.tananaev@gmail.com)
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.traccar.helper;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class Parser {
private int position;
private Matcher matcher;
public Parser(Pattern pattern, String input) {
matcher = pattern.matcher(input);
}
public boolean matches() {
position = 1;
return matcher.matches();
}
public boolean find() {
position = 1;
return matcher.find();
}
public boolean hasNext() {
return hasNext(1);
}
public boolean hasNext(int number) {
if (matcher.group(position) != null) {
return true;
} else {
position += number;
return false;
}
}
public String next() {
return matcher.group(position++);
}
public int nextInt() {
return nextInt(10);
}
public int nextInt(int radix) {
if (hasNext()) {
return Integer.parseInt(next(), radix);
} else {
return 0;
}
}
public long nextLong() {
return nextLong(10);
}
public long nextLong(int radix) {
if (hasNext()) {
return Long.parseLong(next(), radix);
} else {
return 0;
}
}
public double nextDouble() {
if (hasNext()) {
return Double.parseDouble(next());
} else {
return 0.0;
}
}
public enum CoordinateFormat {
DEG_DEG,
DEG_HEM,
DEG_MIN_MIN,
DEG_MIN_HEM,
DEG_MIN_MIN_HEM,
HEM_DEG_MIN_MIN,
HEM_DEG,
HEM_DEG_MIN,
HEM_DEG_MIN_HEM
}
public double nextCoordinate(CoordinateFormat format) {
double coordinate;
String hemisphere = null;
switch (format) {
case DEG_DEG:
coordinate = Double.parseDouble(next() + '.' + next());
break;
case DEG_HEM:
coordinate = nextDouble();
hemisphere = next();
break;
case DEG_MIN_MIN:
coordinate = nextInt();
coordinate += Double.parseDouble(next() + '.' + next()) / 60;
break;
case DEG_MIN_MIN_HEM:
coordinate = nextInt();
coordinate += Double.parseDouble(next() + '.' + next()) / 60;
hemisphere = next();
break;
case HEM_DEG:
hemisphere = next();
coordinate = nextDouble();
break;
case HEM_DEG_MIN:
hemisphere = next();
coordinate = nextInt();
coordinate += nextDouble() / 60;
break;
case HEM_DEG_MIN_HEM:
hemisphere = next();
coordinate = nextInt();
coordinate += nextDouble() / 60;
if (hasNext()) {
hemisphere = next();
}
break;
case HEM_DEG_MIN_MIN:
hemisphere = next();
coordinate = nextInt();
coordinate += Double.parseDouble(next() + '.' + next()) / 60;
break;
case DEG_MIN_HEM:
default:
coordinate = nextInt();
coordinate += nextDouble() / 60;
hemisphere = next();
break;
}
if (hemisphere != null && (hemisphere.equals("S") || hemisphere.equals("W") || hemisphere.equals("-"))) {
coordinate = -coordinate;
}
return coordinate;
}
public double nextCoordinate() {
return nextCoordinate(CoordinateFormat.DEG_MIN_HEM);
}
}
|
