Leaderboard

There are still 6 patches collections (about 30 function patches) that I have to reimplement. At least the Win64 compiler doesn't crash anymore. So it will still take a lot of time to get a usable release version.

But you can simply add the account data, Google still has a large free tier for free apps. If you use the map a lot, then this might get exhausted soon, and the cost may explode. For a seldom map requests the tfree tier might be OK. I also think that Goggle is not clever giving up so many interesting free projects in the past. So a lot of developers will have to look after more reliable sources then, and this could affect the whole Google Cloud business. I you don't trust once, you don't trust ever ...

If the procedures works sequential, set flags while entering and leaving the procedure and ask the MemoryManager from a TThread how many memory is currently used.

When I need a busy loop I usually just do a := 1; while not timeout do a := Cos(a);

@Stefan GlienkeIt does depend on what you are testing. If one claims that it takes > 1s for the first task to execute, it is sufficient to show it is not true. Also the work load on many real-life multi-threaded applications is not dissimilar. Say you fire 100 HTTP requests and you wait for the results to come, or you do asynchronous IO with memory mapped files (using overlapped events). I like this use of language: No doubt … followed by a debatable statement It is clear that … followed by an unclear statement No offence …. followed by an offensive statement etc.

//Notice: I have just renamed this thread to a more meaningful subject.