:: Int -> Bool -package:ENIG

Returns True if the given Int is a valid Unicode codepoint

Return if this year is a leap year (366 days) or not (365 days in a year)

Collection of known answer tests for SHA. Since these tests take too long during regular regression runs, we pass as an argument how many to run. Increase the below number to 24 to run all tests. We have:

>>> knownAnswerTests 1
True

Indicate whether a code point is reserved.

Check if an Int is a power of two. Assumes n is a natural number.

QC.forAll (QC.choose (0,100)) Parts.propInfProdLinearFactors

Parts.propPentagonalPowerSeries 1000

Parts.propPentagonalsDifP 10000

Parts.propPentagonalsDifN 10000

Is this token ix to be held in the place holder?

Is this token ix for Cookie?

Is this token ix for a header not defined in the static table?

Determines if a character code is in the range of a Word8.

Determines if a character code is a surrogate.

Determines if a character code is a scalar.

Determines if a code is a not a character code.

isBottom a returns False if a is distinct from bottom. If a equals bottom and results in an exception of a certain kind (see below), then isBottom a = True. If a never reaches a weak head normal form and never throws one of these exceptions, then isBottom a never terminates. The exceptions that yield True correspond to "pure bottoms", i.e. bottoms that can originate in pure code:

• ArrayException
• ErrorCall
• NoMethodError
• NonTermination
• PatternMatchFail
• RecConError
• RecSelError
• RecUpdError

Assertions are excluded, because their behaviour depends on compiler flags (not pure, and a failed assertion should really yield an exception and nothing else). The same applies to arithmetic exceptions (machine dependent, except possibly for DivideByZero, but the value infinity makes that case unclear as well).

Helper function for constructing IDs of any sort.

Convert from an Int.