úÎâ¼portable experimental/Sebastian Fischer (sebf@informatik.uni-kiel.de) Safe-InferredAThis global constant is an infinite list of prime numbers. It is E generated by a lazy wheel sieve and shared across the whole program D run. If you are concerned about the memory requirements of sharing ' many primes you can call the function  wheelSieve directly. CThis function returns an infinite list of prime numbers by sieving 6 with a wheel that cancels the multiples of the first n primes  where n is the argument given to  wheelSieve. Don' t use too  large wheels. The number 6! is a good value to pass to this D function. Larger wheels improve the run time at the cost of higher  memory requirements. (Checks whether a given number is prime. AThis function uses trial division to check for divisibility with = all primes below the square root of the given number. It is B impractical for numbers with a very large smallest prime factor. >Yields the sorted list of prime factors of the given positive  number. AThis function uses trial division and is impractical for numbers  with very large prime factors. 'number of primes canceled by the wheel infinite list of primes        primes-0.2.1.0Data.Numbers.Primesprimes wheelSieveisPrime primeFactorsQueueForkEmptyWheel Compositessieve compositessplitCompositesdiscard sieveCompsspinwheelnextcancelenqueuemergedequeuemergeAll