Skip to content
Snippets Groups Projects
Select Git revision
  • 9c66dbd373f70a27aca1ab67aaf2a97cffd7aa07
  • master default protected
  • release/202005
  • release/202001
  • release/201912
  • release/201911
  • release/releaseWindowsTestOne
  • release/windowsReleaseTest
  • release/releaseTest
  • release/releaseWindowsTest
  • release/201910
  • release/qt/201910
  • release/windows-test/201910
  • release/201908
  • release/201906
  • release/201905
  • release/201904
  • release/201903
  • release/201902
  • release/201901
  • release/201812
  • 4.0.0
  • 2.2.0
  • 2.1.0
  • 2.0.1
  • 2.0.0
  • 1.4.1
  • 1.4.0
  • 1.3.0
  • 1.2.0
  • 1.1.0
31 results

manager.cpp

Blame
  • Code owners
    Assign users and groups as approvers for specific file changes. Learn more.
    op_cache.cpp 6.77 KiB
    /*
     *  Copyright (C) 2018 Savoir-faire Linux Inc.
     *  Author(s) : Adrien Béraud <adrien.beraud@savoirfairelinux.com>
     *
     *  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 3 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, see <https://www.gnu.org/licenses/>.
     */
    #include "op_cache.h"
    
    namespace dht {
    
    constexpr const std::chrono::seconds OpCache::EXPIRATION;
    
    bool
    OpValueCache::onValuesAdded(const std::vector<Sp<Value>>& vals) {
        std::vector<Sp<Value>> newValues;
        for (const auto& v : vals) {
            auto viop = values.emplace(v->id, OpCacheValueStorage{v});
            if (viop.second) {
                newValues.emplace_back(v);
            } else {
                viop.first->second.refCount++;
            }
        }
        return newValues.empty() ? true : callback(newValues, false);
    }
    bool
    OpValueCache::onValuesExpired(const std::vector<Sp<Value>>& vals) {
        std::vector<Sp<Value>> expiredValues;
        for (const auto& v : vals) {
            auto vit = values.find(v->id);
            if (vit != values.end()) {
                vit->second.refCount--;
                if (not vit->second.refCount) {
                    expiredValues.emplace_back(std::move(vit->second.data));
                    values.erase(vit);
                }
            }
        }
        return expiredValues.empty() ? true : callback(expiredValues, true);
    }
    std::vector<Sp<Value>>
    OpValueCache::get(const Value::Filter& filter) const {
        std::vector<Sp<Value>> ret;
        if (not filter)
            ret.reserve(values.size());
        for (const auto& v : values)
            if (not filter or filter(*v.second.data))
                ret.emplace_back(v.second.data);
        return ret;
    }
    
    Sp<Value>
    OpValueCache::get(Value::Id id) const {
        auto v = values.find(id);
        if (v == values.end())
            return {};
        return v->second.data;
    }