Version 003.
I'm using a Trie for member lookups and arrays for data storage. It's up to 10 times faster.
The Trie holds the offset for where the members data is held in the internal array.
Code:
[SM] Starting Benchmark Tests...
Created 1000 dynamic object(s) in 0.000000 second(s)
Created 99000 dynamic member(s) in 0.164062 second(s)
Read 99000 dynamic member(s) in 0.113281 second(s)
Verified 99000 dynamic member(s) in 0.277343 second(s)
Updated 99000 dynamic member(s) in 0.125000 second(s)
Disposed 1000 dynamic object(s) in 0.007812 second(s)
[SM] Starting Benchmark Tests...
Created 1000 dynamic object(s) in 0.000000 second(s)
Created 99000 dynamic member(s) in 0.164062 second(s)
Read 99000 dynamic member(s) in 0.109375 second(s)
Verified 99000 dynamic member(s) in 0.265625 second(s)
Updated 99000 dynamic member(s) in 0.128906 second(s)
Disposed 1000 dynamic object(s) in 0.007812 second(s)
[SM] Starting Benchmark Tests...
Created 1000 dynamic object(s) in 0.000000 second(s)
Created 99000 dynamic member(s) in 0.164062 second(s)
Read 99000 dynamic member(s) in 0.109375 second(s)
Verified 99000 dynamic member(s) in 0.273437 second(s)
Updated 99000 dynamic member(s) in 0.125000 second(s)
Disposed 1000 dynamic object(s) in 0.011718 second(s)