You are an expert in writing code in many different languages. Your goal is to perform code completion for the following code, keeping in mind the rest of the code and the file meta data.
    Metadata details:
    filename: tests.rs
    path of file: ./repos/nearcore/chain/network/src/peer_manager/peer_store
    
    the code of the file until where you have to start completion: use super::*;
use crate::
    
fn test_lru_eviction() {
    let clock = time::FakeClock::default();
    let mut config = make_config(&[], Default::default(), false);
    config.peer_states_cache_size = 10;
    let peer_store = PeerStore::new(&clock.clock(), config).unwrap();

    let (peer_ids, peer_infos): (Vec<_>, Vec<_>) = (0..15)
        .map(|i| {
            let id = get_peer_id(format!("node{}", i));
            let info = get_peer_info(id.clone(), Some(get_addr(i as u16)));
            (id, info)
        })
        .unzip();
    let peer_addresses = peer_infos.iter().map(|info| info.addr.unwrap()).collect::<Vec<_>>();

    // Fill the peer_store with the first peer_infos
    peer_store.add_indirect_peers(&clock.clock(), peer_infos[0..10].iter().cloned());
    assert_peers_in_cache(&peer_store, &peer_ids[0..10], &peer_addresses[0..10]);

    // Push additional peers and check that the most recent peers are retained
    peer_store.add_indirect_peers(&clock.clock(), peer_infos[10..].iter().cloned());
    assert_peers_in_cache(&peer_store, &peer_ids[5..], &peer_addresses[5..]);
}