Since the CapacityScheduler internal implementation depends more and more on queue being hierarchical, the test gets really hard to maintain. A lot of test cases were failing because they used non existing queues, but the older placement rule solution ignored missing parents, but since the leaf queue change in CS, we must be able to get a full path for any queue, since all queues are referenced by their full path.
This test should reflect this and instead of creating and expecting the existance of fictional queues, it should create a proper queue hierarchy, with a way to describe it better.
Currently we set up a bunch of mockito "when" statements to simulate the queue behavior, but this is a hassle to maintain, and easy to miss a few method.
- is depended upon by
YARN-10273 [Umbrella] Followup tasks for CapacityScheduler leaf queue changes (YARN-9879)