3 ms·
I don't see how branch prediction and caches could dominate performance of logically concatenating a huge amount of text instead of doing it physically.
by gngeal 13y ago
I don't see how branch prediction and caches could dominate performance of logically concatenating a huge amount of text instead of doing it physically.
- dkersten 13y agoI guess it depends on what other operations you need. If the only operation you need is concatenation then trees are definitely faster. Otherwise it depends.
- lucian1900 13y agoArrays and copies are often faster than the equivalent structure-sharing trees, under a certain size at least.