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
|
// $Id: Offsets.cc,v 1.2 2002/10/04 13:44:00 flaterco Exp $
// Offsets: storage for tide offsets.
/*
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 2 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, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include "common.hh"
void LevelOffset::levelMultiply (double in_mult) {
assert (in_mult > 0.0);
mylevelMultiply = in_mult;
}
double LevelOffset::levelMultiply () const {
return mylevelMultiply;
};
LevelOffset::LevelOffset () {
mylevelMultiply = 1.0;
}
int
SimpleOffsets::is_simple() {
return 1;
}
int
HairyOffsets::is_simple() {
return 0;
}
SimpleOffsets::SimpleOffsets () {
mylevelMultiply = 1.0;
};
SimpleOffsets::SimpleOffsets (const CombinedOffset &co_in) {
levelAdd = co_in.levelAdd;
mylevelMultiply = co_in.levelMultiply();
timeAdd = co_in.timeAdd;
}
int operator== (CombinedOffset a, CombinedOffset b) {
if (a.timeAdd == b.timeAdd &&
a.levelMultiply() == b.levelMultiply() &&
a.levelAdd == b.levelAdd)
return 1;
return 0;
}
#if 0
ostream &operator<< (ostream &out, Offsets *o) {
if (!o) {
out << "{null offsets}";
} else {
if (o->is_simple()) {
SimpleOffsets *s = (SimpleOffsets *)o;
out << "{" << s->timeAdd << "," << s->levelMultiply()
<< "," << s->levelAdd << "}";
} else {
HairyOffsets *h = (HairyOffsets *)o;
out << "{max";
out << "{" << h->max.timeAdd << "," << h->max.levelMultiply()
<< "," << h->max.levelAdd << "}";
out << ",min";
out << "{" << h->min.timeAdd << "," << h->min.levelMultiply()
<< "," << h->min.levelAdd << "}";
out << ",flood " << h->floodbegins.timeAdd;
out << ", ebb " << h->ebbbegins.timeAdd;
out << "}";
}
}
return out;
}
#endif
HairyOffsets::HairyOffsets () {
// This space intentionally left blank.
}
HairyOffsets::HairyOffsets (const SimpleOffsets &s_in) {
max = min = s_in;
floodbegins.timeAdd = ebbbegins.timeAdd = s_in.timeAdd;
}
|
