Source code for collections_extended.range_map

"""RangeMap class definition."""
from bisect import bisect_left, bisect_right
from collections import Mapping, Set

from ._util import NOT_SET


[docs]class MappedRange(): """Represents a subrange of a RangeMap. This is a glorified namedtuple. .. automethod:: __init__ """ __slots__ = ('start', 'stop', 'value')
[docs] def __init__(self, start, stop, value): """Create a mapped range. Args: start: The start of the range, inclusive. stop: The end of the range, exclusive. value: The mapped value. """ self.start = start self.stop = stop self.value = value
# Implement __iter__ so we can unpack this def __iter__(self): yield self.start yield self.stop yield self.value def __str__(self): return '[{start!r}, {stop!r}) -> {value!r}'.format( start=self.start, stop=self.stop, value=self.value, ) def __repr__(self): return '{class_name}({start!r}, {stop!r}, {value!r})'.format( class_name=self.__class__.__name__, start=self.start, stop=self.stop, value=self.value, )
class RangeMapView: """Base class for views of RangeMaps.""" __slots__ = '_mapping', def __init__(self, mapping): """Create a RangeMapView from a RangeMap.""" self._mapping = mapping def __len__(self): return len(self._mapping) def __repr__(self): return '{0.__class__.__name__}({0._mapping!r})'.format(self) @property def mapping(self): """Return the underlying RangeMap.""" return self._mapping class RangeMapKeysView(RangeMapView, Set): """A view of the keys that mark the starts of subranges of a RangeMap. Since iterating over all the keys is impossible, the view only iterates over the keys that start each subrange. """ __slots__ = () def __contains__(self, key): return key in self.mapping def __iter__(self): for mapped_range in self.mapping.ranges(): yield mapped_range.start class RangeMapItemsView(RangeMapView, Set): """A view of the items that mark the starts of subranges of a RangeMap. Since iterating over all the items is impossible, the view only iterates over the items that start each subrange. """ __slots__ = () def __contains__(self, item): # TODO should item be a MappedRange instead of a 2-tuple key, value = item try: mapped_value = self.mapping[key] except KeyError: return False else: return mapped_value == value def __iter__(self): for mapped_range in self.mapping.ranges(): yield (mapped_range.start, mapped_range.value) class RangeMapValuesView(RangeMapView): """A view on the values that mark the start of subranges of a RangeMap. Since iterating over all the values is impossible, the view only oterates over the values that start each subrange. """ __slots__ = () def __contains__(self, value): for mapped_range in self.mapping.ranges(): if mapped_range.value == value: return True return False def __iter__(self): for mapped_range in self.mapping.ranges(): yield mapped_range.value def _check_start_stop(start, stop): """Check that start and stop are valid - orderable and in the right order. Raises: ValueError: if stop <= start TypeError: if unorderable """ if start is not None and stop is not None and stop <= start: raise ValueError('stop must be > start') def _check_key_slice(key): if not isinstance(key, slice): raise TypeError('Can only set and delete slices') if key.step is not None: raise ValueError('Cannot set or delete slices with steps')
[docs]class RangeMap(Mapping): """Map ranges of orderable elements to values. .. automethod:: __init__ """
[docs] def __init__(self, iterable=None, default_value=NOT_SET): """Create a RangeMap. A mapping or other iterable can be passed to initialize the RangeMap. If mapping is passed, it is interpreted as a mapping from range start indices to values. If an iterable is passed, each element will define a range in the RangeMap and should be formatted (start, stop, value). default_value is a an optional keyword argument that will initialize the entire RangeMap to that value. Any missing ranges will be mapped to that value. However, if ranges are subsequently deleted they will be removed and *not* mapped to the default_value. Args: iterable: A Mapping or an Iterable to initialize from. default_value: If passed, the return value for all keys less than the least key in mapping or missing ranges in iterable. If no mapping or iterable, the return value for all keys. """ self._keys = [None] self._values = [default_value] if iterable: if isinstance(iterable, Mapping): self._init_from_mapping(iterable) else: self._init_from_iterable(iterable)
@classmethod def from_mapping(cls, mapping): """Create a RangeMap from a mapping of interval starts to values.""" obj = cls() obj._init_from_mapping(mapping) return obj def _init_from_mapping(self, mapping): for key, value in sorted(mapping.items()): self.set(value, key) @classmethod def from_iterable(cls, iterable): """Create a RangeMap from an iterable of tuples defining each range. Each element of the iterable is a tuple (start, stop, value). """ obj = cls() obj._init_from_iterable(iterable) return obj def _init_from_iterable(self, iterable): for start, stop, value in iterable: self.set(value, start=start, stop=stop) def __str__(self): range_format = '({range.start}, {range.stop}): {range.value}' values = ', '.join([range_format.format(range=r) for r in self.ranges()]) return 'RangeMap(%s)' % values def __repr__(self): range_format = '({range.start!r}, {range.stop!r}, {range.value!r})' values = ', '.join([range_format.format(range=r) for r in self.ranges()]) return 'RangeMap([%s])' % values def _bisect_left(self, key): """Return the index of the key or the last key < key.""" if key is None: return 0 else: return bisect_left(self._keys, key, lo=1) def _bisect_right(self, key): """Return the index of the first key > key.""" if key is None: return 1 else: return bisect_right(self._keys, key, lo=1) def ranges(self, start=None, stop=None): """Generate MappedRanges for all mapped ranges. Yields: MappedRange """ _check_start_stop(start, stop) start_loc = self._bisect_right(start) if stop is None: stop_loc = len(self._keys) else: stop_loc = self._bisect_left(stop) start_val = self._values[start_loc - 1] candidate_keys = [start] + self._keys[start_loc:stop_loc] + [stop] candidate_values = [start_val] + self._values[start_loc:stop_loc] for i, value in enumerate(candidate_values): if value is not NOT_SET: start_key = candidate_keys[i] stop_key = candidate_keys[i + 1] yield MappedRange(start_key, stop_key, value) def __contains__(self, key): try: self._getitem(key) except KeyError: return False else: return True def __iter__(self): for key, value in zip(self._keys, self._values): if value is not NOT_SET: yield key def __bool__(self): if len(self._keys) > 1: return True else: return self._values[0] != NOT_SET __nonzero__ = __bool__ def _getitem(self, key): """Get the value for a key (not a slice).""" loc = self._bisect_right(key) - 1 value = self._values[loc] if value is NOT_SET: raise KeyError(key) else: return value def get(self, key, restval=None): """Get the value of the range containing key, otherwise return restval.""" try: return self._getitem(key) except KeyError: return restval def get_range(self, start=None, stop=None): """Return a RangeMap for the range start to stop. Returns: A RangeMap """ return self.from_iterable(self.ranges(start, stop)) def set(self, value, start=None, stop=None): """Set the range from start to stop to value.""" _check_start_stop(start, stop) # start_index, stop_index will denote the sections we are replacing start_index = self._bisect_left(start) if start is not None: # start_index == 0 prev_value = self._values[start_index - 1] if prev_value == value: # We're setting a range where the left range has the same # value, so create one big range start_index -= 1 start = self._keys[start_index] if stop is None: new_keys = [start] new_values = [value] stop_index = len(self._keys) else: stop_index = self._bisect_right(stop) stop_value = self._values[stop_index - 1] stop_key = self._keys[stop_index - 1] if stop_key == stop and stop_value == value: new_keys = [start] new_values = [value] else: new_keys = [start, stop] new_values = [value, stop_value] self._keys[start_index:stop_index] = new_keys self._values[start_index:stop_index] = new_values def delete(self, start=None, stop=None): """Delete the range from start to stop from self. Raises: KeyError: If part of the passed range isn't mapped. """ _check_start_stop(start, stop) start_loc = self._bisect_right(start) - 1 if stop is None: stop_loc = len(self._keys) else: stop_loc = self._bisect_left(stop) for value in self._values[start_loc:stop_loc]: if value is NOT_SET: raise KeyError((start, stop)) # this is inefficient, we've already found the sub ranges self.set(NOT_SET, start=start, stop=stop) def empty(self, start=None, stop=None): """Empty the range from start to stop. Like delete, but no Error is raised if the entire range isn't mapped. """ self.set(NOT_SET, start=start, stop=stop) def clear(self): """Remove all elements.""" self._keys = [None] self._values = [NOT_SET] @property def start(self): """Get the start key of the first range. None if RangeMap is empty or unbounded to the left. """ if self._values[0] is NOT_SET: try: return self._keys[1] except IndexError: # This is empty or everything is mapped to a single value return None else: # This is unbounded to the left return self._keys[0] @property def end(self): """Get the stop key of the last range. None if RangeMap is empty or unbounded to the right. """ if self._values[-1] is NOT_SET: return self._keys[-1] else: # This is unbounded to the right return None def __eq__(self, other): if isinstance(other, RangeMap): return ( self._keys == other._keys and self._values == other._values ) else: return False def __getitem__(self, key): try: _check_key_slice(key) except TypeError: return self._getitem(key) else: return self.get_range(key.start, key.stop) def __setitem__(self, key, value): _check_key_slice(key) self.set(value, key.start, key.stop) def __delitem__(self, key): _check_key_slice(key) self.delete(key.start, key.stop) def __len__(self): count = 0 for v in self._values: if v is not NOT_SET: count += 1 return count def keys(self): """Return a view of the keys.""" return RangeMapKeysView(self) def values(self): """Return a view of the values.""" return RangeMapValuesView(self) def items(self): """Return a view of the item pairs.""" return RangeMapItemsView(self) # Python2 - override slice methods def __setslice__(self, i, j, value): """Implement __setslice__ to override behavior in Python 2. This is required because empty slices pass integers in python2 as opposed to None in python 3. """ raise SyntaxError("Assigning slices doesn't work in Python 2, use set.") def __delslice__(self, i, j): raise SyntaxError("Deleting slices doesn't work in Python 2, use delete.") def __getslice__(self, i, j): raise SyntaxError("Getting slices doesn't work in Python 2, use get_range.")