Slightly simplify nbtree split point choice loop.

Spotted during post-commit review of the nbtree deduplication commit
(commit 0d861bbb).
This commit is contained in:
Peter Geoghegan 2020-04-15 15:47:26 -07:00
parent 8f4ee44bcd
commit f0ca378d4c

View File

@ -820,18 +820,14 @@ _bt_bestsplitloc(FindSplitData *state, int perfectpenalty,
penalty = _bt_split_penalty(state, state->splits + i);
if (penalty <= perfectpenalty)
{
bestpenalty = penalty;
lowsplit = i;
break;
}
if (penalty < bestpenalty)
{
bestpenalty = penalty;
lowsplit = i;
}
if (penalty <= perfectpenalty)
break;
}
final = &state->splits[lowsplit];