Compute the insertion `Position` for a new `use` statement that imports the given FQN, maintaining alphabetical order among the existing imports. If there are no existing imports, returns the fallback position (after `namespace` or `<?php`).
(&self, fqn: &str)
| 40 | /// If there are no existing imports, returns the fallback position |
| 41 | /// (after `namespace` or `<?php`). |
| 42 | pub(crate) fn insert_position_for(&self, fqn: &str) -> Position { |
| 43 | self.insert_position_for_key(&fqn.to_lowercase()) |
| 44 | } |
| 45 | |
| 46 | /// Like [`insert_position_for`](Self::insert_position_for) but |
| 47 | /// accepts a pre-computed sort key instead of deriving one from the |
no test coverage detected