|
From: | Matthew Walker |
Subject: | Re: [Mibble-users] sorting OIDs |
Date: | Tue, 28 Jan 2014 11:40:22 -0500 |
User-agent: | Mozilla/5.0 (Windows NT 6.1; WOW64; rv:24.0) Gecko/20100101 Thunderbird/24.2.0 |
Great to hear.. Although the problem I'm having is OID sorting in general.. I use mibble to parse a MIB and the resulting points are stored in a DB. Using that DB, I will occasionally add 'children' to the MIB resulting in new OIDs which I need to bring back to the user in order (numerically). I was hoping that Mibble would have a utility that receives, say, an Array of OIDs and returns an Array with each OID sorted numerically. If Mibble doesn't have this - then my search continues and I may have to build that sorting algorithm myself. If I do, I'd be happy to contribute to the source. Mysql addresses the sorting of IPV4 addresses with the INET_ATON function:
which is fine with there are only 4 segments to employ this logic towards.. Obviously the problem with OIDs is that there can an unlimited number of segments (certainly more than 4) so this sort of logic would quickly create numbers that exceed any of Java's datatypes -Matthew On 1/28/2014 11:00 AM, Per Cederberg
wrote:
|
[Prev in Thread] | Current Thread | [Next in Thread] |