fibtree

Documentation

Overview

Package fibtree organizes logical FIB entries in a name hierarchy.

Index

• type Tree
  • func New(startDepth int) *Tree
  • func (t *Tree) CountEntries() int
  • func (t *Tree) CountNodes() int
  • func (t *Tree) Erase(name ndn.Name) fibdef.Update
  • func (t *Tree) Find(name ndn.Name) *fibdef.Entry
  • func (t *Tree) Insert(entry fibdef.Entry) fibdef.Update
  • func (t *Tree) List() (list []fibdef.Entry)

Types

type Tree

type Tree struct {
	// contains filtered or unexported fields
}

Tree represents a tree of name hierarchy.

func New

func New(startDepth int) *Tree

New creates a Tree.

func (*Tree) CountEntries

func (t *Tree) CountEntries() int

CountEntries returns number of entries.

func (*Tree) CountNodes

func (t *Tree) CountNodes() int

CountNodes returns number of nodes.

func (*Tree) Erase

func (t *Tree) Erase(name ndn.Name) fibdef.Update

Erase deletes an entry.

func (*Tree) Find

func (t *Tree) Find(name ndn.Name) *fibdef.Entry

Find retrieves an entry by exact match.

func (*Tree) Insert

func (t *Tree) Insert(entry fibdef.Entry) fibdef.Update

Insert inserts or replaces an entry.

func (*Tree) List

func (t *Tree) List() (list []fibdef.Entry)

List lists entries.