Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

rustc_data_structures::graph mini refactor #123934

Merged
merged 6 commits into from
Apr 15, 2024

Commits on Apr 14, 2024

  1. Configuration menu
    Copy the full SHA
    398da59 View commit details
    Browse the repository at this point in the history
  2. Merge {With,Graph}{Successors,Predecessors} into `{Successors,Prede…

    …cessors}`
    
    Now with GAT!
    WaffleLapkin committed Apr 14, 2024
    Configuration menu
    Copy the full SHA
    0d5fc9b View commit details
    Browse the repository at this point in the history
  3. Configuration menu
    Copy the full SHA
    f514493 View commit details
    Browse the repository at this point in the history
  4. Configuration menu
    Copy the full SHA
    3124fa9 View commit details
    Browse the repository at this point in the history
  5. Make depth_first_search into a standalone function

    Does not necessarily change much, but we never overwrite it, so I see no reason
    for it to be in the `Successors` trait. (+we already have a similar `is_cyclic`)
    WaffleLapkin committed Apr 14, 2024
    Configuration menu
    Copy the full SHA
    e8d2221 View commit details
    Browse the repository at this point in the history

Commits on Apr 15, 2024

  1. Use RPITIT for Successors and Predecessors traits

    Now with RPITIT instead of GAT!
    WaffleLapkin committed Apr 15, 2024
    Configuration menu
    Copy the full SHA
    435db9b View commit details
    Browse the repository at this point in the history