|author||Nate Bosch <firstname.lastname@example.org>||Wed May 25 07:52:34 2022 -0700|
|committer||GitHub <email@example.com>||Wed May 25 07:52:34 2022 -0700|
Add complexity bound on binary search methods (#239) Closes #237 In each of the list extensions that mention "Uses binary search" add a sentence documenting that the search takes `log(n)` comparisons. Add a sentence about using binary search and the runtime to the top level algorithm methods.
Contains utility functions and classes in the style of
dart:collection to make working with collections easier.
The package contains functions that operate on lists.
It contains ways to shuffle a
List, do binary search on a sorted
List, and various sorting algorithms.
The package provides a way to specify the equality of elements and collections.
Collections in Dart have no inherent equality. Two sets are not equal, even if they contain exactly the same objects as elements.
Equality interface provides a way to define such an equality. In this case, for example,
const SetEquality(IdentityEquality()) is an equality that considers two sets equal exactly if they contain identical elements.
Equalities are provided for
Maps, as well as combinations of these, such as:
const MapEquality(IdentityEquality(), ListEquality());
This equality considers maps equal if they have identical keys, and the corresponding values are lists with equal (
Utilities for “zipping” a list of iterables into an iterable of lists.
An interface and implementation of a priority queue.
The package contains classes that “wrap” a collection.
A wrapper class contains an object of the same type, and it forwards all methods to the wrapped object.
Wrapper classes can be used in various ways, for example to restrict the type of an object to that of a supertype, or to change the behavior of selected functions on an existing object.
Please file feature requests and bugs at the issue tracker.