Sort the UNION_SET in increasing frequency of occurrence. This speeds up later processing since we may assume the resulting set (Set_3, in this case), is ordered. Uses insertion sort, since the UNION_SET is typically short.
source not stored for this graph (policy: none)
no outgoing calls
no test coverage detected