Volatile Data structures for sranding

What other data structures easily obtainable other than MEMORYSTATUS can be used for seeding rand with?

I have already used dwAvailPhys and some of the others in MEMORYSTATUS, but they are mostly somewhat dependent on each other.

what else besides time & memory?
/dev/urandom
I'm on windows.
I was still looking for something that is a little more concrete, such as current time, vs elapsed time the program has been running, or something even more volatile than memory... if you are not running many programs, and you don't open or close any existing programs the total avail memory is still going to be pretty much in the same ballpark for any 2 consecutive calls to globalmemorystatusex();
Most operating systems have very high-resolution timers. The microsecond at which the clock is queried is likely to be very random.
and how would I go about doing that?
#include <ctime>

srand((unsigned)clock());
Topic archived. No new replies allowed.