tck/me.ahoo.wow.tck.ledger/FailureLedgerSpec

FailureLedgerSpec

abstract class FailureLedgerSpec

The FailureLedger contract (documentation/designs/04-subscriptions.md §2) every backend passes. A backend's test extends it and supplies a ledger from createLedger.

Inheritors

Constructors

FailureLedgerSpec

constructor()

Functions

a claim, schedule or take read before another write never applies after it, the entry due again

@Test

fun a claim, schedule or take read before another write never applies after it, the entry due again()

a new entry's retry state reads back with it, in its page and when resolved

@Test

fun a new entry's retry state reads back with it, in its page and when resolved()

a parked aggregate reads back for its subscription only

@Test

fun a parked aggregate reads back for its subscription only()

a repark or a worker's resolve from the partition an entry left writes nothing

@Test

fun a repark or a worker's resolve from the partition an entry left writes nothing()

a request is left for the owner and taken once

@Test

fun a request is left for the owner and taken once()

a restate replaces why the entry is parked and its retry state at the revision read, keeping a request

@Test

fun a restate replaces why the entry is parked and its retry state at the revision read, keeping a request()

a retry is claimed only at the revision read, once among concurrent claims

@Test

fun a retry is claimed only at the revision read, once among concurrent claims()

a schedule, claim or take applies at the revision read, and a claim or operator's change unschedules

@Test

fun a schedule, claim or take applies at the revision read, and a claim or operator's change unschedules()

a source position reads back with its entry, and moves with the earlier version or a repark

@Test

fun a source position reads back with its entry, and moves with the earlier version or a repark()

a subscription's parked aggregates are counted up to the bound

@Test

fun a subscription's parked aggregates are counted up to the bound()

a subscription's parked aggregates are listed in pages, in aggregate order

@Test

fun a subscription's parked aggregates are listed in pages, in aggregate order()

a tenant's parked aggregates are listed alone, in pages, in aggregate order

@Test

fun a tenant's parked aggregates are listed alone, in pages, in aggregate order()

amending an aggregate that is not parked writes nothing

@Test

fun amending an aggregate that is not parked writes nothing()

an operator's retry spec and recoverability are applied and cleared

@Test

fun an operator's retry spec and recoverability are applied and cleared()

concurrent parks of one aggregate keep the earliest from version

@Test

fun concurrent parks of one aggregate keep the earliest from version()

every amendment is classified, as conditional on a revision read or as an unconditional write

@Test

fun every amendment is classified, as conditional on a revision read or as an unconditional write()

every stored change of an entry gives it the next revision

@Test

fun every stored change of an entry gives it the next revision()

parking an aggregate again keeps the earliest from version

@Test

fun parking an aggregate again keeps the earliest from version()

parking from an earlier version and reparking keep the retry state

@Test

fun parking from an earlier version and reparking keep the retry state()

reparking an aggregate that is not parked writes nothing

@Test

fun reparking an aggregate that is not parked writes nothing()

reparking replaces a parked entry, later or earlier, with its partition and reason

@Test

fun reparking replaces a parked entry, later or earlier, with its partition and reason()

resolving removes the entry, after which the aggregate may be parked anew

@Test

fun resolving removes the entry, after which the aggregate may be parked anew()

the due entries are those of the partitions not scheduled yet or scheduled by now, in pages

@Test

fun the due entries are those of the partitions not scheduled yet or scheduled by now, in pages()