Archives Aug. 8, 2004

As mentioned a while ago, I was trying to build a chaining mechanism into TwistedSNMP's OIDStore mechanism, the idea being that you could mix-and-match OIDStores so that you could compose test-cases readily from pre-built OIDStore fragments.

Problem was that the code became hideous. It's just a graph-traversal algorithm, but the code wasn't written with graph-traversal ...

Tim, Shiva, Shademan, Lisa, Golnar, and Shane were all unavailable, Natasha had already eaten, and Krysta couldn't get past the idea of chocolate and chicken together, so I had no-one for whom to cook (well, turns out I would have had Rosey, but I didn't know that). Anyway, guess I'll cook it tomorrow after I ...

TwistedSNMP has a mechanism called an OIDStore, which allows you to define the values to be returned from a (server-side) agent. At the moment, these are quite simplistic creations, basically either a bisect-sorted list or a BSDDB btree database (the OIDStore must be ordered, which is why a simple dictionary wouldn't work).

That works fine ...