Function is_sorted

test/module_test.cpp:40–54

Check the module is topologically sorted TODO: Use test::make_predicate

// Check the module is topologically sorted
// TODO: Use test::make_predicate
static bool is_sorted(migraphx::module& m)
{
    std::unordered_set<migraphx::instruction_ref> visited;
    for(auto ins : migraphx::iterator_for(m))
    {
        visited.insert(ins);
        if(std::any_of(ins->inputs().begin(), ins->inputs().end(), [&](auto i) {
               return not visited.count(i);
           }))
        {
            return false; // Found an input that has not been visited yet
        }
    }
    return true;
}

static void shuffle_module(migraphx::module& m)
{