In Rickshaw.Graph.HoverDetail.js, in the loop from lines 62 to 73, it will loop infinitely if domainX is a value in stackedData[0] and approximateIndex is an index to the left of its position. Instead of incrementing the index to domainX's position in the list, the final check will fail as it is < and not <=, and it will decrement instead, continually bouncing between the two indices to the left of domainX's position in the list. I have an example available if need be.
In Rickshaw.Graph.HoverDetail.js, in the loop from lines 62 to 73, it will loop infinitely if domainX is a value in stackedData[0] and approximateIndex is an index to the left of its position. Instead of incrementing the index to domainX's position in the list, the final check will fail as it is < and not <=, and it will decrement instead, continually bouncing between the two indices to the left of domainX's position in the list. I have an example available if need be.