summaryrefslogtreecommitdiff
path: root/INSTALL.in
diff options
context:
space:
mode:
authorMatthew Sackman <matthew@lshift.net>2009-04-10 17:21:23 +0100
committerMatthew Sackman <matthew@lshift.net>2009-04-10 17:21:23 +0100
commit3b5a7e084e11ca53b8c25ee36c2ffb071aab9ac7 (patch)
tree47bfb9c519e2f5eea195807114cddb190b5e053b /INSTALL.in
parenta1c140505e6bd32d57fabc37597981bc34f11e53 (diff)
downloadrabbitmq-server-git-3b5a7e084e11ca53b8c25ee36c2ffb071aab9ac7.tar.gz
many bugs fixed. Still no compaction. However, performance is horrible, because the test which established ets:insert_new did what we wanted was actually flawed, and we can't do that, and ets:insert is not fast enough in a bag with many similar keys. What I want is to be able to say "yes, just insert this, I guarantee that whilst there are other equal keys in this bag, you don't need to go and try to find matching values". Hmph
Diffstat (limited to 'INSTALL.in')
0 files changed, 0 insertions, 0 deletions