On Wed, 30 Sep 2015, Nathann Cohen wrote:
We might also want to remove this dependency of posets on
UniqueRepresentation. Despite creating this equality problem,
UniqueRepresentation also causes a memory problem by caching *all*
created posets in memory (makes some computations impossible).
True. That happens if the user wants to search all posets with given
restrictions. To show what I mean (this does not show the problem), at
friday I will talk about Sage and show
for P in Posets():
if P.dimension() > 2:
break
P
* * *
I want to make sure that I understand the rationale. It the user does
def is_sublattice(...): ...
def my_own_is_modular(L):
P5 = Posets.Pentagon()
if is_sublattice(P5, L): ...
my_own_is_modular(L1)
my_own_is_modular(L2)
then P5 is actually created once, not every time my_own_is_modular() is
called? And that can save cpu cycles?
--
Jori Mäntysalo
