1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
|
#
# This file is part of pysnmp software.
#
# Copyright (c) 2005-2019, Ilya Etingof <etingof@gmail.com>
# License: http://snmplabs.com/pysnmp/license.html
#
from bisect import bisect
class OrderedDict(dict):
"""Ordered dictionary used for indices"""
def __init__(self, *args, **kwargs):
super(OrderedDict, self).__init__()
self._keys = []
self._dirty = True
self._keysLens = []
if args:
self.update(*args)
if kwargs:
self.update(**kwargs)
def __setitem__(self, key, value):
super(OrderedDict, self).__setitem__(key, value)
if key not in self._keys:
self._keys.append(key)
self._dirty = True
def __delitem__(self, key):
super(OrderedDict, self).__delitem__(key)
if key in self._keys:
self._keys.remove(key)
self._dirty = True
def clear(self):
super(OrderedDict, self).clear()
self._keys = []
self._dirty = True
def keys(self):
if self._dirty:
self._order()
return list(self._keys)
def values(self):
if self._dirty:
self._order()
return [self[k] for k in self._keys]
def items(self):
if self._dirty:
self._order()
return [(k, self[k]) for k in self._keys]
def update(self, *args, **kwargs):
if args:
iterable = args[0]
if hasattr(iterable, 'keys'):
for k in iterable:
self[k] = iterable[k]
else:
for k, v in iterable:
self[k] = v
if kwargs:
for k in kwargs:
self[k] = kwargs[k]
def sortingFun(self, keys):
keys.sort()
def _order(self):
self.sortingFun(self._keys)
self._keysLens = sorted(
set(len(k) for k in self._keys), reverse=True)
self._dirty = False
def nextKey(self, key):
if self._dirty:
self._order()
keys = self._keys
if key in keys:
nextIdx = keys.index(key) + 1
else:
nextIdx = bisect(keys, key)
if nextIdx < len(keys):
return keys[nextIdx]
else:
raise KeyError(key)
def getKeysLens(self):
if self._dirty:
self._order()
return self._keysLens
class OidOrderedDict(OrderedDict):
"""OID-ordered dictionary used for indices"""
def __init__(self, *args, **kwargs):
OrderedDict.__init__(self, *args, **kwargs)
self._keysCache = {}
def __setitem__(self, key, value):
OrderedDict.__setitem__(self, key, value)
if key not in self._keysCache:
if isinstance(key, tuple):
self._keysCache[key] = key
else:
self._keysCache[key] = [int(x) for x in key.split('.') if x]
def __delitem__(self, key):
OrderedDict.__delitem__(self, key)
if key in self._keysCache:
del self._keysCache[key]
def sortingFun(self, keys):
keys.sort(key=lambda k, d=self._keysCache: d[k])
|
