ArrRef[T] = ref object
  byte_len: int
  when not defined(release):
    arr_ptr
  arr: UncheckedArray[T]

proc `$`[T](a: ArrRef[T]): string

proc `[]=`[T](a: ArrRef[T]; i: Natural; v: T)

proc `[]`[T](a: ArrRef[T]; i: Natural): var T

proc concat[T](arrs: seq[ArrRef[T]]): ArrRef[T]

proc concat[T](arrs: varargs[ArrRef[T]]): ArrRef[T]

proc fill[T](a: ArrRef[T]; v: T)

proc hash[T](arr: ArrRef[T]): Hash

proc newArrRef[T; U: not T](s: seq[U]): ArrRef[T]

proc newArrRef[T](s: seq[T] | ArrRef[T] | openArray[T]): ArrRef[T]

proc newArrRef[T](size: Natural): ArrRef[T]

proc newArrRefWith[T](size: Natural; v: T): ArrRef[T]

proc newSeq[T: not ref](a: ArrRef[T]): var seq[T]

iterator items[T](a: ArrRef[T]): T

iterator mitems[T](a: ArrRef[T]): var T

iterator mpairs[T](a: ArrRef[T]): tuple[key: int, val: var T]

iterator pairs[T](a: ArrRef[T]): tuple[key: int, val: T]

template `&`[T, U](a: ArrRef[T]; b: ArrRef[U]): ArrRef[T]

template `[]=`[T](a: ArrRef[T]; i: BackwardsIndex; v: T)

template `[]`[T](a: ArrRef[T]; i: BackwardsIndex): T

template `[]`[T](a: ArrRef[T]; s: Slice[int]): var SliceMem[T]

template byteLen[T](a: ArrRef[T]): Natural

template high[T](a: ArrRef[T]): int

template len[T](a: ArrRef[T]): Natural

template low[T](a: ArrRef[T]): Natural

template newArrRef[T](s: string): ArrRef[T]

template to[T](a: ArrRef[T]; U: untyped): untyped

template toPointer[T](a: ArrRef[T]): pointer