Wow, that was a freaky bug. Turned out to not have anything to do with the

size of the table, it had to do with using non pointer types for the key (some
more complex types worked as well, probably because of lazy memory collection)
and then using the [] indexing operators.  You wound up with pointers to local
variables that didn't exist by the end of the assignemnt operator.

Strange, but I didn't actually use references inside of all of the Bu::Hash
accessor functions, that means in cases where more complex variables are used
as keys (like Bu::FString) it was making several copies of them per operation
and destroying them all immediately.  Now it will be even faster and use much
less memory.

Good catch, David.

0 files changed, 0 insertions, 0 deletions