问如何通过比较键的值在HashMap中添加BinaryHeap键？

EN

use std::cmp::Reverse;
use std::collections::BinaryHeap;
use std::collections::HashMap;

fn main() {
    let text = "Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book. It has survived not only five centuries, but also the leap into electronic typesetting, remaining essentially unchanged. It was popularised in the 1960s with the release of Letraset sheets containing Lorem Ipsum passages, and more recently with desktop publishing software like Aldus PageMaker including versions of Lorem Ipsum.";

    let mut map = HashMap::new();
    for char in text.chars() {
        *map.entry(char).or_insert(0) += 1;
    }

    let mut heap = BinaryHeap::new();

    for (char, count) in map {
        heap.push(Reverse((count, char)));
        if heap.len() > 5 {
            heap.pop(); // Remove the least frequent.
        }
    }

    dbg!(heap
        .into_sorted_vec()
        .into_iter()
        .map(|Reverse(data)| data)
        .collect::<Vec<_>>());
}

[src/main.rs:22] heap.into_sorted_vec().into_iter().map(|Reverse(data)|
            data).collect::<Vec<_>>() = [
    (
        90,
        ' ',
    ),
    (
        59,
        'e',
    ),
    (
        43,
        't',
    ),
    (
        39,
        's',
    ),
    (
        38,
        'n',
    ),
]