lkml.org 
[lkml]   [2010]   [Jun]   [15]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
SubjectRed back tree and scheduler usage
From
Hello,

I've a question regarding the usage of the red black tree done by the
scheduler. It seems that nodes with the same keys are allowed. However
I'm not sure if this is correct since rotations can break the binary
search tree property (key(left) < key(node) <= key(right)) in that
case. I'm not sure about the consequence though.

Could anybody confirm that this won't hurt ?

Thanks
--
Francis


\
 
 \ /
  Last update: 2010-06-15 15:03    [W:0.037 / U:0.044 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site