Jacqueline Firth: Sorted Collections in Rebellion

Computation exists in service of data. Useful data structures, therefore, make the difference between what is possible and what is easy. And of the many forms of structured data, sorted data is arguably the most useful. In this talk, we’ll tour the sorted data structures in Rebellion, a second standard library for Racket I’ve developed over the years. We’ll collect data into sorted sets, sorted maps, and range sets. We’ll reduce and transduce data from one collection into another. We’ll order data according to composable comparators. We’ll build data up gradually, then all at once. We’ll query it, mutate it, persistently update it, and concurrently access it. And we’ll do it all with enough performance to wrap up by lunch.

https://docs.racket-lang.org/rebellio...

---
Learn more about Racket at https://racket-lang.org

Join the community at the Racket Discourse https://racket.discourse.group/ and Discord   / discord  

If you are enjoying the 14th RacketCon please consider supporting the Racket project and community. Donations, both in-kind and monetary, are used for hosting community infrastructure, administration, educational outreach, and community events such as RacketCon and Racket School.

You can donate via either
Software Freedom Conservancy https://racket-lang.org/sfc.html
GitHub Sponsors https://github.com/sponsors/racket

https://racket.discourse.group/t/enjo...