humotion / src / timestamped_list.cpp @ f311c844
History | View | Annotate | Download (6.762 KB)
1 |
/*
|
---|---|
2 |
* This file is part of humotion
|
3 |
*
|
4 |
* Copyright(c) sschulz <AT> techfak.uni-bielefeld.de
|
5 |
* http://opensource.cit-ec.de/projects/humotion
|
6 |
*
|
7 |
* This file may be licensed under the terms of the
|
8 |
* GNU Lesser General Public License Version 3 (the ``LGPL''),
|
9 |
* or (at your option) any later version.
|
10 |
*
|
11 |
* Software distributed under the License is distributed
|
12 |
* on an ``AS IS'' basis, WITHOUT WARRANTY OF ANY KIND, either
|
13 |
* express or implied. See the LGPL for the specific language
|
14 |
* governing rights and limitations.
|
15 |
*
|
16 |
* You should have received a copy of the LGPL along with this
|
17 |
* program. If not, go to http://www.gnu.org/licenses/lgpl.html
|
18 |
* or write to the Free Software Foundation, Inc.,
|
19 |
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
20 |
*
|
21 |
* The development of this software was supported by the
|
22 |
* Excellence Cluster EXC 277 Cognitive Interaction Technology.
|
23 |
* The Excellence Cluster EXC 277 is a grant of the Deutsche
|
24 |
* Forschungsgemeinschaft (DFG) in the context of the German
|
25 |
* Excellence Initiative.
|
26 |
*/
|
27 |
|
28 |
#include <assert.h> |
29 |
|
30 |
#include "humotion/timestamped_list.h" |
31 |
|
32 |
using boost::mutex;
|
33 |
using humotion::TimestampedList;
|
34 |
|
35 |
TimestampedList::TimestampedList(unsigned int s) { |
36 |
// initialize the list to its desired size:
|
37 |
TimestampedFloat now; |
38 |
tsf_list_.resize(s, now); |
39 |
} |
40 |
|
41 |
TimestampedList::TimestampedList(TimestampedList const &l) {
|
42 |
// lock the tsf_list for this access. by doing this we assure
|
43 |
// that no other thread accessing this element can diturb the
|
44 |
// following atomic instructions:
|
45 |
mutex::scoped_lock scoped_lock(l.access_mutex_); |
46 |
|
47 |
// now do a deep copy with locking!
|
48 |
tsf_list_ = l.tsf_list_; |
49 |
} |
50 |
|
51 |
void TimestampedList::copy_tsf_list_to(timestamped_float_list_t *target) {
|
52 |
// lock the tsf_list for this access. by doing this we assure
|
53 |
// that no other thread accessing this element can diturb the
|
54 |
// following atomic instructions:
|
55 |
mutex::scoped_lock scoped_lock(access_mutex_); |
56 |
|
57 |
*target = tsf_list_; |
58 |
} |
59 |
|
60 |
|
61 |
humotion::Timestamp TimestampedList::get_first_timestamp() { |
62 |
// lock the tsf_list for this access. by doing this we assure
|
63 |
// that no other thread accessing this element can diturb the
|
64 |
// following atomic instructions:
|
65 |
mutex::scoped_lock scoped_lock(access_mutex_); |
66 |
|
67 |
if (tsf_list_.empty()) {
|
68 |
return Timestamp(0, 0); |
69 |
} |
70 |
|
71 |
timestamped_float_list_t::iterator it = tsf_list_.begin(); |
72 |
return it->timestamp;
|
73 |
} |
74 |
|
75 |
humotion::Timestamp TimestampedList::get_last_timestamp() { |
76 |
// lock the tsf_list for this access. by doing this we assure
|
77 |
// that no other thread accessing this element can diturb the
|
78 |
// following atomic instructions:
|
79 |
mutex::scoped_lock scoped_lock(access_mutex_); |
80 |
|
81 |
if (tsf_list_.empty()) {
|
82 |
return Timestamp(0, 0); |
83 |
} |
84 |
|
85 |
timestamped_float_list_t::iterator it = tsf_list_.end(); |
86 |
it--; |
87 |
return it->timestamp;
|
88 |
} |
89 |
|
90 |
void TimestampedList::insert(Timestamp timestamp, float val) { |
91 |
// erase first element:
|
92 |
tsf_list_.pop_front(); |
93 |
tsf_list_.push_back(TimestampedFloat(timestamp, val)); |
94 |
// printf("insert [%5.3f] = %5.1f\n",timestamp,val);
|
95 |
} |
96 |
|
97 |
float TimestampedList::get_newest_value() {
|
98 |
// lock the tsf_list for this access. by doing this we assure
|
99 |
// that no other thread accessing this element can diturb the
|
100 |
// following atomic instructions:
|
101 |
mutex::scoped_lock scoped_lock(access_mutex_); |
102 |
|
103 |
if (tsf_list_.empty()) {
|
104 |
printf("> WARNING: requested newest value from empty list, returning 0.0\n");
|
105 |
return 0.0; |
106 |
} |
107 |
|
108 |
timestamped_float_list_t::iterator it = tsf_list_.end(); |
109 |
it--; |
110 |
return it->value;
|
111 |
} |
112 |
|
113 |
float TimestampedList::get_interpolated_value(Timestamp target_ts) {
|
114 |
// lock the tsf_list for this access. by doing this we assure
|
115 |
// that no other thread accessing this element can diturb the
|
116 |
// following atomic instructions:
|
117 |
mutex::scoped_lock scoped_lock(access_mutex_); |
118 |
|
119 |
TimestampedFloat previous; |
120 |
// printf("> latency %3.2fms\n", (Timestamped().to_seconds() - target_ts.to_seconds())*1000.0);
|
121 |
|
122 |
for ( timestamped_float_list_t::iterator it = tsf_list_.begin(); it != tsf_list_.end(); ++it ) {
|
123 |
if (it->timestamp >= target_ts) {
|
124 |
// ok found close target
|
125 |
if (it == tsf_list_.begin()) {
|
126 |
// no preceding element
|
127 |
printf("> warning, timestamp %6.3f smaller than first element %6.3f in timestamped"
|
128 |
"list. this should not happen (increase ts buffer?)\n",
|
129 |
target_ts.to_seconds(), tsf_list_.begin()->timestamp.to_seconds()); |
130 |
return it->value;
|
131 |
} else {
|
132 |
// do interpolation
|
133 |
return interpolate(*it, previous, target_ts);
|
134 |
} |
135 |
} |
136 |
previous = *it; |
137 |
} |
138 |
|
139 |
// we reached the end, return the last value
|
140 |
printf("> warning: found no timestamp >= than %f in timestamped list...\n",
|
141 |
target_ts.to_seconds()); |
142 |
printf(" this should not happen as images will always be behind\n");
|
143 |
printf(" the motor data. returning most recent value (ts=%f)\n",
|
144 |
previous.timestamp.to_seconds()); |
145 |
|
146 |
return previous.value;
|
147 |
} |
148 |
|
149 |
float TimestampedList::interpolate(TimestampedFloat a, TimestampedFloat b, Timestamp timestamp) {
|
150 |
// a->timestamp < timestamp <= b->timestamp
|
151 |
double dist_a = timestamp.to_seconds() - a.timestamp.to_seconds();
|
152 |
double dist_b = b.timestamp.to_seconds() - timestamp.to_seconds();
|
153 |
double dist = dist_a + dist_b;
|
154 |
|
155 |
float interpolation = a.value + (dist_a / dist) * (b.value - a.value);
|
156 |
return interpolation;
|
157 |
} |
158 |
|
159 |
|
160 |
// tests
|
161 |
void TimestampedList::run_tests() {
|
162 |
int size = 10; |
163 |
TimestampedList list(size); |
164 |
|
165 |
for (int i = 0; i < size; i++) { |
166 |
list.insert(Timestamp(i * 100.0, 0), i*10.0); |
167 |
} |
168 |
|
169 |
// test algorithm:
|
170 |
|
171 |
// test exact match:
|
172 |
for (int i =0 ; i < size; i++) { |
173 |
Timestamp ts(i*100.0, 0); |
174 |
printf("> testing get_interpolated_value(%f) == %f (value read back = %f)\n",
|
175 |
ts.to_seconds(), i*10.0, list.get_interpolated_value(ts)); |
176 |
assert(list.get_interpolated_value(ts) == i*10.0); |
177 |
} |
178 |
printf("passed test 1\n");
|
179 |
|
180 |
assert(list.get_interpolated_value(Timestamp(0.0, 0)) == 0.0); |
181 |
assert(list.get_interpolated_value(Timestamp(110.0, 0)) == 11.0); |
182 |
assert(list.get_interpolated_value(Timestamp(150.0, 0)) == 15.0); |
183 |
assert(list.get_interpolated_value(Timestamp(999990.0, 0)) == 90.0); |
184 |
|
185 |
printf("passed test 2\n");
|
186 |
|
187 |
list.insert(Timestamp(1000.0, 0), 200.0); |
188 |
list.insert(Timestamp(1300.0, 0), -100.0); |
189 |
assert(list.get_interpolated_value(Timestamp(1100, 0)) == 100.0); |
190 |
assert(list.get_interpolated_value(Timestamp(1200, 0)) == 0.0); |
191 |
assert(list.get_interpolated_value(Timestamp(1300, 0)) == -100.0); |
192 |
assert(list.get_interpolated_value(Timestamp(1250, 0)) == -50.0); |
193 |
|
194 |
printf("passed test 3\n");
|
195 |
exit(EXIT_SUCCESS); |
196 |
} |