Home | Trees | Indices | Help |
|
---|
|
object --+ | CachingObject --+ | Validator --+ | CourseValidator --+ | SequenceCourseValidator
Validation strategy for a normal orienteering course. This class uses a dynamic programming "longest common subsequence" algorithm to validate the run and find missing and additional punches.
|
|||
|
|||
|
|||
Inherited from Inherited from |
|
|||
|
|||
|
|||
|
|||
|
|
|||
Inherited from |
|
|||
Inherited from |
|
x.__init__(...) initializes x; see help(type(x)) for signature
|
check if plist exactly matches clist
|
Builds the matrix of lcs subsequence lengths.
|
|
Validate the run if it is valid for this course.
|
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Fri Nov 3 23:56:08 2023 | http://epydoc.sourceforge.net |