/** * Creates a <code>MapBinaryHeap</code> whose heap ordering is based on the ordering of the * elements specified by <code>comp</code>. * * @param comp the comparator to use to order elements in the heap */ public MapBinaryHeap(Comparator<T> comp) { initialize(comp); }
/** * Creates a <code>MapBinaryHeap</code> whose heap ordering * is based on the ordering of the elements specified by <code>c</code>. */ public MapBinaryHeap(Comparator<T> comp) { initialize(comp); }
/** * Creates a <code>MapBinaryHeap</code> whose heap ordering * is based on the ordering of the elements specified by <code>comp</code>. * @param comp the comparator to use to order elements in the heap */ public MapBinaryHeap(Comparator<T> comp) { initialize(comp); }
/** * Creates a <code>MapBinaryHeap</code> whose heap ordering is based on the * ordering of the elements specified by <code>c</code>. */ public MapBinaryHeap(Comparator<T> comp) { initialize(comp); }
/** * Creates a <code>MapBinaryHeap</code> whose heap ordering will be based on * the <i>natural ordering</i> of the elements, which must be * <code>Comparable</code>. */ public MapBinaryHeap() { initialize(new ComparableComparator()); }
/** * Creates a <code>MapBinaryHeap</code> whose heap ordering * will be based on the <i>natural ordering</i> of the elements, * which must be <code>Comparable</code>. */ public MapBinaryHeap() { initialize(new ComparableComparator()); }
/** * Creates a <code>MapBinaryHeap</code> whose heap ordering * will be based on the <i>natural ordering</i> of the elements, * which must be <code>Comparable</code>. */ public MapBinaryHeap() { initialize(new ComparableComparator()); }
/** * Creates a <code>MapBinaryHeap</code> whose heap ordering will be based on the <i>natural * ordering</i> of the elements, which must be <code>Comparable</code>. */ public MapBinaryHeap() { initialize(new ComparableComparator()); }