def METHOD_NAME(shuffle_list, shuffle_key, current_value, sort_function):
    """Return `shuffle_list` with `current_value` at the front of the list
    In the scenario where `current_value` is not in `shuffle_list`:
    - Assume that we have a consistent ordering to `shuffle_list`
    - Insert the `current_value` into `shuffle_list`
    - Sort the new list
    - Do the normal logic to shuffle the list
    - Return the new shuffled list without the `current_value` we inserted"""
    fallback = False
    if current_value not in [item[shuffle_key] for item in shuffle_list]:
        fallback = True
        shuffle_list.append({shuffle_key: current_value})
        shuffle_list = sort_function(shuffle_list)
    matching_index = 0
    for i, key in enumerate(shuffle_list):
        if key[shuffle_key] == current_value:
            matching_index = i
            break
    top_half = shuffle_list[matching_index:]
    bottom_half = shuffle_list[:matching_index]
    if fallback:
        return top_half[1:] + bottom_half
    return top_half + bottom_half