Function key_order 

pub fn key_order(a: &[u8], b: &[u8]) -> Ordering

How two object keys compare: shorter first, then by bytes.

Length first is not arbitrary. It puts the cheapest comparison at the front of the search, so most steps of a lookup are an integer compare against a number the reader already has, and it keeps keys of one length together in the key region.