[
https://issues.apache.org/jira/browse/COUCHDB-997?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=12974764#action_12974764
]
Robert Newson commented on COUCHDB-997:
---------------------------------------
I understand we don't want the cost of the check when it's a very rare event,
and I understand that usort will prevent dupes leaking in in, but I'm concerned
it will make finding the introduction point of dupes harder to find (actually
impossible, since they'll be generated and then deduped).
> Prevent multiple keys from entering a btree.
> --------------------------------------------
>
> Key: COUCHDB-997
> URL: https://issues.apache.org/jira/browse/COUCHDB-997
> Project: CouchDB
> Issue Type: Bug
> Reporter: Paul Joseph Davis
>
> s/sort/usort/ at
> https://github.com/apache/couchdb/blob/trunk/src/couchdb/couch_btree.erl#L181
> This should be completely transparent and incur minimal overhead. This hasn't
> bitten us quite yet, but it would've prevented some of the crazier behavior
> from COUCHDB-968
--
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.
