33
33
34
34
#include < tins/detail/sequence_number_helpers.h>
35
35
36
- using std::move;
37
-
38
36
using Tins::Internals::seq_compare;
39
37
40
38
namespace Tins {
@@ -67,7 +65,7 @@ bool DataTracker::process_payload(uint32_t seq, payload_type payload) {
67
65
}
68
66
bool added_some = false ;
69
67
// Store this payload
70
- store_payload (seq, move (payload));
68
+ store_payload (seq, std:: move (payload));
71
69
// Keep looping while the fragments seq is lower or equal to our seq
72
70
buffered_payload_type::iterator iter = buffered_payload_.find (seq_number_);
73
71
while (iter != buffered_payload_.end () && seq_compare (iter->first , seq_number_) <= 0 ) {
@@ -85,7 +83,7 @@ bool DataTracker::process_payload(uint32_t seq, payload_type payload) {
85
83
payload.begin (),
86
84
payload.begin () + (seq_number_ - iter->first )
87
85
);
88
- store_payload (seq_number_, move (iter->second ));
86
+ store_payload (seq_number_, std:: move (iter->second ));
89
87
iter = erase_iterator (iter);
90
88
}
91
89
else {
@@ -158,14 +156,14 @@ void DataTracker::store_payload(uint32_t seq, payload_type payload) {
158
156
// New segment, store it
159
157
if (iter == buffered_payload_.end ()) {
160
158
total_buffered_bytes_ += payload.size ();
161
- buffered_payload_.insert (make_pair (seq, move (payload)));
159
+ buffered_payload_.insert (make_pair (seq, std:: move (payload)));
162
160
}
163
161
else if (iter->second .size () < payload.size ()) {
164
162
// Increment by the diff between sizes
165
163
total_buffered_bytes_ += (payload.size () - iter->second .size ());
166
164
// If we already have payload on this position but it's a shorter
167
165
// chunk than the new one, replace it
168
- iter->second = move (payload);
166
+ iter->second = std:: move (payload);
169
167
}
170
168
}
171
169
0 commit comments