blob: 288dadccf2832b93a2f4604eaff265bfc1564246 [file] [log] [blame]
// Copyright 2015 The Weave Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "src/states/state_change_queue.h"
#include <base/logging.h>
namespace weave {
StateChangeQueue::StateChangeQueue(size_t max_queue_size)
: max_queue_size_(max_queue_size) {
CHECK_GT(max_queue_size_, 0U) << "Max queue size must not be zero";
bool StateChangeQueue::NotifyPropertiesUpdated(base::Time timestamp,
ValueMap changed_properties) {
auto& stored_changes = state_changes_[timestamp];
// Merge the old property set.
changed_properties.insert(stored_changes.begin(), stored_changes.end());
stored_changes = std::move(changed_properties);
while (state_changes_.size() > max_queue_size_) {
// Queue is full.
// Merge the two oldest records into one. The merge strategy is:
// - Move non-existent properties from element [old] to [new].
// - If both [old] and [new] specify the same property,
// keep the value of [new].
// - Keep the timestamp of [new].
auto element_old = state_changes_.begin();
auto element_new = std::next(element_old);
// This will skip elements that exist in both [old] and [new].
return true;
std::vector<StateChange> StateChangeQueue::GetAndClearRecordedStateChanges() {
std::vector<StateChange> changes;
for (const auto& pair : state_changes_) {
changes.emplace_back(pair.first, std::move(pair.second));
return changes;
StateChangeQueueInterface::Token StateChangeQueue::AddOnStateUpdatedCallback(
const base::Callback<void(UpdateID)>& callback) {
if (state_changes_.empty())
return Token{callbacks_.Add(callback).release()};
void StateChangeQueue::NotifyStateUpdatedOnServer(UpdateID update_id) {
} // namespace weave