BTreeMap vs HashMap

Before Rust, I programmed Java. In Java, there were TreeMap, and HashMap, and in most cases TreeMap was slower than HashMap. So, the rule of thumb was to use HashMap unless you need an order on the keys.

In Rust we have BTreeMap and HashMap. I did some preliminary benchmarks, and it looks like on my examples BTreeMap works faster. What are you recommendation one choosing one vs another? Should I use non standard map implementation instead?