Lugruf

If you're in windows you can disable that in the task manager (Ctrl + Shift + Escape) Spine?

Most of the time I just think I don't have anything to say Micky

Welcome to Reborn! You should be in the circus room to change episodes. I don't know if you can update if you are somewhere else, but there's a chance to corrupt your file. If you are in the circus room it will be safe.

It's not like I used it a lot. I mean, can you remember the last time I wrote something in discord Micky?

I hardly ever read what people write in discord. In fact, I uninstalled it a few days ago. Micky?

You're probably right... You're 90% of the discord server too tbh Anstane?

I blame Micky

You might be interested in using this program that does all the file moving and renaming stuff for you so that you don't end up deleting the wrong file and losing your progress by error.

In the old site there were 20 posts per page, not 25, so the 1000th page was reached before about two or three months ago. When they changed the site, it was reconfigured in pages of 25 posts and so there were over 950 pages. Shing?

Page 1000 yay! Will Ame come to the 1000th page?

Or maybe its me Noobly?

Sorry for not answering before but after the site update my configuration changed and Reborn has stopped sending me an email whn someone posts on that thread, so I couldn't see your post. Could you explain what do you mean in your post with " the save files from the running game are not created" please? A more thorough explanation of the problem will help me find the bug. Thanks in advance!

Try http://www.rebornevo.com/downloads/PBS.zip

Definitely me Micky

Stealth Rock? Anstane?

good luck with your exams spine

1000 go go go! Micky?

This thread is pretty dead today Spine you there?

Here I am Spine?

Contiguous memory > Nodes Micky?

Nah. It's all about understanding cache memory. For some reason, std::map is implemented using linked lists (it's actually a binary tree but the thing's that each node is allocated separatelly). That means that every jump from a node to another, both when searching and when iterating has a very high chance of being a cache miss. If we take into account that a querying data from the RAM takes more or less 100 times more than from the cache, the std::map wastes a huge amount of time just waiting for data. My implementation just makes a better use of cache memory, by making all the sorting and searching algorithms happen in a chunk of contiguous memory. You can take a look at the code here if you're interested: https://bitbucket.org/Lugruf/cache_friendly_map Dragon?

tfw you outperform the C++ standard library... Spine?