Re: [Xconq-developers] New ideas for Xconq
Brought to you by:
elijah_meeks,
matthewskala
From: Lincoln P. <sa...@sb...> - 2006-07-05 21:25:58
|
Eric McDonald wrote: > Eventually, xConq might become more object-oriented, since there are > some advantages to that (using STL to provide a consistent, more > maintainable linked-list implementation, for example), but I am still > quite some ways from achieving that ambition. xConq is mostly the same > legacy C application that it was 7 years ago. > Hmmm...are there any places where Xconq currently uses linked-lists where it might be more efficient to use a different data structure (e.g. binary search tree, heap, hash table)? Might be worth thinking about, since using C++ templates could dramatically simplify such changes. And, yes, I *have* observed that Xconq slows down considerably when the games get very large. -- Lincoln Peters <sa...@sb...> BOFH excuse #360: Your parity check is overdrawn and you're out of cache. |