| // Copyright (c) 2011, 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. |
| |
| part of html_common; |
| |
| /** |
| * An indexable collection of a node's descendants in the document tree, |
| * filtered so that only elements are in the collection. |
| */ |
| class FilteredElementList<T extends Element> extends ListBase<T> |
| implements NodeListWrapper{ |
| final Node _node; |
| final List<Node> _childNodes; |
| |
| /** |
| * Creates a collection of the elements that descend from a node. |
| * |
| * Example usage: |
| * |
| * var filteredElements = new FilteredElementList(query("#container")); |
| * // filteredElements is [a, b, c]. |
| */ |
| FilteredElementList(Node node): _childNodes = node.nodes, _node = node; |
| |
| // We can't memoize this, since it's possible that children will be messed |
| // with externally to this class. |
| // |
| // TODO(nweiz): we don't always need to create a new list. For example |
| // forEach, every, any, ... could directly work on the _childNodes. |
| List<T> get _filtered => |
| new List<T>.from(_childNodes.where((n) => n is Element)); |
| |
| void forEach(void f(T element)) { |
| _filtered.forEach(f); |
| } |
| |
| void operator []=(int index, T value) { |
| this[index].replaceWith(value); |
| } |
| |
| void set length(int newLength) { |
| final len = this.length; |
| if (newLength >= len) { |
| return; |
| } else if (newLength < 0) { |
| throw new ArgumentError("Invalid list length"); |
| } |
| |
| removeRange(newLength, len); |
| } |
| |
| void add(T value) { |
| _childNodes.add(value); |
| } |
| |
| void addAll(Iterable<T> iterable) { |
| for (T element in iterable) { |
| add(element); |
| } |
| } |
| |
| bool contains(Object needle) { |
| if (needle is! Element) return false; |
| T element = needle; |
| return element.parentNode == _node; |
| } |
| |
| Iterable<T> get reversed => _filtered.reversed; |
| |
| void sort([int compare(T a, T b)]) { |
| throw new UnsupportedError('Cannot sort filtered list'); |
| } |
| |
| void setRange(int start, int end, Iterable<T> iterable, |
| [int skipCount = 0]) { |
| throw new UnsupportedError('Cannot setRange on filtered list'); |
| } |
| |
| void fillRange(int start, int end, [T fillValue]) { |
| throw new UnsupportedError('Cannot fillRange on filtered list'); |
| } |
| |
| void replaceRange(int start, int end, Iterable<T> iterable) { |
| throw new UnsupportedError('Cannot replaceRange on filtered list'); |
| } |
| |
| void removeRange(int start, int end) { |
| _filtered.sublist(start, end).forEach((el) => el.remove()); |
| } |
| |
| void clear() { |
| // Currently, ElementList#clear clears even non-element nodes, so we follow |
| // that behavior. |
| _childNodes.clear(); |
| } |
| |
| T removeLast() { |
| final result = this.last; |
| if (result != null) { |
| result.remove(); |
| } |
| return result; |
| } |
| |
| void insert(int index, T value) { |
| _childNodes.insert(index, value); |
| } |
| |
| void insertAll(int index, Iterable<T> iterable) { |
| _childNodes.insertAll(index, iterable); |
| } |
| |
| T removeAt(int index) { |
| final result = this[index]; |
| result.remove(); |
| return result; |
| } |
| |
| bool remove(Object element) { |
| if (element is! Element) return false; |
| for (int i = 0; i < length; i++) { |
| T indexElement = this[i]; |
| if (identical(indexElement, element)) { |
| indexElement.remove(); |
| return true; |
| } |
| } |
| return false; |
| } |
| |
| int get length => _filtered.length; |
| T operator [](int index) => _filtered[index]; |
| Iterator<T> get iterator => _filtered.iterator; |
| |
| List<Node> get rawList => _node.childNodes; |
| } |