at.logic.skeptik.algorithm.compressor
(cottonSplit: (Proof[SequentProofNode], Guard[SequentProofNode]) ⇒ Proof[SequentProofNode]).apply(v1, v2)
(cottonSplit: (Proof[SequentProofNode]) ⇒ Proof[SequentProofNode]).apply(v1)
(cottonSplit: StringAdd).self
(cottonSplit: StringFormat).self
(cottonSplit: (Proof[SequentProofNode], Guard[SequentProofNode]) ⇒ Proof[SequentProofNode]).toString()
(cottonSplit: (Proof[SequentProofNode]) ⇒ Proof[SequentProofNode]).toString()
(cottonSplit: ArrowAssoc[CottonSplit]).x
(Since version 2.10.0) Use leftOfArrow
instead
(cottonSplit: Ensuring[CottonSplit]).x
(Since version 2.10.0) Use resultOfEnsuring
instead
Cotton Split compression algorithm
It's still 30% faster than MultiSplit(1).