[Nfd-dev] Insertion in name tree

[Bruno Ricci]

Dear all,

I have a small question regarding how insertions on name tree are made.

Suppose one has a name, for instance /aaaaa/bbbbb/ccccc/ddddd/eeeee. 
Running nfdc register, I noticed that while the lookup operation is made 
on the entire prefix, the insertion operation on name-tree.cpp is made 
with a for loop, so that on each step we add a component: first /aaaaa, 
then /aaaaa/bbbbb, and so on (see the attached small log of nametree, I 
ran NFD, made a register and stopped NFD).

The question then is: why are the insertion of "long" names treated in 
this way, and not directly adding the full name? Is that an optimization 
for further insertions?

Thanks in advance.

Bruno
-- 
----------------------------------------------------------------------
Bruno Ricci, Ph.D.
Post-doc Researcher
CNIT - Consorzio Nazionale Interuniversitario per le Telecomunicazioni
Department of Electronic Engineering, University of Rome "Tor Vergata"
Website: http://netgroup.uniroma2.it/bruno-ricci/
Tel.: +39 06 7259 7445
-------------- next part --------------
STARTING NFD
lookup start /ndn/broadcast
insert start /ndn
insert end /ndn
insert start /ndn/broadcast
insert end /ndn/broadcast
lookup end /ndn/broadcast
findLongestPrefixMatch start /ndn/broadcast
findLongestPrefixMatch end /ndn/broadcast
findExactMatch start /ndn/broadcast
findExactMatch end /ndn/broadcast
fullEnumerate start
fullEnumerate end
lookup start /aaaaa/bbbbb/ccccc/ddddd/eeeee
insert start /aaaaa
insert end /aaaaa
insert start /aaaaa/bbbbb
insert end /aaaaa/bbbbb
insert start /aaaaa/bbbbb/ccccc
insert end /aaaaa/bbbbb/ccccc
insert start /aaaaa/bbbbb/ccccc/ddddd
insert end /aaaaa/bbbbb/ccccc/ddddd
insert start /aaaaa/bbbbb/ccccc/ddddd/eeeee
insert end /aaaaa/bbbbb/ccccc/ddddd/eeeee
lookup end /aaaaa/bbbbb/ccccc/ddddd/eeeee
STOPPING NFD