https://github.com/dadhi/smap

Fast persistent immutable Map data-structure for Scala with minimal memory footprint
https://github.com/dadhi/smap

2-3-tree benchmark data-structures dictionary efficiency hashmap immutable java map memory performance persistent scala

Last synced: 5 days ago
JSON representation

Fast persistent immutable Map data-structure for Scala with minimal memory footprint

• Host: GitHub
• URL: https://github.com/dadhi/smap
• Owner: dadhi
• License: mit
• Created: 2022-02-10T10:29:50.000Z (almost 3 years ago)
• Default Branch: main
• Last Pushed: 2024-04-23T11:10:36.000Z (7 months ago)
• Last Synced: 2024-05-01T22:50:06.643Z (7 months ago)
• Topics: 2-3-tree, benchmark, data-structures, dictionary, efficiency, hashmap, immutable, java, map, memory, performance, persistent, scala
• Language: Scala
• Homepage:
• Size: 117 KB
• Stars: 5
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# SMap

![Build](https://github.com/dadhi/SMap/actions/workflows/scala.yml/badge.svg)

Fast persistent immutable Map data-structure for Scala with minimal memory footprint.  

The SMap is based on the ImMap from my .NET C# library https://github.com/dadhi/ImTools  

Btw, **S** in Map is for **Speedy**.

### Goals

- [X] Port ImHashMap to SMap with complete addition and lookup ops and minimal tests for sanity

- [X] Benchmark with *ScalaMeter* -> so far inconclusive results

- [X] Benchmark with *JMH* -> initial results are [here](https://jmh.morethan.io/?source=https://raw.githubusercontent.com/dadhi/SMap/main/benchmarks/jmh-results.json)

- [X] Optimize the entry footprint for the Int keys

- [ ] Port the rest of the methods including foreach

- [ ] Port *CsCheck* test to *ScalaCheck*

- [ ] Conform to `immutable.Map` trait as much as possible

- [ ] Publish the package with initial version

- [ ] Optimize the Map entry footprint for the Set