к
Size: a a a
2021 June 28
[
прям как хаскель
[
на null эффективнее
t
ага, т.е. без волшебностей типа анализа циклов
к
data X = X !Int ![Int]
g :: [Int] -> [Int]
g [] = []
g xs =
let X m ys = replace_with_min m xs
in ys
where
-- replace elements with min and return the tuple of min and replaced list
replace_with_min :: Int -> [Int] -> X
replace_with_min m [x] = X x [m]
replace_with_min m (x : xs) =
let X m' xs' = replace_with_min m xs
in X (min x m') (m : xs')
g :: [Int] -> [Int]
g [] = []
g xs =
let X m ys = replace_with_min m xs
in ys
where
-- replace elements with min and return the tuple of min and replaced list
replace_with_min :: Int -> [Int] -> X
replace_with_min m [x] = X x [m]
replace_with_min m (x : xs) =
let X m' xs' = replace_with_min m xs
in X (min x m') (m : xs')
[
Таски в шарпах это вообще ассинхронщина
к
а статья которую я хотел посоветовать вот - https://blog.csongor.co.uk/time-travel-in-haskell-for-dummies/
L
хм. я до последнего был уверен что речь про эту статью с хаскелвики https://wiki.haskell.org/Circular_programming