diff options
| author | Colin Watson <cjwatson@debian.org> | 2020-02-25 17:11:21 +0000 |
|---|---|---|
| committer | Colin Watson <cjwatson@debian.org> | 2020-02-25 17:11:21 +0000 |
| commit | ea9974fa9eea80f19126edbd7e132186d153d2b2 (patch) | |
| tree | 5f722c1f0c58d3ee73321f7e1e6ef9f5b13ec6a3 /gl/lib/gl_anytree_list1.h | |
| parent | f2bcbd87a94c08fae249f6cc9c9fbc07aa49ef5f (diff) | |
| parent | 639597d354c5b57145d6d53b079aeb4e2060d42b (diff) | |
Import man-db_2.9.1.orig.tar.xz
Diffstat (limited to 'gl/lib/gl_anytree_list1.h')
| -rw-r--r-- | gl/lib/gl_anytree_list1.h | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/gl/lib/gl_anytree_list1.h b/gl/lib/gl_anytree_list1.h index c0ef5677..457df319 100644 --- a/gl/lib/gl_anytree_list1.h +++ b/gl/lib/gl_anytree_list1.h @@ -1,5 +1,5 @@ /* Sequential list data type implemented by a binary tree. - Copyright (C) 2006, 2009-2019 Free Software Foundation, Inc. + Copyright (C) 2006, 2009-2020 Free Software Foundation, Inc. Written by Bruno Haible <bruno@clisp.org>, 2006. This program is free software: you can redistribute it and/or modify @@ -28,7 +28,7 @@ typedef struct /* A stack used for iterating across the elements. */ typedef iterstack_item_t iterstack_t[MAXHEIGHT]; -/* Free a non-empty subtree recursively. +/* Frees a non-empty subtree recursively. This function is recursive and therefore not very fast. */ static void free_subtree (gl_list_node_t node) |