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

Purely Functional Data Structure: Stream

  • Guillaume Salvan

    gs@libretech.eu

    More posts by Guillaume Salvan.

Guillaume Salvan

7 Aug 2020 • 1 min read
Purely Functional Data Structure: Stream

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: Heap
Data Structure

Purely Functional Data Structure: Heap

Heap A Heap or priority queue is a tree-based data structure allowing efficient access to the highest priority element according to the heap property. module Heap where class Heap h
  • Guillaume Salvan
Guillaume Salvan 11 Aug 2020 • 15 min read
Purely Functional Data Structure: Set
Data Structure

Purely Functional Data Structure: Set

Set A set is an unordered collection of elements without duplicates. {-# LANGUAGE MultiParamTypeClasses #-} module Set(Set(..)) where class Set s a where empty :: s a insert :: a ->
  • Guillaume Salvan
Guillaume Salvan 4 Aug 2020 • 4 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!