| 1 | // Copyright 2014 The Flutter Authors. All rights reserved. |
| 2 | // Use of this source code is governed by a BSD-style license that can be |
| 3 | // found in the LICENSE file. |
| 4 | |
| 5 | /// @docImport 'dart:ui'; |
| 6 | library; |
| 7 | |
| 8 | import 'dart:collection'; |
| 9 | |
| 10 | // COMMON SIGNATURES |
| 11 | |
| 12 | /// Signature for callbacks that report that an underlying value has changed. |
| 13 | /// |
| 14 | /// See also: |
| 15 | /// |
| 16 | /// * [ValueSetter], for callbacks that report that a value has been set. |
| 17 | typedef ValueChanged<T> = void Function(T value); |
| 18 | |
| 19 | /// Signature for callbacks that report that a value has been set. |
| 20 | /// |
| 21 | /// This is the same signature as [ValueChanged], but is used when the |
| 22 | /// callback is called even if the underlying value has not changed. |
| 23 | /// For example, service extensions use this callback because they |
| 24 | /// call the callback whenever the extension is called with a |
| 25 | /// value, regardless of whether the given value is new or not. |
| 26 | /// |
| 27 | /// See also: |
| 28 | /// |
| 29 | /// * [ValueGetter], the getter equivalent of this signature. |
| 30 | /// * [AsyncValueSetter], an asynchronous version of this signature. |
| 31 | typedef ValueSetter<T> = void Function(T value); |
| 32 | |
| 33 | /// Signature for callbacks that are to report a value on demand. |
| 34 | /// |
| 35 | /// See also: |
| 36 | /// |
| 37 | /// * [ValueSetter], the setter equivalent of this signature. |
| 38 | /// * [AsyncValueGetter], an asynchronous version of this signature. |
| 39 | typedef ValueGetter<T> = T Function(); |
| 40 | |
| 41 | /// Signature for callbacks that filter an iterable. |
| 42 | typedef IterableFilter<T> = Iterable<T> Function(Iterable<T> input); |
| 43 | |
| 44 | /// Signature of callbacks that have no arguments and return no data, but that |
| 45 | /// return a [Future] to indicate when their work is complete. |
| 46 | /// |
| 47 | /// See also: |
| 48 | /// |
| 49 | /// * [VoidCallback], a synchronous version of this signature. |
| 50 | /// * [AsyncValueGetter], a signature for asynchronous getters. |
| 51 | /// * [AsyncValueSetter], a signature for asynchronous setters. |
| 52 | typedef AsyncCallback = Future<void> Function(); |
| 53 | |
| 54 | /// Signature for callbacks that report that a value has been set and return a |
| 55 | /// [Future] that completes when the value has been saved. |
| 56 | /// |
| 57 | /// See also: |
| 58 | /// |
| 59 | /// * [ValueSetter], a synchronous version of this signature. |
| 60 | /// * [AsyncValueGetter], the getter equivalent of this signature. |
| 61 | typedef AsyncValueSetter<T> = Future<void> Function(T value); |
| 62 | |
| 63 | /// Signature for callbacks that are to asynchronously report a value on demand. |
| 64 | /// |
| 65 | /// See also: |
| 66 | /// |
| 67 | /// * [ValueGetter], a synchronous version of this signature. |
| 68 | /// * [AsyncValueSetter], the setter equivalent of this signature. |
| 69 | typedef AsyncValueGetter<T> = Future<T> Function(); |
| 70 | |
| 71 | // LAZY CACHING ITERATOR |
| 72 | |
| 73 | /// A lazy caching version of [Iterable]. |
| 74 | /// |
| 75 | /// This iterable is efficient in the following ways: |
| 76 | /// |
| 77 | /// * It will not walk the given iterator more than you ask for. |
| 78 | /// |
| 79 | /// * If you use it twice (e.g. you check [isNotEmpty], then |
| 80 | /// use [single]), it will only walk the given iterator |
| 81 | /// once. This caching will even work efficiently if you are |
| 82 | /// running two side-by-side iterators on the same iterable. |
| 83 | /// |
| 84 | /// * [toList] uses its EfficientLength variant to create its |
| 85 | /// list quickly. |
| 86 | /// |
| 87 | /// It is inefficient in the following ways: |
| 88 | /// |
| 89 | /// * The first iteration through has caching overhead. |
| 90 | /// |
| 91 | /// * It requires more memory than a non-caching iterator. |
| 92 | /// |
| 93 | /// * The [length] and [toList] properties immediately pre-cache the |
| 94 | /// entire list. Using these fields therefore loses the laziness of |
| 95 | /// the iterable. However, it still gets cached. |
| 96 | /// |
| 97 | /// The caching behavior is propagated to the iterators that are |
| 98 | /// created by [map], [where], [expand], [take], [takeWhile], [skip], |
| 99 | /// and [skipWhile], and is used by the built-in methods that use an |
| 100 | /// iterator like [isNotEmpty] and [single]. |
| 101 | /// |
| 102 | /// Because a CachingIterable only walks the underlying data once, it |
| 103 | /// cannot be used multiple times with the underlying data changing |
| 104 | /// between each use. You must create a new iterable each time. This |
| 105 | /// also applies to any iterables derived from this one, e.g. as |
| 106 | /// returned by `where`. |
| 107 | class CachingIterable<E> extends IterableBase<E> { |
| 108 | /// Creates a [CachingIterable] using the given [Iterator] as the source of |
| 109 | /// data. The iterator must not throw exceptions. |
| 110 | /// |
| 111 | /// Since the argument is an [Iterator], not an [Iterable], it is |
| 112 | /// guaranteed that the underlying data set will only be walked |
| 113 | /// once. If you have an [Iterable], you can pass its [iterator] |
| 114 | /// field as the argument to this constructor. |
| 115 | /// |
| 116 | /// You can this with an existing `sync*` function as follows: |
| 117 | /// |
| 118 | /// ```dart |
| 119 | /// Iterable<int> range(int start, int end) sync* { |
| 120 | /// for (int index = start; index <= end; index += 1) { |
| 121 | /// yield index; |
| 122 | /// } |
| 123 | /// } |
| 124 | /// |
| 125 | /// Iterable<int> i = CachingIterable<int>(range(1, 5).iterator); |
| 126 | /// print(i.length); // walks the list |
| 127 | /// print(i.length); // efficient |
| 128 | /// ``` |
| 129 | /// |
| 130 | /// Beware that this will eagerly evaluate the `range` iterable, and because |
| 131 | /// of that it would be better to just implement `range` as something that |
| 132 | /// returns a `List` to begin with if possible. |
| 133 | CachingIterable(this._prefillIterator); |
| 134 | |
| 135 | final Iterator<E> _prefillIterator; |
| 136 | final List<E> _results = <E>[]; |
| 137 | |
| 138 | @override |
| 139 | Iterator<E> get iterator { |
| 140 | return _LazyListIterator<E>(this); |
| 141 | } |
| 142 | |
| 143 | @override |
| 144 | Iterable<T> map<T>(T Function(E e) toElement) { |
| 145 | return CachingIterable<T>(super.map<T>(toElement).iterator); |
| 146 | } |
| 147 | |
| 148 | @override |
| 149 | Iterable<E> where(bool Function(E element) test) { |
| 150 | return CachingIterable<E>(super.where(test).iterator); |
| 151 | } |
| 152 | |
| 153 | @override |
| 154 | Iterable<T> expand<T>(Iterable<T> Function(E element) toElements) { |
| 155 | return CachingIterable<T>(super.expand<T>(toElements).iterator); |
| 156 | } |
| 157 | |
| 158 | @override |
| 159 | Iterable<E> take(int count) { |
| 160 | return CachingIterable<E>(super.take(count).iterator); |
| 161 | } |
| 162 | |
| 163 | @override |
| 164 | Iterable<E> takeWhile(bool Function(E value) test) { |
| 165 | return CachingIterable<E>(super.takeWhile(test).iterator); |
| 166 | } |
| 167 | |
| 168 | @override |
| 169 | Iterable<E> skip(int count) { |
| 170 | return CachingIterable<E>(super.skip(count).iterator); |
| 171 | } |
| 172 | |
| 173 | @override |
| 174 | Iterable<E> skipWhile(bool Function(E value) test) { |
| 175 | return CachingIterable<E>(super.skipWhile(test).iterator); |
| 176 | } |
| 177 | |
| 178 | @override |
| 179 | int get length { |
| 180 | _precacheEntireList(); |
| 181 | return _results.length; |
| 182 | } |
| 183 | |
| 184 | @override |
| 185 | E elementAt(int index) { |
| 186 | RangeError.checkNotNegative(index, 'index' ); |
| 187 | while (_results.length <= index) { |
| 188 | if (!_fillNext()) { |
| 189 | throw IndexError.withLength(index, _results.length, indexable: this, name: 'index' ); |
| 190 | } |
| 191 | } |
| 192 | return _results[index]; |
| 193 | } |
| 194 | |
| 195 | @override |
| 196 | List<E> toList({bool growable = true}) { |
| 197 | _precacheEntireList(); |
| 198 | return List<E>.of(_results, growable: growable); |
| 199 | } |
| 200 | |
| 201 | void _precacheEntireList() { |
| 202 | while (_fillNext()) {} |
| 203 | } |
| 204 | |
| 205 | bool _fillNext() { |
| 206 | if (!_prefillIterator.moveNext()) { |
| 207 | return false; |
| 208 | } |
| 209 | _results.add(_prefillIterator.current); |
| 210 | return true; |
| 211 | } |
| 212 | } |
| 213 | |
| 214 | class _LazyListIterator<E> implements Iterator<E> { |
| 215 | _LazyListIterator(this._owner) : _index = -1; |
| 216 | |
| 217 | final CachingIterable<E> _owner; |
| 218 | int _index; |
| 219 | |
| 220 | @override |
| 221 | E get current { |
| 222 | assert(_index >= 0); // called "current" before "moveNext()" |
| 223 | if (_index < 0 || _index == _owner._results.length) { |
| 224 | throw StateError('current can not be call after moveNext has returned false' ); |
| 225 | } |
| 226 | return _owner._results[_index]; |
| 227 | } |
| 228 | |
| 229 | @override |
| 230 | bool moveNext() { |
| 231 | if (_index >= _owner._results.length) { |
| 232 | return false; |
| 233 | } |
| 234 | _index += 1; |
| 235 | if (_index == _owner._results.length) { |
| 236 | return _owner._fillNext(); |
| 237 | } |
| 238 | return true; |
| 239 | } |
| 240 | } |
| 241 | |
| 242 | /// A factory interface that also reports the type of the created objects. |
| 243 | class Factory<T> { |
| 244 | /// Creates a new factory. |
| 245 | const Factory(this.constructor); |
| 246 | |
| 247 | /// Creates a new object of type T. |
| 248 | final ValueGetter<T> constructor; |
| 249 | |
| 250 | /// The type of the objects created by this factory. |
| 251 | Type get type => T; |
| 252 | |
| 253 | @override |
| 254 | String toString() { |
| 255 | return 'Factory(type: $type)' ; |
| 256 | } |
| 257 | } |
| 258 | |
| 259 | /// Linearly interpolate between two `Duration`s. |
| 260 | Duration lerpDuration(Duration a, Duration b, double t) { |
| 261 | return Duration( |
| 262 | microseconds: (a.inMicroseconds + (b.inMicroseconds - a.inMicroseconds) * t).round(), |
| 263 | ); |
| 264 | } |
| 265 | |