Method Sequence

util/partialord/partialord.go:83–89

Sequence sets a sequence of ordering constraints. So if were making an ordering over {A, B, C, D, E}, and elems provided is {D, B, A} then we are guaranteed that the total ordering will have D comes before B comes before A. (They're may be elements interspersed, e.g. {D, C, E, B, A} is a valid order

(seq ...string)

// then we are guaranteed that the total ordering will have D comes before B comes before A.
// (They're may be elements interspersed, e.g. {D, C, E, B, A} is a valid ordering)
func (ord *PartialOrdering) Sequence(seq ...string) {
	// We make every node in the sequence have a prior node
	for i := 0; i < (len(seq) - 1); i++ {
		err := ord.dag.AddEdge(seq[i], seq[i+1])
		handleDAGErr(err)
	}
}

// TotalOrdering returns a deterministically chosen total ordering that satisfies all specified
// partial ordering constraints.