I have a struct that looks like this:

pub struct Game {
    /// A HashSet with the players waiting to play as account strings.
    lobby: HashSet<String>,
    /// capacity determines  how many people a match contains.
    capacity: u8,
    /// A vector of ongoing matches.
    matches: Vec<Match>,
    /// HashSet indicating for each player which match they are in.
    players: HashMap<String, usize>,
}

I realised that this won’t work because if there are 3 matches (0, 1, 2) and I remove 1 because it ends, the players that used to point at 2 will be pointing outside the vector or to an incorrect match.

So I thought the obvious solution was to use a reference to the match: players: HashMap<String, &Match>. But this makes lifetimes very complicated.

What’s a good way to deal with a case like these where data are interrelated in the same struct?

  • Gobbel2000@feddit.de
    5·
    9 months ago

    I don’t think there is a good way of having references within the same struct, but you could store reference counted matches:

    matches: Vec<Rc<Match>>,
players: HashMap<String, Rc<Match>>,

    You would still have to make sure that the players map is updated, maybe weak references are useful there.

    Maybe you could also consider storing the players of a match in the match itself, not outside.

    • modulusOP
      11·
      9 months ago

      Thanks, the RC is a possible approach. It seems to violate DRY a bit but maybe there’s no way around it.

      The reason I had the players outside the match is that I need them there anyway, because when I get a player action I need to check in which match they are, who are their opponent(s) and so on. So even if they’re in, they’ll have to be out too as there are concurrent matches and the player actions come all through the same network stream.