tursom/memgraph
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Remove changes on license date

Browse Source
This commit is contained in:
jbajic 2023-01-25 12:14:30 +01:00
parent 1b64a45f10
commit 87718aa084
9 changed files with 9 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/storage/v3/delta.hpp
View File

@ -14,8 +14,6 @@
#include <cstdint> #include <cstdint>
#include <memory> #include <memory>
#include <boost/uuid/uuid.hpp>
#include "storage/v3/edge_ref.hpp" #include "storage/v3/edge_ref.hpp"
#include "storage/v3/id_types.hpp" #include "storage/v3/id_types.hpp"
#include "storage/v3/property_value.hpp" #include "storage/v3/property_value.hpp"

4
src/storage/v3/indices.hpp
View File

@ -120,7 +120,7 @@ class LabelIndex {
[[nodiscard]] bool Empty() const noexcept { return index_.empty(); } [[nodiscard]] bool Empty() const noexcept { return index_.empty(); }
std::map<LabelId, IndexContainer> &GetIndex() { return index_; } std::map<LabelId, IndexContainer> &GetIndex() noexcept { return index_; }
private: private:
std::map<LabelId, IndexContainer> index_; std::map<LabelId, IndexContainer> index_;
@ -239,7 +239,7 @@ class LabelPropertyIndex {
[[nodiscard]] bool Empty() const noexcept { return index_.empty(); } [[nodiscard]] bool Empty() const noexcept { return index_.empty(); }
std::map<std::pair<LabelId, PropertyId>, IndexContainer> &GetIndex() { return index_; } std::map<std::pair<LabelId, PropertyId>, IndexContainer> &GetIndex() noexcept { return index_; }
private: private:
std::map<std::pair<LabelId, PropertyId>, IndexContainer> index_; std::map<std::pair<LabelId, PropertyId>, IndexContainer> index_;

10
src/storage/v3/shard_worker.hpp
View File

@ -1,4 +1,4 @@
// Copyright 2023 Memgraph Ltd. // Copyright 2022 Memgraph Ltd.
// //
// Use of this software is governed by the Business Source License // Use of this software is governed by the Business Source License
// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source // included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
@ -173,14 +173,6 @@ class ShardWorker {
auto &rsm = rsm_map_.at(uuid); auto &rsm = rsm_map_.at(uuid);
Time next_for_uuid = rsm.Cron(); Time next_for_uuid = rsm.Cron();
// Check if shard should split
// if (const auto split_info = rsm.ShouldSplit(); split_info) {
// Request split from coordinator
// split_point => middle pk
// shard_id => uuid
// shard_version =>
// }
cron_schedule_.pop(); cron_schedule_.pop();
cron_schedule_.push(std::make_pair(next_for_uuid, uuid)); cron_schedule_.push(std::make_pair(next_for_uuid, uuid));
} else { } else {

2
tests/simulation/request_router.cpp
View File

@ -1,4 +1,4 @@
// Copyright 2023 Memgraph Ltd. // Copyright 2022 Memgraph Ltd.
// //
// Use of this software is governed by the Business Source License // Use of this software is governed by the Business Source License
// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source // included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source

2
tests/simulation/sharded_map.cpp
View File

@ -1,4 +1,4 @@
// Copyright 2023 Memgraph Ltd. // Copyright 2022 Memgraph Ltd.
// //
// Use of this software is governed by the Business Source License // Use of this software is governed by the Business Source License
// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source // included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source

2
tests/simulation/test_cluster.hpp
View File

@ -1,4 +1,4 @@
// Copyright 2023 Memgraph Ltd. // Copyright 2022 Memgraph Ltd.
// //
// Use of this software is governed by the Business Source License // Use of this software is governed by the Business Source License
// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source // included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source

2
tests/unit/high_density_shard_create_scan.cpp
View File

@ -1,4 +1,4 @@
// Copyright 2023 Memgraph Ltd. // Copyright 2022 Memgraph Ltd.
// //
// Use of this software is governed by the Business Source License // Use of this software is governed by the Business Source License
// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source // included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source

2
tests/unit/machine_manager.cpp
View File

@ -1,4 +1,4 @@
// Copyright 2023 Memgraph Ltd. // Copyright 2022 Memgraph Ltd.
// //
// Use of this software is governed by the Business Source License // Use of this software is governed by the Business Source License
// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source // included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source

2
tests/unit/storage_v3_indices.cpp
View File

@ -1,4 +1,4 @@
// Copyright 2023 Memgraph Ltd. // Copyright 2022 Memgraph Ltd.
// //
// Use of this software is governed by the Business Source License // Use of this software is governed by the Business Source License
// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source // included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source