Re: Efficient sorting of SNMP oids
AV == Avleen Vig avl...@gmail.com writes: AV On Oct 31, 2009, at 22:17, Dave Hodgkinson daveh...@gmail.com wrote: Then build it in to your own dist tree. AV Or better yet, extract the key functionality you need from the module AV and mak it part of your script! Easy. and one more idea. sort::maker actually generates source code for its sorts and you can print that out. then you cut/paste that generated code into your program. the only issue i see is how to handle varying length OIDs. but i leave that as an exercise to the reader. uri -- Uri Guttman -- u...@stemsystems.com http://www.sysarch.com -- - Perl Code Review , Architecture, Development, Training, Support -- - Gourmet Hot Cocoa Mix http://bestfriendscocoa.com -
Re: Efficient sorting of SNMP oids
On Oct 31, 2009, at 15:17, Dave Hodgkinson wrote: Using Sort::Key::OID or sort::maker would have been great, except that we need to deploy the script to a rather large number of servers and it is traditionally long and painful to get modules approved and deployed in our machines. Then build it in to your own dist tree. Yeah; that's what we do. We have a git submodule (cpan/) with our application, so when we upgrade or install a module it gets branched/ merged/tracked/code-reviewed/managed just like any other application change we make. We have a helper script[1] that starts the CPAN shell with INSTALL_BASE appropriately configured to make it easy. - ask [1] http://git.develooper.com/?p=combust.git;a=blob;f=bin/cbcpan;h=b69b81829e43450344f9dc35349151cf2750e6b5;hb=HEAD
