Skip to content
pubscout

Compare

The strongest value in each row is marked.

Attributefast_immutable_collections

Fast immutable lists, sets, maps, and multimaps for Dart

pub.devRemove
kdtree

A fast Dart implementation of the k-dimensional (k-d) tree data structure.

pub.devRemove
ScoresHealth91 (best)36
Maintenance98 (best)0
Quality93 (best)76
Popularity82 (best)23
Community80 (best)11
Compatibility100100
UsageDownloads (30 days)122k (best)1.8k
Likes412 (best)11
Pub points150 / 160 (best)140 / 160
GitHub stars230 (best)12
MaintenanceLatest release12.0.1, 4 days ago (best)0.2.0, 6 years ago
Major versions in 12 months10 (best)
Contributors14 (best)2
Publisherglasberg.devUnverified
FitPlatformsAll (pure Dart)All (pure Dart)
WASM-readyYesYes
KindPure DartPure Dart
Code generationNoNo
Direct dependencies20 (best)
LicenseBSD-2-CLAUSEMIT
Setup effortLowLow
JudgementStrengths
  • Significantly faster than many traditional immutable collection packages by saving structural differences.
  • No manual mutable/immutable cycles required; easy locking via `.lock` extensions.
  • Supports const instances for IList, ISet, and IMap.
  • Super fast Dart implementation of the k-d tree algorithm.
  • Supports nearest neighbor queries with optional maximal search distance.
  • Includes JSON serialization and balance factor approximation.
Weaknesses
  • Introduces custom collection types (IList, ISet, IMap) that require learning specific APIs.
  • Changes in internal structure flushing can affect identity comparisons if not configured carefully.
  • Unreliable balance factor for small trees.
  • No built-in alternative packages from the catalog to compare against.
WarningsNoneNone
fast_immutable_collections vs kdtree: which Flutter package should you use? | pubscout