X-Git-Url: http://erislabs.net/gitweb/?a=blobdiff_plain;ds=sidebyside;f=lib%2Fgl_anytree_list2.h;h=81d2a18cf57cc40c3ff4c9c5d3102dc01cc98136;hb=fb7fde6f658ac18b7ab7ca61dca9a290cc8c3348;hp=fba2845fad0bde7ff6e842e460daaf00b242f4bd;hpb=9017ec629b3dda3e398d6ea027cae26ab7d018b5;p=gnulib.git

diff --git a/lib/gl_anytree_list2.h b/lib/gl_anytree_list2.h
index fba2845fa..81d2a18cf 100644
--- a/lib/gl_anytree_list2.h
+++ b/lib/gl_anytree_list2.h
@@ -1,5 +1,5 @@
 /* Sequential list data type implemented by a binary tree.
-   Copyright (C) 2006 Free Software Foundation, Inc.
+   Copyright (C) 2006-2007 Free Software Foundation, Inc.
    Written by Bruno Haible <bruno@clisp.org>, 2006.
 
    This program is free software; you can redistribute it and/or modify
@@ -23,6 +23,7 @@ static gl_list_t
 gl_tree_create_empty (gl_list_implementation_t implementation,
 		      gl_listelement_equals_fn equals_fn,
 		      gl_listelement_hashcode_fn hashcode_fn,
+		      gl_listelement_dispose_fn dispose_fn,
 		      bool allow_duplicates)
 {
   struct gl_list_impl *list = XMALLOC (struct gl_list_impl);
@@ -30,6 +31,7 @@ gl_tree_create_empty (gl_list_implementation_t implementation,
   list->base.vtable = implementation;
   list->base.equals_fn = equals_fn;
   list->base.hashcode_fn = hashcode_fn;
+  list->base.dispose_fn = dispose_fn;
   list->base.allow_duplicates = allow_duplicates;
 #if WITH_HASHTABLE
   list->table_size = 11;
@@ -457,6 +459,8 @@ gl_tree_list_free (gl_list_t list)
 	  if (!stack_ptr->rightp)
 	    break;
 	  /* Free the current node.  */
+	  if (list->base.dispose_fn != NULL)
+	    list->base.dispose_fn (node->value);
 	  free (node);
 	}
       /* Descend on right branch.  */