search

sagemath / sage

Main repository of SageMath. Now open for Issues and Pull Requests.
https://www.sagemath.org
Other
1.21k stars 421 forks source link

Direct access to hash of elements of finite enumerated sets #31269

Open videlec opened 3 years ago

videlec commented 3 years ago

We propose the introduction of a protocol (ie a specified method with a standardized name) on finite ordered sets in order to access the hash of elements of an ordered set as a Python array. This kind of feature is needed in some situations to implement efficient hashing of composed objects such as permutations encountered in eg #31236.

Note that for "big" finite sets this makes no sense (storing the array would be memory prohibitive). However, as far as symmetric group as concerned, the list of elements of the domain is done anyway.

Component: performance

Issue created by migration from https://trac.sagemath.org/ticket/31269

mkoeppe commented 3 years ago
comment:1

Sage development has entered the release candidate phase for 9.3. Setting a new milestone for this ticket based on a cursory review of ticket status, priority, and last modification date.