Simple program that runs 100x slower using Text or ByteString vs. String

Here is a repository that just contains a simple function slowText that takes a long list of String / Text / ByteString and appends them using a function based on what happens in the UnitLargeDoc test of the pretty package. A list of String with 10,000,000 elements can be processed in about 5 seconds on my machine. Lists that long blow the stack if the element type is Text or ByteString. For shorter lists, the element processing time is 100x longer or more.

git repo: https://github.com/ddssff/slowtext

travis output: https://travis-ci.org/ddssff/slowtext/builds

The 7.10 and 8.0.2 tests are running properly and failing because the Text and ByteString tests take longer than String. I will fix the others shortly.

Trac metadata

Trac field	Value
Version	8.0.1
Type	Bug
TypeOfFailure	OtherFailure
Priority	normal
Resolution	Unresolved
Component	Core Libraries
Test case
Differential revisions
BlockedBy
Related
Blocking
CC	ekmett
Operating system
Architecture