Gecko [ nbspublicschool.com ]

Name	Size	Permission
__init__.py	20 B	-rw-r--r--
__init__.pyc	171 B	-rw-r--r--
__init__.pyo	171 B	-rw-r--r--
codec.py	3.22 KB	-rw-r--r--
codec.pyc	3.75 KB	-rw-r--r--
codec.pyo	3.75 KB	-rw-r--r--
compat.py	232 B	-rw-r--r--
compat.pyc	763 B	-rw-r--r--
compat.pyo	763 B	-rw-r--r--
core.py	11.14 KB	-rw-r--r--
core.pyc	11.23 KB	-rw-r--r--
core.pyo	11.23 KB	-rw-r--r--
idnadata.py	32.21 KB	-rw-r--r--
idnadata.pyc	27.84 KB	-rw-r--r--
idnadata.pyo	27.84 KB	-rw-r--r--
intranges.py	1.71 KB	-rw-r--r--
intranges.pyc	2.11 KB	-rw-r--r--
intranges.pyo	2.11 KB	-rw-r--r--
uts46data.py	180.6 KB	-rw-r--r--
uts46data.pyc	266.24 KB	-rw-r--r--
uts46data.pyo	266.24 KB	-rw-r--r--

Code Editor : intranges.py

"""
Given a list of integers, made up of (hopefully) a small number of long runs
of consecutive integers, compute a representation of the form
((start1, end1), (start2, end2) ...). Then answer the question "was x present
in the original list?" in time O(log(# runs)).
"""

import bisect

def intranges_from_list(list_):
    """Represent a list of integers as a sequence of ranges:
    ((start_0, end_0), (start_1, end_1), ...), such that the original
    integers are exactly those x such that start_i <= x < end_i for some i.

Ranges are encoded as single integers (start << 32 | end), not as tuples.
    """

sorted_list = sorted(list_)
    ranges = []
    last_write = -1
    for i in range(len(sorted_list)):
        if i+1 < len(sorted_list):
            if sorted_list[i] == sorted_list[i+1]-1:
                continue
        current_range = sorted_list[last_write+1:i+1]
        ranges.append(_encode_range(current_range[0], current_range[-1] + 1))
        last_write = i

return tuple(ranges)

def _encode_range(start, end):
    return (start << 32) | end

def _decode_range(r):
    return (r >> 32), (r & ((1 << 32) - 1))

def intranges_contain(int_, ranges):
    """Determine if `int_` falls into one of the ranges in `ranges`."""
    tuple_ = _encode_range(int_, 0)
    pos = bisect.bisect_left(ranges, tuple_)
    # we could be immediately ahead of a tuple (start, end)
    # with start < int_ <= end
    if pos > 0:
        left, right = _decode_range(ranges[pos-1])
        if left <= int_ < right:
            return True
    # or we could be immediately behind a tuple (int_, end)
    if pos < len(ranges):
        left, _ = _decode_range(ranges[pos])
        if left == int_:
            return True
    return False

${this.title}

Code Editor : intranges.py