About the List<MibTableRow>

[Frank Fock]

Hi Robert,

When looking closely to the MibTable implementation,
you will find out that the used OidList template uses
a AVL tree which has an access time of O(log(n)) for
its items. That's as far as I know, the very fast ;-)
You can replace it by a "real" List and see what
happens for tables with 10.000 rows.

BTW, for very large tables, I could be better to not
create the whole table, instead using MibComplexEntry
to compute and return only those values needed for a
request.

Best regards,
Frank

Robert wrote:
> Hi,Frank
>  
> If I want to know  any index whether in the table of MIB or not, I can 
> call function like this:
> if(NULL==MiBEntry::instance->find_index(oidIndex)).
>  
> We know that the rate of list finding is very slow.If Agent adopt the 
> structure of Map and make the index as the key of Map, the performance 
> of Agent will improve very quickly, I think.
>  
> Best regards,
> Robert
>  
>  
>  
>