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
|
/*
* Copyright © 2015 Canonical Ltd.
*
* This program is free software: you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License version 3,
* as published by the Free Software Foundation.
*
* 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 Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* Authored by: Manuel de la Pena <manuel.delapena@canonical.com>
*/
#include "time_based_update_policy.h"
namespace com
{
namespace ubuntu
{
namespace location
{
std::chrono::minutes TimeBasedUpdatePolicy::default_timeout()
{
static const std::chrono::minutes default_limit(2);
return default_limit;
}
TimeBasedUpdatePolicy::TimeBasedUpdatePolicy(std::chrono::minutes mins)
: limit(mins)
{
}
const location::Update<location::Position>& TimeBasedUpdatePolicy::verify_update(const location::Update<location::Position>& update)
{
std::lock_guard<std::mutex> guard(position_update_mutex);
bool use_new_update;
if (is_significantly_newer(last_position_update, update, limit))
{
use_new_update = true;
}
else if (is_significantly_older(last_position_update, update, limit))
{
use_new_update = false;
}
else
{
// if the update has happened within a reasonable amount of time we will just use it if it is more accurate
// that the previous one.
use_new_update = !last_position_update.value.accuracy.horizontal ||
(update.value.accuracy.horizontal
&& *last_position_update.value.accuracy.horizontal >= *update.value.accuracy.horizontal);
}
if (use_new_update)
{
last_position_update = update;
return update;
}
else
{
return last_position_update;
}
}
const location::Update<location::Heading>& TimeBasedUpdatePolicy::verify_update(const location::Update<location::Heading>& update)
{
std::lock_guard<std::mutex> guard(heading_update_mutex);
bool use_new_update;
if (is_significantly_newer(last_heading_update, update, limit))
{
use_new_update = true;
}
else if (is_significantly_older(last_heading_update, update, limit))
{
use_new_update = false;
}
if (use_new_update)
{
last_heading_update = update;
return update;
}
else
{
return last_heading_update;
}
}
const location::Update<location::Velocity>& TimeBasedUpdatePolicy::verify_update(const location::Update<location::Velocity>& update)
{
std::lock_guard<std::mutex> guard(velocity_update_mutex);
bool use_new_update;
if (is_significantly_newer(last_velocity_update, update, limit))
{
use_new_update = true;
}
else if (is_significantly_older(last_velocity_update, update, limit))
{
use_new_update = false;
}
if (use_new_update)
{
last_velocity_update = update;
return update;
}
else
{
return last_velocity_update;
}
}
}
}
}
|