úÎ}=     Safe8The relations two vector clocks may find themselves in. BA vector clock is, conceptually, an associtive list sorted by the 5 value of the key, where each key appears only once. O(1). The empty vector clock. O(1)). A vector clock with a single element. O(N)0. Insert each entry in the list one at a time. O(1);. All the entries in the vector clock. Note that this is  not the inverse of . O(1). Is the vector clock empty? O(N).. The number of entries in the vector clock. O(N)3. Lookup the value for a key in the vector clock. O(N);. Is the given key a key in an entry of the vector clock? O(N)<. Delete an entry from the vector clock. If the requested % entry does not exist, does nothing. O(N)*. Insert or replace the entry for a key. O(N)". Increment the entry for a key. O(N)7. Increment the entry for a key. If the key does not # exist, assume it was the default.  O(max(N, M))-. Combine two vector clocks entry-by-entry.  O(max(N, M))). The maximum of the two vector clocks.  O(min(N, M))/. The relation between the two vector clocks.  O(min(N, M)). Short-hand for relation vc1 vc2 == Causes. O(N)3. Check whether the vector clock is valid or not.      Safe      vector-clock-0.1.2Data.VectorClock.SimpleData.VectorClockRelation ConcurrentCausedByCauses VectorClockempty singletonfromListtoListnullsizelookupmemberdeleteinsertincincWithDefaultcombinemaxrelationcausesvalid$fBinaryVectorClock$fShowVectorClock