2009/4/7 Colin Kern <[email protected]>: > On Tue, Apr 7, 2009 at 12:33 PM, Łukasz Lew <[email protected]> wrote: >> Thanks. What about linked lists? >> They seem to be both compact and fast to merge and detect duplicates. >> Why have you abandoned them? >> >> Lukasz >> > > Or a Hash Set, which has constant time insert, delete, contains, and > size operations and guarantees no duplicates. Merging groups would be > linear, I think.
Hash set is usually bigger than array of liberties. The bigger problem is that you can't get the single element of singleton. (btw you don't need hashing to store liberties as liberties usually are integers from some not too big interval) > > Colin > _______________________________________________ > computer-go mailing list > [email protected] > http://www.computer-go.org/mailman/listinfo/computer-go/ > _______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
