## /Prelude-v23.0.0/NonEmpty/shifted.dhall

Copy path to clipboard

Combine a NonEmpty list of NonEmpty lists, offsetting the index of each element by the number of elements in preceding lists

### Examples

shifted
Bool
{ head = { index = 0, value = True }
, tail = [ { index = 1, value = True }, { index = 2, value = True } ]
}
, tail =
[ { head = { index = 0, value = False }
, tail = [ { index = 1, value = False } ]
}
, { head = { index = 0, value = True }
, tail =
[ { index = 1, value = True }
, { index = 2, value = True }
, { index = 3, value = True }
]
}
]
}
≡ { head = { index = 0, value = True }
, tail =
[ { index = 1, value = True }
, { index = 2, value = True }
, { index = 3, value = False }
, { index = 4, value = False }
, { index = 5, value = True }
, { index = 6, value = True }
, { index = 7, value = True }
, { index = 8, value = True }
]
}
shifted
Bool
{ head = { index = 0, value = True }
, tail = [] : List { index : Natural, value : Bool }
}
, tail = [] : List (NonEmpty { index : Natural, value : Bool })
}
≡ { head = { index = 0, value = True }
, tail = [] : List { index : Natural, value : Bool }
}

### Source

{-|
Combine a `NonEmpty` list of `NonEmpty` lists, offsetting the `index` of each
element by the number of elements in preceding lists
-}
let NonEmpty =
missing sha256:e2e247455a858317e470e0e4affca8ac07f9f130570ece9cb7ac1f4ea3deb87f
? ./Type.dhall

let NonEmpty/toList =
missing sha256:0977fe14b77232a4451dcf409c43df4589c4b3cdde7b613aab8df183be1b53f5
? ./toList.dhall

let List/map =
missing sha256:dd845ffb4568d40327f2a817eb42d1c6138b929ca758d50bc33112ef3c885680
? ../List/map.dhall

let List/shifted =
missing sha256:54fb22c7e952ebce1cfc0fcdd33ce4cfa817bff9d6564af268dea6685f8b5dfe
? ../List/shifted.dhall

let shifted
: ∀(a : Type) →
NonEmpty (NonEmpty { index : Natural, value : a }) →
NonEmpty { index : Natural, value : a }
= λ(a : Type) →
λ(kvss : NonEmpty (NonEmpty { index : Natural, value : a })) →
, tail =
List/shifted
a
# List/map
(NonEmpty { index : Natural, value : a })
(List { index : Natural, value : a })
( λ(kvs : NonEmpty { index : Natural, value : a }) →
List/map
{ index : Natural, value : a }
{ index : Natural, value : a }
( λ(kv : { index : Natural, value : a }) →
{ index = kv.index + 1, value = kv.value }
)
(NonEmpty/toList { index : Natural, value : a } kvs)
)
kvss.tail
)
}

let example0 =
assert
: shifted
Bool
{ head = { index = 0, value = True }
, tail =
[ { index = 1, value = True }, { index = 2, value = True } ]
}
, tail =
[ { head = { index = 0, value = False }
, tail = [ { index = 1, value = False } ]
}
, { head = { index = 0, value = True }
, tail =
[ { index = 1, value = True }
, { index = 2, value = True }
, { index = 3, value = True }
]
}
]
}
≡ { head = { index = 0, value = True }
, tail =
[ { index = 1, value = True }
, { index = 2, value = True }
, { index = 3, value = False }
, { index = 4, value = False }
, { index = 5, value = True }
, { index = 6, value = True }
, { index = 7, value = True }
, { index = 8, value = True }
]
}

let example1 =
assert
: shifted
Bool