cp_library/ds/view/view2_cls.py

View this file on GitHub
Last update: 2025-07-11 23:11:42+09:00

Depends on

Required by

Verified with

Code

from cp_library.alg.iter.sort.isort_ranged_fn import isort_ranged
import cp_library.__header__
from typing import Generic
from cp_library.misc.typing import _S, _T
import cp_library.ds.__header__
import cp_library.ds.view.__header__

class view2(Generic[_S, _T]):
    __slots__ = 'A', 'B', 'l', 'r'
    def __init__(V, A: list[_S], B: list[_T], l: int, r: int): V.A, V.B, V.l, V.r = A, B, l, r
    def __len__(V): return V.r - V.l
    def __getitem__(V, i: int): 
        if 0 <= i < V.r - V.l: return V.A[V.l+i], V.B[V.l+i]
        else: raise IndexError
    def __setitem__(V, i: int, v: tuple[_S, _T]): V.A[V.l+i], V.B[V.l+i] = v
    def __contains__(V, v: tuple[_S, _T]): raise NotImplemented
    def set_range(V, l: int, r: int): V.l, V.r = l, r
    def index(V, v: tuple[_S, _T]): raise NotImplemented
    def reverse(V):
        l, r = V.l, V.r-1
        while l < r: V.A[l], V.A[r] = V.A[r], V.A[l]; V.B[l], V.B[r] = V.B[r], V.B[l]; l += 1; r -= 1
    def sort(V, reverse=False): isort_ranged(V.A, V.B, l=V.l, r=V.r, reverse=reverse)
    def pop(V): V.r -= 1; return V.A[V.r], V.B[V.r]
    def append(V, v: tuple[_S, _T]): V.A[V.r], V.B[V.r] = v; V.r += 1
    def popleft(V): V.l += 1; return V.A[V.l-1], V.B[V.l-1]
    def appendleft(V, v: tuple[_S, _T]): V.l -= 1; V.A[V.l], V.B[V.l]  = v; 
    def validate(V): return 0 <= V.l <= V.r <= len(V.A)

'''
╺━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━╸
             https://kobejean.github.io/cp-library               
'''




def argsort_ranged(A: list[int], l: int, r: int, reverse=False):
    P = Packer(r-l-1); I = [A[l+i] for i in range(r-l)]; P.ienumerate(I, reverse); I.sort()
    for i in range(r-l): I[i] = (I[i] & P.m) + l
    return I



class Packer:
    __slots__ = 's', 'm'
    def __init__(P, mx: int): P.s = mx.bit_length(); P.m = (1 << P.s) - 1
    def enc(P, a: int, b: int): return a << P.s | b
    def dec(P, x: int) -> tuple[int, int]: return x >> P.s, x & P.m
    def enumerate(P, A, reverse=False): P.ienumerate(A:=list(A), reverse); return A
    def ienumerate(P, A, reverse=False):
        if reverse:
            for i,a in enumerate(A): A[i] = P.enc(-a, i)
        else:
            for i,a in enumerate(A): A[i] = P.enc(a, i)
    def indices(P, A: list[int]): P.iindices(A:=list(A)); return A
    def iindices(P, A):
        for i,a in enumerate(A): A[i] = P.m&a


def isort_ranged(*L: list, l: int, r: int, reverse=False):
    n = r - l
    order = argsort_ranged(L[0], l, r, reverse=reverse)
    inv = [0] * n
    # order contains indices in range [l, r), need to map to [0, n)
    for i in range(n): inv[order[i]-l] = i
    for i in range(n):
        j = order[i] - l  # j is in range [0, n)
        for A in L: A[l+i], A[l+j] = A[l+j], A[l+i]
        order[inv[i]], order[inv[j]] = order[inv[j]], order[inv[i]]
        inv[i], inv[j] = inv[j], inv[i]
    return L
from typing import Generic
from typing import TypeVar
_S = TypeVar('S')
_T = TypeVar('T')
_U = TypeVar('U')



class view2(Generic[_S, _T]):
    __slots__ = 'A', 'B', 'l', 'r'
    def __init__(V, A: list[_S], B: list[_T], l: int, r: int): V.A, V.B, V.l, V.r = A, B, l, r
    def __len__(V): return V.r - V.l
    def __getitem__(V, i: int): 
        if 0 <= i < V.r - V.l: return V.A[V.l+i], V.B[V.l+i]
        else: raise IndexError
    def __setitem__(V, i: int, v: tuple[_S, _T]): V.A[V.l+i], V.B[V.l+i] = v
    def __contains__(V, v: tuple[_S, _T]): raise NotImplemented
    def set_range(V, l: int, r: int): V.l, V.r = l, r
    def index(V, v: tuple[_S, _T]): raise NotImplemented
    def reverse(V):
        l, r = V.l, V.r-1
        while l < r: V.A[l], V.A[r] = V.A[r], V.A[l]; V.B[l], V.B[r] = V.B[r], V.B[l]; l += 1; r -= 1
    def sort(V, reverse=False): isort_ranged(V.A, V.B, l=V.l, r=V.r, reverse=reverse)
    def pop(V): V.r -= 1; return V.A[V.r], V.B[V.r]
    def append(V, v: tuple[_S, _T]): V.A[V.r], V.B[V.r] = v; V.r += 1
    def popleft(V): V.l += 1; return V.A[V.l-1], V.B[V.l-1]
    def appendleft(V, v: tuple[_S, _T]): V.l -= 1; V.A[V.l], V.B[V.l]  = v; 
    def validate(V): return 0 <= V.l <= V.r <= len(V.A)