> Any sugestions are welcome, and are greatly appreciated.
Well, my suggestion would be to have the array-sorting class listen
for changes of the point, and only start the thread that does the
sorting when that point moves (or a new element is inserted into the
array). This way, you will not have any multi-threading problems,
provided
the point doesn't move too often. Additionally, cpu usage will go down.
Multi-threading is still a good idea, since the point-moving-function
won't be blocked until the sorting has finished.
That's what I would do based on how I understand the problem. But
maybe
I just didn't understand it ... because I don't understand why the
sorting
thread doesn't run at a lower priority in the first place (since you
said
"Creating a thread to sort the array as resources permit seemed a good
way to go." - that sounds like you'd want the sorting thread to get any
spare cpu time (hence lower priority)).
Regards,
Robert
***************************************************************************
He is truly wise who gains wisdom from another's mishap.
***************************************************************************
_ email:
[EMAIL PROTECTED]
/_)_ / __ __ 7 //_ _ __ __ __ or:
[EMAIL PROTECTED]
/ \(_)/_)(- / / /\(_)_\(_// (_/
http://www.ifs.tuwien.ac.at/~rkosara/
*** Student of Computer Science and Medicine in Vienna, Austria, Europe
***
***************************************************************************
----------------------------------------------------------------------
To UNSUBSCRIBE, email to [EMAIL PROTECTED]
with a subject of "unsubscribe". Trouble? Contact [EMAIL PROTECTED]
