Source code for adselect.contrib.utils

import heapq
import time


def merge(*iterables):
    """
    Sort iterables of tuples in descending mode.

    In place operation.

    :param iterables: Iterables objects.
    :return:
    """

    h = []
    for it in map(iter, iterables):
        try:
            nxt = it.next
            v = nxt()
            h.append([(-v[0], v[1]), nxt])
        except StopIteration:
            pass

    heapq.heapify(h)

    while True:
        try:
            while True:
                v, nxt = s = h[0]
                yield -v[0], v[1]
                v = nxt()
                s[0] = -v[0], v[1]
                heapq._siftup(h, 0)
        except StopIteration:
            heapq.heappop(h)
        except IndexError:
            return


def reverse_insort(a, x, lo=0, hi=None):
    """
    (https://stackoverflow.com/a/2247433 CC-BY-SA)

    Insert item x in list a, and keep it reverse-sorted assuming a
    is reverse-sorted.

    If x is already in a, insert it to the right of the rightmost x.

    Optional args lo (default 0) and hi (default len(a)) bound the
    slice of a to be searched.

    In place operation.

    :param a: List we are sorting.
    :param x: Item we insert.
    :param lo: Lower bound of slice we're scanning.
    :param hi: Higher bound of slice we're scanning.
    """
    if lo < 0:
        raise ValueError('lo must be non-negative')

    if hi is None:
        hi = len(a)

    while lo < hi:
        mid = (lo+hi)//2
        if x > a[mid]:
            hi = mid
        else:
            lo = mid+1

    a.insert(lo, x)


def get_timestamp():
    """

    :return: Current epoch time as integer.
    """
    return int(time.time())