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
|
// $Id: StationRef.cc 2641 2007-09-02 21:31:02Z flaterco $
/* StationRef Index information for a station in a harmonics file.
Copyright (C) 1998 David Flater.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "common.hh"
#include "HarmonicsFile.hh"
Station * const StationRef::load() const {
HarmonicsFile h (harmonicsFileName);
return h.getStation (*this);
}
StationRef::StationRef (const Dstr &harmonicsFileName_,
uint32_t recordNumber_,
const Dstr &name_,
const Coordinates &coordinates_,
const Dstr &timezone_,
bool isReferenceStation_):
harmonicsFileName(harmonicsFileName_),
recordNumber(recordNumber_),
name(name_),
coordinates(coordinates_),
timezone(timezone_),
isReferenceStation(isReferenceStation_) {}
const bool sortByName (const StationRef *x, const StationRef *y) {
return (dstrcasecmp (x->name, y->name) < 0);
}
const bool sortByLat (const StationRef *x, const StationRef *y) {
const Coordinates &left = x->coordinates;
const Coordinates &right = y->coordinates;
if (left.isNull())
return (!(right.isNull()));
if (right.isNull())
return false;
return (left.lat() < right.lat());
}
const bool sortByLng (const StationRef *x, const StationRef *y) {
const Coordinates &left = x->coordinates;
const Coordinates &right = y->coordinates;
if (left.isNull())
return (!(right.isNull()));
if (right.isNull())
return false;
return (left.lng() < right.lng());
}
// Cleanup2006 Done
|
