Benchmark that checks the time linearity of the building of a generalized
suffix tree based on sequence of characters as well as the solving of the
mutliple common subsquences problem.
Linear Supertypes
App, DelayedInit, AnyRef, Any
Ordering
Alphabetic
By Inheritance
Inherited
GeneralizedSuffixTreeBuilderLinearityBenchmark
App
DelayedInit
AnyRef
Any
Hide All
Show All
Visibility
Public
All
Value Members
final def!=(arg0: Any): Boolean
Definition Classes
AnyRef → Any
final def##(): Int
Definition Classes
AnyRef → Any
final def==(arg0: Any): Boolean
Definition Classes
AnyRef → Any
defargs: Array[String]
Attributes
protected
Definition Classes
App
Annotations
@deprecatedOverriding("args should not be overridden", "2.11.0")
Benchmark that checks the time linearity of the building of a generalized suffix tree based on sequence of characters as well as the solving of the mutliple common subsquences problem.