Already a member? Log in

Sign up with your...


Sign Up with your email address

Add Tags

Duplicate Tags

Rename Tags

Share This URL With Others!

Save Link

Sign in

Sign Up with your email address

Sign up

By clicking the button, you agree to the Terms & Conditions.

Forgot Password?

Please enter your username below and press the send button.
A password reset link will be sent to you.

If you are unable to access the email address originally associated with your Delicious account, we recommend creating a new account.

Links 1 through 3 of 3 by Atif Aziz tagged data-structures

“With the spreading popularity of languages like F# and Haskell, many people are encountering the concept of an algebraic data type for the first time. When that term is produced without explanation, it almost invariably becomes a source of confusion. In what sense are data types algebraic? Is there a one-to-one correspondence between the structures of high-school algebra and the data types of Haskell? Could I create a polynomial data type? Do I have to remember the quadratic formula? Are the term-transformations of (say) differential calculus meaningful in the context of algebraic data types? Isn’t this all just a bunch of general abstract nonsense? We’ll investigate these questions, and perhaps demystify this important concept of functional languages.” Also broaches the idea behind the Zipper data structure.

Share It With Others!

Mark C. Chu-Carroll provides a good description of the popular but complex algorithm, with an example implementation in Python.

Share It With Others!

Lock-free data structures are usually implemented around some retry logic as well as a strong synchronization primitive. The most widely-used such primitive is known as Compare-And-Swap (CAS). Here is a lock-free stack using a linked list as the underlyin

Share It With Others!