So had an interesting experience with Go the other day. This is part of building a bloom filter index which is going to replace the index in searchcode.com So I was trying to verify how long a search would take when the index was full. When trying it out on a machine to see what the performance would be I built a version to create some very large slices over 64,000,000 items in length to simulate the expected workload. This should take about 53 GB in memory with all the overhead and such adde...
