tag:blogger.com,1999:blog-8072464059979174136.post3215885897410060325..comments2023-03-31T08:53:17.476-07:00Comments on don't count on finding me: LLVM Data Structures, and Putting Use on Dietheisenbughttp://www.blogger.com/profile/11328338875953258337noreply@blogger.comBlogger1125tag:blogger.com,1999:blog-8072464059979174136.post-26526799675947771662010-07-22T11:42:57.791-07:002010-07-22T11:42:57.791-07:00You can of course, also derive a faster length by ...You can of course, also derive a faster length by using skew-binary-encoded random-access lists. <br /><br />That then gives you O(log n) drop and indexing as well.Edward Kmetthttps://www.blogger.com/profile/16144424873202502715noreply@blogger.com