Speed up AsList
, AsSet
and ElementsStabChain
for permutation groups, by not sorting the list returned by ElementsStabChain
(in accordance with its documentation which never promised this)
#5216
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The documentation for
ElementsStabChain
never claimed that the result it returns is sorted. So we change it to not do that, by usingAppend
instead ofUniteSet
. Then we use that to provide a faster version ofAsList
. As a side effect, this actually even speeds upAsSet
, as sorting only at the end is cheaper then sorting repeatedly during creation of the list.Some timings:
Before:
After:
As another side effect, the output of
AsList(G)
andList(Iterator(G))
now seem to coincide ifG
is a permutation group.Of course in practice it's usually a bad idea to enumerate all group elements to start with... but for some applications this is still needed.