blob: f0d971e0ff5073c1ef09eab5d7eb57596b286aee (
about) (
plain)
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
|
"""
This module will hold generic functions that can operate on a wide-array of
data structures.
"""
from math import ceil
from functools import reduce
from typing import Any, Tuple, Sequence
def partition_all(num: int, items: Sequence[Any]) -> Tuple[Tuple[Any, ...], ...]:
"""
Given a sequence `items`, return a new sequence of the same type as `items`
with the data partitioned into sections of `n` items per partition.
This is an approximation of clojure's `partition-all` function.
"""
def __compute_start_stop__(acc, iteration):
start = iteration * num
return acc + ((start, start + num),)
iterations = range(ceil(len(items) / num))
return tuple([# type: ignore[misc]
tuple(items[start:stop]) for start, stop # type: ignore[has-type]
in reduce(
__compute_start_stop__, iterations, tuple())])
|
