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
stack

A Dart package providing a stack data structure with push, pop, size, length, and top functionalities.

pub.devRemove
ScoresHealth3650 (best)
Maintenance01 (best)
Quality76100 (best)
Popularity2361 (best)
Community1123 (best)
Compatibility100100
UsageDownloads (30 days)1.8k23k (best)
Likes1138 (best)
Pub points140 / 160160 / 160 (best)
GitHub stars1218 (best)
MaintenanceLatest release0.2.0, 6 years ago0.2.2, 3 years ago (best)
Major versions in 12 months00
Contributors24 (best)
PublisherUnverifiedUnverified
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.
  • Provides clear stack methods like push, pop, top, and size.
  • Supports null safety and works across multiple platforms including Android, iOS, web, and desktop.
  • Includes a Sized constructor to control stack size constraints.
Weaknesses
  • Unreliable balance factor for small trees.
  • No built-in alternative packages from the catalog to compare against.
  • Limited in scope, handling only basic stack data structure features.
  • Throws an IllegalOperationException if top() or pop() is used on an empty stack.
WarningsNoneNone
kdtree vs stack: which Flutter package should you use? | pubscout