assertNotReadOnly();
H keyHash = m_keyHasher.hash(key);
if (m_tree.containsKey(keyHash))
{
throw new KeyExistsException("The key " + key + " already exists in the database");
}
P pos = getProxied().insert(key, value);
m_tree.insert(keyHash, pos);
return pos;
}