txn

type CheckResult struct {
	// valid? true | :unknown | false
	IsUnknown        bool           `json:"is_unknown"`
	Valid            bool           `json:"valid"`
	AnomalyTypes     []string       `json:"anomaly_types"`
	Anomalies        core.Anomalies `json:"anomalies"`
	ImpossibleModels []interface{}  `json:"impossible_models"`
	Not              []string       `json:"not"`
	AlsoNot          []string       `json:"also_not"`
}

type CycleAnomalySpecType struct {
	// A set of relationships which must intersect with every edge in the cycle.
	Rels map[core.Rel]struct{}

	// A set of relationships which must intersect with the first edge in the cycle.
	FirstRel core.Rel
	// A set of relationships which must intersect with remaining edges.
	RestRels map[core.Rel]struct{}

	// A predicate over a cycle explanation. We use this to restrict cycles to e.g. *just* G2 instead of G-single.
	FilterEx FilterExType

	// A predicate over a cycle
	With core.CyclePredicate
}

type CycleExplainerWrapper struct{}

type DistMode = int

type FilterExType = func(cycleCase *core.CycleExplainerResult) bool

type FilterGraphFn = func(rels []core.Rel) *core.DirectedGraph

type KeyDist struct {
	DistMode DistMode
}

type MopIterator struct {
	// contains filtered or unexported fields
}

type OpMopIterator struct {
	// contains filtered or unexported fields
}

type Opts struct {
	// define what specific anomalies and consistency models to look for
	ConsistencyModels []core.ConsistencyModelName
	Anomalies         []string
	AdditionalGraphs  []core.Analyzer
}

type WrTxnOpts struct {
	KeyDist KeyDist
	// The base for an exponential distribution.
	// Defaults to 2, so the first key is twice as likely as the second,
	//  which is twice as likely as the third, etc.
	KeyDistBase     uint
	KeyCount        uint
	MinTxnLength    uint
	MaxTxnLength    uint
	MaxWritesPerKey uint
}

type WrTxnState struct {
	// contains filtered or unexported fields
}