| // Copyright (c) 2013, the Dart project authors. Please see the AUTHORS file |
| // for details. All rights reserved. Use of this source code is governed by a |
| // BSD-style license that can be found in the LICENSE file. |
| |
| /// Note: the VM concatenates all patch files into a single patch file. This |
| /// file is the first patch in "dart:typed_data" which contains all the imports |
| /// used by patches of that library. We plan to change this when we have a |
| /// shared front end and simply use parts. |
| |
| import "dart:_internal" |
| show |
| ClassID, |
| CodeUnits, |
| ExpandIterable, |
| FollowedByIterable, |
| IterableElementError, |
| ListMapView, |
| Lists, |
| MappedIterable, |
| MappedIterable, |
| ReversedListIterable, |
| SkipWhileIterable, |
| Sort, |
| SubListIterable, |
| TakeWhileIterable, |
| WhereIterable, |
| WhereTypeIterable, |
| patch; |
| |
| import "dart:collection" show ListBase; |
| |
| import 'dart:math' show Random; |
| |
| /// There are no parts in patch library: |
| |
| @patch |
| class ByteData implements TypedData { |
| @patch |
| @pragma("vm:entry-point") |
| factory ByteData(int length) { |
| final list = new Uint8List(length) as _TypedList; |
| return new _ByteDataView(list, 0, length); |
| } |
| |
| // Called directly from C code. |
| @pragma("vm:entry-point") |
| factory ByteData._view(_TypedList typedData, int offsetInBytes, int length) { |
| return new _ByteDataView(typedData, offsetInBytes, length); |
| } |
| } |
| |
| // Based class for _TypedList that provides common methods for implementing |
| // the collection and list interfaces. |
| // This class does not extend ListBase<T> since that would add type arguments |
| // to instances of _TypeListBase. Instead the subclasses use type specific |
| // mixins (like _IntListMixin, _DoubleListMixin) to implement ListBase<T>. |
| abstract class _TypedListBase { |
| int get length; |
| int get elementSizeInBytes; |
| int get offsetInBytes; |
| _ByteBuffer get buffer; |
| |
| // Method(s) implementing the Collection interface. |
| String join([String separator = ""]) { |
| StringBuffer buffer = new StringBuffer(); |
| buffer.writeAll(this as Iterable, separator); |
| return buffer.toString(); |
| } |
| |
| bool get isEmpty { |
| return this.length == 0; |
| } |
| |
| bool get isNotEmpty => !isEmpty; |
| |
| // Method(s) implementing the List interface. |
| |
| set length(newLength) { |
| throw new UnsupportedError("Cannot resize a fixed-length list"); |
| } |
| |
| void clear() { |
| throw new UnsupportedError("Cannot remove from a fixed-length list"); |
| } |
| |
| bool remove(Object element) { |
| throw new UnsupportedError("Cannot remove from a fixed-length list"); |
| } |
| |
| void removeRange(int start, int end) { |
| throw new UnsupportedError("Cannot remove from a fixed-length list"); |
| } |
| |
| void replaceRange(int start, int end, Iterable iterable) { |
| throw new UnsupportedError("Cannot remove from a fixed-length list"); |
| } |
| |
| // Method(s) implementing Object interface. |
| String toString() => ListBase.listToString(this as List); |
| |
| // Internal utility methods. |
| |
| // Returns true if operation succeeds. |
| // 'fromCid' and 'toCid' may be cid-s of the views and therefore may not |
| // match the cids of 'this' and 'from'. |
| // Uses toCid and fromCid to decide if clamping is necessary. |
| // Element size of toCid and fromCid must match (test at caller). |
| bool _setRange(int startInBytes, int lengthInBytes, _TypedListBase from, |
| int startFromInBytes, int toCid, int fromCid) native "TypedData_setRange"; |
| } |
| |
| abstract class _IntListMixin implements List<int> { |
| int get elementSizeInBytes; |
| int get offsetInBytes; |
| _ByteBuffer get buffer; |
| |
| List<int> _createList(int length); |
| |
| Iterable<T> whereType<T>() => new WhereTypeIterable<T>(this); |
| |
| Iterable<int> followedBy(Iterable<int> other) => |
| new FollowedByIterable<int>.firstEfficient(this, other); |
| |
| List<R> cast<R>() => List.castFrom<int, R>(this); |
| void set first(int value) { |
| if (this.length == 0) throw new RangeError.index(0, this); |
| this[0] = value; |
| } |
| |
| void set last(int value) { |
| if (this.length == 0) throw new RangeError.index(0, this); |
| this[this.length - 1] = value; |
| } |
| |
| int indexWhere(bool test(int element), [int start = 0]) { |
| if (start < 0) start = 0; |
| for (int i = start; i < length; i++) { |
| if (test(this[i])) return i; |
| } |
| return -1; |
| } |
| |
| int lastIndexWhere(bool test(int element), [int start]) { |
| if (start == null || start >= this.length) start = this.length - 1; |
| for (int i = start; i >= 0; i--) { |
| if (test(this[i])) return i; |
| } |
| return -1; |
| } |
| |
| List<int> operator +(List<int> other) { |
| int totalLength = this.length + other.length; |
| return <int>[] |
| ..length = totalLength |
| ..setRange(0, this.length, this) |
| ..setRange(this.length, totalLength, other); |
| } |
| |
| bool contains(Object element) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| if (this[i] == element) return true; |
| } |
| return false; |
| } |
| |
| void shuffle([Random random]) { |
| if (random == null) random = new Random(); |
| var i = this.length; |
| while (i > 1) { |
| int pos = random.nextInt(i); |
| i -= 1; |
| var tmp = this[i]; |
| this[i] = this[pos]; |
| this[pos] = tmp; |
| } |
| } |
| |
| void setRange(int start, int end, Iterable<int> from, [int skipCount = 0]) { |
| // Check ranges. |
| if (0 > start || start > end || end > length) { |
| RangeError.checkValidRange(start, end, length); // Always throws. |
| assert(false); |
| } |
| if (skipCount < 0) { |
| throw new ArgumentError(skipCount); |
| } |
| |
| final count = end - start; |
| if ((from.length - skipCount) < count) { |
| throw IterableElementError.tooFew(); |
| } |
| |
| if (count == 0) return; |
| |
| if (from is _TypedListBase) { |
| // Note: _TypedListBase is not related to Iterable<int> so there is |
| // no promotion here. |
| final fromAsTypedList = from as _TypedListBase; |
| if (this.elementSizeInBytes == fromAsTypedList.elementSizeInBytes) { |
| if ((count < 10) && (fromAsTypedList.buffer != this.buffer)) { |
| Lists.copy(from as List<int>, skipCount, this, start, count); |
| return; |
| } else if (this.buffer._data._setRange( |
| start * elementSizeInBytes + this.offsetInBytes, |
| count * elementSizeInBytes, |
| fromAsTypedList.buffer._data, |
| skipCount * elementSizeInBytes + fromAsTypedList.offsetInBytes, |
| ClassID.getID(this), |
| ClassID.getID(from))) { |
| return; |
| } |
| } else if (fromAsTypedList.buffer == this.buffer) { |
| // Different element sizes, but same buffer means that we need |
| // an intermediate structure. |
| // TODO(srdjan): Optimize to skip copying if the range does not overlap. |
| final fromAsList = from as List<int>; |
| final tempBuffer = _createList(count); |
| for (var i = 0; i < count; i++) { |
| tempBuffer[i] = fromAsList[skipCount + i]; |
| } |
| for (var i = start; i < end; i++) { |
| this[i] = tempBuffer[i - start]; |
| } |
| return; |
| } |
| } |
| |
| List otherList; |
| int otherStart; |
| if (from is List<int>) { |
| otherList = from; |
| otherStart = skipCount; |
| } else { |
| otherList = from.skip(skipCount).toList(growable: false); |
| otherStart = 0; |
| } |
| if (otherStart + count > otherList.length) { |
| throw IterableElementError.tooFew(); |
| } |
| Lists.copy(otherList, otherStart, this, start, count); |
| } |
| |
| Iterable<int> where(bool f(int element)) => new WhereIterable<int>(this, f); |
| |
| Iterable<int> take(int n) => new SubListIterable<int>(this, 0, n); |
| |
| Iterable<int> takeWhile(bool test(int element)) => |
| new TakeWhileIterable<int>(this, test); |
| |
| Iterable<int> skip(int n) => new SubListIterable<int>(this, n, null); |
| |
| Iterable<int> skipWhile(bool test(int element)) => |
| new SkipWhileIterable<int>(this, test); |
| |
| Iterable<int> get reversed => new ReversedListIterable<int>(this); |
| |
| Map<int, int> asMap() => new ListMapView<int>(this); |
| |
| Iterable<int> getRange(int start, [int end]) { |
| RangeError.checkValidRange(start, end, this.length); |
| return new SubListIterable<int>(this, start, end); |
| } |
| |
| Iterator<int> get iterator => new _TypedListIterator<int>(this); |
| |
| List<int> toList({bool growable: true}) { |
| return new List<int>.from(this, growable: growable); |
| } |
| |
| Set<int> toSet() { |
| return new Set<int>.from(this); |
| } |
| |
| void forEach(void f(int element)) { |
| var len = this.length; |
| for (var i = 0; i < len; i++) { |
| f(this[i]); |
| } |
| } |
| |
| int reduce(int combine(int value, int element)) { |
| var len = this.length; |
| if (len == 0) throw IterableElementError.noElement(); |
| var i = 0; |
| var value = this[0]; |
| for (var i = 1; i < len; ++i) { |
| value = combine(value, this[i]); |
| } |
| return value; |
| } |
| |
| T fold<T>(T initialValue, T combine(T initialValue, int element)) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| initialValue = combine(initialValue, this[i]); |
| } |
| return initialValue; |
| } |
| |
| Iterable<T> map<T>(T f(int element)) => new MappedIterable<int, T>(this, f); |
| |
| Iterable<T> expand<T>(Iterable<T> f(int element)) => |
| new ExpandIterable<int, T>(this, f); |
| |
| bool every(bool f(int element)) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| if (!f(this[i])) return false; |
| } |
| return true; |
| } |
| |
| bool any(bool f(int element)) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| if (f(this[i])) return true; |
| } |
| return false; |
| } |
| |
| int firstWhere(bool test(int element), {int orElse()}) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| var element = this[i]; |
| if (test(element)) return element; |
| } |
| if (orElse != null) return orElse(); |
| throw IterableElementError.noElement(); |
| } |
| |
| int lastWhere(bool test(int element), {int orElse()}) { |
| var result = null; |
| var len = this.length; |
| for (var i = len - 1; i >= 0; --i) { |
| var element = this[i]; |
| if (test(element)) { |
| return element; |
| } |
| } |
| if (orElse != null) return orElse(); |
| throw IterableElementError.noElement(); |
| } |
| |
| int singleWhere(bool test(int element), {int orElse()}) { |
| var result = null; |
| bool foundMatching = false; |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| var element = this[i]; |
| if (test(element)) { |
| if (foundMatching) { |
| throw IterableElementError.tooMany(); |
| } |
| result = element; |
| foundMatching = true; |
| } |
| } |
| if (foundMatching) return result; |
| if (orElse != null) return orElse(); |
| throw IterableElementError.noElement(); |
| } |
| |
| int elementAt(int index) { |
| return this[index]; |
| } |
| |
| void add(int value) { |
| throw new UnsupportedError("Cannot add to a fixed-length list"); |
| } |
| |
| void addAll(Iterable<int> value) { |
| throw new UnsupportedError("Cannot add to a fixed-length list"); |
| } |
| |
| void insert(int index, int value) { |
| throw new UnsupportedError("Cannot insert into a fixed-length list"); |
| } |
| |
| void insertAll(int index, Iterable<int> values) { |
| throw new UnsupportedError("Cannot insert into a fixed-length list"); |
| } |
| |
| void sort([int compare(int a, int b)]) { |
| Sort.sort(this, compare ?? Comparable.compare); |
| } |
| |
| int indexOf(int element, [int start = 0]) { |
| if (start >= this.length) { |
| return -1; |
| } else if (start < 0) { |
| start = 0; |
| } |
| for (int i = start; i < this.length; i++) { |
| if (this[i] == element) return i; |
| } |
| return -1; |
| } |
| |
| int lastIndexOf(int element, [int start = null]) { |
| if (start == null || start >= this.length) { |
| start = this.length - 1; |
| } else if (start < 0) { |
| return -1; |
| } |
| for (int i = start; i >= 0; i--) { |
| if (this[i] == element) return i; |
| } |
| return -1; |
| } |
| |
| int removeLast() { |
| throw new UnsupportedError("Cannot remove from a fixed-length list"); |
| } |
| |
| int removeAt(int index) { |
| throw new UnsupportedError("Cannot remove from a fixed-length list"); |
| } |
| |
| void removeWhere(bool test(int element)) { |
| throw new UnsupportedError("Cannot remove from a fixed-length list"); |
| } |
| |
| void retainWhere(bool test(int element)) { |
| throw new UnsupportedError("Cannot remove from a fixed-length list"); |
| } |
| |
| int get first { |
| if (length > 0) return this[0]; |
| throw IterableElementError.noElement(); |
| } |
| |
| int get last { |
| if (length > 0) return this[length - 1]; |
| throw IterableElementError.noElement(); |
| } |
| |
| int get single { |
| if (length == 1) return this[0]; |
| if (length == 0) throw IterableElementError.noElement(); |
| throw IterableElementError.tooMany(); |
| } |
| |
| List<int> sublist(int start, [int end]) { |
| end = RangeError.checkValidRange(start, end, this.length); |
| var length = end - start; |
| List<int> result = _createList(length); |
| result.setRange(0, length, this, start); |
| return result; |
| } |
| |
| void setAll(int index, Iterable<int> iterable) { |
| final end = iterable.length + index; |
| setRange(index, end, iterable); |
| } |
| |
| void fillRange(int start, int end, [int fillValue]) { |
| RangeError.checkValidRange(start, end, this.length); |
| for (var i = start; i < end; ++i) { |
| this[i] = fillValue; |
| } |
| } |
| } |
| |
| abstract class _DoubleListMixin implements List<double> { |
| int get elementSizeInBytes; |
| int get offsetInBytes; |
| _ByteBuffer get buffer; |
| |
| List<double> _createList(int length); |
| |
| Iterable<T> whereType<T>() => new WhereTypeIterable<T>(this); |
| |
| Iterable<double> followedBy(Iterable<double> other) => |
| new FollowedByIterable<double>.firstEfficient(this, other); |
| |
| List<R> cast<R>() => List.castFrom<double, R>(this); |
| void set first(double value) { |
| if (this.length == 0) throw new RangeError.index(0, this); |
| this[0] = value; |
| } |
| |
| void set last(double value) { |
| if (this.length == 0) throw new RangeError.index(0, this); |
| this[this.length - 1] = value; |
| } |
| |
| int indexWhere(bool test(double element), [int start = 0]) { |
| if (start < 0) start = 0; |
| for (int i = start; i < length; i++) { |
| if (test(this[i])) return i; |
| } |
| return -1; |
| } |
| |
| int lastIndexWhere(bool test(double element), [int start]) { |
| if (start == null || start >= this.length) start = this.length - 1; |
| for (int i = start; i >= 0; i--) { |
| if (test(this[i])) return i; |
| } |
| return -1; |
| } |
| |
| List<double> operator +(List<double> other) { |
| int totalLength = this.length + other.length; |
| return <double>[] |
| ..length = totalLength |
| ..setRange(0, this.length, this) |
| ..setRange(this.length, totalLength, other); |
| } |
| |
| bool contains(Object element) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| if (this[i] == element) return true; |
| } |
| return false; |
| } |
| |
| void shuffle([Random random]) { |
| if (random == null) random = new Random(); |
| var i = this.length; |
| while (i > 1) { |
| int pos = random.nextInt(i); |
| i -= 1; |
| var tmp = this[i]; |
| this[i] = this[pos]; |
| this[pos] = tmp; |
| } |
| } |
| |
| void setRange(int start, int end, Iterable<double> from, |
| [int skipCount = 0]) { |
| // Check ranges. |
| if (0 > start || start > end || end > length) { |
| RangeError.checkValidRange(start, end, length); // Always throws. |
| assert(false); |
| } |
| if (skipCount < 0) { |
| throw new ArgumentError(skipCount); |
| } |
| |
| final count = end - start; |
| if ((from.length - skipCount) < count) { |
| throw IterableElementError.tooFew(); |
| } |
| |
| if (count == 0) return; |
| |
| if (from is _TypedListBase) { |
| // Note: _TypedListBase is not related to Iterable<double> so there is |
| // no promotion here. |
| final fromAsTypedList = from as _TypedListBase; |
| if (this.elementSizeInBytes == fromAsTypedList.elementSizeInBytes) { |
| if ((count < 10) && (fromAsTypedList.buffer != this.buffer)) { |
| Lists.copy(from as List<double>, skipCount, this, start, count); |
| return; |
| } else if (this.buffer._data._setRange( |
| start * elementSizeInBytes + this.offsetInBytes, |
| count * elementSizeInBytes, |
| fromAsTypedList.buffer._data, |
| skipCount * elementSizeInBytes + fromAsTypedList.offsetInBytes, |
| ClassID.getID(this), |
| ClassID.getID(from))) { |
| return; |
| } |
| } else if (fromAsTypedList.buffer == this.buffer) { |
| // Different element sizes, but same buffer means that we need |
| // an intermediate structure. |
| // TODO(srdjan): Optimize to skip copying if the range does not overlap. |
| final fromAsList = from as List<double>; |
| final tempBuffer = _createList(count); |
| for (var i = 0; i < count; i++) { |
| tempBuffer[i] = fromAsList[skipCount + i]; |
| } |
| for (var i = start; i < end; i++) { |
| this[i] = tempBuffer[i - start]; |
| } |
| return; |
| } |
| } |
| |
| List otherList; |
| int otherStart; |
| if (from is List<double>) { |
| otherList = from; |
| otherStart = skipCount; |
| } else { |
| otherList = from.skip(skipCount).toList(growable: false); |
| otherStart = 0; |
| } |
| if (otherStart + count > otherList.length) { |
| throw IterableElementError.tooFew(); |
| } |
| Lists.copy(otherList, otherStart, this, start, count); |
| } |
| |
| Iterable<double> where(bool f(double element)) => |
| new WhereIterable<double>(this, f); |
| |
| Iterable<double> take(int n) => new SubListIterable<double>(this, 0, n); |
| |
| Iterable<double> takeWhile(bool test(double element)) => |
| new TakeWhileIterable<double>(this, test); |
| |
| Iterable<double> skip(int n) => new SubListIterable<double>(this, n, null); |
| |
| Iterable<double> skipWhile(bool test(double element)) => |
| new SkipWhileIterable<double>(this, test); |
| |
| Iterable<double> get reversed => new ReversedListIterable<double>(this); |
| |
| Map<int, double> asMap() => new ListMapView<double>(this); |
| |
| Iterable<double> getRange(int start, [int end]) { |
| RangeError.checkValidRange(start, end, this.length); |
| return new SubListIterable<double>(this, start, end); |
| } |
| |
| Iterator<double> get iterator => new _TypedListIterator<double>(this); |
| |
| List<double> toList({bool growable: true}) { |
| return new List<double>.from(this, growable: growable); |
| } |
| |
| Set<double> toSet() { |
| return new Set<double>.from(this); |
| } |
| |
| void forEach(void f(double element)) { |
| var len = this.length; |
| for (var i = 0; i < len; i++) { |
| f(this[i]); |
| } |
| } |
| |
| double reduce(double combine(double value, double element)) { |
| var len = this.length; |
| if (len == 0) throw IterableElementError.noElement(); |
| var i = 0; |
| var value = this[0]; |
| for (var i = 1; i < len; ++i) { |
| value = combine(value, this[i]); |
| } |
| return value; |
| } |
| |
| T fold<T>(T initialValue, T combine(T initialValue, double element)) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| initialValue = combine(initialValue, this[i]); |
| } |
| return initialValue; |
| } |
| |
| Iterable<T> map<T>(T f(double element)) => |
| new MappedIterable<double, T>(this, f); |
| |
| Iterable<T> expand<T>(Iterable<T> f(double element)) => |
| new ExpandIterable<double, T>(this, f); |
| |
| bool every(bool f(double element)) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| if (!f(this[i])) return false; |
| } |
| return true; |
| } |
| |
| bool any(bool f(double element)) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| if (f(this[i])) return true; |
| } |
| return false; |
| } |
| |
| double firstWhere(bool test(double element), {double orElse()}) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| var element = this[i]; |
| if (test(element)) return element; |
| } |
| if (orElse != null) return orElse(); |
| throw IterableElementError.noElement(); |
| } |
| |
| double lastWhere(bool test(double element), {double orElse()}) { |
| var result = null; |
| var len = this.length; |
| for (var i = len - 1; i >= 0; --i) { |
| var element = this[i]; |
| if (test(element)) { |
| return element; |
| } |
| } |
| if (orElse != null) return orElse(); |
| throw IterableElementError.noElement(); |
| } |
| |
| double singleWhere(bool test(double element), {double orElse()}) { |
| var result = null; |
| bool foundMatching = false; |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| var element = this[i]; |
| if (test(element)) { |
| if (foundMatching) { |
| throw IterableElementError.tooMany(); |
| } |
| result = element; |
| foundMatching = true; |
| } |
| } |
| if (foundMatching) return result; |
| if (orElse != null) return orElse(); |
| throw IterableElementError.noElement(); |
| } |
| |
| double elementAt(int index) { |
| return this[index]; |
| } |
| |
| void add(double value) { |
| throw new UnsupportedError("Cannot add to a fixed-length list"); |
| } |
| |
| void addAll(Iterable<double> value) { |
| throw new UnsupportedError("Cannot add to a fixed-length list"); |
| } |
| |
| void insert(int index, double value) { |
| throw new UnsupportedError("Cannot insert into a fixed-length list"); |
| } |
| |
| void insertAll(int index, Iterable<double> values) { |
| throw new UnsupportedError("Cannot insert into a fixed-length list"); |
| } |
| |
| void sort([int compare(double a, double b)]) { |
| Sort.sort(this, compare ?? Comparable.compare); |
| } |
| |
| int indexOf(double element, [int start = 0]) { |
| if (start >= this.length) { |
| return -1; |
| } else if (start < 0) { |
| start = 0; |
| } |
| for (int i = start; i < this.length; i++) { |
| if (this[i] == element) return i; |
| } |
| return -1; |
| } |
| |
| int lastIndexOf(double element, [int start = null]) { |
| if (start == null || start >= this.length) { |
| start = this.length - 1; |
| } else if (start < 0) { |
| return -1; |
| } |
| for (int i = start; i >= 0; i--) { |
| if (this[i] == element) return i; |
| } |
| return -1; |
| } |
| |
| double removeLast() { |
| throw new UnsupportedError("Cannot remove from a fixed-length list"); |
| } |
| |
| double removeAt(int index) { |
| throw new UnsupportedError("Cannot remove from a fixed-length list"); |
| } |
| |
| void removeWhere(bool test(double element)) { |
| throw new UnsupportedError("Cannot remove from a fixed-length list"); |
| } |
| |
| void retainWhere(bool test(double element)) { |
| throw new UnsupportedError("Cannot remove from a fixed-length list"); |
| } |
| |
| double get first { |
| if (length > 0) return this[0]; |
| throw IterableElementError.noElement(); |
| } |
| |
| double get last { |
| if (length > 0) return this[length - 1]; |
| throw IterableElementError.noElement(); |
| } |
| |
| double get single { |
| if (length == 1) return this[0]; |
| if (length == 0) throw IterableElementError.noElement(); |
| throw IterableElementError.tooMany(); |
| } |
| |
| List<double> sublist(int start, [int end]) { |
| end = RangeError.checkValidRange(start, end, this.length); |
| var length = end - start; |
| List<double> result = _createList(length); |
| result.setRange(0, length, this, start); |
| return result; |
| } |
| |
| void setAll(int index, Iterable<double> iterable) { |
| final end = iterable.length + index; |
| setRange(index, end, iterable); |
| } |
| |
| void fillRange(int start, int end, [double fillValue]) { |
| RangeError.checkValidRange(start, end, this.length); |
| for (var i = start; i < end; ++i) { |
| this[i] = fillValue; |
| } |
| } |
| } |
| |
| abstract class _Float32x4ListMixin implements List<Float32x4> { |
| int get elementSizeInBytes; |
| int get offsetInBytes; |
| _ByteBuffer get buffer; |
| |
| List<Float32x4> _createList(int length); |
| |
| Iterable<T> whereType<T>() => new WhereTypeIterable<T>(this); |
| |
| Iterable<Float32x4> followedBy(Iterable<Float32x4> other) => |
| new FollowedByIterable<Float32x4>.firstEfficient(this, other); |
| |
| List<R> cast<R>() => List.castFrom<Float32x4, R>(this); |
| void set first(Float32x4 value) { |
| if (this.length == 0) throw new RangeError.index(0, this); |
| this[0] = value; |
| } |
| |
| void set last(Float32x4 value) { |
| if (this.length == 0) throw new RangeError.index(0, this); |
| this[this.length - 1] = value; |
| } |
| |
| int indexWhere(bool test(Float32x4 element), [int start = 0]) { |
| if (start < 0) start = 0; |
| for (int i = start; i < length; i++) { |
| if (test(this[i])) return i; |
| } |
| return -1; |
| } |
| |
| int lastIndexWhere(bool test(Float32x4 element), [int start]) { |
| if (start == null || start >= this.length) start = this.length - 1; |
| for (int i = start; i >= 0; i--) { |
| if (test(this[i])) return i; |
| } |
| return -1; |
| } |
| |
| List<Float32x4> operator +(List<Float32x4> other) { |
| int totalLength = this.length + other.length; |
| return <Float32x4>[] |
| ..length = totalLength |
| ..setRange(0, this.length, this) |
| ..setRange(this.length, totalLength, other); |
| } |
| |
| bool contains(Object element) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| if (this[i] == element) return true; |
| } |
| return false; |
| } |
| |
| void shuffle([Random random]) { |
| if (random == null) random = new Random(); |
| var i = this.length; |
| while (i > 1) { |
| int pos = random.nextInt(i); |
| i -= 1; |
| var tmp = this[i]; |
| this[i] = this[pos]; |
| this[pos] = tmp; |
| } |
| } |
| |
| void setRange(int start, int end, Iterable<Float32x4> from, |
| [int skipCount = 0]) { |
| // Check ranges. |
| if (0 > start || start > end || end > length) { |
| RangeError.checkValidRange(start, end, length); // Always throws. |
| assert(false); |
| } |
| if (skipCount < 0) { |
| throw new ArgumentError(skipCount); |
| } |
| |
| final count = end - start; |
| if ((from.length - skipCount) < count) { |
| throw IterableElementError.tooFew(); |
| } |
| |
| if (count == 0) return; |
| |
| if (from is _TypedListBase) { |
| // Note: _TypedListBase is not related to Iterable<Float32x4> so there is |
| // no promotion here. |
| final fromAsTypedList = from as _TypedListBase; |
| if (this.elementSizeInBytes == fromAsTypedList.elementSizeInBytes) { |
| if ((count < 10) && (fromAsTypedList.buffer != this.buffer)) { |
| Lists.copy(from as List<Float32x4>, skipCount, this, start, count); |
| return; |
| } else if (this.buffer._data._setRange( |
| start * elementSizeInBytes + this.offsetInBytes, |
| count * elementSizeInBytes, |
| fromAsTypedList.buffer._data, |
| skipCount * elementSizeInBytes + fromAsTypedList.offsetInBytes, |
| ClassID.getID(this), |
| ClassID.getID(from))) { |
| return; |
| } |
| } else if (fromAsTypedList.buffer == this.buffer) { |
| // Different element sizes, but same buffer means that we need |
| // an intermediate structure. |
| // TODO(srdjan): Optimize to skip copying if the range does not overlap. |
| final fromAsList = from as List<Float32x4>; |
| final tempBuffer = _createList(count); |
| for (var i = 0; i < count; i++) { |
| tempBuffer[i] = fromAsList[skipCount + i]; |
| } |
| for (var i = start; i < end; i++) { |
| this[i] = tempBuffer[i - start]; |
| } |
| return; |
| } |
| } |
| |
| List otherList; |
| int otherStart; |
| if (from is List<Float32x4>) { |
| otherList = from; |
| otherStart = skipCount; |
| } else { |
| otherList = from.skip(skipCount).toList(growable: false); |
| otherStart = 0; |
| } |
| if (otherStart + count > otherList.length) { |
| throw IterableElementError.tooFew(); |
| } |
| Lists.copy(otherList, otherStart, this, start, count); |
| } |
| |
| Iterable<Float32x4> where(bool f(Float32x4 element)) => |
| new WhereIterable<Float32x4>(this, f); |
| |
| Iterable<Float32x4> take(int n) => new SubListIterable<Float32x4>(this, 0, n); |
| |
| Iterable<Float32x4> takeWhile(bool test(Float32x4 element)) => |
| new TakeWhileIterable<Float32x4>(this, test); |
| |
| Iterable<Float32x4> skip(int n) => |
| new SubListIterable<Float32x4>(this, n, null); |
| |
| Iterable<Float32x4> skipWhile(bool test(Float32x4 element)) => |
| new SkipWhileIterable<Float32x4>(this, test); |
| |
| Iterable<Float32x4> get reversed => new ReversedListIterable<Float32x4>(this); |
| |
| Map<int, Float32x4> asMap() => new ListMapView<Float32x4>(this); |
| |
| Iterable<Float32x4> getRange(int start, [int end]) { |
| RangeError.checkValidRange(start, end, this.length); |
| return new SubListIterable<Float32x4>(this, start, end); |
| } |
| |
| Iterator<Float32x4> get iterator => new _TypedListIterator<Float32x4>(this); |
| |
| List<Float32x4> toList({bool growable: true}) { |
| return new List<Float32x4>.from(this, growable: growable); |
| } |
| |
| Set<Float32x4> toSet() { |
| return new Set<Float32x4>.from(this); |
| } |
| |
| void forEach(void f(Float32x4 element)) { |
| var len = this.length; |
| for (var i = 0; i < len; i++) { |
| f(this[i]); |
| } |
| } |
| |
| Float32x4 reduce(Float32x4 combine(Float32x4 value, Float32x4 element)) { |
| var len = this.length; |
| if (len == 0) throw IterableElementError.noElement(); |
| var i = 0; |
| var value = this[0]; |
| for (var i = 1; i < len; ++i) { |
| value = combine(value, this[i]); |
| } |
| return value; |
| } |
| |
| T fold<T>(T initialValue, T combine(T initialValue, Float32x4 element)) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| initialValue = combine(initialValue, this[i]); |
| } |
| return initialValue; |
| } |
| |
| Iterable<T> map<T>(T f(Float32x4 element)) => |
| new MappedIterable<Float32x4, T>(this, f); |
| |
| Iterable<T> expand<T>(Iterable<T> f(Float32x4 element)) => |
| new ExpandIterable<Float32x4, T>(this, f); |
| |
| bool every(bool f(Float32x4 element)) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| if (!f(this[i])) return false; |
| } |
| return true; |
| } |
| |
| bool any(bool f(Float32x4 element)) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| if (f(this[i])) return true; |
| } |
| return false; |
| } |
| |
| Float32x4 firstWhere(bool test(Float32x4 element), {Float32x4 orElse()}) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| var element = this[i]; |
| if (test(element)) return element; |
| } |
| if (orElse != null) return orElse(); |
| throw IterableElementError.noElement(); |
| } |
| |
| Float32x4 lastWhere(bool test(Float32x4 element), {Float32x4 orElse()}) { |
| var result = null; |
| var len = this.length; |
| for (var i = len - 1; i >= 0; --i) { |
| var element = this[i]; |
| if (test(element)) { |
| return element; |
| } |
| } |
| if (orElse != null) return orElse(); |
| throw IterableElementError.noElement(); |
| } |
| |
| Float32x4 singleWhere(bool test(Float32x4 element), {Float32x4 orElse()}) { |
| var result = null; |
| bool foundMatching = false; |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| var element = this[i]; |
| if (test(element)) { |
| if (foundMatching) { |
| throw IterableElementError.tooMany(); |
| } |
| result = element; |
| foundMatching = true; |
| } |
| } |
| if (foundMatching) return result; |
| if (orElse != null) return orElse(); |
| throw IterableElementError.noElement(); |
| } |
| |
| Float32x4 elementAt(int index) { |
| return this[index]; |
| } |
| |
| void add(Float32x4 value) { |
| throw new UnsupportedError("Cannot add to a fixed-length list"); |
| } |
| |
| void addAll(Iterable<Float32x4> value) { |
| throw new UnsupportedError("Cannot add to a fixed-length list"); |
| } |
| |
| void insert(int index, Float32x4 value) { |
| throw new UnsupportedError("Cannot insert into a fixed-length list"); |
| } |
| |
| void insertAll(int index, Iterable<Float32x4> values) { |
| throw new UnsupportedError("Cannot insert into a fixed-length list"); |
| } |
| |
| void sort([int compare(Float32x4 a, Float32x4 b)]) { |
| if (compare == null) { |
| throw "SIMD don't have default compare."; |
| } |
| Sort.sort(this, compare); |
| } |
| |
| int indexOf(Float32x4 element, [int start = 0]) { |
| if (start >= this.length) { |
| return -1; |
| } else if (start < 0) { |
| start = 0; |
| } |
| for (int i = start; i < this.length; i++) { |
| if (this[i] == element) return i; |
| } |
| return -1; |
| } |
| |
| int lastIndexOf(Float32x4 element, [int start = null]) { |
| if (start == null || start >= this.length) { |
| start = this.length - 1; |
| } else if (start < 0) { |
| return -1; |
| } |
| for (int i = start; i >= 0; i--) { |
| if (this[i] == element) return i; |
| } |
| return -1; |
| } |
| |
| Float32x4 removeLast() { |
| throw new UnsupportedError("Cannot remove from a fixed-length list"); |
| } |
| |
| Float32x4 removeAt(int index) { |
| throw new UnsupportedError("Cannot remove from a fixed-length list"); |
| } |
| |
| void removeWhere(bool test(Float32x4 element)) { |
| throw new UnsupportedError("Cannot remove from a fixed-length list"); |
| } |
| |
| void retainWhere(bool test(Float32x4 element)) { |
| throw new UnsupportedError("Cannot remove from a fixed-length list"); |
| } |
| |
| Float32x4 get first { |
| if (length > 0) return this[0]; |
| throw IterableElementError.noElement(); |
| } |
| |
| Float32x4 get last { |
| if (length > 0) return this[length - 1]; |
| throw IterableElementError.noElement(); |
| } |
| |
| Float32x4 get single { |
| if (length == 1) return this[0]; |
| if (length == 0) throw IterableElementError.noElement(); |
| throw IterableElementError.tooMany(); |
| } |
| |
| List<Float32x4> sublist(int start, [int end]) { |
| end = RangeError.checkValidRange(start, end, this.length); |
| var length = end - start; |
| List<Float32x4> result = _createList(length); |
| result.setRange(0, length, this, start); |
| return result; |
| } |
| |
| void setAll(int index, Iterable<Float32x4> iterable) { |
| final end = iterable.length + index; |
| setRange(index, end, iterable); |
| } |
| |
| void fillRange(int start, int end, [Float32x4 fillValue]) { |
| RangeError.checkValidRange(start, end, this.length); |
| for (var i = start; i < end; ++i) { |
| this[i] = fillValue; |
| } |
| } |
| } |
| |
| abstract class _Int32x4ListMixin implements List<Int32x4> { |
| int get elementSizeInBytes; |
| int get offsetInBytes; |
| _ByteBuffer get buffer; |
| |
| List<Int32x4> _createList(int length); |
| |
| Iterable<T> whereType<T>() => new WhereTypeIterable<T>(this); |
| |
| Iterable<Int32x4> followedBy(Iterable<Int32x4> other) => |
| new FollowedByIterable<Int32x4>.firstEfficient(this, other); |
| |
| List<R> cast<R>() => List.castFrom<Int32x4, R>(this); |
| void set first(Int32x4 value) { |
| if (this.length == 0) throw new RangeError.index(0, this); |
| this[0] = value; |
| } |
| |
| void set last(Int32x4 value) { |
| if (this.length == 0) throw new RangeError.index(0, this); |
| this[this.length - 1] = value; |
| } |
| |
| int indexWhere(bool test(Int32x4 element), [int start = 0]) { |
| if (start < 0) start = 0; |
| for (int i = start; i < length; i++) { |
| if (test(this[i])) return i; |
| } |
| return -1; |
| } |
| |
| int lastIndexWhere(bool test(Int32x4 element), [int start]) { |
| if (start == null || start >= this.length) start = this.length - 1; |
| for (int i = start; i >= 0; i--) { |
| if (test(this[i])) return i; |
| } |
| return -1; |
| } |
| |
| List<Int32x4> operator +(List<Int32x4> other) { |
| int totalLength = this.length + other.length; |
| return <Int32x4>[] |
| ..length = totalLength |
| ..setRange(0, this.length, this) |
| ..setRange(this.length, totalLength, other); |
| } |
| |
| bool contains(Object element) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| if (this[i] == element) return true; |
| } |
| return false; |
| } |
| |
| void shuffle([Random random]) { |
| if (random == null) random = new Random(); |
| var i = this.length; |
| while (i > 1) { |
| int pos = random.nextInt(i); |
| i -= 1; |
| var tmp = this[i]; |
| this[i] = this[pos]; |
| this[pos] = tmp; |
| } |
| } |
| |
| void setRange(int start, int end, Iterable<Int32x4> from, |
| [int skipCount = 0]) { |
| // Check ranges. |
| if (0 > start || start > end || end > length) { |
| RangeError.checkValidRange(start, end, length); // Always throws. |
| assert(false); |
| } |
| if (skipCount < 0) { |
| throw new ArgumentError(skipCount); |
| } |
| |
| final count = end - start; |
| if ((from.length - skipCount) < count) { |
| throw IterableElementError.tooFew(); |
| } |
| |
| if (count == 0) return; |
| |
| if (from is _TypedListBase) { |
| // Note: _TypedListBase is not related to Iterable<Int32x4> so there is |
| // no promotion here. |
| final fromAsTypedList = from as _TypedListBase; |
| if (this.elementSizeInBytes == fromAsTypedList.elementSizeInBytes) { |
| if ((count < 10) && (fromAsTypedList.buffer != this.buffer)) { |
| Lists.copy(from as List<Int32x4>, skipCount, this, start, count); |
| return; |
| } else if (this.buffer._data._setRange( |
| start * elementSizeInBytes + this.offsetInBytes, |
| count * elementSizeInBytes, |
| fromAsTypedList.buffer._data, |
| skipCount * elementSizeInBytes + fromAsTypedList.offsetInBytes, |
| ClassID.getID(this), |
| ClassID.getID(from))) { |
| return; |
| } |
| } else if (fromAsTypedList.buffer == this.buffer) { |
| // Different element sizes, but same buffer means that we need |
| // an intermediate structure. |
| // TODO(srdjan): Optimize to skip copying if the range does not overlap. |
| final fromAsList = from as List<Int32x4>; |
| final tempBuffer = _createList(count); |
| for (var i = 0; i < count; i++) { |
| tempBuffer[i] = fromAsList[skipCount + i]; |
| } |
| for (var i = start; i < end; i++) { |
| this[i] = tempBuffer[i - start]; |
| } |
| return; |
| } |
| } |
| |
| List otherList; |
| int otherStart; |
| if (from is List<Int32x4>) { |
| otherList = from; |
| otherStart = skipCount; |
| } else { |
| otherList = from.skip(skipCount).toList(growable: false); |
| otherStart = 0; |
| } |
| if (otherStart + count > otherList.length) { |
| throw IterableElementError.tooFew(); |
| } |
| Lists.copy(otherList, otherStart, this, start, count); |
| } |
| |
| Iterable<Int32x4> where(bool f(Int32x4 element)) => |
| new WhereIterable<Int32x4>(this, f); |
| |
| Iterable<Int32x4> take(int n) => new SubListIterable<Int32x4>(this, 0, n); |
| |
| Iterable<Int32x4> takeWhile(bool test(Int32x4 element)) => |
| new TakeWhileIterable<Int32x4>(this, test); |
| |
| Iterable<Int32x4> skip(int n) => new SubListIterable<Int32x4>(this, n, null); |
| |
| Iterable<Int32x4> skipWhile(bool test(Int32x4 element)) => |
| new SkipWhileIterable<Int32x4>(this, test); |
| |
| Iterable<Int32x4> get reversed => new ReversedListIterable<Int32x4>(this); |
| |
| Map<int, Int32x4> asMap() => new ListMapView<Int32x4>(this); |
| |
| Iterable<Int32x4> getRange(int start, [int end]) { |
| RangeError.checkValidRange(start, end, this.length); |
| return new SubListIterable<Int32x4>(this, start, end); |
| } |
| |
| Iterator<Int32x4> get iterator => new _TypedListIterator<Int32x4>(this); |
| |
| List<Int32x4> toList({bool growable: true}) { |
| return new List<Int32x4>.from(this, growable: growable); |
| } |
| |
| Set<Int32x4> toSet() { |
| return new Set<Int32x4>.from(this); |
| } |
| |
| void forEach(void f(Int32x4 element)) { |
| var len = this.length; |
| for (var i = 0; i < len; i++) { |
| f(this[i]); |
| } |
| } |
| |
| Int32x4 reduce(Int32x4 combine(Int32x4 value, Int32x4 element)) { |
| var len = this.length; |
| if (len == 0) throw IterableElementError.noElement(); |
| var i = 0; |
| var value = this[0]; |
| for (var i = 1; i < len; ++i) { |
| value = combine(value, this[i]); |
| } |
| return value; |
| } |
| |
| T fold<T>(T initialValue, T combine(T initialValue, Int32x4 element)) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| initialValue = combine(initialValue, this[i]); |
| } |
| return initialValue; |
| } |
| |
| Iterable<T> map<T>(T f(Int32x4 element)) => |
| new MappedIterable<Int32x4, T>(this, f); |
| |
| Iterable<T> expand<T>(Iterable<T> f(Int32x4 element)) => |
| new ExpandIterable<Int32x4, T>(this, f); |
| |
| bool every(bool f(Int32x4 element)) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| if (!f(this[i])) return false; |
| } |
| return true; |
| } |
| |
| bool any(bool f(Int32x4 element)) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| if (f(this[i])) return true; |
| } |
| return false; |
| } |
| |
| Int32x4 firstWhere(bool test(Int32x4 element), {Int32x4 orElse()}) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| var element = this[i]; |
| if (test(element)) return element; |
| } |
| if (orElse != null) return orElse(); |
| throw IterableElementError.noElement(); |
| } |
| |
| Int32x4 lastWhere(bool test(Int32x4 element), {Int32x4 orElse()}) { |
| var result = null; |
| var len = this.length; |
| for (var i = len - 1; i >= 0; --i) { |
| var element = this[i]; |
| if (test(element)) { |
| return element; |
| } |
| } |
| if (orElse != null) return orElse(); |
| throw IterableElementError.noElement(); |
| } |
| |
| Int32x4 singleWhere(bool test(Int32x4 element), {Int32x4 orElse()}) { |
| var result = null; |
| bool foundMatching = false; |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| var element = this[i]; |
| if (test(element)) { |
| if (foundMatching) { |
| throw IterableElementError.tooMany(); |
| } |
| result = element; |
| foundMatching = true; |
| } |
| } |
| if (foundMatching) return result; |
| if (orElse != null) return orElse(); |
| throw IterableElementError.noElement(); |
| } |
| |
| Int32x4 elementAt(int index) { |
| return this[index]; |
| } |
| |
| void add(Int32x4 value) { |
| throw new UnsupportedError("Cannot add to a fixed-length list"); |
| } |
| |
| void addAll(Iterable<Int32x4> value) { |
| throw new UnsupportedError("Cannot add to a fixed-length list"); |
| } |
| |
| void insert(int index, Int32x4 value) { |
| throw new UnsupportedError("Cannot insert into a fixed-length list"); |
| } |
| |
| void insertAll(int index, Iterable<Int32x4> values) { |
| throw new UnsupportedError("Cannot insert into a fixed-length list"); |
| } |
| |
| void sort([int compare(Int32x4 a, Int32x4 b)]) { |
| if (compare == null) { |
| throw "SIMD don't have default compare."; |
| } |
| Sort.sort(this, compare); |
| } |
| |
| int indexOf(Int32x4 element, [int start = 0]) { |
| if (start >= this.length) { |
| return -1; |
| } else if (start < 0) { |
| start = 0; |
| } |
| for (int i = start; i < this.length; i++) { |
| if (this[i] == element) return i; |
| } |
| return -1; |
| } |
| |
| int lastIndexOf(Int32x4 element, [int start = null]) { |
| if (start == null || start >= this.length) { |
| start = this.length - 1; |
| } else if (start < 0) { |
| return -1; |
| } |
| for (int i = start; i >= 0; i--) { |
| if (this[i] == element) return i; |
| } |
| return -1; |
| } |
| |
| Int32x4 removeLast() { |
| throw new UnsupportedError("Cannot remove from a fixed-length list"); |
| } |
| |
| Int32x4 removeAt(int index) { |
| throw new UnsupportedError("Cannot remove from a fixed-length list"); |
| } |
| |
| void removeWhere(bool test(Int32x4 element)) { |
| throw new UnsupportedError("Cannot remove from a fixed-length list"); |
| } |
| |
| void retainWhere(bool test(Int32x4 element)) { |
| throw new UnsupportedError("Cannot remove from a fixed-length list"); |
| } |
| |
| Int32x4 get first { |
| if (length > 0) return this[0]; |
| throw IterableElementError.noElement(); |
| } |
| |
| Int32x4 get last { |
| if (length > 0) return this[length - 1]; |
| throw IterableElementError.noElement(); |
| } |
| |
| Int32x4 get single { |
| if (length == 1) return this[0]; |
| if (length == 0) throw IterableElementError.noElement(); |
| throw IterableElementError.tooMany(); |
| } |
| |
| List<Int32x4> sublist(int start, [int end]) { |
| end = RangeError.checkValidRange(start, end, this.length); |
| var length = end - start; |
| List<Int32x4> result = _createList(length); |
| result.setRange(0, length, this, start); |
| return result; |
| } |
| |
| void setAll(int index, Iterable<Int32x4> iterable) { |
| final end = iterable.length + index; |
| setRange(index, end, iterable); |
| } |
| |
| void fillRange(int start, int end, [Int32x4 fillValue]) { |
| RangeError.checkValidRange(start, end, this.length); |
| for (var i = start; i < end; ++i) { |
| this[i] = fillValue; |
| } |
| } |
| } |
| |
| abstract class _Float64x2ListMixin implements List<Float64x2> { |
| int get elementSizeInBytes; |
| int get offsetInBytes; |
| _ByteBuffer get buffer; |
| |
| List<Float64x2> _createList(int length); |
| |
| Iterable<T> whereType<T>() => new WhereTypeIterable<T>(this); |
| |
| Iterable<Float64x2> followedBy(Iterable<Float64x2> other) => |
| new FollowedByIterable<Float64x2>.firstEfficient(this, other); |
| |
| List<R> cast<R>() => List.castFrom<Float64x2, R>(this); |
| void set first(Float64x2 value) { |
| if (this.length == 0) throw new RangeError.index(0, this); |
| this[0] = value; |
| } |
| |
| void set last(Float64x2 value) { |
| if (this.length == 0) throw new RangeError.index(0, this); |
| this[this.length - 1] = value; |
| } |
| |
| int indexWhere(bool test(Float64x2 element), [int start = 0]) { |
| if (start < 0) start = 0; |
| for (int i = start; i < length; i++) { |
| if (test(this[i])) return i; |
| } |
| return -1; |
| } |
| |
| int lastIndexWhere(bool test(Float64x2 element), [int start]) { |
| if (start == null || start >= this.length) start = this.length - 1; |
| for (int i = start; i >= 0; i--) { |
| if (test(this[i])) return i; |
| } |
| return -1; |
| } |
| |
| List<Float64x2> operator +(List<Float64x2> other) { |
| int totalLength = this.length + other.length; |
| return <Float64x2>[] |
| ..length = totalLength |
| ..setRange(0, this.length, this) |
| ..setRange(this.length, totalLength, other); |
| } |
| |
| bool contains(Object element) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| if (this[i] == element) return true; |
| } |
| return false; |
| } |
| |
| void shuffle([Random random]) { |
| if (random == null) random = new Random(); |
| var i = this.length; |
| while (i > 1) { |
| int pos = random.nextInt(i); |
| i -= 1; |
| var tmp = this[i]; |
| this[i] = this[pos]; |
| this[pos] = tmp; |
| } |
| } |
| |
| void setRange(int start, int end, Iterable<Float64x2> from, |
| [int skipCount = 0]) { |
| // Check ranges. |
| if (0 > start || start > end || end > length) { |
| RangeError.checkValidRange(start, end, length); // Always throws. |
| assert(false); |
| } |
| if (skipCount < 0) { |
| throw new ArgumentError(skipCount); |
| } |
| |
| final count = end - start; |
| if ((from.length - skipCount) < count) { |
| throw IterableElementError.tooFew(); |
| } |
| |
| if (count == 0) return; |
| |
| if (from is _TypedListBase) { |
| // Note: _TypedListBase is not related to Iterable<Float64x2> so there is |
| // no promotion here. |
| final fromAsTypedList = from as _TypedListBase; |
| if (this.elementSizeInBytes == fromAsTypedList.elementSizeInBytes) { |
| if ((count < 10) && (fromAsTypedList.buffer != this.buffer)) { |
| Lists.copy(from as List<Float64x2>, skipCount, this, start, count); |
| return; |
| } else if (this.buffer._data._setRange( |
| start * elementSizeInBytes + this.offsetInBytes, |
| count * elementSizeInBytes, |
| fromAsTypedList.buffer._data, |
| skipCount * elementSizeInBytes + fromAsTypedList.offsetInBytes, |
| ClassID.getID(this), |
| ClassID.getID(from))) { |
| return; |
| } |
| } else if (fromAsTypedList.buffer == this.buffer) { |
| // Different element sizes, but same buffer means that we need |
| // an intermediate structure. |
| // TODO(srdjan): Optimize to skip copying if the range does not overlap. |
| final fromAsList = from as List<Float64x2>; |
| final tempBuffer = _createList(count); |
| for (var i = 0; i < count; i++) { |
| tempBuffer[i] = fromAsList[skipCount + i]; |
| } |
| for (var i = start; i < end; i++) { |
| this[i] = tempBuffer[i - start]; |
| } |
| return; |
| } |
| } |
| |
| List otherList; |
| int otherStart; |
| if (from is List<Float64x2>) { |
| otherList = from; |
| otherStart = skipCount; |
| } else { |
| otherList = from.skip(skipCount).toList(growable: false); |
| otherStart = 0; |
| } |
| if (otherStart + count > otherList.length) { |
| throw IterableElementError.tooFew(); |
| } |
| Lists.copy(otherList, otherStart, this, start, count); |
| } |
| |
| Iterable<Float64x2> where(bool f(Float64x2 element)) => |
| new WhereIterable<Float64x2>(this, f); |
| |
| Iterable<Float64x2> take(int n) => new SubListIterable<Float64x2>(this, 0, n); |
| |
| Iterable<Float64x2> takeWhile(bool test(Float64x2 element)) => |
| new TakeWhileIterable<Float64x2>(this, test); |
| |
| Iterable<Float64x2> skip(int n) => |
| new SubListIterable<Float64x2>(this, n, null); |
| |
| Iterable<Float64x2> skipWhile(bool test(Float64x2 element)) => |
| new SkipWhileIterable<Float64x2>(this, test); |
| |
| Iterable<Float64x2> get reversed => new ReversedListIterable<Float64x2>(this); |
| |
| Map<int, Float64x2> asMap() => new ListMapView<Float64x2>(this); |
| |
| Iterable<Float64x2> getRange(int start, [int end]) { |
| RangeError.checkValidRange(start, end, this.length); |
| return new SubListIterable<Float64x2>(this, start, end); |
| } |
| |
| Iterator<Float64x2> get iterator => new _TypedListIterator<Float64x2>(this); |
| |
| List<Float64x2> toList({bool growable: true}) { |
| return new List<Float64x2>.from(this, growable: growable); |
| } |
| |
| Set<Float64x2> toSet() { |
| return new Set<Float64x2>.from(this); |
| } |
| |
| void forEach(void f(Float64x2 element)) { |
| var len = this.length; |
| for (var i = 0; i < len; i++) { |
| f(this[i]); |
| } |
| } |
| |
| Float64x2 reduce(Float64x2 combine(Float64x2 value, Float64x2 element)) { |
| var len = this.length; |
| if (len == 0) throw IterableElementError.noElement(); |
| var i = 0; |
| var value = this[0]; |
| for (var i = 1; i < len; ++i) { |
| value = combine(value, this[i]); |
| } |
| return value; |
| } |
| |
| T fold<T>(T initialValue, T combine(T initialValue, Float64x2 element)) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| initialValue = combine(initialValue, this[i]); |
| } |
| return initialValue; |
| } |
| |
| Iterable<T> map<T>(T f(Float64x2 element)) => |
| new MappedIterable<Float64x2, T>(this, f); |
| |
| Iterable<T> expand<T>(Iterable<T> f(Float64x2 element)) => |
| new ExpandIterable<Float64x2, T>(this, f); |
| |
| bool every(bool f(Float64x2 element)) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| if (!f(this[i])) return false; |
| } |
| return true; |
| } |
| |
| bool any(bool f(Float64x2 element)) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| if (f(this[i])) return true; |
| } |
| return false; |
| } |
| |
| Float64x2 firstWhere(bool test(Float64x2 element), {Float64x2 orElse()}) { |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| var element = this[i]; |
| if (test(element)) return element; |
| } |
| if (orElse != null) return orElse(); |
| throw IterableElementError.noElement(); |
| } |
| |
| Float64x2 lastWhere(bool test(Float64x2 element), {Float64x2 orElse()}) { |
| var result = null; |
| var len = this.length; |
| for (var i = len - 1; i >= 0; --i) { |
| var element = this[i]; |
| if (test(element)) { |
| return element; |
| } |
| } |
| if (orElse != null) return orElse(); |
| throw IterableElementError.noElement(); |
| } |
| |
| Float64x2 singleWhere(bool test(Float64x2 element), {Float64x2 orElse()}) { |
| var result = null; |
| bool foundMatching = false; |
| var len = this.length; |
| for (var i = 0; i < len; ++i) { |
| var element = this[i]; |
| if (test(element)) { |
| if (foundMatching) { |
| throw IterableElementError.tooMany(); |
| } |
| result = element; |
| foundMatching = true; |
| } |
| } |
| if (foundMatching) return result; |
| if (orElse != null) return orElse(); |
| throw IterableElementError.noElement(); |
| } |
| |
| Float64x2 elementAt(int index) { |
| return this[index]; |
| } |
| |
| void add(Float64x2 value) { |
| throw new UnsupportedError("Cannot add to a fixed-length list"); |
| } |
| |
| void addAll(Iterable<Float64x2> value) { |
| throw new UnsupportedError("Cannot add to a fixed-length list"); |
| } |
| |
| void insert(int index, Float64x2 value) { |
| throw new UnsupportedError("Cannot insert into a fixed-length list"); |
| } |
| |
| void insertAll(int index, Iterable<Float64x2> values) { |
| throw new UnsupportedError("Cannot insert into a fixed-length list"); |
| } |
| |
| void sort([int compare(Float64x2 a, Float64x2 b)]) { |
| if (compare == null) { |
| throw "SIMD don't have default compare."; |
| } |
| Sort.sort(this, compare); |
| } |
| |
| int indexOf(Float64x2 element, [int start = 0]) { |
| if (start >= this.length) { |
| return -1; |
| } else if (start < 0) { |
| start = 0; |
| } |
| for (int i = start; i < this.length; i++) { |
| if (this[i] == element) return i; |
| } |
| return -1; |
| } |
| |
| int lastIndexOf(Float64x2 element, [int start = null]) { |
| if (start == null || start >= this.length) { |
| start = this.length - 1; |
| } else if (start < 0) { |
| return -1; |
| } |
| for (int i = start; i >= 0; i--) { |
| if (this[i] == element) return i; |
| } |
| return -1; |
| } |
| |
| Float64x2 removeLast() { |
| throw new UnsupportedError("Cannot remove from a fixed-length list"); |
| } |
| |
| Float64x2 removeAt(int index) { |
| throw new UnsupportedError("Cannot remove from a fixed-length list"); |
| } |
| |
| void removeWhere(bool test(Float64x2 element)) { |
| throw new UnsupportedError("Cannot remove from a fixed-length list"); |
| } |
| |
| void retainWhere(bool test(Float64x2 element)) { |
| throw new UnsupportedError("Cannot remove from a fixed-length list"); |
| } |
| |
| Float64x2 get first { |
| if (length > 0) return this[0]; |
| throw IterableElementError.noElement(); |
| } |
| |
| Float64x2 get last { |
| if (length > 0) return this[length - 1]; |
| throw IterableElementError.noElement(); |
| } |
| |
| Float64x2 get single { |
| if (length == 1) return this[0]; |
| if (length == 0) throw IterableElementError.noElement(); |
| throw IterableElementError.tooMany(); |
| } |
| |
| List<Float64x2> sublist(int start, [int end]) { |
| end = RangeError.checkValidRange(start, end, this.length); |
| var length = end - start; |
| List<Float64x2> result = _createList(length); |
| result.setRange(0, length, this, start); |
| return result; |
| } |
| |
| void setAll(int index, Iterable<Float64x2> iterable) { |
| final end = iterable.length + index; |
| setRange(index, end, iterable); |
| } |
| |
| void fillRange(int start, int end, [Float64x2 fillValue]) { |
| RangeError.checkValidRange(start, end, this.length); |
| for (var i = start; i < end; ++i) { |
| this[i] = fillValue; |
| } |
| } |
| } |
| |
| @pragma("vm:entry-point") |
| class _ByteBuffer implements ByteBuffer { |
| final _TypedList _data; |
| |
| _ByteBuffer(this._data); |
| |
| @pragma("vm:entry-point") |
| factory _ByteBuffer._New(data) => new _ByteBuffer(data); |
| |
| // Forward calls to _data. |
| int get lengthInBytes => _data.lengthInBytes; |
| int get hashCode => _data.hashCode; |
| bool operator ==(Object other) => |
| (other is _ByteBuffer) && identical(_data, other._data); |
| |
| ByteData asByteData([int offsetInBytes = 0, int length]) { |
| if (length == null) { |
| length = this.lengthInBytes - offsetInBytes; |
| } |
| return new _ByteDataView(this._data, offsetInBytes, length); |
| } |
| |
| Int8List asInt8List([int offsetInBytes = 0, int length]) { |
| if (length == null) { |
| length = this.lengthInBytes - offsetInBytes; |
| } |
| return new _Int8ArrayView(this, offsetInBytes, length); |
| } |
| |
| Uint8List asUint8List([int offsetInBytes = 0, int length]) { |
| if (length == null) { |
| length = this.lengthInBytes - offsetInBytes; |
| } |
| return new _Uint8ArrayView(this, offsetInBytes, length); |
| } |
| |
| Uint8ClampedList asUint8ClampedList([int offsetInBytes = 0, int length]) { |
| if (length == null) { |
| length = this.lengthInBytes - offsetInBytes; |
| } |
| return new _Uint8ClampedArrayView(this, offsetInBytes, length); |
| } |
| |
| Int16List asInt16List([int offsetInBytes = 0, int length]) { |
| if (length == null) { |
| length = |
| (this.lengthInBytes - offsetInBytes) ~/ Int16List.bytesPerElement; |
| } |
| return new _Int16ArrayView(this, offsetInBytes, length); |
| } |
| |
| Uint16List asUint16List([int offsetInBytes = 0, int length]) { |
| if (length == null) { |
| length = |
| (this.lengthInBytes - offsetInBytes) ~/ Uint16List.bytesPerElement; |
| } |
| return new _Uint16ArrayView(this, offsetInBytes, length); |
| } |
| |
| Int32List asInt32List([int offsetInBytes = 0, int length]) { |
| if (length == null) { |
| length = |
| (this.lengthInBytes - offsetInBytes) ~/ Int32List.bytesPerElement; |
| } |
| return new _Int32ArrayView(this, offsetInBytes, length); |
| } |
| |
| Uint32List asUint32List([int offsetInBytes = 0, int length]) { |
| if (length == null) { |
| length = |
| (this.lengthInBytes - offsetInBytes) ~/ Uint32List.bytesPerElement; |
| } |
| return new _Uint32ArrayView(this, offsetInBytes, length); |
| } |
| |
| Int64List asInt64List([int offsetInBytes = 0, int length]) { |
| if (length == null) { |
| length = |
| (this.lengthInBytes - offsetInBytes) ~/ Int64List.bytesPerElement; |
| } |
| return new _Int64ArrayView(this, offsetInBytes, length); |
| } |
| |
| Uint64List asUint64List([int offsetInBytes = 0, int length]) { |
| if (length == null) { |
| length = |
| (this.lengthInBytes - offsetInBytes) ~/ Uint64List.bytesPerElement; |
| } |
| return new _Uint64ArrayView(this, offsetInBytes, length); |
| } |
| |
| Float32List asFloat32List([int offsetInBytes = 0, int length]) { |
| if (length == null) { |
| length = |
| (this.lengthInBytes - offsetInBytes) ~/ Float32List.bytesPerElement; |
| } |
| return new _Float32ArrayView(this, offsetInBytes, length); |
| } |
| |
| Float64List asFloat64List([int offsetInBytes = 0, int length]) { |
| if (length == null) { |
| length = |
| (this.lengthInBytes - offsetInBytes) ~/ Float64List.bytesPerElement; |
| } |
| return new _Float64ArrayView(this, offsetInBytes, length); |
| } |
| |
| Float32x4List asFloat32x4List([int offsetInBytes = 0, int length]) { |
| if (length == null) { |
| length = |
| (this.lengthInBytes - offsetInBytes) ~/ Float32x4List.bytesPerElement; |
| } |
| return new _Float32x4ArrayView(this, offsetInBytes, length); |
| } |
| |
| Int32x4List asInt32x4List([int offsetInBytes = 0, int length]) { |
| if (length == null) { |
| length = |
| (this.lengthInBytes - offsetInBytes) ~/ Int32x4List.bytesPerElement; |
| } |
| return new _Int32x4ArrayView(this, offsetInBytes, length); |
| } |
| |
| Float64x2List asFloat64x2List([int offsetInBytes = 0, int length]) { |
| if (length == null) { |
| length = |
| (this.lengthInBytes - offsetInBytes) ~/ Float64x2List.bytesPerElement; |
| } |
| return new _Float64x2ArrayView(this, offsetInBytes, length); |
| } |
| } |
| |
| abstract class _TypedList extends _TypedListBase { |
| int get elementSizeInBytes; |
| |
| // Default method implementing parts of the TypedData interface. |
| int get offsetInBytes { |
| return 0; |
| } |
| |
| int get lengthInBytes { |
| return length * elementSizeInBytes; |
| } |
| |
| _ByteBuffer get buffer => new _ByteBuffer(this); |
| |
| // Methods implementing the collection interface. |
| |
| @pragma("vm:exact-result-type", "dart:core#_Smi") |
| int get length native "TypedData_length"; |
| |
| // Internal utility methods. |
| |
| @pragma("vm:exact-result-type", "dart:core#_Smi") |
| int _getInt8(int offsetInBytes) native "TypedData_GetInt8"; |
| void _setInt8(int offsetInBytes, int value) native "TypedData_SetInt8"; |
| |
| @pragma("vm:exact-result-type", "dart:core#_Smi") |
| int _getUint8(int offsetInBytes) native "TypedData_GetUint8"; |
| void _setUint8(int offsetInBytes, int value) native "TypedData_SetUint8"; |
| |
| @pragma("vm:exact-result-type", "dart:core#_Smi") |
| int _getInt16(int offsetInBytes) native "TypedData_GetInt16"; |
| void _setInt16(int offsetInBytes, int value) native "TypedData_SetInt16"; |
| |
| @pragma("vm:exact-result-type", "dart:core#_Smi") |
| int _getUint16(int offsetInBytes) native "TypedData_GetUint16"; |
| void _setUint16(int offsetInBytes, int value) native "TypedData_SetUint16"; |
| |
| int _getInt32(int offsetInBytes) native "TypedData_GetInt32"; |
| void _setInt32(int offsetInBytes, int value) native "TypedData_SetInt32"; |
| |
| int _getUint32(int offsetInBytes) native "TypedData_GetUint32"; |
| void _setUint32(int offsetInBytes, int value) native "TypedData_SetUint32"; |
| |
| int _getInt64(int offsetInBytes) native "TypedData_GetInt64"; |
| void _setInt64(int offsetInBytes, int value) native "TypedData_SetInt64"; |
| |
| int _getUint64(int offsetInBytes) native "TypedData_GetUint64"; |
| void _setUint64(int offsetInBytes, int value) native "TypedData_SetUint64"; |
| |
| @pragma("vm:exact-result-type", "dart:core#_Double") |
| double _getFloat32(int offsetInBytes) native "TypedData_GetFloat32"; |
| void _setFloat32(int offsetInBytes, double value) |
| native "TypedData_SetFloat32"; |
| |
| @pragma("vm:exact-result-type", "dart:core#_Double") |
| double _getFloat64(int offsetInBytes) native "TypedData_GetFloat64"; |
| void _setFloat64(int offsetInBytes, double value) |
| native "TypedData_SetFloat64"; |
| |
| @pragma("vm:exact-result-type", _Float32x4) |
| Float32x4 _getFloat32x4(int offsetInBytes) native "TypedData_GetFloat32x4"; |
| void _setFloat32x4(int offsetInBytes, Float32x4 value) |
| native "TypedData_SetFloat32x4"; |
| |
| @pragma("vm:exact-result-type", _Int32x4) |
| Int32x4 _getInt32x4(int offsetInBytes) native "TypedData_GetInt32x4"; |
| void _setInt32x4(int offsetInBytes, Int32x4 value) |
| native "TypedData_SetInt32x4"; |
| |
| Float64x2 _getFloat64x2(int offsetInBytes) native "TypedData_GetFloat64x2"; |
| void _setFloat64x2(int offsetInBytes, Float64x2 value) |
| native "TypedData_SetFloat64x2"; |
| |
| /** |
| * Stores the [CodeUnits] as UTF-16 units into this TypedData at |
| * positions [start]..[end] (uint16 indices). |
| */ |
| void _setCodeUnits( |
| CodeUnits units, int byteStart, int length, int skipCount) { |
| assert(byteStart + length * Uint16List.bytesPerElement <= lengthInBytes); |
| String string = CodeUnits.stringOf(units); |
| int sliceEnd = skipCount + length; |
| RangeError.checkValidRange( |
| skipCount, sliceEnd, string.length, "skipCount", "skipCount + length"); |
| for (int i = 0; i < length; i++) { |
| _setUint16(byteStart + i * Uint16List.bytesPerElement, |
| string.codeUnitAt(skipCount + i)); |
| } |
| } |
| } |
| |
| @patch |
| class Int8List { |
| @patch |
| @pragma("vm:exact-result-type", _Int8List) |
| factory Int8List(int length) native "TypedData_Int8Array_new"; |
| |
| @patch |
| factory Int8List.fromList(List<int> elements) { |
| return new Int8List(elements.length) |
| ..setRange(0, elements.length, elements); |
| } |
| } |
| |
| @pragma("vm:entry-point") |
| class _Int8List extends _TypedList with _IntListMixin implements Int8List { |
| // Method(s) implementing List interface. |
| @pragma("vm:exact-result-type", "dart:core#_Smi") |
| int operator [](int index) { |
| if (index < 0 || index >= length) { |
| throw new RangeError.index(index, this, "index"); |
| } |
| return _getInt8(index); |
| } |
| |
| void operator []=(int index, int value) { |
| if (index < 0 || index >= length) { |
| throw new RangeError.index(index, this, "index"); |
| } |
| _setInt8(index, _toInt8(value)); |
| } |
| |
| // Method(s) implementing TypedData interface. |
| int get elementSizeInBytes { |
| return Int8List.bytesPerElement; |
| } |
| |
| // Internal utility methods. |
| Int8List _createList(int length) { |
| return new Int8List(length); |
| } |
| } |
| |
| @patch |
| class Uint8List { |
| @patch |
| @pragma("vm:exact-result-type", _Uint8List) |
| factory Uint8List(int length) native "TypedData_Uint8Array_new"; |
| |
| @patch |
| factory Uint8List.fromList(List<int> elements) { |
| return new Uint8List(elements.length) |
| ..setRange(0, elements.length, elements); |
| } |
| } |
| |
| @pragma("vm:entry-point") |
| class _Uint8List extends _TypedList with _IntListMixin implements Uint8List { |
| // Methods implementing List interface. |
| @pragma("vm:exact-result-type", "dart:core#_Smi") |
| int operator [](int index) { |
| if (index < 0 || index >= length) { |
| throw new RangeError.index(index, this, "index"); |
| } |
| return _getUint8(index); |
| } |
| |
| void operator []=(int index, int value) { |
| if (index < 0 || index >= length) { |
| throw new RangeError.index(index, this, "index"); |
| } |
| _setUint8(index, _toUint8(value)); |
| } |
| |
| // Methods implementing TypedData interface. |
| int get elementSizeInBytes { |
| return Uint8List.bytesPerElement; |
| } |
| |
| // Internal utility methods. |
| Uint8List _createList(int length) { |
| return new Uint8List(length); |
| } |
| } |
| |
| @patch |
| class Uint8ClampedList { |
| @patch |
| @pragma("vm:exact-result-type", _Uint8ClampedList) |
| factory Uint8ClampedList(int length) native "TypedData_Uint8ClampedArray_new"; |
| |
| @patch |
| factory Uint8ClampedList.fromList(List<int> elements) { |
| return new Uint8ClampedList(elements.length) |
| ..setRange(0, elements.length, elements); |
| } |
| } |
| |
| @pragma("vm:entry-point") |
| class _Uint8ClampedList extends _TypedList |
| with _IntListMixin |
| implements Uint8ClampedList { |
| // Methods implementing List interface. |
| @pragma("vm:exact-result-type", "dart:core#_Smi") |
| int operator [](int index) { |
| if (index < 0 || index >= length) { |
| throw new RangeError.index(index, this, "index"); |
| } |
| return _getUint8(index); |
| } |
| |
| void operator []=(int index, int value) { |
| if (index < 0 || index >= length) { |
| throw new RangeError.index(index, this, "index"); |
| } |
| _setUint8(index, _toClampedUint8(value)); |
| } |
| |
| // Methods implementing TypedData interface. |
| int get elementSizeInBytes { |
| return Uint8List.bytesPerElement; |
| } |
| |
| // Internal utility methods. |
| Uint8ClampedList _createList(int length) { |
| return new Uint8ClampedList(length); |
| } |
| } |
| |
| @patch |
| class Int16List { |
| @patch |
| @pragma("vm:exact-result-type", _Int16List) |
| factory Int16List(int length) native "TypedData_Int16Array_new"; |
| |
| @patch |
| factory Int16List.fromList(List<int> elements) { |
| return new Int16List(elements.length) |
| ..setRange(0, elements.length, elements); |
| } |
| } |
| |
| @pragma("vm:entry-point") |
| class _Int16List extends _TypedList with _IntListMixin implements Int16List { |
| // Method(s) implementing List interface. |
| @pragma("vm:exact-result-type", "dart:core#_Smi") |
| int operator [](int index) { |
| if (index < 0 || index >= length) { |
| throw new RangeError.index(index, this, "index"); |
| } |
| return _getIndexedInt16(index); |
| } |
| |
| void operator []=(int index, int value) { |
| if (index < 0 || index >= length) { |
| throw new RangeError.index(index, this, "index"); |
| } |
| _setIndexedInt16(index, _toInt16(value)); |
| } |
| |
| void setRange(int start, int end, Iterable iterable, [int skipCount = 0]) { |
| if (iterable is CodeUnits) { |
| end = RangeError.checkValidRange(start, end, this.length); |
| int length = end - start; |
| int byteStart = this.offsetInBytes + start * Int16List.bytesPerElement; |
| _setCodeUnits(iterable, byteStart, length, skipCount); |
| } else { |
| super.setRange(start, end, iterable, skipCount); |
| } |
| } |
| |
| // Method(s) implementing TypedData interface. |
| int get elementSizeInBytes { |
| return Int16List.bytesPerElement; |
| } |
| |
| // Internal utility methods. |
| Int16List _createList(int length) { |
| return new Int16List(length); |
| } |
| |
| int _getIndexedInt16(int index) { |
| return _getInt16(index * Int16List.bytesPerElement); |
| } |
| |
| void _setIndexedInt16(int index, int value) { |
| _setInt16(index * Int16List.bytesPerElement, value); |
| } |
| } |
| |
| @patch |
| class Uint16List { |
| @patch |
| @pragma("vm:exact-result-type", _Uint16List) |
| factory Uint16List(int length) native "TypedData_Uint16Array_new"; |
| |
| @patch |
| factory Uint16List.fromList(List<int> elements) { |
| return new Uint16List(elements.length) |
| ..setRange(0, elements.length, elements); |
| } |
| } |
| |
| @pragma("vm:entry-point") |
| class _Uint16List extends _TypedList with _IntListMixin implements Uint16List { |
| // Method(s) implementing the List interface. |
| @pragma("vm:exact-result-type", "dart:core#_Smi") |
| int operator [](int index) { |
| if (index < 0 || index >= length) { |
| throw new RangeError.index(index, this, "index"); |
| } |
| return _getIndexedUint16(index); |
| } |
| |
| void operator []=(int index, int value) { |
| if (index < 0 || index >= length) { |
| throw new RangeError.index(index, this, "index"); |
| } |
| _setIndexedUint16(index, _toUint16(value)); |
| } |
| |
| void setRange(int start, int end, Iterable iterable, [int skipCount = 0]) { |
| if (iterable is CodeUnits) { |
| end = RangeError.checkValidRange(start, end, this.length); |
| int length = end - start; |
| int byteStart = this.offsetInBytes + start * Uint16List.bytesPerElement; |
| _setCodeUnits(iterable, byteStart, length, skipCount); |
| } else { |
| super.setRange(start, end, iterable, skipCount); |
| } |
| } |
| |
| // Method(s) implementing the TypedData interface. |
| int get elementSizeInBytes { |
| return Uint16List.bytesPerElement; |
| } |
| |
| // Internal utility methods. |
| Uint16List _createList(int length) { |
| return new Uint16List(length); |
| } |
| |
| int _getIndexedUint16(int index) { |
| return _getUint16(index * Uint16List.bytesPerElement); |
| } |
| |
| void _setIndexedUint16(int index, int value) { |
| _setUint16(index * Uint16List.bytesPerElement, value); |
| } |
| } |
| |
| @patch |
| class Int32List { |
| @patch |
| @pragma("vm:exact-result-type", _Int32List) |
| factory Int32List(int length) native "TypedData_Int32Array_new"; |
| |
| @patch |
| factory Int32List.fromList(List<int> elements) { |
| return new Int32List(elements.length) |
| ..setRange(0, elements.length, elements); |
| } |
| } |
| |
| @pragma("vm:entry-point") |
| class _Int32List extends _TypedList with _IntListMixin implements Int32List { |
| // Method(s) implementing the List interface. |
| int operator [](int index) { |
| if (index < 0 || index >= length) { |
| throw new RangeError.index(index, this, "index"); |
| } |
| return _getIndexedInt32(index); |
| } |
| |
| void operator []=(int index, int value) { |
| if (index < 0 || index >= length) { |
| throw new RangeError.index(index, this, "index"); |
| } |
| _setIndexedInt32(index, _toInt32(value)); |
| } |
| |
| // Method(s) implementing TypedData interface. |
| int get elementSizeInBytes { |
| return Int32List.bytesPerElement; |
| } |
| |
| // Internal utility methods. |
| Int32List _createList(int length) { |
| return new Int32List(length); |
| } |
| |
| int _getIndexedInt32(int index) { |
| return _getInt32(index * Int32List.bytesPerElement); |
| } |
| |
| void _setIndexedInt32(int index, int value) { |
| _setInt32(index * Int32List.bytesPerElement, value); |
| } |
| } |
| |
| @patch |
| class Uint32List { |
| @patch |
| @pragma("vm:exact-result-type", _Uint32List) |
| factory Uint32List(int length) native "TypedData_Uint32Array_new"; |
| |
| @patch |
| factory Uint32List.fromList(List<int> elements) { |
| return new Uint32List(elements.length) |
| ..setRange(0, elements.length, elements); |
| } |
| } |
| |
| @pragma("vm:entry-point") |
| class _Uint32List extends _TypedList with _IntListMixin implements Uint32List { |
| // Method(s) implementing the List interface. |
| int operator [](int index) { |
| if (index < 0 || index >= length) { |
| throw new RangeError.index(index, this, "index"); |
| } |
| return _getIndexedUint32(index); |
| } |
| |
| void operator []=(int index, int value) { |
| if (index < 0 || index >= length) { |
| throw new RangeError.index(index, this, "index"); |
| } |
| _setIndexedUint32(index, _toUint32(value)); |
| } |
| |
| // Method(s) implementing the TypedData interface. |
| int get elementSizeInBytes { |
| return Uint32List.bytesPerElement; |
| } |
| |
| // Internal utility methods. |
| Uint32List _createList(int length) { |
| return new Uint32List(length); |
| } |
| |
| int _getIndexedUint32(int index) { |
| return _getUint32(index * Uint32List.bytesPerElement); |
| } |
| |
| void _setIndexedUint32(int index, int value) { |
| _setUint32(index * Uint32List.bytesPerElement, value); |
| } |
| } |
| |
| @patch |
| class Int64List { |
| @patch |
| @pragma("vm:exact-result-type", _Int64List) |
| factory Int64List(int length) native "TypedData_Int64Array_new"; |
| |
| @patch |
| factory Int64List.fromList(List<int> elements) { |
| return new Int64List(elements.length) |
| ..setRange(0, elements.length, elements); |
| } |
| } |
| |
| @pragma("vm:entry-point") |
| class _Int64List extends _TypedList with _IntListMixin implements Int64List { |
| // Method(s) implementing the List interface. |
| int operator [](int index) { |
| if (index < 0 || index >= length) { |
| throw new RangeError.index(index, this, "index"); |
| } |
| return _getIndexedInt64(index); |
| } |
| |
| void operator []=(int index, int value) { |
| if (index < 0 || index >= length) { |
| throw new RangeError.index(index, this, "index"); |
| } |
| _setIndexedInt64(index, value); |
| } |
| |
| // Method(s) implementing the TypedData interface. |
| int get elementSizeInBytes { |
| return Int64List.bytesPerElement; |
| } |
| |
| // Internal utility methods. |
| Int64List _createList(int length) { |
| return new Int64List(length); |
| } |
| |
| int _getIndexedInt64(int index) { |
| return _getInt64(index * Int64List.bytesPerElement); |
| } |
| |
| void _setIndexedInt64(int index, int value) { |
| _setInt64(index * Int64List.bytesPerElement, value); |
| } |
| } |
| |
| @patch |
| class Uint64List { |
| @patch |
| @pragma("vm:exact-result-type", _Uint64List) |
| factory Uint64List(int length) native "TypedData_Uint64Array_new"; |
| |
| @patch |
| factory Uint64List.fromList(List<int> elements) { |
| return new Uint64List(elements.length) |
| ..setRange(0, elements.length, elements); |
| } |
| } |
| |
| @pragma("vm:entry-point") |
| class _Uint64List extends _TypedList with _IntListMixin implements Uint64List { |
| // Method(s) implementing the List interface. |
| int operator [](int index) { |
| if (index < 0 || index >= length) { |
| throw new RangeError.index(index, this, "index"); |
| } |
| return _getIndexedUint64(index); |
| } |
| |
| void operator []=(int index, int value) { |
| if (index < 0 || index >= length) { |
| throw new RangeError.index(index, this, "index"); |
| } |
| _setIndexedUint64(index, value); |
| } |
| |
| // Method(s) implementing the TypedData interface. |
| int get elementSizeInBytes { |
| return Uint64List.bytesPerElement; |
| } |
| |
| // Internal utility methods. |
| Uint64List _createList(int length) { |
| return new Uint64List(length); |
| } |
| |
| int _getIndexedUint64(int index) { |
| return _getUint64(index * Uint64List.bytesPerElement); |
| } |
| |
| void _setIndexedUint64(int index, int value) { |
| _setUint64(index * Uint64List.bytesPerElement, value); |
| } |
| } |
| |
| @patch |
| class Float32List { |
| @patch |
| @pragma("vm:exact-result-type", _Float32List) |
| factory Float32List(int length) native "TypedData_Float32Array_new"; |
| |
| @patch |
| factory Float32List.fromList(List<double> elements) { |
| return new Float32List(elements.length) |
| ..setRange(0, elements.length, elements); |
| } |
| } |
| |
| @pragma("vm:entry-point") |
| class _Float32List extends _TypedList |
| with _DoubleListMixin |
| implements Float32List { |
| // Method(s) implementing the List interface. |
| @pragma("vm:exact-result-type", "dart:core#_Double") |
| double operator [](int index) { |
| if (index < 0 || index >= length) { |
| throw new RangeError.index(index, this, "index"); |
| } |
| return _getIndexedFloat32(index); |
| } |
| |
| void operator []=(int index, double value) { |
| if (index < 0 || index >= length) { |
| throw new RangeError.index(index, this, "index"); |
| } |
| _setIndexedFloat32(index, value); |
| } |
| |
| // Method(s) implementing the TypedData interface. |
| int get elementSizeInBytes { |
| return Float32List.bytesPerElement; |
| } |
| |
| // Internal utility methods. |
| Float32List _createList(int length) { |
| return new Float32List(length); |
| } |
| |
| double _getIndexedFloat32(int index) { |
| return _getFloat32(index * Float32List.bytesPerElement); |
| } |
| |
| void _setIndexedFloat32(int index, double value) { |
| _setFloat32(index * Float32List.bytesPerElement, value); |
| } |
| } |
| |
| @patch |
| class Float64List { |
| @patch |
| @pragma("vm:exact-result-type", _Float64List) |
| factory Float64List(int length) native "TypedData_Float64Array_new"; |
| |
| @patch |
| factory Float64List.fromList(List<double> elements) { |
| return new Float64List(elements.length) |
| ..setRange(0, elements.length, elements); |
| } |
| } |
| |
| @pragma("vm:entry-point") |
| class _Float64List extends _TypedList |
| with _DoubleListMixin |
| implements Float64List { |
| // Method(s) implementing the List interface. |
| @pragma("vm:exact-result-type", "dart:core#_Double") |
| double operator [](int index) { |
| if (index < 0 || index >= length) { |
| throw new RangeError.index(index, this, "index"); |
| } |
| return _getIndexedFloat64(index); |
| } |
| |
| void operator []=(int index, double value) { |
| if (index < 0 || index >= length) { |
| throw new RangeError.index(index, this, "index"); |
| } |
| _setIndexedFloat64(index, value); |
| } |
| |
| // Method(s) implementing the TypedData interface. |
| int get elementSizeInBytes { |
| return Float64List.bytesPerElement; |
| } |
| |
| // Internal utility methods. |
| Float64List _createList(int length) { |
| return new Float64List(length); |
|