BIND 10 #2093: implement RBNode Node::getAbsoluteLabelSequence

[BIND 10 Development]

#2093: implement RBNode Node::getAbsoluteLabelSequence
-------------------------------------+-------------------------------------
                   Reporter:         |                 Owner:  jinmei
  jinmei                             |                Status:  reviewing
                       Type:  task   |             Milestone:
                   Priority:         |  Sprint-20120807
  medium                             |            Resolution:
                  Component:  data   |             Sensitive:  0
  source                             |           Sub-Project:  DNS
                   Keywords:         |  Estimated Difficulty:  5
            Defect Severity:  N/A    |           Total Hours:  0
Feature Depending on Ticket:         |
  scalable inmemory                  |
        Add Hours to Ticket:  0      |
                  Internal?:  0      |
-------------------------------------+-------------------------------------

Comment (by jinmei):

 Replying to [comment:13 jelte]:

 I've fixed one minor typo.  With that, I think the branch is okay for
 merge.

 One side note: I guess we'll need operator== for `LabelSequence`.
 I think it's a suboptimal way to test if two sequences are equal by
 converting a sequence to text for EXPECT_EQ() and comparing the
 results.

 > oh, btw, should we remove getName and getAbsoluteName?

 Eventually, but details of it will depend on how we deal with the
 wildcard case in the main in-memory data source implementation.
 See #2150.  If we use this shortcut to find a tree node for a wildcard
 name (like *.wild.example.com), we can simply remove the above two; if
 not, we'd first have to implement a way to construct a `LabelSequence`
 for the wildcard name before removing them.

 In either case, this will be for a later sprint.

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