Summary: 23 instances, 21 unique

Text	Count
// TODO: Later computations depend on these, but these don't	1
// TODO: Is it possible to generate this table bottom-up? If	1
// TODO: Can we still do the test?	2
// TODO: Can we still do this with n == 1?	2
// TODO: Control this better.	1
// TODO: The n1 and twoU values in the ukeys follow strict	1
// TODO: More precise bounds when there are ties.	1
// TODO: Minimize U?	1
// TODO: Plot method to return a pre-configured Plot object with	1
// TODO: These can generate a lot of garbage. Perhaps the caller	1
// TODO: The worst case for this function is when there are	1
// TODO: For discrete distributions, use the step size to	1
row.cols = append(row.cols, t.Configs...) // TODO Should this also trim common path prefix? (see toCSV)	1
// TODO: Actually, it's at most ⌈n*m/2⌉, but	1
// TODO: Generate less garbage.	1
// TODO: ~40% of this function's time is spent in mapassign on	1
// TODO: Put all errors in the same place and maybe unify them.	1
// TODO: This all assumes that data is sampled at a regular interval	1
// TODO: Add a Support method for finite support distributions? Or	1
// TODO: If the query is invalid, surface that to the user.	1
// TODO: Use symmetry to minimize U	1