[Copied from the developer forums]

pif_DataStructures is an implementation of four linear data structures: deques, queues, stacks, and linked lists. I have not included implementations of arrays as they aren't truly achievable in DM, and the closest analog would be the /list type. All four types are able to be bound so that the structure can not exceed a certain amount of nodes. The deque structure has been setup to allow input/output restriction (the programmer can set it up so that nodes can be restricted from popping and pushing on one or both sides). The linked list structure has also been set up so that the linking method can be singly-, doubly-, linearly-, or circularly-linked (stuff like being both doubly- and circularly-linked are allowed).

If you find any bugs or wish to leave any suggestions or comments, reply here or on the forum.