7647adba1a
This reduces the runtime of the `deep-nested-large-record` benchmark by about 50%. Note that previously, contrary to its name and documentation, this function traversed a Dhall.Map in insertion order due to its use of Dhall.Map.toList! With this change, the traversal is changed to ascending key order. Also: - Fix the deep-nested-large-record benchmark - Remove the map-operations benchmark: This benchmark actually reports a ~20% loss of performance for the unorderedTraverseWithKey_ change. Since we eventually care about dhall's performance we it's better not to be mislead by a questionable micro-benchmark.
6 lines
74 B
Plaintext
6 lines
74 B
Plaintext
{ types =
|
|
{ Big = ./BigEnum.dhall
|
|
, Little = ./LittleEnum.dhall
|
|
}
|
|
}
|