I-Haskell iwulimi lokuhlela olusebenza kahle olwaziwa ngezici zalo ezisezingeni eliphezulu nokusho okuthile. Indawo eyodwa ephawulekayo lapho amandla e-Haskell ekhazimula khona kusetshenzwa ngohlu olungapheli. Ngokuhlola okuvilaphayo kuka-Haskell, singamela futhi silawule uhlu olungapheli ngaphandle kokungena ezindabeni zokukhathala kwenkumbulo ngaphandle kwalapho sicela ukusebenzisa uhlu ngokuphelele. Cabanga ngohlu oluqhubeka njalo, njengezinombolo ezisuka ku-1 ziye kokungapheli, uhlu olunjalo luwuhlu olungapheli.
Uhlu Olungapheli ku-Haskell
E-Haskell, kunemisebenzi eminingi yokubhekana nezinhlu ezingapheli. Eyisisekelo kunazo zonke
repeat
. Lo msebenzi uthatha inani futhi ukhiqize uhlu olungapheli olwenziwa ngalelo nani. Ngokwesibonelo,
repeat 7
izoveza uhlu olungapheli lwesikhombisa. Omunye umsebenzi owusizo kulo mongo yi-
iterate
umsebenzi. Lo msebenzi uthatha umsebenzi kanye nenani lokuqala. Isebenzisa umsebenzi enanini lokuqala, bese isebenzisa umsebenzi kumphumela, bese kuba umphumela womphumela, njalonjalo, ikhiqiza uhlu olungapheli.
Uhlu olungenamkhawulo, yize lubonakala lunzima, kulula ukuluphatha ku-Haskell, ngenxa yemodeli yokuhlola yobuvila ka-Haskell. Lesi sici sivumela u-Haskell ukuthi ahlole isisho kuphela uma inani laso lidingeka, ngaleyo ndlela enikeza indlela ephumelelayo yokusebenza ngohlu olungenamkhawulo.
Ukubhala ngekhodi nge-Infinite Lists
Ake sihlole amakhodi we-Haskell asebenzayo sisebenzisa umqondo wohlu olungapheli. Inkinga evamile esingayixazulula ngohlu olungapheli ukukhiqiza uhlu lwazo zonke izinombolo eziyinhloko.
Ikhodi elandelayo ixazulula le nkinga kahle:
primes = filterPrime [2..]
where filterPrime (p:xs) =
p : filterPrime [x | x <- xs, x `mod` p /= 0]
[/code]
In this code, the function [code lang="Haskell"]filterPrime[/code] takes the first number from the list (which is a prime) and concatenates it with the result of filtering out the multiples of that prime number from the rest of the list. The function [code lang="Haskell"]filterPrime[/code] then recursively calls itself to generate all prime numbers.
<b>With the above code, we not only solved our limitation but also illustrated the power and efficiency of Haskell's infinite lists.</b>
<h2>Understanding the Libraries</h2>
Haskell's standard library, GHC.Base, provides several functions that are crucial to the manipulation of infinite lists. These functions include [code lang="Haskell"]cycle
,
iterate
, Futhi
repeat
, Phakathi kwabanye.
Ngokwesibonelo,
repeat
umsebenzi unikeza indlela elula yokwenza uhlu olungapheli. Phakathi naleso sikhathi, i-
cycle
umsebenzi uthatha uhlu olunomkhawulo futhi uluphindaphinda ngokungapheli.
iterate
, ngakolunye uhlangothi, inikeza ukuguquguquka okwengeziwe njengoba kusivumela ukuthi sikhiqize uhlu olungenamkhawulo ngokusebenzisa ngokuphindaphindiwe umsebenzi.
Ukuqonda ukuthi ungayisebenzisa kanjani le mitapo yolwazi kanye nemisebenzi kubalulekile ekuqondeni uhlu olungenamkhawulo eHaskell. Ngenxa yalokhu, ukudala nokuphatha uhlu olungenamkhawulo kuba yimisebenzi esingayenza kalula nangobuhle.
