tree 91fc618ab0bb717966e98d3fcb39a1fbdf04d51b
parent 260de8684d48c1a69e169112fa053d2df1b4871f
author Neale Ranns <nranns@cisco.com> 1524486679 -0700
committer Damjan Marion <dmarion.lists@gmail.com> 1524659498 +0000

Adjacency walk more scalable

When walking all adjacencies for a given {next-hop,interface} instead of
walking all the adjacencies on that interface and matching the next-hop
(which is O(n) in the number of adjacencies on that link, find all instances
of an adjacency with any link-type and wtih that {next-hop,interfacE} pair:
this is O(1).

Change-Id: Ic80399fc9e93c8df111379c039e592d8cafbab18
Signed-off-by: Neale Ranns <nranns@cisco.com>