NOTE: This event moved from the 20th to the 28th
In this talk, I would demonstrate how immutable and persistent data structures in functional languages work and why they are more efficient than intuitions.
I would do a case study on various data-structures including array, list, relaxed Radix Balanced Trees, hash array mapped trie. The typical design methods and tradeoffs for such data structures are presented along the way. Then I would talk about the pros and cons, and some best practices of using such data structures.
About the presenter:
Lesley Lai :: https://www.meetup.com/denverfp/members/226583503/profile/
- 5:30 -- Room is ours, come socialize for a few minutes. What's everyone been working on? Anyone interested in giving an upcoming talk.
- 5:45 -- Talk begins.
- 6:45 -- Talk Ends, questions and discussion.
- 7:30 -- We all leave. Some of us usually grab drinks if you're interested.
This meetup is again sponsored by SwitchFly! That means beer and pizza will be generously provided- thanks SwitchFly!