Summary: 11 instances, 10 unique

Text	Count
# TODO: these constants should preferably be computed based on the data means in future.	1
//TODO uncomment the following code fragment to complete this witness function//	2
// TODO update the return statement to consider the case where k is a negative number	1
//TODO Complete this witness function//	1
// TODO add the negative spec for k	1
//TODO replace the following line by the commented out for-loop bellow where we identify all start positions	1
//TODO update this ranking function to produce a higher value than the ones in AbsPos.	1
//TODO replace the following line by a for-loop where we identify all end positions	1
//TODO given the spec on the start position, write a spec on the end position	1
//TODO update the following ranking function	1