BIND 10 #397: Port generic red-black tree (RBT) data structure from BIND-9

[BIND 10 Development]

#397: Port generic red-black tree (RBT) data structure from BIND-9
------------------------------+---------------------------------------------
      Reporter:  zzchen_pku   |        Owner:  jinmei   
          Type:  enhancement  |       Status:  reviewing
      Priority:  major        |    Milestone:           
     Component:  data source  |   Resolution:           
      Keywords:               |    Sensitive:  0        
Estimatedhours:  0.0          |        Hours:  0        
      Billable:  1            |   Totalhours:  0        
      Internal:  0            |  
------------------------------+---------------------------------------------

Comment(by jinmei):

 I'd like to propose constifying methods/temporary variables as much as
 possible.  I've committed a proposed change to the branch (r3611).  Please
 check.

 Making find(), findHelper(), successor() const may be controversial, and,
 in fact, I suspect we'll eventually see the need for getting a mutable
 node via find() (e.g., when manipulating RRsets for a rbt node) but I
 believe in that case we should provide both mutable and immutable version
 of find() just like std::map::find() has two versions.

 (to be continued)

-- 
Ticket URL: <http://bind10.isc.org/ticket/397#comment:17>
BIND 10 Development <http://bind10.isc.org>
BIND 10 Development