Skip to content
pubscout

Compare

The strongest value in each row is marked.

Attributekdtree

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

pub.devRemove
ordered_set

Ordered Set that keeps elements sorted and allows duplicates by priority.

pub.devRemove
ScoresHealth3682 (best)
Maintenance075 (best)
Quality76100 (best)
Popularity2371 (best)
Community1169 (best)
Compatibility100100
UsageDownloads (30 days)1.8k172k (best)
Likes1135 (best)
Pub points140 / 160160 / 160 (best)
GitHub stars1226 (best)
MaintenanceLatest release0.2.0, 6 years ago8.0.1, 4 months ago (best)
Major versions in 12 months00
Contributors26 (best)
PublisherUnverifiedblue-fire.xyz
FitPlatformsAll (pure Dart)All (pure Dart)
WASM-readyYesYes
KindPure DartPure Dart
Code generationNoNo
Direct dependencies00
LicenseMITMIT
Setup effortLowLow
JudgementStrengths
  • 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.
  • Allows duplicate priorities
  • Simple API with static constructors
  • Iterable implementation for easy traversal
  • Supports query registration and caching
Weaknesses
  • Unreliable balance factor for small trees.
  • No built-in alternative packages from the catalog to compare against.
  • No built‑in persistence or async support
  • Not a full data‑structure library (no tree traversal APIs)
WarningsNoneNone
kdtree vs ordered_set: which Flutter package should you use? | pubscout