tck/me.ahoo.wow.tck.log/EventLogEntryCases

EventLogEntryCases

abstract class EventLogEntryCases : EventLogAccessCases

The entry cases of the EventLog contract: where a stream lands as an entry of a partition, with its position and transport, and how a tail reads the entries back in sequence. They read only EventLogFixtures' fixtures, hooks and constants; see EventLogFixtures for the chain of families this class is part of.

Inheritors

EventLogReadCases

Functions

a partition count that is not a power of two dividing 4096 is refused

@Test

fun a partition count that is not a power of two dividing 4096 is refused()

an entry lands in its ref's partition, sequenced from 1

@Test

fun an entry lands in its ref's partition, sequenced from 1()

an unknown future transport field round-trips unchanged through tail and readEntries

@Test

fun an unknown future transport field round-trips unchanged through tail and readEntries()

The transport is the runtime's opaque bytes: a backend gives them back unchanged, so a field a newer version adds survives a backend that does not know it, and the runtime of that version reads it.

appendAll keeps each stream's transport

@Test

fun appendAll keeps each stream's transport()

appends of two aggregate types interleaved in one partition tail back in sequence order

@Test

fun appends of two aggregate types interleaved in one partition tail back in sequence order()

every partition is created with no parent at epoch 0, and keeps that lineage as entries land

@Test

fun every partition is created with no parent at epoch 0, and keeps that lineage as entries land()

head is the last committed sequence of a partition, null when it is empty

@Test

fun head is the last committed sequence of a partition, null when it is empty()

positionOf finds where a version of an aggregate was committed

@Test

fun positionOf finds where a version of an aggregate was committed()

readEntries returns a version range in version order, each entry with its position and transport

@Test

fun readEntries returns a version range in version order, each entry with its position and transport()

tail never skips a committed entry, however appends interleave

@Test

fun tail never skips a committed entry, however appends interleave()

tail resumes after a position with the same entries

@Test

fun tail resumes after a position with the same entries()

the entry an append's outcome names is what tail reads back

@Test

fun the entry an append's outcome names is what tail reads back()

What the runtime hands its tails in memory is the stream and transport as appended at the position the outcome names: a backend's tail must read back exactly that, the events' payloads as JSON.

transport is given back by tail and readEntries only

@Test

fun transport is given back by tail and readEntries only()