Description:
Programming issues that transcend languages and OSs.
|
|
|
Programming Open-Ended Plots In Games
|
| |
Hi, there is a computer game that I play. It's a text-based RPG, and
you play it on the Windows Desktop. The game has an open-ended plot,
and I talked to the developer of that game, and he said the open-ended
plot means that he finitely programmed an infinite number of choices
that players can make during the main plot. He also said that nothing... more »
|
|
|
LAN scan
|
| |
So, I have a service that runs on port X on a machine.
I want to scan a subnet of 192.168.0.* and see what machines are running this service.
Right now, I'm basically spawning about 255 threads that each attempt to make a TCP connection to 192.168.0.whatever. Sometimes machines seem to not get spotted.... more »
|
|
|
AVL versus Red-Black Trees
|
| |
AVL trees and Red-Black Trees are both types of self-balancing binary search trees. AVL trees were developed in the early 1960's by two Russians. Red-Black trees were developed in the 1970's. My question is this:
Since an AVL tree actually keeps the tree in a little better balance than the Red-Black tree, and since the AVL code is *simpler* than the Red-Black... more »
|
|
|
I have received the following question...
|
| |
.
Hello,
I have received the following question:
>Hi all,
>I need a simple FIFO queue, which would allow the communication >between two threads (producer - consumer).
>Please note that my model is: one producer - one consumer. One >producer (main thread) builds an object, which it then pushes to the... more »
|
|
|
Parallel archiver was updated to version 1.85
|
| |
Hello,
Parallel archiver was updated to version 1.85, i have overloaded the GetKeys() method , now you can use wildcards, you can pass the wildcard in the first argument and the TStringList in the second argument like this:
pzr.getkeys('*.pas',st);
and after that call the ExtractFiles() method and pass it the TStringList.... more »
|
|
|
Compare two methods of random permutations
|
| |
I want to compare in a practical sense two methods of random
permutations -- one theoretically perfect, namely that of Fisher and
Yates, and another ad hoc, let's call it X. A way of comparison I could
think of is the following:
One starts from the standard configuration of n objects [0, 1, 2,... more »
|
|
|
iterate and delete
|
| |
Does computer science in general ever address the issue of when you are iterating over a collection and deleting elements from it? If you are just using a counter, this can be tricky as the deletions can mess up the indices.
Thanks.
|
|
|
About my Parallel archiver...
|
| |
Question:
How can your Parallel archiver beat 7Zip and even FreeArc like that , are you a genius Amine ?
Reponse:
No i am not a genius, just use my Parallel archiver and be happy with it,
cause it is now one of the best archiver around, and it's very stable also.
You can download my Parallel archiver version 1.83:... more »
|
|
|
