[xmonad] XMonad Efficiency

[Brandon Allbery]

On Tue, Apr 17, 2012 at 14:23, Norbert Zeh <nzeh at cs.dal.ca> wrote:

> Brandon Allbery [2012.04.17 1344 -0400]:
> > (I am starting to think that
> http://code.google.com/p/xmonad/issues/detail?id=
> > 494 is a priority.)
>
> Well, they are somewhat related, but I think the issue I'm talking about
> here
> has a much more straightforward fix than trying to generate pure
> approximations
> of layouts that can generate their exact answer only impurely.
>
> My idea was to keep a Map that associates a rectangle with each window ID
> (actually a list + offline sorting is enough and may be faster).  After
>

Caching previous computations is a pretty necessary part of the full
solution to that issue, which is why I pointed to it.

-- 
brandon s allbery                                      allbery.b at gmail.com
wandering unix systems administrator (available)     (412) 475-9364 vm/sms
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/xmonad/attachments/20120417/aec9d480/attachment-0001.htm>