Package org.opensearch.cluster.coordination
package org.opensearch.cluster.coordination
-
ClassDescriptionBasic implementation of the Wing and Gong Graph Search Algorithm, following the descriptions in Gavin Lowe: Testing for linearizability Concurrency and Computation: Practice and Experience 29, 4 (2017).Sequence of invocations and responses, recording the run of a concurrent system.Sequential specification of a datatype that allows for keyed access, providing compositional checking (see
LinearizabilityChecker.SequentialSpec.partition(List)).Sequential specification of a datatype.Mock single threadedPrioritizedOpenSearchThreadPoolExecutorbased onDeterministicTaskQueue, simulating the behaviour of an executor returned byOpenSearchExecutors.newSinglePrioritizing(java.lang.String, java.util.concurrent.ThreadFactory, org.opensearch.common.util.concurrent.ThreadContext, java.util.concurrent.ScheduledExecutorService).