/// It takes the (partial) name of the node itself, and extends it
/// with all upper nodes.
///
- /// The label sequence that is returned should therefore always be
- /// absolute.
- ///
/// \note Care must be taken with the buffer that is used here; this
/// method overwrites its data, so it should not be associated with
/// any other LabelSequence during the lifetime of the LabelSequence
int name_count = sizeof(domain_names) / sizeof(domain_names[0]);
uint8_t buf[LabelSequence::MAX_SERIALIZED_LENGTH];
for (int i = 0; i < name_count; ++i) {
- EXPECT_EQ(RBTree<int>::EXACTMATCH, rbtree.find(Name(domain_names[i]), &crbtnode));
+ EXPECT_EQ(RBTree<int>::EXACTMATCH, rbtree.find(Name(domain_names[i]),
+ &crbtnode));
// First make sure the names themselves are not absolute
LabelSequence ls(crbtnode->getLabels());