id	summary	reporter	owner	description	type	status	priority	milestone	component	version	resolution	keywords	cc	os	architecture	failure	difficulty	testcase	blockedby	blocking	related
969	Inconsistent complexities in Data.Set	dpt@…		The documentation for Data.Set says that 'insert' can be performed in time O(log n).  On the other hand, the same operation can also be done with 'singleton' followed by 'union', for a claimed complexity of O(n), which doesn't seem credible.	bug	closed	normal		libraries/base	6.6	invalid			Unknown/Multiple	Unknown/Multiple		Unknown