Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright 2016 The Chromium Authors. All rights reserved. | 1 // Copyright 2016 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #ifndef BLIMP_NET_HELIUM_VECTOR_CLOCK_H_ | 5 #ifndef BLIMP_NET_HELIUM_VECTOR_CLOCK_H_ |
| 6 #define BLIMP_NET_HELIUM_VECTOR_CLOCK_H_ | 6 #define BLIMP_NET_HELIUM_VECTOR_CLOCK_H_ |
| 7 | 7 |
| 8 #include <stdint.h> | 8 #include <stdint.h> |
| 9 | 9 |
| 10 #include "blimp/common/proto/helium.pb.h" | |
| 11 | |
| 10 namespace blimp { | 12 namespace blimp { |
| 11 | 13 |
| 12 // From wikipedia: | 14 // From wikipedia: |
| 13 // A vector clock is an algorithm for generating a partial ordering of events | 15 // A vector clock is an algorithm for generating a partial ordering of events |
| 14 // in a distributed system and detecting causality violations. This is used | 16 // in a distributed system and detecting causality violations. This is used |
| 15 // in Blimp to allow client and server modify a local copy of an object and | 17 // in Blimp to allow client and server modify a local copy of an object and |
| 16 // later be able to detect ordering or conflicts if any. | 18 // later be able to detect ordering or conflicts if any. |
| 17 // | 19 // |
| 18 // For more info see: | 20 // For more info see: |
| 19 // https://en.wikipedia.org/wiki/Vector_clock | 21 // https://en.wikipedia.org/wiki/Vector_clock |
| 20 | 22 |
| 21 typedef uint32_t Revision; | 23 typedef uint32_t Revision; |
| 22 | 24 |
| 23 class VectorClock { | 25 class VectorClock { |
|
Sriram
2016/09/29 18:52:21
Add comment on threading expectation of the object
| |
| 24 public: | 26 public: |
| 25 enum class Comparison { LessThan, EqualTo, GreaterThan, Conflict }; | 27 enum class Comparison { LessThan, EqualTo, GreaterThan, Conflict }; |
| 26 | 28 |
| 27 VectorClock(Revision local_revision, Revision remote_revision); | 29 VectorClock(Revision local_revision, Revision remote_revision); |
| 28 VectorClock(); | 30 VectorClock(); |
| 29 | 31 |
| 30 // Compares two vector clocks. There are 4 possibilities for the result: | 32 // Compares two vector clocks. There are 4 possibilities for the result: |
| 31 // * LessThan: One revision is equal and for the other is smaller. | 33 // * LessThan: One revision is equal and for the other is smaller. |
| 32 // (1,0).CompareTo((2, 0)); | 34 // (1,0).CompareTo((2, 0)); |
| 33 // * EqualTo: Both revisions are the same. | 35 // * EqualTo: Both revisions are the same. |
| (...skipping 15 matching lines...) Expand all Loading... | |
| 49 void set_local_revision(Revision local_revision) { | 51 void set_local_revision(Revision local_revision) { |
| 50 local_revision_ = local_revision; | 52 local_revision_ = local_revision; |
| 51 } | 53 } |
| 52 | 54 |
| 53 Revision remote_revision() const { return remote_revision_; } | 55 Revision remote_revision() const { return remote_revision_; } |
| 54 | 56 |
| 55 void set_remote_revision(Revision remote_revision) { | 57 void set_remote_revision(Revision remote_revision) { |
| 56 remote_revision_ = remote_revision; | 58 remote_revision_ = remote_revision; |
| 57 } | 59 } |
| 58 | 60 |
| 61 // Create the ProtoBuf object corresponding to this object | |
| 62 helium::VectorClock CreateProto(); | |
| 63 | |
| 64 // Inverts the local and remote components respectively | |
| 65 VectorClock Invert(); | |
|
Sriram
2016/09/29 18:52:21
Can you update the comment to tell when it would b
scf
2016/09/29 23:13:39
Done.
| |
| 66 | |
| 59 private: | 67 private: |
| 60 Revision local_revision_ = 0; | 68 Revision local_revision_ = 0; |
| 61 Revision remote_revision_ = 0; | 69 Revision remote_revision_ = 0; |
| 62 }; | 70 }; |
| 63 | 71 |
| 64 } // namespace blimp | 72 } // namespace blimp |
| 65 | 73 |
| 66 #endif // BLIMP_NET_HELIUM_VECTOR_CLOCK_H_ | 74 #endif // BLIMP_NET_HELIUM_VECTOR_CLOCK_H_ |
| OLD | NEW |