grizzly_range library

Classes

Bin<T>

BinCount<T>

ConstantIterable<T>

ConstantIterator<T>

DoubleRange

DoubleRangeIterator

DurationRange

DurationRangeIterator

Extent<E>

Encloses an extent with a inclusive lower limit and exclusive upper limit.

HasExtent<T>

HistBin<T>

IntRange

Iterable of integers similar to python's range.

IntRangeIterator

MonthRange

MonthRangeIterator

TimeRange

TimeRangeIterator

Extensions

BinCountsExt on BinCounts<T>

BinExtentsExt on Extents<T>

BinsExt on Bins<T>

DoubleExtentExt on Extent<double>

DoubleRangeExt on double

DurationRangeExt on Duration

ExtentsExt on Extents<T>

HasExtentListExt on List<HasExtent<T>>

HistogramExt on Histogram<T>

IntExtentExt on Extent<int>

IntExtentsExt on Extents<int>

IntRangeExt on int

ListExtExtent on List<T>

MonthRangeExt on DateTime

NumExtentExt on Extent<T>

ObjRangeExt on T

RandomExt on Random

TimeRangeExt on DateTime

Functions

indices(int length) → Iterable<int>

linspace<T extends num>(T start, T stop, [int count = 100]) → Iterable<T>

ones([int length = 10]) → Iterable<int>

range<T>(T start, T stop, [dynamic step]) → Iterable<T>

take(int length, [int step = 1]) → Iterable<int>

tickIncrement(num start, num stop, int count) → num

ticks(num start, num stop, int count) → Iterable<num>

Returns an Iterable of approximately count + 1 uniformly-spaced, nicely-rounded values between start and stop (inclusive). Each value is a power of ten multiplied by 1, 2 or 5.

tickStep(num start, num stop, num count) → num

until<T>(T stop, [T? step]) → Iterable<T>

zeros([int length = 10]) → Iterable<int>

zip<T>(Iterable<T> a, Iterable<T> b) → Iterable<({T a, T b})>

Typedefs

BinCounts<T> = List<BinCount<T>>

Bins<T> = List<Bin<T>>

Extents<T> = List<Extent<T>>

Histogram<T> = List<HistBin<T>>