Timeline for Red-black tree appears to be slower than std::multimap
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 22, 2022 at 10:02 | comment | added | greybeard |
10% slower I don't see remove() & rbt_rotate(). Include find()in the performance model. One thing to try: Get rid of field parent. rbt_add() seems to leak memory with present keys. For a problem with lower_bound try the root's key in a non-trivial tree.
|
|
| Dec 6, 2016 at 2:27 | history | tweeted | twitter.com/StackCodeReview/status/805961859446767616 | ||
| Dec 5, 2016 at 7:44 | history | edited | 200_success | CC BY-SA 3.0 |
Froze GitHub commit
|
| Dec 5, 2016 at 6:53 | history | reopened |
Phrancis janos |
||
| Dec 5, 2016 at 6:52 | history | undeleted |
Gaslight Deceive Subvert Phrancis Heslacher |
||
| Nov 17, 2016 at 3:00 | history | deleted | CommunityBot | Scheduled: RemoveAbandonedClosed | |
| Nov 7, 2016 at 15:46 | history | closed |
forsvarir t3chb0t 301_Moved_Permanently Emily L. Graipher |
Needs details or clarity | |
| Nov 7, 2016 at 12:22 | history | edited | Gaslight Deceive Subvert | CC BY-SA 3.0 |
added 220 characters in body
|
| Nov 7, 2016 at 0:39 | history | edited | Jamal | CC BY-SA 3.0 |
added 23 characters in body; edited title
|
| Nov 7, 2016 at 0:07 | review | Close votes | |||
| Nov 7, 2016 at 15:46 | |||||
| Nov 6, 2016 at 23:49 | comment | added | forsvarir |
Code in questions should ideally be sufficient to understand on their own. The definition for rbtree would seem to be a key piece of information currently missing from your question. As far as 'hottest part of my code is my loop for inserting', the rest of your description suggests that it's actually the deletion code that is slower so you probably want to be focusing on the deletion profiling, not the insertion.
|
|
| Nov 5, 2016 at 0:30 | history | asked | Gaslight Deceive Subvert | CC BY-SA 3.0 |