Maximum memory (1TiB, somewhat random value).

Maximum disk (8TiB, somewhat random value).

Max CPUs (1024, somewhat random value).

Max spindles (1024, somewhat random value).

Max vcpu ratio (random value).

Max spindle ratio (random value).

Max memory ratio (random value).

Max nodes, used just to limit arbitrary instances for smaller opcode definitions (e.g. list of nodes in OpTestDelay).

Max opcodes or jobs in a submit job and submit many jobs.

Checks for equality with proper annotation. The first argument is the computed value, the second one the expected value.

Checks for inequality with proper annotation. The first argument is the computed value, the second one the expected (not equal) value.

Show a message and fail the test.

A True property.

A stable version of QuickCheck's cover. In its current implementation, cover will not detect insufficient coverage if the actual coverage in the sample is 0. Work around this by lifting the probability to at least 10 percent. The underlying issue is tracked at https:github.comnick8325quickcheckissues26

Return the python binary to use. If the PYTHON environment variable is defined, use its value, otherwise use just "python".

Run Python with an expression, returning the exit code, standard output and error.

Check python exit code, and fail via HUnit assertions if non-zero. Otherwise, return the standard output.

Defines a DNS name.

Generates printable ASCII characters (from ' ' to '~').

Generates a short string (0 <= n <= 40 chars) from printable ASCII.

Generates a short string (1 <= n <= 40 chars) from printable ASCII.

Generates a single name component.

Generates an entire FQDN.

Generates a UUID-like string.

Only to be used for QuickCheck testing. For obtaining actual UUIDs use the newUUID function in Ganeti.Utils

Combinator that generates a Maybe using a sub-combinator.

Generates a sublist of a given list, keeping the ordering. The generated elements are always a subset of the list.

In order to better support corner cases, the size of the sublist is chosen to have the uniform distribution.

Generates a map given generators for keys and values.

Generates a list of tags (correctly upper bounded).

Generates a fields list. This uses the same character set as a DNS name (just for simplicity).

Generates a list of a given size with non-duplicate elements.

Helper for genSet, declared separately due to type constraints.

Generates a Set of arbitrary elements.

Generates a Set of arbitrary elements wrapped in a ListSet

Generate an arbitrary element of and AndRestArguments field.

Helper function to compute the number of hosts in a network given the netmask. (For IPv4 only.)

Generates an arbitrary IPv6 network address in textual form. The generated address is not simpflified, e. g. an address like 2607:f0d0:1002:0051:0000:0000:0000:0004 does not become 2607:f0d0:1002:51::4

Generates an arbitrary IPv6 network in textual form.

Generates a valid, arbitrary tag name with respect to the given TagKind for opcodes.

Generates a valid, arbitrary tag name with respect to the given TagKind for Luxi.

Checks for serialisation idempotence.

Checks for array serialisation idempotence.

Checks if the deserializer doesn't accept forbidden values. The first argument is ignored, it just enforces the correct type.

Result to PropertyM IO.

Returns the content of the specified haskell test data file.

Generate arbitrary values in the IO monad. This is a simple wrapper over sample'.

Function for testing whether a file is parsed correctly.

Generate a property test for parsers.

Generate an arbitrary non negative integer number

Computes the relative error of two Double numbers.

This is the "relative error" algorithm in http://randomascii.wordpress.com/2012/02/25/ comparing-floating-point-numbers-2012-edition (URL split due to too long line).

Helper to a get a temporary file name.

listOfUniqueBy gen keyFun forbidden: Generates a list of random length, where all generated elements will be unique by the keying function keyFun. They will also be distinct from all elements in forbidden by the keying function.

As for listOf, the maximum output length depends on the size parameter.

Example:

 listOfUniqueBy (arbitrary :: Gen String) (length) ["hey"]
 -- Generates a list of strings of different length, but not of length 3.

The passed gen should not make key collisions too likely, since the implementation uses suchThat, looping until enough unique elements have been generated. If the gen makes collisions likely, this function will consequently be slow, or not terminate if it is not possible to generate enough elements, like in:

 listOfUniqueBy (arbitrary :: Gen Int) (`mod` 2) []
 -- May not terminate depending on the size parameter of the Gen,
 -- since there are only 2 unique keys (0 and 1).