+ changed = true;
+ }
+
+ return changed;
+}
+
+/**
+ * Merge a clock vector into this vector, using a pairwise comparison. The
+ * resulting vector length will be the maximum length of the two being merged.
+ * @param cv is the ClockVector being merged into this vector.
+ */
+bool ClockVector::minmerge(const ClockVector *cv)
+{
+ ASSERT(cv != NULL);
+ bool changed = false;
+ if (cv->num_threads > num_threads) {
+ clock = (modelclock_t *)snapshot_realloc(clock, cv->num_threads * sizeof(modelclock_t));
+ for (int i = num_threads;i < cv->num_threads;i++)
+ clock[i] = 0;
+ num_threads = cv->num_threads;
+ }
+
+ /* Element-wise minimum */
+ for (int i = 0;i < cv->num_threads;i++)
+ if (cv->clock[i] < clock[i]) {
+ clock[i] = cv->clock[i];
+ changed = true;
+ }
+
+ return changed;