private SortedSet < TypeElement > get ( Map < TypeElement , SortedSet < TypeElement > > map , TypeElement typeElement ) { return map . computeIfAbsent ( typeElement , t -> new TreeSet <> ( comparator ) ) ; }
From the map return the set of sub - classes or sub - interfaces . If set is null create a new one and return it .