BIND 10 #397: Port generic red-black tree (RBT) data structure from BIND-9
BIND 10 Development
do-not-reply at isc.org
Tue Dec 7 06:21:43 UTC 2010
#397: Port generic red-black tree (RBT) data structure from BIND-9
------------------------------+---------------------------------------------
Reporter: zzchen_pku | Owner: hanfeng
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 |
------------------------------+---------------------------------------------
Changes (by jinmei):
* owner: jinmei => hanfeng
Comment:
Replying to [comment:24 jinmei]:
> Anyway: for this sprint, we only need a much smaller subset of the
feature we're currently having. Specifically:
> - create the table
> - insert entries
> - find a longest match entry
>
> We don't need to erase entries; we don't need iterators. Can we focus
on a subset of this branch that only covers the 3 crucial points? It will
help complete the review process faster and give us time to work on other
tasks. The rest of the features/code will be a subject of future sprints.
>
I've created a sub branch named "trac397focused" based on the latest
version of trac397, and made suggested initial changes including:
- limit the features to those we need for this sprint
- rename the file (for not still called rbt(ree))
- remove the place to store the file from auth to datasrc
Is it okay to continue our review on this focused branch? (note: it
doesn't mean trac397 is dead. We'll import additional features from it as
we see the need for them in future sprints).
Giving the ticket back to Feng at this point.
--
Ticket URL: <http://bind10.isc.org/ticket/397#comment:26>
BIND 10 Development <http://bind10.isc.org>
BIND 10 Development
More information about the bind10-tickets
mailing list