Home | History | Annotate | Download | only in Format

Lines Matching refs:InitialState

1065   /// \brief Analyze the entire solution space starting from \p InitialState.
1069   /// find the shortest path (the one with lowest penalty) from \p InitialState
1073   unsigned analyzeSolutionSpace(LineState &InitialState, bool DryRun = false) {
1083         new (Allocator.Allocate()) StateNode(InitialState, false, nullptr);
1124       reconstructPath(InitialState, Queue.top().second);