On Tue, Apr 7, 2009 at 12:33 PM, Łukasz Lew <lukasz....@gmail.com> 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. Colin _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
