comparison mercurial/util.py @ 51703:ca7bde5dbafb

black: format the codebase with 23.3.0

The CI has moved to 23.3.0, which is the last version that supports 3.7
at runtime, so we should honor this change.

# skip-blame mass-reformating only

51702:b0a4de6c14f8

                self[k] = v
            for k in f:
                self[k] = f[k]

    def insert(self, position, key, value):
        for (i, (k, v)) in enumerate(list(self.items())):
            if i == position:
                self[key] = value
            if i >= position:
                del self[k]
                self[k] = v

    def __init__(self, in_iter):
        """in_iter is the iterator that's iterating over the input chunks."""

        def splitbig(chunks):
            for chunk in chunks:
                if len(chunk) > 2 ** 20:
                    pos = 0
                    while pos < len(chunk):
                        end = pos + 2 ** 18
                        yield chunk[pos:end]
                        pos = end
                else:
                    yield chunk

        buf = []
        queue = self._queue
        while left > 0:
            # refill the queue
            if not queue:
                target = 2 ** 18
                for chunk in self.iter:
                    queue.append(chunk)
                    target -= len(chunk)
                    if target <= 0:
                        break

    return wrapper


_sizeunits = (
    (b'm', 2 ** 20),
    (b'k', 2 ** 10),
    (b'g', 2 ** 30),
    (b'kb', 2 ** 10),
    (b'mb', 2 ** 20),
    (b'gb', 2 ** 30),
    (b'b', 1),
)


def sizetoint(s: bytes) -> int:

51703:ca7bde5dbafb

                self[k] = v
            for k in f:
                self[k] = f[k]

    def insert(self, position, key, value):
        for i, (k, v) in enumerate(list(self.items())):
            if i == position:
                self[key] = value
            if i >= position:
                del self[k]
                self[k] = v

    def __init__(self, in_iter):
        """in_iter is the iterator that's iterating over the input chunks."""

        def splitbig(chunks):
            for chunk in chunks:
                if len(chunk) > 2**20:
                    pos = 0
                    while pos < len(chunk):
                        end = pos + 2**18
                        yield chunk[pos:end]
                        pos = end
                else:
                    yield chunk

        buf = []
        queue = self._queue
        while left > 0:
            # refill the queue
            if not queue:
                target = 2**18
                for chunk in self.iter:
                    queue.append(chunk)
                    target -= len(chunk)
                    if target <= 0:
                        break

    return wrapper


_sizeunits = (
    (b'm', 2**20),
    (b'k', 2**10),
    (b'g', 2**30),
    (b'kb', 2**10),
    (b'mb', 2**20),
    (b'gb', 2**30),
    (b'b', 1),
)


def sizetoint(s: bytes) -> int: