/usr/share/pyshared/landscape/lib/sequenceranges.py is in landscape-common 12.04.3-0ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 | class SequenceError(Exception):
"""Raised when the sequence isn't proper for translation to ranges."""
class SequenceRanges(object):
"""High level interface to ranges.
A ranges list represent a sequence of ordered and non-repeating
elements into a more compact format, by representing 3 or more
consecutive entries by a range.
This means that a sequence such as
[1, 2, 4, 5, 6, 8, 10, 11, 12, 14]
becomes
[1, 2, (4, 6), 8, (10, 12), 14]
"""
def __init__(self):
self._ranges = []
@classmethod
def from_sequence(cls, sequence):
obj = cls()
obj._ranges[:] = sequence_to_ranges(sequence)
return obj
@classmethod
def from_ranges(cls, ranges):
obj = cls()
obj._ranges[:] = ranges
return obj
def to_sequence(self):
return list(ranges_to_sequence(self._ranges))
def to_ranges(self):
return list(self._ranges)
def __iter__(self):
return ranges_to_sequence(self._ranges)
def __contains__(self, item):
index = find_ranges_index(self._ranges, item)
if index < len(self._ranges):
test = self._ranges[index]
if isinstance(test, tuple):
return (test[0] <= item <= test[1])
return (test == item)
return False
def add(self, item):
add_to_ranges(self._ranges, item)
def remove(self, item):
remove_from_ranges(self._ranges, item)
def sequence_to_ranges(sequence):
"""Iterate over range items that compose the given sequence."""
iterator = iter(sequence)
try:
range_start = range_stop = iterator.next()
except StopIteration:
return
while range_start is not None:
try:
item = iterator.next()
except StopIteration:
item = None
if item == range_stop+1:
range_stop += 1
else:
if item is not None and item <= range_stop:
if item < range_stop:
raise SequenceError("Sequence is unordered (%r < %r)" %
(item, range_stop))
else:
raise SequenceError("Found duplicated item (%r)" % (item,))
if range_stop == range_start:
yield range_start
elif range_stop == range_start+1:
yield range_start
yield range_stop
else:
yield (range_start, range_stop)
range_start = range_stop = item
def ranges_to_sequence(ranges):
"""Iterate over individual items represented in a ranges list."""
for item in ranges:
if isinstance(item, tuple):
for item in xrange(item[0], item[1]+1):
yield item
else:
yield item
def find_ranges_index(ranges, item):
"""Find the index where an entry *may* be."""
lo = 0
hi = len(ranges)
while lo < hi:
mid = (lo+hi)//2
test = ranges[mid]
try:
test = test[1]
except TypeError:
pass
if item > test:
lo = mid+1
else:
hi = mid
return lo
def add_to_ranges(ranges, item):
"""Insert item in ranges, reorganizing as needed."""
index_start = index_stop = index = find_ranges_index(ranges, item)
range_start = range_stop = item
ranges_len = len(ranges)
# Look for duplicates.
if index < ranges_len:
test = ranges[index]
if isinstance(test, tuple):
if test[0] <= item <= test[1]:
return
elif test == item:
return
# Merge to the left side.
while index_start > 0:
test = ranges[index_start-1]
if isinstance(test, tuple):
if test[1] != range_start-1:
break
range_start = test[0]
else:
if test != range_start-1:
break
range_start -= 1
index_start -= 1
# Merge to the right side.
while index_stop < ranges_len:
test = ranges[index_stop]
if isinstance(test, tuple):
if test[0] != range_stop+1:
break
range_stop = test[1]
else:
if test != range_stop+1:
break
range_stop += 1
index_stop += 1
if range_stop-range_start < 2:
ranges.insert(index, item)
else:
ranges[index_start:index_stop] = ((range_start, range_stop),)
def remove_from_ranges(ranges, item):
"""Remove item from ranges, reorganizing as needed."""
index = find_ranges_index(ranges, item)
ranges_len = len(ranges)
if index < ranges_len:
test = ranges[index]
if isinstance(test, tuple):
range_start, range_stop = test
if item >= range_start:
# Handle right side of the range (and replace original item).
if range_stop < item+3:
ranges[index:index+1] = range(item+1, range_stop+1)
else:
ranges[index:index+1] = ((item+1, range_stop),)
# Handle left side of the range.
if range_start > item-3:
if range_start != item:
ranges[index:index] = range(range_start, item)
else:
ranges[index:index] = ((range_start, item-1),)
elif item == test:
del ranges[index]
|