Details
-
Suggestion
-
Resolution: Fixed
-
P1: Critical
-
6.9.0 Beta1
-
None
-
5
-
e4bcd9f1c (dev), 1d067db12 (6.9), 860998279 (dev), 6869341dc (6.9)
-
Foundation Sprint 122, Foundation Sprint 123, Foundation Sprint 124, Foundation Sprint 125
Description
QDomNodeList currently implements an indexed iterator, basically calling item(n). This allows it to be random-access, but requires the QDomNodeList to linearize itself (maybeCreateList(), noexceptLength()), which takes time and extra memory.
An alternative is to use a sentinel end-iterator and have the QDomNodeList::const_iterator iterate the underlying data structure (a tree) directly, as per QDomNodeListPrivate::forEachNode(). Then this would be more akin to firstChild()/nextSibling() iteration, which does not require linearization of the list.
Attachments
Issue Links
- blocks
-
QTBUG-132090 Qt 6.9 API Change Review
-
- Closed
-
- clones
-
QTBUG-115076 Implement begin/end/iterator in QDomNodeList
-
- Closed
-