LibreTech
  • Home
  • About
  • Author
  • Git
  • Gemini
Purely Functional Data Structure: Deque
Subscribe
Data Structure

Purely Functional Data Structure: Deque

  • Guillaume Salvan

    gs@libretech.eu

    More posts by Guillaume Salvan.

Guillaume Salvan

17 Aug 2020 • 4 min read

This post is for paying subscribers only

Subscribe now

Already have an account? Sign in

Subscribe to LibreTech

Get the latest posts delivered right to your inbox

Great! Check your inbox and click the link to confirm your subscription.
Please enter a valid email address!

More in Data Structure

See all 11 posts →
Purely Functional Data Structure: Random Access List
Data Structure

Purely Functional Data Structure: Random Access List

Random Access List A random access list is a data structure that supports array-like search and update function and head, cons, tail functions in list. Its implementation requires a binary
  • Guillaume Salvan
Guillaume Salvan 19 Aug 2020 • 9 min read
Purely Functional Data Structure: Queue
Data Structure

Purely Functional Data Structure: Queue

A queue is represented with a front and tail list. In the front list, elements are sorted and in the tail list they are in reverse order. Queue module Queue
  • Guillaume Salvan
Guillaume Salvan 14 Aug 2020 • 9 min read
LibreTech © 2021
Latest Posts Ghost
You've successfully subscribed to LibreTech!
Could not sign up! Invalid sign up link.

Subscribe to LibreTech

Stay up to date! Get all the latest & greatest posts delivered straight to your inbox

Great! Check your inbox and click the link to confirm your subscription.
Please enter a valid email address!