how is mibs constructed and searched in agent++3.0?

[Frank Fock]

cheng.sihai____mail.zte.com.cn wrote:
>   how is mibs contructed and searched in agent3.0? could you interpret it
> by  a chart? is mib searched with a linear method?

AGENT++ uses AVL trees to build its MIB search tree. AVL trees are balanced
binary search trees, that provide best performance for searching
elements. For more details on AVL trees see for example:

http://www.slac.stanford.edu/comp/c/cset/364/doc/ioc/concepts/c3cavltr.htm

Since AGENT++v3.3 also tables make use of AVL trees to store their
rows. Before v3.3 a double linked list had been used, which performed
not very well for large tables (>500 rows).

Best regards,
Frank

-- 
Frank Fock                     Marconi Communications Software Systems
<frank.fock at marconicomms.com>  Blumenstrasse 22-24, 
Phone: +49 7191 13-4851        71522 Backnang,            
Fax:   +49 7191 13-2502        Germany