src/main/java/de/dfki/lt/loot/jada/FibonacciHeapBase.java
public HeapNode<Data> insert(Data d) {
    if (debug) System.out.println("insert " + d);
    ++count;
    // create a new tree with a single myKey:
    return insertNode(new HeapNode<Data>(d));
  }
/** Insert a new pair of data and key into this heap, and return an object
   *  that represents the pair in this heap.
   *
   *  @return a HeapNode that contains the key and data objects and can be used
   *          to decrease the key.
   */
Insert a new pair of data and key into this heap, and return an object
that represents the pair in this heap.

@return a HeapNode that contains the key and data objects and can be used
to decrease the key.
Insert a new pair of data and key into this heap and return an object that represents the pair in this heap . @return a HeapNode that contains the key and data objects and can be used to decrease the key .
public HeapNode<Data> insert(Data d) {
    if (debug) System.out.println("insert " + d);
    ++count;
    return insertNode(new HeapNode<Data>(d));
  }
public HeapNode < Data > insert ( Data d ) { if ( debug ) System . out . println ( "insert " + d ) ; ++ count ; return insertNode ( new HeapNode < Data > ( d ) ) ; }
Insert a new pair of data and key into this heap, and return an object
  that represents the pair in this heap.
Insert a new pair of data and key into this heap and return an object that represents the pair in this heap .
// create a new tree with a single myKey: