Schemas
AccountLimits
typemaxRequestsCountMaximum number of requests allowed per billing period.
maxRequestsRateMaximum number of requests allowed per second. 0 means no rate limit is enforced.
maxTermsCountMaximum number of terms accepted in a single request.
maxTimeoutMaximum execution timeout per request, in milliseconds.
maxStatesCountMaximum number of automaton states an operation may build.
Boolean
typevalueBoolean value.
Cardinality
Decision Table
| Variant | Matching Criteria |
|---|---|
| type = object · type="infinite" | |
| type = object · type="bigInteger" | |
| type = object · type="integer" · requires: value |
typeCardinalityInfinite
typeCardinalityBigInteger
typeCardinalityInteger
typevalueExact count.
ErrorResponse
successerrorHuman readable error message.
errorCodeThe error code.
ErrorResponse400
successerrorHuman readable error message.
errorCodeThe error code.
ErrorResponse401
successerrorHuman readable error message.
errorCodeThe error code.
ErrorResponse403
successerrorHuman readable error message.
errorCodeThe error code.
GenerateStringsRequest
Source term to generate strings from.
limitMaximum number of unique strings to return.
offsetNumber of matched strings to skip before starting to collect the results. Used for pagination.
minLengthShortest string to generate. Strings shorter than this are left out of the enumeration entirely, offset never counting them.
maxLengthLongest string to generate. Strings longer than this are left out of the enumeration entirely, offset never counting them. A value below minLength leaves nothing to generate.
pathOrderOrder in which the paths of the language are scheduled. Defaults to sweep.
characterOrderOrder in which the strings within each path are produced. Defaults to ascending.
seedSeed behind the shuffled modes of pathOrder and characterOrder; ignored when neither is used. The default seed is fixed rather than random, so two calls sharing a seed generate the same strings and offset pages through them consistently. Change it to draw a different sequence from the same term.
charsetCharacter class the generated strings are restricted to, such as [a-z] or \P{C}. Paths needing a character outside of it are dropped entirely. If omitted, every character the term allows is used.
Change how the engine handles the operation.
GenerateStringsPathOrder
Order in which the paths of the language are scheduled — the shapes the term allows, as opposed to the characters filling them (characterOrder). sweep expands one path in full, shortest first, before moving to the next one: the cheapest way to page through a whole language with offset. interleave covers every path the term holds before any path is asked for a second string, so a limit smaller than the number of shapes is spent entirely on distinct shapes; slower than sweep, but better suited to deriving test cases. shuffled is interleave with same-length paths visited in an order drawn by seed. Shorter paths still come first, so the seed only draws among paths of equal length. All three are deterministic and page with offset; for shuffled, offsets are only consistent between calls sharing the same seed.
GenerateStringsCharacterOrder
Order in which the strings within each path are produced. Orthogonal to pathOrder: it does not change what can be generated, only which strings are reached first. ascending expands each position from the low end of its character range first, so [a-z]{8} yields aaaaaaaa, aaaaaaab, ... — a stable, spec-defined order returning the smallest witnesses of a path first. shuffled applies a permutation drawn from seed, so [a-z]{8} yields something like sjtwsive instead: the strings look like real inputs. Random in look only — generation stays reproducible and pages with offset, though offsets are only consistent between calls sharing the same seed, and the exact sequence may change between releases. Use charset to restrict generation to specific characters.
GenerateStringsResponse
typeThe generated distinct strings.
Length
typeminShortest possible length, or null if empty.
maxLongest possible length, or null if unbounded.
TermRequest
Serialized term.
Change how the engine handles the operation.
MultiTermsRequest
Terms to process. Order matters for some operations.
Change how the engine handles the operation.
RepeatRequest
Term to repeat.
minInclusive lower bound of repetitions.
maxInclusive upper bound. If omitted or null, the repetition is unbounded.
Change how the engine handles the operation.
RequestOptions
schemaVersionClient-expected schema version.
Change how the engine returns results.
Change how the engine executes the operation.
FairResponseOptions
deterministicWhen true, the returned FAIR is guaranteed to be a deterministic automaton, suitable for consistent pagination with /generate/strings.
ResponseOptions
formatReturn format of the term.
Options applied when format is "fair". Ignored otherwise.
ExecutionOptions
timeoutTimeout in milliseconds for the operation.
String
typevalueString value.
Strings
typevalueArray of unique strings.
Term
Decision Table
| Variant | Matching Criteria |
|---|---|
| type = object · type="regex" · requires: value | |
| type = object · type="fair" · requires: value |
typevalueRegular expression pattern.
TermRegex
typevalueRegular expression pattern.
TermFairMetadata
deterministicWhether this FAIR encodes a deterministic automaton. Only a deterministic FAIR guarantees consistent string ordering across paginated /generate/strings requests; call /compute/determinize first if this is false.
TermFair
typevalueFAIR payload.
Metadata describing properties of a FAIR automaton.
TwoTermsRequest
Exactly 2 terms.
Change how the engine handles the operation.