The data structure used in the algorithm to represent a Course that possibly has multiple sections combined (occurring at the same time)
0: key of this course 1: an array of section indices
Example:
["span20205", [0, 1, 2]]
TODO: add description
compute the width and left of the blocks contained in each day
pre-compute conflictCache
using timeArrayList
and dateList
sanitize a query string, copy it to the WebAssembly heap and returns a pointer to it returns -1 if query is shorter than gramLen
Generated using TypeDoc
Start and end date in millisecond (obtained via
Date.getTime
)