diff --git a/src/register/QuickFill.h b/src/register/QuickFill.h
index 84cc09c873..bca24e5a82 100644
--- a/src/register/QuickFill.h
+++ b/src/register/QuickFill.h
@@ -31,25 +31,6 @@
 #include <glib.h>
 
 
-/** STRUCTS *********************************************************/
-
-/* The way quickfill works is this: the decscription field of a transaction
- * is used to insert a pointer to itself into the quickfill tree.  The
- * QuickFill struct is a node in the tree, and the qf array is an array
- * of pointers to children of the node.  (NULL, if no corresponding child.)
- * The index of the array is determined by the next letter in the string
- * that is the description field.  The trans field is a pointer to the last
- * inserted child that made it to this node.  At the root of the tree is
- * a QuickFill struct, with trans == NULL, and the array of pointers to
- * children.  When a transaction is inserted, the first letter of the
- * description field determines which child the transaction goes into.  
- * If the child is NULL, a new QuickFill node is created.  Otherwise,
- * the trans field of the child is changed to point to the new transaction.
- * Then, recursively, the process is repeated, with the next character in
- * the description field as the index to the array.  The recursion stops
- * when the end of the descriptions string is reached.
- */
-
 typedef enum
 {
   QUICKFILL_LIFO,