The performance of creating new datetime formats can be improved

[DmitryNekrasov]

• Replace direct list concatenation in ParserStructure.append() with ConcatenatedListView for improved efficiency.
• Add ConcatenatedListView implementation to lazily combine two lists without creating a new collection.

[DmitryNekrasov]

@dkhalanskyjb Hello! What do you think about this idea?

[dkhalanskyjb]

Hi! This may help with the first stage (building a parser before the normalisation), but normalisation has quadratic complexity, too, and it wouldn't benefit from the proposed approach, as the lists themselves will also need to be reconstructed.

We could extract the happy fast path where there are no adjacent numeric parser operations and simplify normalisation there. That is a common case, so it would be nice to provide brilliant performance there. I'm not yet convinced the common case can't be drastically improved by a better algorithm.

[dkhalanskyjb]

Now that I think about it, it doesn't even fix the quadratic complexity of the initial stage. Concatenating n parsers will give us a binary tree with n leaves. We will need to traverse the tree at least once, and even a single enumeration of all these elements will have quadratic complexity: the depth n to access the first parser, n - 1 to access the second one, and so on. The construction of the new list does indeed become O(n), but then, each traversal is O(n^2).

Most parsers we concatenate are going to be single-element, so n parsers basically means n operations.