I should have explicitly said the version 3 theory, which has an imlpementation in Darcs 2.16. I've never seen worst case quadratic complexity, like quicksort'

I should have explicitly said the version 3 theory, which has an imlpementation in Darcs 2.16. I've never seen worst case quadratic complexity, like quicksort's, labelled exponential before, which seems misleading. I think there's more to practical scalability than worst-case asymptotic complexity, even if guaranteed linear is likely a good start; have the two been compared for Linux or GCC, for instance? I'd be happy to use the best combination of speed and features/usability. I just set up Trac for Darcs hosting -- though it has some tension with the Subversion model -- exporting to git for people who want the pain. I'd investigate Sourcehut integration if I had the time.