On Tue, Feb 14, 2006 at 10:28:56AM -0800, Wes Hardaker wrote: > >>>>> On Tue, 14 Feb 2006 11:49:44 +0100 (CET), brisse <[EMAIL PROTECTED]> > >>>>> said: > > brisse> I have generated myMIB.c and myMIB.h with mib2c -c > brisse> mib2c.iterate.conf myMIB. > > The iterator actually lets you *not* keep a copy of the data in the > agent and the get_first and get_next functions can directly browse > your data without caching it.
Another thing I have been woundering in this context is how to handle the case where I have a data set that I can choose to order any way I wish from the application point of view and thus I choose to order it in OID order - now I have data that is randomly accessible and would like an interface that asks for the key it want instead of iterating over half the data set for each request. What helper should I use? /MF (This is the interface that C++ map presents so it is relevant for the original poster as well (random find is O(log n), get_next is O(1) if you have a iterator to the previous element but for that to work you have to track that the iterator isn't invalidated, this happens, for map, when the element that the iterator references is removed from the map)) ------------------------------------------------------- This SF.net email is sponsored by: Splunk Inc. Do you grep through log files for problems? Stop! Download the new AJAX search engine that makes searching your log files as easy as surfing the web. DOWNLOAD SPLUNK! http://sel.as-us.falkag.net/sel?cmd=lnk&kid=103432&bid=230486&dat=121642 _______________________________________________ Net-snmp-coders mailing list Net-snmp-coders@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/net-snmp-coders
