On a lookaside eviction, we store the min and max keys that we're writing to lookaside so that we can easily instantiate the page in the future. At the moment, we simply begin at the min key and call next on the cursor until we go past the max key, which relies in the lookaside keys being in the same order as the btree that the keys come from. This assumption isn't true as we've discovered a quirk with putting strings keys into a byte array type (which we have to do in the lookaside table since the key can be any type) where it is encoded with the length prefixed to it. This means that string keys aren't in alphabetical order (they are in length order and THEN alphabetical order).

The solution is to store every key that we're writing to lookaside when evicting. That way we can simply search for each one to instantiate the page as needed.