[Gecode] Another abstraction sets...

[Christian Schulte]

One thing that occurred to me about this particular iterator is that one
could have a generic backwards iterator (using the same idea as a cache) and
specialize for rangelists to a more efficient implementation.

I intend to do the same for Minus (which actually needs to reverse as well).

Cheers
Christian

--
Christian Schulte, http://www.imit.kth.se/~schulte/ 

-----Original Message-----
From: gecode-bounces at ps.uni-sb.de [mailto:gecode-bounces at ps.uni-sb.de] On
Behalf Of Gabor Szokoli
Sent: Friday, July 16, 2004 8:30 PM
To: 'Technical discussions about Gecode'
Subject: Re: [Gecode] Another abstraction sets...


Christian Schulte wrote:

>I have to admit that I do not subscribe to this reasoning: if there is 
>anything that will be extended first by user of Gecode it will be a new 
>branching. So providing some functionality for programming distributors 
>easily might be a good idea.
>
>  
>
Done.
(Took a while to give up on figuring out superclass- and member element 
construtor execution order and just work around the issue)

If we want to make distributor programming easy, we also need a reversed 
unknown iterator (needs a reversed difference), and a forward and a 
backward "nth element of an interator" operation exposed.
(we have something like the last two already but tied to rangelists 
directly)


Gabor
_______________________________________________
Gecode mailing list
Gecode at ps.uni-sb.de http://www.ps.uni-sb.de/mailman/listinfo/gecode