<awangdev>Ugly Number II_2.java
private void populate(PriorityQueue<Long> candidate, HashSet<Long> set, long[] dp, long last, int factor) {

        long nextCandidate = last * factor;
        if (!set.contains(nextCandidate)) {
            candidate.add(nextCandidate);
            set.add(nextCandidate);
        }
    }
private void var_0 ( PriorityQueue < Long > var_3 , HashSet < Long > var_5 , long [ ] var_6 , long var_7 , int var_8 ) {
  long var_9 = var_7 * var_8 ;
  if ( ! var_5 . contains ( var_9 ) ) {
    var_3 . add ( var_9 ) ;
    var_5 . add ( var_9 ) ;
  }
}
