message: Use `std::usize::MAX` instead of `usize::MAX` for older Rust compatibility
diff: @@ -48,7 +48,7 @@ mod state {
  let c0 = g.node_count();
  Vf2State {
  graph: g,
  - mapping: vec![usize::MAX; c0],
  + mapping: vec![std::usize::MAX; c0],
  out: vec![0; c0],
  ins: vec![0; c0 * (g.is_directed() as usize)],
  out_size: 0,
  @@ -89,7 +89,7 @@ mod state {
  /// Restore the state to before the last added mapping
  pub fn pop_mapping(&mut self, from: G::NodeId) {
  // undo (n, m) mapping
  - self.mapping[self.graph.to_index(from)] = usize::MAX;
  + self.mapping[self.graph.to_index(from)] = std::usize::MAX;
  // unmark in ins and outs
  for ix in self.graph.neighbors_directed(from, Outgoing) {
  @@ -116,7 +116,7 @@ mod state {
  .iter()
  .enumerate()
  .find(move |&(index, &elt)| {
  - elt > 0 && self.mapping[from_index + index] == usize::MAX
  + elt > 0 && self.mapping[from_index + index] == std::usize::MAX
  })
  .map(|(index, _)| index)
  }
  @@ -130,7 +130,7 @@ mod state {
  .iter()
  .enumerate()
  .find(move |&(index, &elt)| {
  - elt > 0 && self.mapping[from_index + index] == usize::MAX
  + elt > 0 && self.mapping[from_index + index] == std::usize::MAX
  })
  .map(|(index, _)| index)
  }
  @@ -140,7 +140,7 @@ mod state {
  self.mapping[from_index..]
  .iter()
  .enumerate()
  - .find(|&(_, &elt)| elt == usize::MAX)
  + .find(|&(_, &elt)| elt == std::usize::MAX)
  .map(|(index, _)| index)
  }
  }
  @@ -318,7 +318,7 @@ mod matching {
  } else {
  field!(st, 1 - $j).graph.to_index(field!(nodes, 1 - $j))
  };
  - if m_neigh == usize::MAX {
  + if m_neigh == std::usize::MAX {
  continue;
  }
  let has_edge = field!(st, 1 - $j).graph.is_adjacent(
  @@ -344,7 +344,7 @@ mod matching {
  pred_count += 1;
  // the self loop case is handled in outgoing
  let m_neigh = field!(st, $j).mapping[field!(st, $j).graph.to_index(n_neigh)];
  - if m_neigh == usize::MAX {
  + if m_neigh == std::usize::MAX {
  continue;
  }
  let has_edge = field!(st, 1 - $j).graph.is_adjacent(
  @@ -406,7 +406,7 @@ mod matching {
  } else {
  field!(st, 1 - $j).graph.to_index(field!(nodes, 1 - $j))
  };
  - if m_neigh == usize::MAX {
  + if m_neigh == std::usize::MAX {
  continue;
  }
  @@ -433,7 +433,7 @@ mod matching {
  // the self loop case is handled in outgoing
  let m_neigh =
  field!(st, $j).mapping[field!(st, $j).graph.to_index(n_neigh)];
  - if m_neigh == usize::MAX {
  + if m_neigh == std::usize::MAX {
  continue;
  }
  