Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Some months ago I read somewhere of an efficient approach for appending and prepending lists to other lists in O(1) by representing them with function compositions that, once evaluated, build in O(n) the resulting list.
Unfortunately I cannot remember the source of this article or (if existing) the name of this technique/approach. Do you have references about it, please?
The data structure is called a difference list (or
DListfor short). You can find a default implementation of it in a library available on Hackage.As you mentioned, a full description can be gathered from a chapter in Real World Haskell on the subject.