@@ -1056,9 +1056,9 @@ bt_entry_unique_check(BtreeCheckState *state, IndexTuple itup,
10561056}
10571057
10581058/*
1059- * Prevent double reporting unique constraint violation between
1060- * the posting list entries of the first tuple on the page after
1061- * cross-page check.
1059+ * Prevent double reporting unique constraint violation
1060+ *between the posting list entries of the first tuple on the
1061+ *page after cross-page check.
10621062 */
10631063if (* lVis_block != targetblock && ItemPointerIsValid (* lVis_tid ))
10641064return ;
@@ -1072,8 +1072,8 @@ bt_entry_unique_check(BtreeCheckState *state, IndexTuple itup,
10721072}
10731073
10741074/*
1075- * Current tuple has no posting list. If TID is visible save info about
1076- *it for the next comparisons in the loop in bt_page_check(). Report
1075+ * Current tuple has no posting list. If TID is visible save info about it
1076+ * for the next comparisons in the loop in bt_page_check(). Report
10771077 * duplicate if lVis_tid is already valid.
10781078 */
10791079else
@@ -1694,8 +1694,8 @@ bt_target_page_check(BtreeCheckState *state)
16941694}
16951695
16961696/*
1697- * If the index is unique verify entries uniqueness by checking the heap
1698- * tuples visibility.
1697+ * If the index is unique verify entries uniqueness by checking the
1698+ *heap tuples visibility.
16991699 */
17001700if (state -> checkunique && state -> indexinfo -> ii_Unique &&
17011701P_ISLEAF (topaque )&& !skey -> anynullkeys )