Skip to content
pubscout

Compare

The strongest value in each row is marked.

Attributebit_array

Compactly stores bits in an array data structure

pub.devRemove
kdtree

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

pub.devRemove
ScoresHealth54 (best)36
Maintenance5 (best)0
Quality100 (best)76
Popularity40 (best)23
Community63 (best)11
Compatibility100100
UsageDownloads (30 days)9k (best)1.8k
Likes14 (best)11
Pub points160 / 160 (best)140 / 160
GitHub stars1112 (best)
MaintenanceLatest release2.3.0, 2 years ago (best)0.2.0, 6 years ago
Major versions in 12 months00
Contributors5 (best)2
Publisheragilord.comUnverified
FitPlatformsAll (pure Dart)All (pure Dart)
WASM-readyYesYes
KindPure DartPure Dart
Code generationNoNo
Direct dependencies00
LicenseBSD-3-CLAUSEMIT
Setup effortLowLow
JudgementStrengths
  • Compact memory storage for bits
  • Supports common bitwise operators (&, |, ^)
  • Provides range and callback-driven updates
  • 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
  • Limited to basic bit array manipulation functionality
  • Unreliable balance factor for small trees.
  • No built-in alternative packages from the catalog to compare against.
WarningsNoneNone
bit_array vs kdtree: which Flutter package should you use? | pubscout