/* ----
* Check whether we are interested in this specific transaction, and tell
- * the the reorderbuffer to forget the content of the (sub-)transactions
+ * the reorderbuffer to forget the content of the (sub-)transactions
* if not.
*
* There basically two reasons we might not be interested in this
* perform the use-case dependent, actual, work.
*
* Needs to be called while in a memory context that's at least as long lived
- * as the the decoding context because further memory contexts will be created
+ * as the decoding context because further memory contexts will be created
* inside it.
*
* Returns an initialized decoding context after calling the output plugin's
* perform the use-case dependent, actual, work.
*
* Needs to be called while in a memory context that's at least as long lived
- * as the the decoding context because further memory contexts will be created
+ * as the decoding context because further memory contexts will be created
* inside it.
*
* Returns an initialized decoding context after calling the output plugin's
* * A tuple with a cmin but no cmax (and thus no combocid) got
* deleted/updated in another transaction than the one which created it
* which we are looking at right now. As only one of cmin, cmax or combocid
- * is actually stored in the heap we don't have access to the the value we
+ * is actually stored in the heap we don't have access to the value we
* need anymore.
*
* To resolve those problems we have a per-transaction hash of (cmin,
/*
* Acquire XidGenLock, so no transactions can acquire an xid while we're
* running. If no transaction with xid were running concurrently a new xid
- * could influence the the RecentXmin et al.
+ * could influence the RecentXmin et al.
*
* We initialize the computation to nextXid since that's guaranteed to be
* a safe, albeit pessimal, value.