We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see ourdocumentation.
There was an error while loading.Please reload this page.
1 parent231bcd0 commit8716b26Copy full SHA for 8716b26
src/backend/access/nbtree/nbtinsert.c
@@ -173,9 +173,8 @@ _bt_doinsert(Relation rel, IndexTuple itup,
173
174
/*
175
* Check if the page is still the rightmost leaf page, has enough
176
- * free space to accommodate the new tuple, no split is in
177
- * progress, and the insertion scan key is strictly greater than
178
- * the first key on the page.
+ * free space to accommodate the new tuple, and the insertion
+ * scan key is strictly greater than the first key on the page.
179
*/
180
if (P_ISLEAF(lpageop)&&P_RIGHTMOST(lpageop)&&
181
!P_IGNORE(lpageop)&&
@@ -185,8 +184,8 @@ _bt_doinsert(Relation rel, IndexTuple itup,
185
184
P_FIRSTDATAKEY(lpageop))>0)
186
{
187
188
- * The right-most block should never have incomplete split. But
189
- * be paranoid and check for it anyway.
+ * The right-most block should never haveanincomplete split.
+ *Butbe paranoid and check for it anyway.
190
191
Assert(!P_INCOMPLETE_SPLIT(lpageop));
192
fastpath= true;