src/main/java/de/dfki/lt/loot/jada/FibonacciHeapBase.java
public void remove(final HeapNode<Data> node) {
    final Comparator<Data> save = _comparator;
    // Create a comparator that makes node the smallest of all entries
    _comparator = new Comparator<Data>() {
      @Override
      public int compare(Data o1, Data o2) {
        if (o1 == node.data)
          return (o2 == node.data) ? 0 : -1;
        if (o2 == node.data) return 1;
        return save.compare(o1, o2);
      }
    };
    decreaseKey(node);
    removeMinimum();
    _comparator = save;
  }
/** Remove node from the heap. The value of the minusInfinity key must be
   *  smaller than any key on the heap, otherwise, and IllegalArgumentException
   *  will be thrown.
   */
Remove node from the heap. The value of the minusInfinity key must be
smaller than any key on the heap, otherwise, and IllegalArgumentException
will be thrown.
Remove node from the heap . The value of the minusInfinity key must be smaller than any key on the heap otherwise and IllegalArgumentException will be thrown .
public void remove(final HeapNode<Data> node) {
    final Comparator<Data> save = _comparator;
    _comparator = new Comparator<Data>() {
      @Override
      public int compare(Data o1, Data o2) {
        if (o1 == node.data)
          return (o2 == node.data) ? 0 : -1;
        if (o2 == node.data) return 1;
        return save.compare(o1, o2);
      }
    };
    decreaseKey(node);
    removeMinimum();
    _comparator = save;
  }
public void remove ( final HeapNode < Data > node ) { final Comparator < Data > save = _comparator ; _comparator = new Comparator < Data > ( ) { @ Override public int compare ( Data o1 , Data o2 ) { if ( o1 == node . data ) return ( o2 == node . data ) ? 0 : - 1 ; if ( o2 == node . data ) return 1 ; return save . compare ( o1 , o2 ) ; } } ; decreaseKey ( node ) ; removeMinimum ( ) ; _comparator = save ; }
Remove node from the heap.
Remove node from the heap .
// Create a comparator that makes node the smallest of all entries