This commit was manufactured by cvs2svn to create tag 'rtems-addon-rtems-addon-packages-4-7-99-2

packages-4-7-99-2'.

Sprout from ncurses-gnu 2002-12-19 15:34:54 UTC Eric Norum <WENorum@lbl.gov> 'Latest ncurses add-on'
Cherrypick from addons 2002-06-28 21:58:41 UTC Eric Norum <WENorum@lbl.gov> 'Useful add-on libraries':
    README
    RTEMS_Makefiles/Makefile.avl
    RTEMS_Makefiles/Makefile.common
    RTEMS_Makefiles/Makefile.site
    avl-1.4.0/AUTHORS
    avl-1.4.0/COPYING
    avl-1.4.0/ChangeLog
    avl-1.4.0/INSTALL
    avl-1.4.0/Makefile.am
    avl-1.4.0/Makefile.in
    avl-1.4.0/NEWS
    avl-1.4.0/README
    avl-1.4.0/THANKS
    avl-1.4.0/TODO
    avl-1.4.0/aclocal.m4
    avl-1.4.0/avl.c
    avl-1.4.0/avl.h
    avl-1.4.0/avl.html
    avl-1.4.0/avl.info
    avl-1.4.0/avl.texinfo
    avl-1.4.0/avl.text
    avl-1.4.0/avlt.c
    avl-1.4.0/avlt.h
    avl-1.4.0/avltr.c
    avl-1.4.0/avltr.h
    avl-1.4.0/configure
    avl-1.4.0/configure.in
    avl-1.4.0/install-sh
    avl-1.4.0/missing
    avl-1.4.0/mkinstalldirs
    avl-1.4.0/rb.c
    avl-1.4.0/rb.h
    avl-1.4.0/texinfo.tex
    avl-1.4.0/thread-test.c
    examples/avl/BuildTests.sh
    examples/avl/Makefile
    examples/avl/README
    examples/avl/init.c
    examples/ncurses/BuildTests.sh
    examples/ncurses/Makefile
    examples/ncurses/README
    examples/ncurses/init.c
    examples/readline/.gdbinit
    examples/readline/Makefile
    examples/readline/init.c
    examples/readline/rlgeneric.c
    ncurses-5.2/ANNOUNCE
    ncurses-5.2/Ada95/Makefile.in
    ncurses-5.2/Ada95/README
    ncurses-5.2/Ada95/TODO
    ncurses-5.2/Ada95/gen/Makefile.in
    ncurses-5.2/Ada95/gen/gen.c
    ncurses-5.2/Ada95/gen/html.m4
    ncurses-5.2/Ada95/gen/normal.m4
    ncurses-5.2/Ada95/gen/table.m4
    ncurses-5.2/Ada95/gen/terminal_interface-curses-aux.ads.m4
    ncurses-5.2/Ada95/gen/terminal_interface-curses-forms-field_types.ads.m4
    ncurses-5.2/Ada95/gen/terminal_interface-curses-forms-field_user_data.ads.m4
    ncurses-5.2/Ada95/gen/terminal_interface-curses-forms-form_user_data.ads.m4
    ncurses-5.2/Ada95/gen/terminal_interface-curses-forms.ads.m4
    ncurses-5.2/Ada95/gen/terminal_interface-curses-menus-item_user_data.ads.m4
    ncurses-5.2/Ada95/gen/terminal_interface-curses-menus-menu_user_data.ads.m4
    ncurses-5.2/Ada95/gen/terminal_interface-curses-menus.ads.m4
    ncurses-5.2/Ada95/gen/terminal_interface-curses-mouse.ads.m4
    ncurses-5.2/Ada95/gen/terminal_interface-curses-panels-user_data.ads.m4
    ncurses-5.2/Ada95/gen/terminal_interface-curses-panels.ads.m4
    ncurses-5.2/Ada95/gen/terminal_interface-curses.ads.m4
    ncurses-5.2/Ada95/samples/Makefile.in
    ncurses-5.2/Ada95/samples/README
    ncurses-5.2/Ada95/samples/explain.txt
    ncurses-5.2/Ada95/samples/rain.adb
    ncurses-5.2/Ada95/samples/rain.ads
    ncurses-5.2/Ada95/samples/sample-curses_demo-attributes.adb
    ncurses-5.2/Ada95/samples/sample-curses_demo-attributes.ads
    ncurses-5.2/Ada95/samples/sample-curses_demo-mouse.adb
    ncurses-5.2/Ada95/samples/sample-curses_demo-mouse.ads
    ncurses-5.2/Ada95/samples/sample-curses_demo.adb
    ncurses-5.2/Ada95/samples/sample-curses_demo.ads
    ncurses-5.2/Ada95/samples/sample-explanation.adb
    ncurses-5.2/Ada95/samples/sample-explanation.ads
    ncurses-5.2/Ada95/samples/sample-form_demo-aux.adb
    ncurses-5.2/Ada95/samples/sample-form_demo-aux.ads
    ncurses-5.2/Ada95/samples/sample-form_demo-handler.adb
    ncurses-5.2/Ada95/samples/sample-form_demo-handler.ads
    ncurses-5.2/Ada95/samples/sample-form_demo.adb
    ncurses-5.2/Ada95/samples/sample-form_demo.ads
    ncurses-5.2/Ada95/samples/sample-function_key_setting.adb
    ncurses-5.2/Ada95/samples/sample-function_key_setting.ads
    ncurses-5.2/Ada95/samples/sample-header_handler.adb
    ncurses-5.2/Ada95/samples/sample-header_handler.ads
    ncurses-5.2/Ada95/samples/sample-helpers.adb
    ncurses-5.2/Ada95/samples/sample-helpers.ads
    ncurses-5.2/Ada95/samples/sample-keyboard_handler.adb
    ncurses-5.2/Ada95/samples/sample-keyboard_handler.ads
    ncurses-5.2/Ada95/samples/sample-manifest.ads
    ncurses-5.2/Ada95/samples/sample-menu_demo-aux.adb
    ncurses-5.2/Ada95/samples/sample-menu_demo-aux.ads
    ncurses-5.2/Ada95/samples/sample-menu_demo-handler.adb
    ncurses-5.2/Ada95/samples/sample-menu_demo-handler.ads
    ncurses-5.2/Ada95/samples/sample-menu_demo.adb
    ncurses-5.2/Ada95/samples/sample-menu_demo.ads
    ncurses-5.2/Ada95/samples/sample-my_field_type.adb
    ncurses-5.2/Ada95/samples/sample-my_field_type.ads
    ncurses-5.2/Ada95/samples/sample-text_io_demo.adb
    ncurses-5.2/Ada95/samples/sample-text_io_demo.ads
    ncurses-5.2/Ada95/samples/sample.adb
    ncurses-5.2/Ada95/samples/sample.ads
    ncurses-5.2/Ada95/samples/status.adb
    ncurses-5.2/Ada95/samples/status.ads
    ncurses-5.2/Ada95/samples/tour.adb
    ncurses-5.2/Ada95/samples/tour.ads
    ncurses-5.2/Ada95/src/Makefile.in
    ncurses-5.2/Ada95/src/terminal_interface-curses-aux.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-forms-field_types-alpha.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-forms-field_types-alpha.ads
    ncurses-5.2/Ada95/src/terminal_interface-curses-forms-field_types-alphanumeric.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-forms-field_types-alphanumeric.ads
    ncurses-5.2/Ada95/src/terminal_interface-curses-forms-field_types-enumeration-ada.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-forms-field_types-enumeration-ada.ads
    ncurses-5.2/Ada95/src/terminal_interface-curses-forms-field_types-enumeration.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-forms-field_types-enumeration.ads
    ncurses-5.2/Ada95/src/terminal_interface-curses-forms-field_types-intfield.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-forms-field_types-intfield.ads
    ncurses-5.2/Ada95/src/terminal_interface-curses-forms-field_types-ipv4_address.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-forms-field_types-ipv4_address.ads
    ncurses-5.2/Ada95/src/terminal_interface-curses-forms-field_types-numeric.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-forms-field_types-numeric.ads
    ncurses-5.2/Ada95/src/terminal_interface-curses-forms-field_types-regexp.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-forms-field_types-regexp.ads
    ncurses-5.2/Ada95/src/terminal_interface-curses-forms-field_types-user-choice.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-forms-field_types-user-choice.ads
    ncurses-5.2/Ada95/src/terminal_interface-curses-forms-field_types-user.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-forms-field_types-user.ads
    ncurses-5.2/Ada95/src/terminal_interface-curses-forms-field_types.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-forms-field_user_data.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-forms-form_user_data.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-forms.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-menus-item_user_data.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-menus-menu_user_data.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-menus.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-mouse.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-panels-user_data.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-panels.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-text_io-aux.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-text_io-aux.ads
    ncurses-5.2/Ada95/src/terminal_interface-curses-text_io-complex_io.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-text_io-complex_io.ads
    ncurses-5.2/Ada95/src/terminal_interface-curses-text_io-decimal_io.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-text_io-decimal_io.ads
    ncurses-5.2/Ada95/src/terminal_interface-curses-text_io-enumeration_io.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-text_io-enumeration_io.ads
    ncurses-5.2/Ada95/src/terminal_interface-curses-text_io-fixed_io.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-text_io-fixed_io.ads
    ncurses-5.2/Ada95/src/terminal_interface-curses-text_io-float_io.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-text_io-float_io.ads
    ncurses-5.2/Ada95/src/terminal_interface-curses-text_io-integer_io.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-text_io-integer_io.ads
    ncurses-5.2/Ada95/src/terminal_interface-curses-text_io-modular_io.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-text_io-modular_io.ads
    ncurses-5.2/Ada95/src/terminal_interface-curses-text_io.adb
    ncurses-5.2/Ada95/src/terminal_interface-curses-text_io.ads
    ncurses-5.2/Ada95/src/terminal_interface-curses.adb
    ncurses-5.2/Ada95/src/terminal_interface.ads
    ncurses-5.2/INSTALL
    ncurses-5.2/MANIFEST
    ncurses-5.2/Makefile.glibc
    ncurses-5.2/Makefile.in
    ncurses-5.2/Makefile.os2
    ncurses-5.2/NEWS
    ncurses-5.2/README
    ncurses-5.2/README.emx
    ncurses-5.2/README.glibc
    ncurses-5.2/TO-DO
    ncurses-5.2/aclocal.m4
    ncurses-5.2/announce.html.in
    ncurses-5.2/c++/Makefile.in
    ncurses-5.2/c++/NEWS
    ncurses-5.2/c++/PROBLEMS
    ncurses-5.2/c++/README-first
    ncurses-5.2/c++/cursesapp.cc
    ncurses-5.2/c++/cursesapp.h
    ncurses-5.2/c++/cursesf.cc
    ncurses-5.2/c++/cursesf.h
    ncurses-5.2/c++/cursesm.cc
    ncurses-5.2/c++/cursesm.h
    ncurses-5.2/c++/cursesmain.cc
    ncurses-5.2/c++/cursesp.cc
    ncurses-5.2/c++/cursesp.h
    ncurses-5.2/c++/cursespad.cc
    ncurses-5.2/c++/cursesw.cc
    ncurses-5.2/c++/cursesw.h
    ncurses-5.2/c++/cursslk.cc
    ncurses-5.2/c++/cursslk.h
    ncurses-5.2/c++/demo.cc
    ncurses-5.2/c++/edit_cfg.sh
    ncurses-5.2/c++/etip.h.in
    ncurses-5.2/c++/headers
    ncurses-5.2/c++/internal.h
    ncurses-5.2/c++/modules
    ncurses-5.2/config.guess
    ncurses-5.2/config.sub
    ncurses-5.2/configure
    ncurses-5.2/configure.in
    ncurses-5.2/convert_configure.pl
    ncurses-5.2/dist.mk
    ncurses-5.2/doc/hackguide.doc
    ncurses-5.2/doc/html/Ada95.html
    ncurses-5.2/doc/html/ada/files.htm
    ncurses-5.2/doc/html/ada/files/T.htm
    ncurses-5.2/doc/html/ada/funcs.htm
    ncurses-5.2/doc/html/ada/funcs/A.htm
    ncurses-5.2/doc/html/ada/funcs/B.htm
    ncurses-5.2/doc/html/ada/funcs/C.htm
    ncurses-5.2/doc/html/ada/funcs/D.htm
    ncurses-5.2/doc/html/ada/funcs/E.htm
    ncurses-5.2/doc/html/ada/funcs/F.htm
    ncurses-5.2/doc/html/ada/funcs/G.htm
    ncurses-5.2/doc/html/ada/funcs/H.htm
    ncurses-5.2/doc/html/ada/funcs/I.htm
    ncurses-5.2/doc/html/ada/funcs/K.htm
    ncurses-5.2/doc/html/ada/funcs/L.htm
    ncurses-5.2/doc/html/ada/funcs/M.htm
    ncurses-5.2/doc/html/ada/funcs/N.htm
    ncurses-5.2/doc/html/ada/funcs/O.htm
    ncurses-5.2/doc/html/ada/funcs/P.htm
    ncurses-5.2/doc/html/ada/funcs/Q.htm
    ncurses-5.2/doc/html/ada/funcs/R.htm
    ncurses-5.2/doc/html/ada/funcs/S.htm
    ncurses-5.2/doc/html/ada/funcs/T.htm
    ncurses-5.2/doc/html/ada/funcs/U.htm
    ncurses-5.2/doc/html/ada/funcs/V.htm
    ncurses-5.2/doc/html/ada/funcs/W.htm
    ncurses-5.2/doc/html/ada/index.htm
    ncurses-5.2/doc/html/ada/main.htm
    ncurses-5.2/doc/html/ada/table.html
    ncurses-5.2/doc/html/ada/terminal_interface-curses-aux__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-aux__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-field_types-alpha__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-field_types-alpha__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-field_types-alphanumeric__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-field_types-alphanumeric__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-field_types-enumeration-ada__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-field_types-enumeration-ada__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-field_types-enumeration__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-field_types-enumeration__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-field_types-intfield__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-field_types-intfield__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-field_types-ipv4_address__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-field_types-ipv4_address__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-field_types-numeric__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-field_types-numeric__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-field_types-regexp__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-field_types-regexp__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-field_types-user-choice__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-field_types-user-choice__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-field_types-user__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-field_types-user__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-field_types__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-field_types__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-field_user_data__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-field_user_data__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-form_user_data__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms-form_user_data__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-forms__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-menus-item_user_data__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-menus-item_user_data__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-menus-menu_user_data__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-menus-menu_user_data__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-menus__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-menus__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-mouse__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-mouse__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-panels-user_data__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-panels-user_data__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-panels__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-panels__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-text_io-aux__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-text_io-aux__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-text_io-complex_io__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-text_io-complex_io__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-text_io-decimal_io__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-text_io-decimal_io__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-text_io-enumeration_io__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-text_io-enumeration_io__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-text_io-fixed_io__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-text_io-fixed_io__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-text_io-float_io__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-text_io-float_io__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-text_io-integer_io__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-text_io-integer_io__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-text_io-modular_io__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-text_io-modular_io__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-text_io__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses-text_io__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses__adb.htm
    ncurses-5.2/doc/html/ada/terminal_interface-curses__ads.htm
    ncurses-5.2/doc/html/ada/terminal_interface__ads.htm
    ncurses-5.2/doc/html/announce.html
    ncurses-5.2/doc/html/hackguide.html
    ncurses-5.2/doc/html/index.html
    ncurses-5.2/doc/html/man/captoinfo.1m.html
    ncurses-5.2/doc/html/man/clear.1.html
    ncurses-5.2/doc/html/man/curs_addch.3x.html
    ncurses-5.2/doc/html/man/curs_addchstr.3x.html
    ncurses-5.2/doc/html/man/curs_addstr.3x.html
    ncurses-5.2/doc/html/man/curs_attr.3x.html
    ncurses-5.2/doc/html/man/curs_beep.3x.html
    ncurses-5.2/doc/html/man/curs_bkgd.3x.html
    ncurses-5.2/doc/html/man/curs_border.3x.html
    ncurses-5.2/doc/html/man/curs_clear.3x.html
    ncurses-5.2/doc/html/man/curs_color.3x.html
    ncurses-5.2/doc/html/man/curs_delch.3x.html
    ncurses-5.2/doc/html/man/curs_deleteln.3x.html
    ncurses-5.2/doc/html/man/curs_extend.3x.html
    ncurses-5.2/doc/html/man/curs_getch.3x.html
    ncurses-5.2/doc/html/man/curs_getstr.3x.html
    ncurses-5.2/doc/html/man/curs_getyx.3x.html
    ncurses-5.2/doc/html/man/curs_inch.3x.html
    ncurses-5.2/doc/html/man/curs_inchstr.3x.html
    ncurses-5.2/doc/html/man/curs_initscr.3x.html
    ncurses-5.2/doc/html/man/curs_inopts.3x.html
    ncurses-5.2/doc/html/man/curs_insch.3x.html
    ncurses-5.2/doc/html/man/curs_insstr.3x.html
    ncurses-5.2/doc/html/man/curs_instr.3x.html
    ncurses-5.2/doc/html/man/curs_kernel.3x.html
    ncurses-5.2/doc/html/man/curs_mouse.3x.html
    ncurses-5.2/doc/html/man/curs_move.3x.html
    ncurses-5.2/doc/html/man/curs_outopts.3x.html
    ncurses-5.2/doc/html/man/curs_overlay.3x.html
    ncurses-5.2/doc/html/man/curs_pad.3x.html
    ncurses-5.2/doc/html/man/curs_print.3x.html
    ncurses-5.2/doc/html/man/curs_printw.3x.html
    ncurses-5.2/doc/html/man/curs_refresh.3x.html
    ncurses-5.2/doc/html/man/curs_scanw.3x.html
    ncurses-5.2/doc/html/man/curs_scr_dump.3x.html
    ncurses-5.2/doc/html/man/curs_scroll.3x.html
    ncurses-5.2/doc/html/man/curs_slk.3x.html
    ncurses-5.2/doc/html/man/curs_termattrs.3x.html
    ncurses-5.2/doc/html/man/curs_termcap.3x.html
    ncurses-5.2/doc/html/man/curs_terminfo.3x.html
    ncurses-5.2/doc/html/man/curs_touch.3x.html
    ncurses-5.2/doc/html/man/curs_trace.3x.html
    ncurses-5.2/doc/html/man/curs_util.3x.html
    ncurses-5.2/doc/html/man/curs_window.3x.html
    ncurses-5.2/doc/html/man/default_colors.3x.html
    ncurses-5.2/doc/html/man/define_key.3x.html
    ncurses-5.2/doc/html/man/form.3x.html
    ncurses-5.2/doc/html/man/form_cursor.3x.html
    ncurses-5.2/doc/html/man/form_data.3x.html
    ncurses-5.2/doc/html/man/form_driver.3x.html
    ncurses-5.2/doc/html/man/form_field.3x.html
    ncurses-5.2/doc/html/man/form_field_attributes.3x.html
    ncurses-5.2/doc/html/man/form_field_buffer.3x.html
    ncurses-5.2/doc/html/man/form_field_info.3x.html
    ncurses-5.2/doc/html/man/form_field_just.3x.html
    ncurses-5.2/doc/html/man/form_field_new.3x.html
    ncurses-5.2/doc/html/man/form_field_opts.3x.html
    ncurses-5.2/doc/html/man/form_field_userptr.3x.html
    ncurses-5.2/doc/html/man/form_field_validation.3x.html
    ncurses-5.2/doc/html/man/form_fieldtype.3x.html
    ncurses-5.2/doc/html/man/form_hook.3x.html
    ncurses-5.2/doc/html/man/form_new.3x.html
    ncurses-5.2/doc/html/man/form_new_page.3x.html
    ncurses-5.2/doc/html/man/form_opts.3x.html
    ncurses-5.2/doc/html/man/form_page.3x.html
    ncurses-5.2/doc/html/man/form_post.3x.html
    ncurses-5.2/doc/html/man/form_requestname.3x.html
    ncurses-5.2/doc/html/man/form_userptr.3x.html
    ncurses-5.2/doc/html/man/form_win.3x.html
    ncurses-5.2/doc/html/man/infocmp.1m.html
    ncurses-5.2/doc/html/man/infotocap.1m.html
    ncurses-5.2/doc/html/man/keybound.3x.html
    ncurses-5.2/doc/html/man/keyok.3x.html
    ncurses-5.2/doc/html/man/menu.3x.html
    ncurses-5.2/doc/html/man/menu_attributes.3x.html
    ncurses-5.2/doc/html/man/menu_cursor.3x.html
    ncurses-5.2/doc/html/man/menu_driver.3x.html
    ncurses-5.2/doc/html/man/menu_format.3x.html
    ncurses-5.2/doc/html/man/menu_hook.3x.html
    ncurses-5.2/doc/html/man/menu_items.3x.html
    ncurses-5.2/doc/html/man/menu_mark.3x.html
    ncurses-5.2/doc/html/man/menu_new.3x.html
    ncurses-5.2/doc/html/man/menu_opts.3x.html
    ncurses-5.2/doc/html/man/menu_pattern.3x.html
    ncurses-5.2/doc/html/man/menu_post.3x.html
    ncurses-5.2/doc/html/man/menu_requestname.3x.html
    ncurses-5.2/doc/html/man/menu_spacing.3x.html
    ncurses-5.2/doc/html/man/menu_userptr.3x.html
    ncurses-5.2/doc/html/man/menu_win.3x.html
    ncurses-5.2/doc/html/man/mitem_current.3x.html
    ncurses-5.2/doc/html/man/mitem_name.3x.html
    ncurses-5.2/doc/html/man/mitem_new.3x.html
    ncurses-5.2/doc/html/man/mitem_opts.3x.html
    ncurses-5.2/doc/html/man/mitem_userptr.3x.html
    ncurses-5.2/doc/html/man/mitem_value.3x.html
    ncurses-5.2/doc/html/man/mitem_visible.3x.html
    ncurses-5.2/doc/html/man/ncurses.3x.html
    ncurses-5.2/doc/html/man/panel.3x.html
    ncurses-5.2/doc/html/man/resizeterm.3x.html
    ncurses-5.2/doc/html/man/term.5.html
    ncurses-5.2/doc/html/man/term.7.html
    ncurses-5.2/doc/html/man/terminfo.5.html
    ncurses-5.2/doc/html/man/tic.1m.html
    ncurses-5.2/doc/html/man/toe.1m.html
    ncurses-5.2/doc/html/man/tput.1.html
    ncurses-5.2/doc/html/man/tset.1.html
    ncurses-5.2/doc/html/man/wresize.3x.html
    ncurses-5.2/doc/html/ncurses-intro.html
    ncurses-5.2/doc/ncurses-intro.doc
    ncurses-5.2/form/Makefile.in
    ncurses-5.2/form/READ.ME
    ncurses-5.2/form/fld_arg.c
    ncurses-5.2/form/fld_attr.c
    ncurses-5.2/form/fld_current.c
    ncurses-5.2/form/fld_def.c
    ncurses-5.2/form/fld_dup.c
    ncurses-5.2/form/fld_ftchoice.c
    ncurses-5.2/form/fld_ftlink.c
    ncurses-5.2/form/fld_info.c
    ncurses-5.2/form/fld_just.c
    ncurses-5.2/form/fld_link.c
    ncurses-5.2/form/fld_max.c
    ncurses-5.2/form/fld_move.c
    ncurses-5.2/form/fld_newftyp.c
    ncurses-5.2/form/fld_opts.c
    ncurses-5.2/form/fld_pad.c
    ncurses-5.2/form/fld_page.c
    ncurses-5.2/form/fld_stat.c
    ncurses-5.2/form/fld_type.c
    ncurses-5.2/form/fld_user.c
    ncurses-5.2/form/form.h
    ncurses-5.2/form/form.priv.h
    ncurses-5.2/form/frm_cursor.c
    ncurses-5.2/form/frm_data.c
    ncurses-5.2/form/frm_def.c
    ncurses-5.2/form/frm_driver.c
    ncurses-5.2/form/frm_hook.c
    ncurses-5.2/form/frm_opts.c
    ncurses-5.2/form/frm_page.c
    ncurses-5.2/form/frm_post.c
    ncurses-5.2/form/frm_req_name.c
    ncurses-5.2/form/frm_scale.c
    ncurses-5.2/form/frm_sub.c
    ncurses-5.2/form/frm_user.c
    ncurses-5.2/form/frm_win.c
    ncurses-5.2/form/fty_alnum.c
    ncurses-5.2/form/fty_alpha.c
    ncurses-5.2/form/fty_enum.c
    ncurses-5.2/form/fty_int.c
    ncurses-5.2/form/fty_ipv4.c
    ncurses-5.2/form/fty_num.c
    ncurses-5.2/form/fty_regex.c
    ncurses-5.2/form/headers
    ncurses-5.2/form/llib-lform
    ncurses-5.2/form/modules
    ncurses-5.2/include/Caps
    ncurses-5.2/include/MKhashsize.sh
    ncurses-5.2/include/MKncurses_def.sh
    ncurses-5.2/include/MKparametrized.sh
    ncurses-5.2/include/MKterm.h.awk.in
    ncurses-5.2/include/Makefile.in
    ncurses-5.2/include/capdefaults.c
    ncurses-5.2/include/curses.h.in
    ncurses-5.2/include/edit_cfg.sh
    ncurses-5.2/include/headers
    ncurses-5.2/include/nc_alloc.h
    ncurses-5.2/include/nc_panel.h
    ncurses-5.2/include/ncurses_cfg.hin
    ncurses-5.2/include/ncurses_defs
    ncurses-5.2/include/term_entry.h
    ncurses-5.2/include/termcap.h.in
    ncurses-5.2/include/tic.h
    ncurses-5.2/include/unctrl.h.in
    ncurses-5.2/install-sh
    ncurses-5.2/man/MKterminfo.sh
    ncurses-5.2/man/Makefile.in
    ncurses-5.2/man/captoinfo.1m
    ncurses-5.2/man/clear.1
    ncurses-5.2/man/curs_addch.3x
    ncurses-5.2/man/curs_addchstr.3x
    ncurses-5.2/man/curs_addstr.3x
    ncurses-5.2/man/curs_attr.3x
    ncurses-5.2/man/curs_beep.3x
    ncurses-5.2/man/curs_bkgd.3x
    ncurses-5.2/man/curs_border.3x
    ncurses-5.2/man/curs_clear.3x
    ncurses-5.2/man/curs_color.3x
    ncurses-5.2/man/curs_delch.3x
    ncurses-5.2/man/curs_deleteln.3x
    ncurses-5.2/man/curs_extend.3x
    ncurses-5.2/man/curs_getch.3x
    ncurses-5.2/man/curs_getstr.3x
    ncurses-5.2/man/curs_getyx.3x
    ncurses-5.2/man/curs_inch.3x
    ncurses-5.2/man/curs_inchstr.3x
    ncurses-5.2/man/curs_initscr.3x
    ncurses-5.2/man/curs_inopts.3x
    ncurses-5.2/man/curs_insch.3x
    ncurses-5.2/man/curs_insstr.3x
    ncurses-5.2/man/curs_instr.3x
    ncurses-5.2/man/curs_kernel.3x
    ncurses-5.2/man/curs_mouse.3x
    ncurses-5.2/man/curs_move.3x
    ncurses-5.2/man/curs_outopts.3x
    ncurses-5.2/man/curs_overlay.3x
    ncurses-5.2/man/curs_pad.3x
    ncurses-5.2/man/curs_print.3x
    ncurses-5.2/man/curs_printw.3x
    ncurses-5.2/man/curs_refresh.3x
    ncurses-5.2/man/curs_scanw.3x
    ncurses-5.2/man/curs_scr_dump.3x
    ncurses-5.2/man/curs_scroll.3x
    ncurses-5.2/man/curs_slk.3x
    ncurses-5.2/man/curs_termattrs.3x
    ncurses-5.2/man/curs_termcap.3x
    ncurses-5.2/man/curs_terminfo.3x
    ncurses-5.2/man/curs_touch.3x
    ncurses-5.2/man/curs_trace.3x
    ncurses-5.2/man/curs_util.3x
    ncurses-5.2/man/curs_window.3x
    ncurses-5.2/man/default_colors.3x
    ncurses-5.2/man/define_key.3x
    ncurses-5.2/man/form.3x
    ncurses-5.2/man/form_cursor.3x
    ncurses-5.2/man/form_data.3x
    ncurses-5.2/man/form_driver.3x
    ncurses-5.2/man/form_field.3x
    ncurses-5.2/man/form_field_attributes.3x
    ncurses-5.2/man/form_field_buffer.3x
    ncurses-5.2/man/form_field_info.3x
    ncurses-5.2/man/form_field_just.3x
    ncurses-5.2/man/form_field_new.3x
    ncurses-5.2/man/form_field_opts.3x
    ncurses-5.2/man/form_field_userptr.3x
    ncurses-5.2/man/form_field_validation.3x
    ncurses-5.2/man/form_fieldtype.3x
    ncurses-5.2/man/form_hook.3x
    ncurses-5.2/man/form_new.3x
    ncurses-5.2/man/form_new_page.3x
    ncurses-5.2/man/form_opts.3x
    ncurses-5.2/man/form_page.3x
    ncurses-5.2/man/form_post.3x
    ncurses-5.2/man/form_requestname.3x
    ncurses-5.2/man/form_userptr.3x
    ncurses-5.2/man/form_win.3x
    ncurses-5.2/man/infocmp.1m
    ncurses-5.2/man/infotocap.1m
    ncurses-5.2/man/keybound.3x
    ncurses-5.2/man/keyok.3x
    ncurses-5.2/man/make_sed.sh
    ncurses-5.2/man/man_db.renames
    ncurses-5.2/man/manlinks.sed
    ncurses-5.2/man/menu.3x
    ncurses-5.2/man/menu_attributes.3x
    ncurses-5.2/man/menu_cursor.3x
    ncurses-5.2/man/menu_driver.3x
    ncurses-5.2/man/menu_format.3x
    ncurses-5.2/man/menu_hook.3x
    ncurses-5.2/man/menu_items.3x
    ncurses-5.2/man/menu_mark.3x
    ncurses-5.2/man/menu_new.3x
    ncurses-5.2/man/menu_opts.3x
    ncurses-5.2/man/menu_pattern.3x
    ncurses-5.2/man/menu_post.3x
    ncurses-5.2/man/menu_requestname.3x
    ncurses-5.2/man/menu_spacing.3x
    ncurses-5.2/man/menu_userptr.3x
    ncurses-5.2/man/menu_win.3x
    ncurses-5.2/man/mitem_current.3x
    ncurses-5.2/man/mitem_name.3x
    ncurses-5.2/man/mitem_new.3x
    ncurses-5.2/man/mitem_opts.3x
    ncurses-5.2/man/mitem_userptr.3x
    ncurses-5.2/man/mitem_value.3x
    ncurses-5.2/man/mitem_visible.3x
    ncurses-5.2/man/ncurses.3x
    ncurses-5.2/man/panel.3x
    ncurses-5.2/man/resizeterm.3x
    ncurses-5.2/man/term.5
    ncurses-5.2/man/term.7
    ncurses-5.2/man/terminfo.head
    ncurses-5.2/man/terminfo.tail
    ncurses-5.2/man/tic.1m
    ncurses-5.2/man/toe.1m
    ncurses-5.2/man/tput.1
    ncurses-5.2/man/tset.1
    ncurses-5.2/man/wresize.3x
    ncurses-5.2/menu/Makefile.in
    ncurses-5.2/menu/READ.ME
    ncurses-5.2/menu/eti.h
    ncurses-5.2/menu/headers
    ncurses-5.2/menu/llib-lmenu
    ncurses-5.2/menu/m_attribs.c
    ncurses-5.2/menu/m_cursor.c
    ncurses-5.2/menu/m_driver.c
    ncurses-5.2/menu/m_format.c
    ncurses-5.2/menu/m_global.c
    ncurses-5.2/menu/m_hook.c
    ncurses-5.2/menu/m_item_cur.c
    ncurses-5.2/menu/m_item_nam.c
    ncurses-5.2/menu/m_item_new.c
    ncurses-5.2/menu/m_item_opt.c
    ncurses-5.2/menu/m_item_top.c
    ncurses-5.2/menu/m_item_use.c
    ncurses-5.2/menu/m_item_val.c
    ncurses-5.2/menu/m_item_vis.c
    ncurses-5.2/menu/m_items.c
    ncurses-5.2/menu/m_new.c
    ncurses-5.2/menu/m_opts.c
    ncurses-5.2/menu/m_pad.c
    ncurses-5.2/menu/m_pattern.c
    ncurses-5.2/menu/m_post.c
    ncurses-5.2/menu/m_req_name.c
    ncurses-5.2/menu/m_scale.c
    ncurses-5.2/menu/m_spacing.c
    ncurses-5.2/menu/m_sub.c
    ncurses-5.2/menu/m_userptr.c
    ncurses-5.2/menu/m_win.c
    ncurses-5.2/menu/menu.h
    ncurses-5.2/menu/menu.priv.h
    ncurses-5.2/menu/mf_common.h
    ncurses-5.2/menu/modules
    ncurses-5.2/misc/Makefile.in
    ncurses-5.2/misc/chkdef.cmd
    ncurses-5.2/misc/cleantic.cmd
    ncurses-5.2/misc/cmpdef.cmd
    ncurses-5.2/misc/emx.src
    ncurses-5.2/misc/form.def
    ncurses-5.2/misc/form.ref
    ncurses-5.2/misc/indent.pro
    ncurses-5.2/misc/makedef.cmd
    ncurses-5.2/misc/makellib
    ncurses-5.2/misc/menu.def
    ncurses-5.2/misc/menu.ref
    ncurses-5.2/misc/ncurses.def
    ncurses-5.2/misc/ncurses.ref
    ncurses-5.2/misc/panel.def
    ncurses-5.2/misc/panel.ref
    ncurses-5.2/misc/run_tic.in
    ncurses-5.2/misc/shlib
    ncurses-5.2/misc/tabset/std
    ncurses-5.2/misc/tabset/stdcrt
    ncurses-5.2/misc/tabset/vt100
    ncurses-5.2/misc/tabset/vt300
    ncurses-5.2/misc/tdlint
    ncurses-5.2/misc/terminfo.src
    ncurses-5.2/mk-0th.awk
    ncurses-5.2/mk-1st.awk
    ncurses-5.2/mk-2nd.awk
    ncurses-5.2/mkinstalldirs
    ncurses-5.2/ncurses/Makefile.in
    ncurses-5.2/ncurses/README
    ncurses-5.2/ncurses/SigAction.h
    ncurses-5.2/ncurses/base/MKkeyname.awk
    ncurses-5.2/ncurses/base/MKlib_gen.sh
    ncurses-5.2/ncurses/base/MKunctrl.awk
    ncurses-5.2/ncurses/base/README
    ncurses-5.2/ncurses/base/define_key.c
    ncurses-5.2/ncurses/base/keybound.c
    ncurses-5.2/ncurses/base/keyok.c
    ncurses-5.2/ncurses/base/lib_addch.c
    ncurses-5.2/ncurses/base/lib_addstr.c
    ncurses-5.2/ncurses/base/lib_beep.c
    ncurses-5.2/ncurses/base/lib_bkgd.c
    ncurses-5.2/ncurses/base/lib_box.c
    ncurses-5.2/ncurses/base/lib_chgat.c
    ncurses-5.2/ncurses/base/lib_clear.c
    ncurses-5.2/ncurses/base/lib_clearok.c
    ncurses-5.2/ncurses/base/lib_clrbot.c
    ncurses-5.2/ncurses/base/lib_clreol.c
    ncurses-5.2/ncurses/base/lib_color.c
    ncurses-5.2/ncurses/base/lib_colorset.c
    ncurses-5.2/ncurses/base/lib_delch.c
    ncurses-5.2/ncurses/base/lib_delwin.c
    ncurses-5.2/ncurses/base/lib_dft_fgbg.c
    ncurses-5.2/ncurses/base/lib_echo.c
    ncurses-5.2/ncurses/base/lib_endwin.c
    ncurses-5.2/ncurses/base/lib_erase.c
    ncurses-5.2/ncurses/base/lib_flash.c
    ncurses-5.2/ncurses/base/lib_freeall.c
    ncurses-5.2/ncurses/base/lib_getch.c
    ncurses-5.2/ncurses/base/lib_getstr.c
    ncurses-5.2/ncurses/base/lib_hline.c
    ncurses-5.2/ncurses/base/lib_immedok.c
    ncurses-5.2/ncurses/base/lib_inchstr.c
    ncurses-5.2/ncurses/base/lib_initscr.c
    ncurses-5.2/ncurses/base/lib_insch.c
    ncurses-5.2/ncurses/base/lib_insdel.c
    ncurses-5.2/ncurses/base/lib_insstr.c
    ncurses-5.2/ncurses/base/lib_instr.c
    ncurses-5.2/ncurses/base/lib_isendwin.c
    ncurses-5.2/ncurses/base/lib_leaveok.c
    ncurses-5.2/ncurses/base/lib_mouse.c
    ncurses-5.2/ncurses/base/lib_move.c
    ncurses-5.2/ncurses/base/lib_mvwin.c
    ncurses-5.2/ncurses/base/lib_newterm.c
    ncurses-5.2/ncurses/base/lib_newwin.c
    ncurses-5.2/ncurses/base/lib_nl.c
    ncurses-5.2/ncurses/base/lib_overlay.c
    ncurses-5.2/ncurses/base/lib_pad.c
    ncurses-5.2/ncurses/base/lib_printw.c
    ncurses-5.2/ncurses/base/lib_redrawln.c
    ncurses-5.2/ncurses/base/lib_refresh.c
    ncurses-5.2/ncurses/base/lib_restart.c
    ncurses-5.2/ncurses/base/lib_scanw.c
    ncurses-5.2/ncurses/base/lib_screen.c
    ncurses-5.2/ncurses/base/lib_scroll.c
    ncurses-5.2/ncurses/base/lib_scrollok.c
    ncurses-5.2/ncurses/base/lib_scrreg.c
    ncurses-5.2/ncurses/base/lib_set_term.c
    ncurses-5.2/ncurses/base/lib_slk.c
    ncurses-5.2/ncurses/base/lib_slkatr_set.c
    ncurses-5.2/ncurses/base/lib_slkatrof.c
    ncurses-5.2/ncurses/base/lib_slkatron.c
    ncurses-5.2/ncurses/base/lib_slkatrset.c
    ncurses-5.2/ncurses/base/lib_slkattr.c
    ncurses-5.2/ncurses/base/lib_slkclear.c
    ncurses-5.2/ncurses/base/lib_slkcolor.c
    ncurses-5.2/ncurses/base/lib_slkinit.c
    ncurses-5.2/ncurses/base/lib_slklab.c
    ncurses-5.2/ncurses/base/lib_slkrefr.c
    ncurses-5.2/ncurses/base/lib_slkset.c
    ncurses-5.2/ncurses/base/lib_slktouch.c
    ncurses-5.2/ncurses/base/lib_touch.c
    ncurses-5.2/ncurses/base/lib_ungetch.c
    ncurses-5.2/ncurses/base/lib_vline.c
    ncurses-5.2/ncurses/base/lib_wattroff.c
    ncurses-5.2/ncurses/base/lib_wattron.c
    ncurses-5.2/ncurses/base/lib_winch.c
    ncurses-5.2/ncurses/base/lib_window.c
    ncurses-5.2/ncurses/base/memmove.c
    ncurses-5.2/ncurses/base/nc_panel.c
    ncurses-5.2/ncurses/base/resizeterm.c
    ncurses-5.2/ncurses/base/safe_sprintf.c
    ncurses-5.2/ncurses/base/sigaction.c
    ncurses-5.2/ncurses/base/tries.c
    ncurses-5.2/ncurses/base/version.c
    ncurses-5.2/ncurses/base/vsscanf.c
    ncurses-5.2/ncurses/base/wresize.c
    ncurses-5.2/ncurses/curses.priv.h
    ncurses-5.2/ncurses/fifo_defs.h
    ncurses-5.2/ncurses/llib-lncurses
    ncurses-5.2/ncurses/modules
    ncurses-5.2/ncurses/tinfo/MKcaptab.awk
    ncurses-5.2/ncurses/tinfo/MKfallback.sh
    ncurses-5.2/ncurses/tinfo/MKnames.awk
    ncurses-5.2/ncurses/tinfo/README
    ncurses-5.2/ncurses/tinfo/access.c
    ncurses-5.2/ncurses/tinfo/add_tries.c
    ncurses-5.2/ncurses/tinfo/alloc_entry.c
    ncurses-5.2/ncurses/tinfo/alloc_ttype.c
    ncurses-5.2/ncurses/tinfo/captoinfo.c
    ncurses-5.2/ncurses/tinfo/comp_error.c
    ncurses-5.2/ncurses/tinfo/comp_expand.c
    ncurses-5.2/ncurses/tinfo/comp_hash.c
    ncurses-5.2/ncurses/tinfo/comp_parse.c
    ncurses-5.2/ncurses/tinfo/comp_scan.c
    ncurses-5.2/ncurses/tinfo/doalloc.c
    ncurses-5.2/ncurses/tinfo/free_ttype.c
    ncurses-5.2/ncurses/tinfo/getenv_num.c
    ncurses-5.2/ncurses/tinfo/home_terminfo.c
    ncurses-5.2/ncurses/tinfo/init_keytry.c
    ncurses-5.2/ncurses/tinfo/keys.list
    ncurses-5.2/ncurses/tinfo/lib_acs.c
    ncurses-5.2/ncurses/tinfo/lib_baudrate.c
    ncurses-5.2/ncurses/tinfo/lib_cur_term.c
    ncurses-5.2/ncurses/tinfo/lib_data.c
    ncurses-5.2/ncurses/tinfo/lib_has_cap.c
    ncurses-5.2/ncurses/tinfo/lib_kernel.c
    ncurses-5.2/ncurses/tinfo/lib_longname.c
    ncurses-5.2/ncurses/tinfo/lib_napms.c
    ncurses-5.2/ncurses/tinfo/lib_options.c
    ncurses-5.2/ncurses/tinfo/lib_print.c
    ncurses-5.2/ncurses/tinfo/lib_raw.c
    ncurses-5.2/ncurses/tinfo/lib_setup.c
    ncurses-5.2/ncurses/tinfo/lib_termcap.c
    ncurses-5.2/ncurses/tinfo/lib_termname.c
    ncurses-5.2/ncurses/tinfo/lib_tgoto.c
    ncurses-5.2/ncurses/tinfo/lib_ti.c
    ncurses-5.2/ncurses/tinfo/lib_tparm.c
    ncurses-5.2/ncurses/tinfo/lib_tputs.c
    ncurses-5.2/ncurses/tinfo/lib_ttyflags.c
    ncurses-5.2/ncurses/tinfo/make_keys.c
    ncurses-5.2/ncurses/tinfo/name_match.c
    ncurses-5.2/ncurses/tinfo/parse_entry.c
    ncurses-5.2/ncurses/tinfo/read_entry.c
    ncurses-5.2/ncurses/tinfo/read_termcap.c
    ncurses-5.2/ncurses/tinfo/setbuf.c
    ncurses-5.2/ncurses/tinfo/strings.c
    ncurses-5.2/ncurses/tinfo/write_entry.c
    ncurses-5.2/ncurses/trace/README
    ncurses-5.2/ncurses/trace/lib_trace.c
    ncurses-5.2/ncurses/trace/lib_traceatr.c
    ncurses-5.2/ncurses/trace/lib_tracebits.c
    ncurses-5.2/ncurses/trace/lib_tracechr.c
    ncurses-5.2/ncurses/trace/lib_tracedmp.c
    ncurses-5.2/ncurses/trace/lib_tracemse.c
    ncurses-5.2/ncurses/trace/trace_buf.c
    ncurses-5.2/ncurses/trace/trace_tries.c
    ncurses-5.2/ncurses/trace/trace_xnames.c
    ncurses-5.2/ncurses/tty/MKexpanded.sh
    ncurses-5.2/ncurses/tty/hardscroll.c
    ncurses-5.2/ncurses/tty/hashmap.c
    ncurses-5.2/ncurses/tty/lib_mvcur.c
    ncurses-5.2/ncurses/tty/lib_tstp.c
    ncurses-5.2/ncurses/tty/lib_twait.c
    ncurses-5.2/ncurses/tty/lib_vidattr.c
    ncurses-5.2/ncurses/tty/tty_display.h
    ncurses-5.2/ncurses/tty/tty_input.h
    ncurses-5.2/ncurses/tty/tty_update.c
    ncurses-5.2/panel/Makefile.in
    ncurses-5.2/panel/headers
    ncurses-5.2/panel/llib-lpanel
    ncurses-5.2/panel/modules
    ncurses-5.2/panel/p_above.c
    ncurses-5.2/panel/p_below.c
    ncurses-5.2/panel/p_bottom.c
    ncurses-5.2/panel/p_delete.c
    ncurses-5.2/panel/p_hidden.c
    ncurses-5.2/panel/p_hide.c
    ncurses-5.2/panel/p_move.c
    ncurses-5.2/panel/p_new.c
    ncurses-5.2/panel/p_replace.c
    ncurses-5.2/panel/p_show.c
    ncurses-5.2/panel/p_top.c
    ncurses-5.2/panel/p_update.c
    ncurses-5.2/panel/p_user.c
    ncurses-5.2/panel/p_win.c
    ncurses-5.2/panel/panel.c
    ncurses-5.2/panel/panel.h
    ncurses-5.2/panel/panel.priv.h
    ncurses-5.2/progs/MKtermsort.sh
    ncurses-5.2/progs/Makefile.in
    ncurses-5.2/progs/capconvert
    ncurses-5.2/progs/clear.c
    ncurses-5.2/progs/clear.sh
    ncurses-5.2/progs/dump_entry.c
    ncurses-5.2/progs/dump_entry.h
    ncurses-5.2/progs/infocmp.c
    ncurses-5.2/progs/modules
    ncurses-5.2/progs/progs.priv.h
    ncurses-5.2/progs/tic.c
    ncurses-5.2/progs/toe.c
    ncurses-5.2/progs/tput.c
    ncurses-5.2/progs/tset.c
    ncurses-5.2/sysdeps/unix/sysv/linux/Makefile
    ncurses-5.2/sysdeps/unix/sysv/linux/alpha/configure
    ncurses-5.2/sysdeps/unix/sysv/linux/configure
    ncurses-5.2/sysdeps/unix/sysv/linux/edit_man.sed
    ncurses-5.2/sysdeps/unix/sysv/linux/edit_man.sh
    ncurses-5.2/sysdeps/unix/sysv/linux/run_tic.sh
    ncurses-5.2/tack/COPYING
    ncurses-5.2/tack/HISTORY
    ncurses-5.2/tack/Makefile.in
    ncurses-5.2/tack/README
    ncurses-5.2/tack/ansi.c
    ncurses-5.2/tack/charset.c
    ncurses-5.2/tack/color.c
    ncurses-5.2/tack/control.c
    ncurses-5.2/tack/crum.c
    ncurses-5.2/tack/edit.c
    ncurses-5.2/tack/fun.c
    ncurses-5.2/tack/init.c
    ncurses-5.2/tack/menu.c
    ncurses-5.2/tack/modes.c
    ncurses-5.2/tack/modules
    ncurses-5.2/tack/output.c
    ncurses-5.2/tack/pad.c
    ncurses-5.2/tack/scan.c
    ncurses-5.2/tack/sync.c
    ncurses-5.2/tack/sysdep.c
    ncurses-5.2/tack/tack.1
    ncurses-5.2/tack/tack.c
    ncurses-5.2/tack/tack.h
    ncurses-5.2/tar-copy.sh
    ncurses-5.2/test/Makefile.in
    ncurses-5.2/test/README
    ncurses-5.2/test/blue.c
    ncurses-5.2/test/bs.6
    ncurses-5.2/test/bs.c
    ncurses-5.2/test/cardfile.c
    ncurses-5.2/test/cardfile.dat
    ncurses-5.2/test/configure
    ncurses-5.2/test/configure.in
    ncurses-5.2/test/ditto.c
    ncurses-5.2/test/dots.c
    ncurses-5.2/test/filter.c
    ncurses-5.2/test/firework.c
    ncurses-5.2/test/firstlast.c
    ncurses-5.2/test/gdc.6
    ncurses-5.2/test/gdc.c
    ncurses-5.2/test/hanoi.c
    ncurses-5.2/test/hashtest.c
    ncurses-5.2/test/keynames.c
    ncurses-5.2/test/knight.c
    ncurses-5.2/test/lrtest.c
    ncurses-5.2/test/modules
    ncurses-5.2/test/ncurses.c
    ncurses-5.2/test/ncurses_tst.hin
    ncurses-5.2/test/newdemo.c
    ncurses-5.2/test/railroad.c
    ncurses-5.2/test/rain.c
    ncurses-5.2/test/tclock.c
    ncurses-5.2/test/test.priv.h
    ncurses-5.2/test/testaddch.c
    ncurses-5.2/test/testcurs.c
    ncurses-5.2/test/testscanw.c
    ncurses-5.2/test/tracemunch
    ncurses-5.2/test/view.c
    ncurses-5.2/test/worm.c
    ncurses-5.2/test/xmas.c
Cherrypick from master 2007-08-07 16:14:17 UTC Joel Sherrill <joel.sherrill@OARcorp.com> '2007-08-07	Joel Sherrill <joel.sherrill@OARcorp.com>':
    ChangeLog
    RTEMS_Makefiles/Makefile.bfd
    RTEMS_Makefiles/Makefile.libtecla
    RTEMS_Makefiles/Makefile.ncurses
    RTEMS_Makefiles/Makefile.ncurses-5.3
    RTEMS_Makefiles/Makefile.readline-4.3
    RTEMS_Makefiles/Makefile.zlib
    SUPPORT
    VERSION
    bit
    bit_bfd
    libtecla-1.4.1/CHANGES
    libtecla-1.4.1/INSTALL
    libtecla-1.4.1/LICENSE.TERMS
    libtecla-1.4.1/Makefile
    libtecla-1.4.1/Makefile.in
    libtecla-1.4.1/Makefile.rules
    libtecla-1.4.1/Makefile.stub
    libtecla-1.4.1/PORTING
    libtecla-1.4.1/README
    libtecla-1.4.1/RELEASE.NOTES
    libtecla-1.4.1/config.guess
    libtecla-1.4.1/config.sub
    libtecla-1.4.1/configure
    libtecla-1.4.1/configure.in
    libtecla-1.4.1/cplfile.c
    libtecla-1.4.1/cplfile.h
    libtecla-1.4.1/cplmatch.c
    libtecla-1.4.1/demo.c
    libtecla-1.4.1/demo2.c
    libtecla-1.4.1/direader.c
    libtecla-1.4.1/direader.h
    libtecla-1.4.1/enhance.c
    libtecla-1.4.1/expand.c
    libtecla-1.4.1/freelist.c
    libtecla-1.4.1/freelist.h
    libtecla-1.4.1/getline.c
    libtecla-1.4.1/getline.h
    libtecla-1.4.1/hash.c
    libtecla-1.4.1/hash.h
    libtecla-1.4.1/history.c
    libtecla-1.4.1/history.h
    libtecla-1.4.1/homedir.c
    libtecla-1.4.1/homedir.h
    libtecla-1.4.1/html/changes.html
    libtecla-1.4.1/html/cpl_complete_word.html
    libtecla-1.4.1/html/ef_expand_file.html
    libtecla-1.4.1/html/enhance.html
    libtecla-1.4.1/html/gl_get_line.html
    libtecla-1.4.1/html/index.html
    libtecla-1.4.1/html/libtecla.html
    libtecla-1.4.1/html/pca_lookup_file.html
    libtecla-1.4.1/html/release.html
    libtecla-1.4.1/install-sh
    libtecla-1.4.1/keytab.c
    libtecla-1.4.1/keytab.h
    libtecla-1.4.1/libtecla.h
    libtecla-1.4.1/libtecla.map
    libtecla-1.4.1/man3/cfc_file_start.3
    libtecla-1.4.1/man3/cfc_literal_escapes.3
    libtecla-1.4.1/man3/cfc_set_check_fn.3
    libtecla-1.4.1/man3/cpl_add_completion.3
    libtecla-1.4.1/man3/cpl_complete_word.3
    libtecla-1.4.1/man3/cpl_file_completions.3
    libtecla-1.4.1/man3/cpl_last_error.3
    libtecla-1.4.1/man3/cpl_list_completions.3
    libtecla-1.4.1/man3/cpl_record_error.3
    libtecla-1.4.1/man3/del_CplFileConf.3
    libtecla-1.4.1/man3/del_ExpandFile.3
    libtecla-1.4.1/man3/del_GetLine.3
    libtecla-1.4.1/man3/del_PathCache.3
    libtecla-1.4.1/man3/del_PcaPathConf.3
    libtecla-1.4.1/man3/del_WordCompletion.3
    libtecla-1.4.1/man3/ef_expand_file.3
    libtecla-1.4.1/man3/ef_last_error.3
    libtecla-1.4.1/man3/ef_list_expansions.3
    libtecla-1.4.1/man3/enhance.3
    libtecla-1.4.1/man3/gl_change_terminal.3
    libtecla-1.4.1/man3/gl_clear_history.3
    libtecla-1.4.1/man3/gl_configure_getline.3
    libtecla-1.4.1/man3/gl_customize_completion.3
    libtecla-1.4.1/man3/gl_echo_mode.3
    libtecla-1.4.1/man3/gl_get_line.3
    libtecla-1.4.1/man3/gl_group_history.3
    libtecla-1.4.1/man3/gl_ignore_signal.3
    libtecla-1.4.1/man3/gl_last_signal.3
    libtecla-1.4.1/man3/gl_limit_history.3
    libtecla-1.4.1/man3/gl_load_history.3
    libtecla-1.4.1/man3/gl_lookup_history.3
    libtecla-1.4.1/man3/gl_prompt_style.3
    libtecla-1.4.1/man3/gl_range_of_history.3
    libtecla-1.4.1/man3/gl_resize_history.3
    libtecla-1.4.1/man3/gl_save_history.3
    libtecla-1.4.1/man3/gl_show_history.3
    libtecla-1.4.1/man3/gl_size_of_history.3
    libtecla-1.4.1/man3/gl_state_of_history.3
    libtecla-1.4.1/man3/gl_terminal_size.3
    libtecla-1.4.1/man3/gl_toggle_history.3
    libtecla-1.4.1/man3/gl_trap_signal.3
    libtecla-1.4.1/man3/gl_watch_fd.3
    libtecla-1.4.1/man3/libtecla.3
    libtecla-1.4.1/man3/libtecla_version.3
    libtecla-1.4.1/man3/new_CplFileConf.3
    libtecla-1.4.1/man3/new_ExpandFile.3
    libtecla-1.4.1/man3/new_GetLine.3
    libtecla-1.4.1/man3/new_PathCache.3
    libtecla-1.4.1/man3/new_PcaPathConf.3
    libtecla-1.4.1/man3/new_WordCompletion.3
    libtecla-1.4.1/man3/pca_last_error.3
    libtecla-1.4.1/man3/pca_lookup_file.3
    libtecla-1.4.1/man3/pca_path_completions.3
    libtecla-1.4.1/man3/pca_scan_path.3
    libtecla-1.4.1/man3/pca_set_check_fn.3
    libtecla-1.4.1/man3/ppc_file_start.3
    libtecla-1.4.1/man3/ppc_literal_escapes.3
    libtecla-1.4.1/pathutil.c
    libtecla-1.4.1/pathutil.h
    libtecla-1.4.1/pcache.c
    libtecla-1.4.1/stringrp.c
    libtecla-1.4.1/stringrp.h
    libtecla-1.4.1/strngmem.c
    libtecla-1.4.1/strngmem.h
    libtecla-1.4.1/update_html
    libtecla-1.4.1/update_version
    libtecla-1.4.1/version.c
    ncurses-5.3/config.sub
    ncurses-5.3/misc/run_tic.sh
    readline-4.3.orig/CHANGELOG
    readline-4.3.orig/CHANGES
    readline-4.3.orig/COPYING
    readline-4.3.orig/INSTALL
    readline-4.3.orig/MANIFEST
    readline-4.3.orig/Makefile.in
    readline-4.3.orig/README
    readline-4.3.orig/USAGE
    readline-4.3.orig/aclocal.m4
    readline-4.3.orig/ansi_stdlib.h
    readline-4.3.orig/bind.c
    readline-4.3.orig/callback.c
    readline-4.3.orig/chardefs.h
    readline-4.3.orig/compat.c
    readline-4.3.orig/complete.c
    readline-4.3.orig/config.h.in
    readline-4.3.orig/configure
    readline-4.3.orig/configure.in
    readline-4.3.orig/display.c
    readline-4.3.orig/doc/Makefile.in
    readline-4.3.orig/doc/hist.texinfo
    readline-4.3.orig/doc/history.0
    readline-4.3.orig/doc/history.3
    readline-4.3.orig/doc/history.dvi
    readline-4.3.orig/doc/history.html
    readline-4.3.orig/doc/history.info
    readline-4.3.orig/doc/history.ps
    readline-4.3.orig/doc/history_3.ps
    readline-4.3.orig/doc/hstech.texinfo
    readline-4.3.orig/doc/hsuser.texinfo
    readline-4.3.orig/doc/manvers.texinfo
    readline-4.3.orig/doc/readline.0
    readline-4.3.orig/doc/readline.3
    readline-4.3.orig/doc/readline.dvi
    readline-4.3.orig/doc/readline.html
    readline-4.3.orig/doc/readline.info
    readline-4.3.orig/doc/readline.ps
    readline-4.3.orig/doc/readline_3.ps
    readline-4.3.orig/doc/rlman.texinfo
    readline-4.3.orig/doc/rltech.texinfo
    readline-4.3.orig/doc/rluser.texinfo
    readline-4.3.orig/doc/rluserman.dvi
    readline-4.3.orig/doc/rluserman.html
    readline-4.3.orig/doc/rluserman.info
    readline-4.3.orig/doc/rluserman.ps
    readline-4.3.orig/doc/rluserman.texinfo
    readline-4.3.orig/doc/texi2dvi
    readline-4.3.orig/doc/texi2html
    readline-4.3.orig/doc/texinfo.tex
    readline-4.3.orig/emacs_keymap.c
    readline-4.3.orig/examples/Inputrc
    readline-4.3.orig/examples/Makefile.in
    readline-4.3.orig/examples/excallback.c
    readline-4.3.orig/examples/fileman.c
    readline-4.3.orig/examples/histexamp.c
    readline-4.3.orig/examples/manexamp.c
    readline-4.3.orig/examples/readlinebuf.h
    readline-4.3.orig/examples/rl.c
    readline-4.3.orig/examples/rlcat.c
    readline-4.3.orig/examples/rlfe.c
    readline-4.3.orig/examples/rltest.c
    readline-4.3.orig/examples/rlversion.c
    readline-4.3.orig/funmap.c
    readline-4.3.orig/histexpand.c
    readline-4.3.orig/histfile.c
    readline-4.3.orig/histlib.h
    readline-4.3.orig/history.c
    readline-4.3.orig/history.h
    readline-4.3.orig/histsearch.c
    readline-4.3.orig/input.c
    readline-4.3.orig/isearch.c
    readline-4.3.orig/keymaps.c
    readline-4.3.orig/keymaps.h
    readline-4.3.orig/kill.c
    readline-4.3.orig/macro.c
    readline-4.3.orig/mbutil.c
    readline-4.3.orig/misc.c
    readline-4.3.orig/nls.c
    readline-4.3.orig/parens.c
    readline-4.3.orig/posixdir.h
    readline-4.3.orig/posixjmp.h
    readline-4.3.orig/posixstat.h
    readline-4.3.orig/readline.c
    readline-4.3.orig/readline.h
    readline-4.3.orig/rlconf.h
    readline-4.3.orig/rldefs.h
    readline-4.3.orig/rlmbutil.h
    readline-4.3.orig/rlprivate.h
    readline-4.3.orig/rlshell.h
    readline-4.3.orig/rlstdc.h
    readline-4.3.orig/rltty.c
    readline-4.3.orig/rltty.h
    readline-4.3.orig/rltypedefs.h
    readline-4.3.orig/rlwinsize.h
    readline-4.3.orig/savestring.c
    readline-4.3.orig/search.c
    readline-4.3.orig/shell.c
    readline-4.3.orig/shlib/Makefile.in
    readline-4.3.orig/signals.c
    readline-4.3.orig/support/config.guess
    readline-4.3.orig/support/config.sub
    readline-4.3.orig/support/install.sh
    readline-4.3.orig/support/mkdirs
    readline-4.3.orig/support/mkdist
    readline-4.3.orig/support/shlib-install
    readline-4.3.orig/support/shobj-conf
    readline-4.3.orig/support/wcwidth.c
    readline-4.3.orig/tcap.h
    readline-4.3.orig/terminal.c
    readline-4.3.orig/text.c
    readline-4.3.orig/tilde.c
    readline-4.3.orig/tilde.h
    readline-4.3.orig/undo.c
    readline-4.3.orig/util.c
    readline-4.3.orig/vi_keymap.c
    readline-4.3.orig/vi_mode.c
    readline-4.3.orig/xmalloc.c
    readline-4.3.orig/xmalloc.h
    readline-4.3/CHANGELOG-ReadLine
    readline-4.3/CHANGES
    readline-4.3/COPYING
    readline-4.3/INSTALL
    readline-4.3/MANIFEST
    readline-4.3/Makefile.in
    readline-4.3/README
    readline-4.3/USAGE
    readline-4.3/aclocal.m4
    readline-4.3/ansi_stdlib.h
    readline-4.3/bind.c
    readline-4.3/callback.c
    readline-4.3/chardefs.h
    readline-4.3/compat.c
    readline-4.3/complete.c
    readline-4.3/config.h.in
    readline-4.3/configure
    readline-4.3/configure.in
    readline-4.3/display.c
    readline-4.3/doc/Makefile.in
    readline-4.3/doc/hist.texinfo
    readline-4.3/doc/history.3
    readline-4.3/doc/hstech.texinfo
    readline-4.3/doc/hsuser.texinfo
    readline-4.3/doc/manvers.texinfo
    readline-4.3/doc/readline.3
    readline-4.3/doc/rlman.texinfo
    readline-4.3/doc/rltech.texinfo
    readline-4.3/doc/rluser.texinfo
    readline-4.3/doc/rluserman.texinfo
    readline-4.3/doc/texi2dvi
    readline-4.3/doc/texi2html
    readline-4.3/doc/texinfo.tex
    readline-4.3/emacs_keymap.c
    readline-4.3/examples/Inputrc
    readline-4.3/examples/Makefile.in
    readline-4.3/examples/excallback.c
    readline-4.3/examples/fileman.c
    readline-4.3/examples/histexamp.c
    readline-4.3/examples/manexamp.c
    readline-4.3/examples/readlinebuf.h
    readline-4.3/examples/rl.c
    readline-4.3/examples/rlcat.c
    readline-4.3/examples/rlfe.c
    readline-4.3/examples/rltest.c
    readline-4.3/examples/rlversion.c
    readline-4.3/funmap.c
    readline-4.3/histexpand.c
    readline-4.3/histfile.c
    readline-4.3/histlib.h
    readline-4.3/history.c
    readline-4.3/history.h
    readline-4.3/histsearch.c
    readline-4.3/input.c
    readline-4.3/isearch.c
    readline-4.3/keymaps.c
    readline-4.3/keymaps.h
    readline-4.3/kill.c
    readline-4.3/macro.c
    readline-4.3/mbutil.c
    readline-4.3/misc.c
    readline-4.3/nls.c
    readline-4.3/parens.c
    readline-4.3/posixdir.h
    readline-4.3/posixjmp.h
    readline-4.3/posixstat.h
    readline-4.3/readline.c
    readline-4.3/readline.h
    readline-4.3/rlconf.h
    readline-4.3/rldefs.h
    readline-4.3/rlmbutil.h
    readline-4.3/rlprivate.h
    readline-4.3/rlshell.h
    readline-4.3/rlstdc.h
    readline-4.3/rltty.c
    readline-4.3/rltty.h
    readline-4.3/rltypedefs.h
    readline-4.3/rlwinsize.h
    readline-4.3/savestring.c
    readline-4.3/search.c
    readline-4.3/shell.c
    readline-4.3/shlib/Makefile.in
    readline-4.3/signals.c
    readline-4.3/support/config.guess
    readline-4.3/support/config.sub
    readline-4.3/support/install.sh
    readline-4.3/support/mkdirs
    readline-4.3/support/mkdist
    readline-4.3/support/shlib-install
    readline-4.3/support/shobj-conf
    readline-4.3/support/wcwidth.c
    readline-4.3/tcap.h
    readline-4.3/terminal.c
    readline-4.3/text.c
    readline-4.3/tilde.c
    readline-4.3/tilde.h
    readline-4.3/undo.c
    readline-4.3/util.c
    readline-4.3/vi_keymap.c
    readline-4.3/vi_mode.c
    readline-4.3/xmalloc.c
    readline-4.3/xmalloc.h
    readline-doc-4.3/MANIFEST.doc
    readline-doc-4.3/doc/history.0
    readline-doc-4.3/doc/history.dvi
    readline-doc-4.3/doc/history.html
    readline-doc-4.3/doc/history.info
    readline-doc-4.3/doc/history.ps
    readline-doc-4.3/doc/history_3.ps
    readline-doc-4.3/doc/readline.0
    readline-doc-4.3/doc/readline.dvi
    readline-doc-4.3/doc/readline.html
    readline-doc-4.3/doc/readline.info
    readline-doc-4.3/doc/readline.ps
    readline-doc-4.3/doc/readline_3.ps
    readline-doc-4.3/doc/rluserman.dvi
    readline-doc-4.3/doc/rluserman.html
    readline-doc-4.3/doc/rluserman.info
    readline-doc-4.3/doc/rluserman.ps
    zlib-1.1.4/ChangeLog
    zlib-1.1.4/FAQ
    zlib-1.1.4/INDEX
    zlib-1.1.4/Make_vms.com
    zlib-1.1.4/Makefile
    zlib-1.1.4/Makefile.in
    zlib-1.1.4/Makefile.riscos
    zlib-1.1.4/README
    zlib-1.1.4/adler32.c
    zlib-1.1.4/algorithm.txt
    zlib-1.1.4/amiga/Makefile.pup
    zlib-1.1.4/amiga/Makefile.sas
    zlib-1.1.4/compress.c
    zlib-1.1.4/configure
    zlib-1.1.4/contrib/README.contrib
    zlib-1.1.4/contrib/asm386/gvmat32.asm
    zlib-1.1.4/contrib/asm386/gvmat32c.c
    zlib-1.1.4/contrib/asm386/mkgvmt32.bat
    zlib-1.1.4/contrib/asm386/zlibvc.def
    zlib-1.1.4/contrib/asm386/zlibvc.dsp
    zlib-1.1.4/contrib/asm386/zlibvc.dsw
    zlib-1.1.4/contrib/asm586/README.586
    zlib-1.1.4/contrib/asm586/match.S
    zlib-1.1.4/contrib/asm686/README.686
    zlib-1.1.4/contrib/asm686/match.S
    zlib-1.1.4/contrib/delphi/zlib.mak
    zlib-1.1.4/contrib/delphi/zlibdef.pas
    zlib-1.1.4/contrib/delphi2/d_zlib.bpr
    zlib-1.1.4/contrib/delphi2/d_zlib.cpp
    zlib-1.1.4/contrib/delphi2/readme.txt
    zlib-1.1.4/contrib/delphi2/zlib.bpg
    zlib-1.1.4/contrib/delphi2/zlib.bpr
    zlib-1.1.4/contrib/delphi2/zlib.cpp
    zlib-1.1.4/contrib/delphi2/zlib.pas
    zlib-1.1.4/contrib/delphi2/zlib32.bpr
    zlib-1.1.4/contrib/delphi2/zlib32.cpp
    zlib-1.1.4/contrib/iostream/test.cpp
    zlib-1.1.4/contrib/iostream/zfstream.cpp
    zlib-1.1.4/contrib/iostream/zfstream.h
    zlib-1.1.4/contrib/iostream2/zstream.h
    zlib-1.1.4/contrib/iostream2/zstream_test.cpp
    zlib-1.1.4/contrib/minizip/ChangeLogUnzip
    zlib-1.1.4/contrib/minizip/Makefile
    zlib-1.1.4/contrib/minizip/miniunz.c
    zlib-1.1.4/contrib/minizip/minizip.c
    zlib-1.1.4/contrib/minizip/readme.txt
    zlib-1.1.4/contrib/minizip/unzip.c
    zlib-1.1.4/contrib/minizip/unzip.def
    zlib-1.1.4/contrib/minizip/unzip.h
    zlib-1.1.4/contrib/minizip/zip.c
    zlib-1.1.4/contrib/minizip/zip.def
    zlib-1.1.4/contrib/minizip/zip.h
    zlib-1.1.4/contrib/minizip/zlibvc.def
    zlib-1.1.4/contrib/minizip/zlibvc.dsp
    zlib-1.1.4/contrib/minizip/zlibvc.dsw
    zlib-1.1.4/contrib/untgz/Makefile
    zlib-1.1.4/contrib/untgz/makefile.w32
    zlib-1.1.4/contrib/untgz/untgz.c
    zlib-1.1.4/contrib/visual-basic.txt
    zlib-1.1.4/crc32.c
    zlib-1.1.4/deflate.c
    zlib-1.1.4/deflate.h
    zlib-1.1.4/descrip.mms
    zlib-1.1.4/example.c
    zlib-1.1.4/gzio.c
    zlib-1.1.4/infblock.c
    zlib-1.1.4/infblock.h
    zlib-1.1.4/infcodes.c
    zlib-1.1.4/infcodes.h
    zlib-1.1.4/inffast.c
    zlib-1.1.4/inffast.h
    zlib-1.1.4/inffixed.h
    zlib-1.1.4/inflate.c
    zlib-1.1.4/inftrees.c
    zlib-1.1.4/inftrees.h
    zlib-1.1.4/infutil.c
    zlib-1.1.4/infutil.h
    zlib-1.1.4/maketree.c
    zlib-1.1.4/minigzip.c
    zlib-1.1.4/msdos/Makefile.b32
    zlib-1.1.4/msdos/Makefile.bor
    zlib-1.1.4/msdos/Makefile.dj2
    zlib-1.1.4/msdos/Makefile.emx
    zlib-1.1.4/msdos/Makefile.msc
    zlib-1.1.4/msdos/Makefile.tc
    zlib-1.1.4/msdos/Makefile.w32
    zlib-1.1.4/msdos/Makefile.wat
    zlib-1.1.4/msdos/zlib.def
    zlib-1.1.4/msdos/zlib.rc
    zlib-1.1.4/nt/Makefile.emx
    zlib-1.1.4/nt/Makefile.gcc
    zlib-1.1.4/nt/Makefile.nt
    zlib-1.1.4/nt/zlib.dnt
    zlib-1.1.4/os2/Makefile.os2
    zlib-1.1.4/os2/zlib.def
    zlib-1.1.4/trees.c
    zlib-1.1.4/trees.h
    zlib-1.1.4/uncompr.c
    zlib-1.1.4/zconf.h
    zlib-1.1.4/zlib.3
    zlib-1.1.4/zlib.h
    zlib-1.1.4/zlib.html
    zlib-1.1.4/zutil.c
    zlib-1.1.4/zutil.h

1 files changed, 1046 insertions, 0 deletions

diff --git a/avl-1.4.0/avl.html b/avl-1.4.0/avl.html
new file mode 100644
index 0000000..ef3e51e
--- /dev/null
+++ b/avl-1.4.0/avl.html
@@ -0,0 +1,1046 @@
+<HTML>
+<HEAD>
+<!-- This HTML file has been created by texi2html 1.54
+     from ./avl.texinfo on 6 October 1999 -->
+
+<TITLE>libavl manual</TITLE>
+
+</HEAD>
+<BODY>
+<H1>libavl</H1>
+<H2>A library for manipulation of balanced binary trees</H2>
+<ADDRESS>Ben Pfaff</ADDRESS>
+<P>
+<P><HR><P>
+<H1>Table of Contents</H1>
+<UL>
+<LI><A NAME="TOC1" HREF="avl.html#SEC1">Introduction to balanced binary trees</A>
+<LI><A NAME="TOC2" HREF="avl.html#SEC2">Introduction to threaded trees</A>
+<LI><A NAME="TOC3" HREF="avl.html#SEC3">Types</A>
+<LI><A NAME="TOC4" HREF="avl.html#SEC4">Functions</A>
+<LI><A NAME="TOC5" HREF="avl.html#SEC5">Tree Creation</A>
+<LI><A NAME="TOC6" HREF="avl.html#SEC6">Insertion and Deletion</A>
+<LI><A NAME="TOC7" HREF="avl.html#SEC7">Searching</A>
+<LI><A NAME="TOC8" HREF="avl.html#SEC8">Iteration</A>
+<LI><A NAME="TOC9" HREF="avl.html#SEC9">Conversion</A>
+<LI><A NAME="TOC10" HREF="avl.html#SEC10">Author</A>
+<LI><A NAME="TOC11" HREF="avl.html#SEC11">Index</A>
+</UL>
+<P><HR><P>
+
+
+<H1><A NAME="SEC1" HREF="avl.html#TOC1">Introduction to balanced binary trees</A></H1>
+
+<P>
+<A NAME="IDX1"></A>
+Consider some techniques that can be used to find a particular item in a
+data set.  Typical methods include sequential searching, digital
+searching, hash tables, and binary searching.
+
+</P>
+<P>
+Sequential searching is simple, but slow (O(n)).  Digital searching
+requires that the entire data set be known in advance, and memory
+efficient implementations are slow.
+
+</P>
+<P>
+Hash tables are fast (O(1)) for static data sets, but they can be
+wasteful of memory.  It can be difficult to choose an effective hash
+function.  Some hash tables variants also make deletion an expensive
+operation.
+
+</P>
+<P>
+<A NAME="IDX2"></A>
+Binary search techniques work almost as quickly (O(log(n)) on an ordered
+table, or on a binary tree.  Binary trees also allow easy iteration over
+the data in the tree in sorted order.  With hash tables it is necessary
+to sort the data before iterating, and after sorting the data is no
+longer in hash form.
+
+</P>
+<P>
+Binary trees are efficient for insertion, deletion, and searching, if
+data are inserted in random order.  But, if data are inserted in order
+using a naive algorithm, binary search degenerates to sequential search.
+
+</P>
+<P>
+<A NAME="IDX3"></A>
+<A NAME="IDX4"></A>
+<A NAME="IDX5"></A>
+In turn, this problem can be solved by <STRONG>rebalancing</STRONG> the tree after
+each insertion or deletion.  In rebalancing, nodes are rearranged via
+transformations called <STRONG>rotations</STRONG> using an algorithm that tends to
+minimize the tree's height.
+
+</P>
+<P>
+There are several schemes for rebalancing binary trees.  The two most
+common types of balanced tree are <STRONG>AVL trees</STRONG> and <STRONG>red-black
+trees</STRONG>.  libavl implements both types:
+
+</P>
+
+<UL>
+<LI>
+
+<A NAME="IDX6"></A>
+<A NAME="IDX7"></A>
+AVL trees, invented by Russian mathematicians G. M. Adel'son-Velskii and
+E. M. Landis, ensure that, for each node, the difference in height
+between its subtrees (the <STRONG>balance factor</STRONG>) is not greater than 1.
+
+<LI>
+
+Red-black trees, invented by R. Bayer and studied at length by
+L. J. Guibas and R. Sedgewick, assign each node of a tree a color (red
+or black), and specify a set of rules governing how red and black nodes
+may be arranged.
+</UL>
+
+<P>
+The table below presents a comparison among unbalanced binary trees, AVL
+trees, and red-black trees.  In the table, <VAR>n</VAR> is the number of
+nodes in the tree and <VAR>h</VAR> is the tree's height before the
+operation.  <STRONG>lg</STRONG> is the base-2 logarithm function.
+
+</P>
+<TABLE>
+
+<TR>Operation
+<BR>
+<TR>
+<TD> Binary Tree
+<TD> AVL Tree
+<TD> Red-Black Tree
+
+<BR>
+<TR>Time per insertion or deletion
+<BR>
+<TR>
+<TD> O(<VAR>h</VAR>)
+<TD> O(lg <VAR>n</VAR>)
+<TD> O(lg <VAR>n</VAR>)
+
+<BR>
+<TR>Time for insertion of <VAR>k</VAR> nodes having sequential values
+<BR>
+<TR>
+<TD> O(<VAR>k</VAR>^2)
+<TD> O(<VAR>n</VAR> lg <VAR>n</VAR>)
+<TD> O(<VAR>n</VAR> lg <VAR>n</VAR>)
+
+<BR>
+<TR>Time for insertion of <VAR>k</VAR> nodes having random values
+<BR>
+<TR>
+<TD> O(<VAR>n</VAR> lg <VAR>n</VAR>)
+<TD> O(<VAR>n</VAR> lg <VAR>n</VAR>)
+<TD> O(<VAR>n</VAR> lg <VAR>n</VAR>)
+
+<BR>
+<TR>Maximum number of rotations per insertion
+<BR>
+<TR>
+<TD> 0
+<TD> 1
+<TD> lg <VAR>n</VAR>
+
+<BR>
+<TR>Maximum number of rotations per deletion
+<BR>
+<TR>
+<TD> 0
+<TD> lg <VAR>n</VAR>
+<TD> lg <VAR>n</VAR>
+
+<BR>
+<TR>Maximum <VAR>h</VAR> as a function of <VAR>n</VAR>
+<BR>
+<TR>
+<TD> <VAR>n</VAR>
+<TD> 1.44 lg (<VAR>n</VAR> + 2) - .328
+<TD> 2 lg (<VAR>n</VAR> + 1)
+
+<BR>
+<TR>Minimum <VAR>n</VAR> as a function of <VAR>h</VAR>
+<BR>
+<TR>
+<TD> <VAR>h</VAR>
+<TD> 2^((<VAR>h</VAR> + .328) / 1.44) - 2
+<TD> 2^(<VAR>h</VAR> / 2) - 1
+</TABLE>
+
+There are alternatives to AVL trees that share some of their properties.
+For instance, skip lists, 2-3 trees, and splay trees all allow O(log(n))
+insertion and deletion.  The main disadvantage of these methods is that
+their operations are not as well documented in the literature.
+
+
+
+<H1><A NAME="SEC2" HREF="avl.html#TOC2">Introduction to threaded trees</A></H1>
+
+<P>
+<STRONG>Threading</STRONG> is a clever method that simplifies binary tree
+traversal.  
+
+</P>
+<P>
+Nodes in a unthreaded binary tree that have zero or one subnodes have
+two or one null subnode pointers, respectively.  In a threaded binary
+tree, a left child pointer that would otherwise be null is used to point
+to the node's inorder<A NAME="DOCF1" HREF="avl.html#FOOT1">(1)</A>
+predecessor, and in a null right child pointer points to its inorder
+successor.
+
+</P>
+<P>
+In a threaded tree, it is always possible to find the next node and the
+previous node of a node, given only a pointer to the node in question.
+In an unthreaded tree, it's also necessary to have a list of the nodes
+between the node in question and root of the tree.
+
+</P>
+<P>
+Advantages of a threaded tree compared to an unthreaded one include:
+
+</P>
+
+<UL>
+<LI>
+
+Faster traversal and less memory usage during traversal, since no stack
+need be maintained.
+
+<LI>
+
+Greater generality, since one can go from a node to its successor or
+predecessor given only the node, simplifying algorithms that require
+moving forward and backward in a tree.
+</UL>
+
+<P>
+Some disadvantages of threaded trees are:
+
+</P>
+
+<UL>
+<LI>
+
+Slower insertion and deletion, since threads need to be maintained.  In
+somes cases, this can be alleviated by constructing the tree as an
+unthreaded tree, then threading it with a special libavl function.
+
+<LI>
+
+In theory, threaded trees need two extra bits per node to indicate
+whether each child pointer points to an ordinary node or the node's
+successor/predecessor node.  In libavl, however, these bits are stored
+in a byte that is used for structure alignment padding in unthreaded
+binary trees, so no extra storage is used.
+</UL>
+
+<P>
+A <STRONG>right-threaded binary tree</STRONG> is similar to a threaded binary tree,
+but threads are only maintained on the right side of each node.  This
+allows for traversal to the right (toward larger values) but not to the
+left (toward smaller values).  Right-threaded trees are convenient when
+the properties of a threaded tree are desirable, but traversal in
+reverse sort order is not necessary.  Not threading the left links saves
+time in insertions and deletions.
+
+</P>
+<P>
+Left-threaded binary trees also exist, but they are not implemented by
+libavl.  The same effect can be obtained by sorting the tree in the
+opposite order.
+
+</P>
+
+
+<H1><A NAME="SEC3" HREF="avl.html#TOC3">Types</A></H1>
+
+<P>
+The following types are defined and used by libavl:
+
+</P>
+<P>
+<DL>
+<DT><U>Data Type:</U> <B>avl_tree</B>
+<DD><A NAME="IDX8"></A>
+<DT><U>Data Type:</U> <B>avlt_tree</B>
+<DD><A NAME="IDX9"></A>
+<DT><U>Data Type:</U> <B>avltr_tree</B>
+<DD><A NAME="IDX10"></A>
+<DT><U>Data Type:</U> <B>rb_tree</B>
+<DD><A NAME="IDX11"></A>
+These are the data types used to represent a tree.  Although they are
+defined in the libavl header files, it should never be necessary to
+access them directly.  Instead, all accesses should take place through
+libavl functions.
+</DL>
+
+</P>
+<P>
+<DL>
+<DT><U>Data Type:</U> <B>avl_node</B>
+<DD><A NAME="IDX12"></A>
+<DT><U>Data Type:</U> <B>avlt_node</B>
+<DD><A NAME="IDX13"></A>
+<DT><U>Data Type:</U> <B>avltr_node</B>
+<DD><A NAME="IDX14"></A>
+<DT><U>Data Type:</U> <B>rb_node</B>
+<DD><A NAME="IDX15"></A>
+These are the data types used to represent individual nodes in a tree.
+Similar cautions apply as with <CODE>avl_tree</CODE> structures.
+</DL>
+
+</P>
+<P>
+<DL>
+<DT><U>Data Type:</U> <B>avl_traverser</B>
+<DD><A NAME="IDX16"></A>
+<DT><U>Data Type:</U> <B>avlt_traverser</B>
+<DD><A NAME="IDX17"></A>
+<DT><U>Data Type:</U> <B>avltr_traverser</B>
+<DD><A NAME="IDX18"></A>
+<DT><U>Data Type:</U> <B>rb_traverser</B>
+<DD><A NAME="IDX19"></A>
+These are the data types used by the <CODE>avl_traverse</CODE> family of
+functions to iterate across the tree.  Again, these are opaque
+structures.
+</DL>
+
+</P>
+<P>
+<DL>
+<DT><U>Data Type:</U> <B>avl_comparison_func</B>
+<DD><A NAME="IDX20"></A>
+Every tree must have an ordering defined by a function of this type.  It
+must have the following signature:
+
+</P>
+
+<PRE>
+int <VAR>compare</VAR> (const void *<VAR>a</VAR>, const void *<VAR>b</VAR>, void *<VAR>param</VAR>)
+</PRE>
+
+<P>
+The return value is expected to be like that returned by <CODE>strcmp</CODE>
+in the standard C library: negative if <VAR>a</VAR> &#60; <VAR>b</VAR>, zero if
+<VAR>a</VAR> = <VAR>b</VAR>, positive if <VAR>a</VAR> &#62; <VAR>b</VAR>.  <VAR>param</VAR> is an
+arbitrary value defined by the user when the tree was created.
+</DL>
+
+</P>
+<P>
+<DL>
+<DT><U>Data Type:</U> <B>avl_node_func</B>
+<DD><A NAME="IDX21"></A>
+This is a class of function called to perform an operation on a data
+item.  Functions of this type have the following signature:
+
+</P>
+
+<PRE>
+void <VAR>operate</VAR> (void *<VAR>data</VAR>, void *<VAR>param</VAR>)
+</PRE>
+
+<P>
+<VAR>data</VAR> is the data item and <VAR>param</VAR> is an arbitrary user-defined
+value set when the tree was created.
+</DL>
+
+</P>
+<P>
+<DL>
+<DT><U>Data Type:</U> <B>avl_copy_func</B>
+<DD><A NAME="IDX22"></A>
+
+</P>
+<P>
+This is a class of function called to make a new copy of a node's data.
+Functions of this type have the following signature:
+
+</P>
+
+<PRE>
+void *<VAR>copy</VAR> (void *<VAR>data</VAR>, void *<VAR>param</VAR>)
+</PRE>
+
+<P>
+The function should return a new copy of <VAR>data</VAR>.  <VAR>param</VAR> is an
+arbitrary user-defined value set when the tree was created.
+</DL>
+
+</P>
+<P>
+<DL>
+<DT><U>Macro:</U> <B>AVL_MAX_HEIGHT</B>
+<DD><A NAME="IDX23"></A>
+This macro defines the maximum height of an AVL tree that can be handled
+by functions that maintain a stack of nodes descended.  The default
+value is 32, which allows for AVL trees with a maximum number of nodes
+between 5,704,880 and 4,294,967,295, depending on order of insertion.
+This macro may be defined by the user before including any AVL tree
+header file, in which case libavl will honor that value.
+</DL>
+
+</P>
+<P>
+<DL>
+<DT><U>Macro:</U> <B>RB_MAX_HEIGHT</B>
+<DD><A NAME="IDX24"></A>
+This macro defines the maximum height of an AVL tree that can be handled
+by functions that maintain a stack of nodes descended.  The default
+value is 32, which allows for red-black trees with a maximum number of
+nodes of at least 65535.  This macro may be defined by the user before
+including the red-black tree header file, in which case libavl will
+honor that value.
+</DL>
+
+</P>
+
+
+<H1><A NAME="SEC4" HREF="avl.html#TOC4">Functions</A></H1>
+
+<P>
+<A NAME="IDX25"></A>
+<A NAME="IDX26"></A>
+<A NAME="IDX27"></A>
+libavl is four libraries in one:
+
+</P>
+
+<UL>
+<LI>
+
+An unthreaded AVL tree library.
+
+<LI>
+
+A threaded AVL tree library.
+
+<LI>
+
+A right-threaded AVL tree library.
+
+<LI>
+
+A red-black tree library.
+</UL>
+
+<P>
+Identifiers in these libraries are prefixed by <CODE>avl_</CODE>,
+<CODE>avlt_</CODE>, <CODE>avltr_</CODE>, and <CODE>rb_</CODE>, with corresponding header
+files <TT>`avl.h'</TT>, <TT>`avlt.h'</TT>, <TT>`avltr.h'</TT>, and <TT>`rb.h'</TT>,
+respectively.  The functions that they declare are defined in the
+<TT>`.c'</TT> files with the same names.
+
+</P>
+<P>
+Most tree functions are implemented in all three libraries, but
+threading allows more generality of operation.  So, the threaded and
+right-threaded libraries offer a few additional functions for finding
+the next or previous node from a given node.  In addition, they offer
+functions for converting trees from threaded or right-threaded
+representations to unthreaded, and vice versa.<A NAME="DOCF2" HREF="avl.html#FOOT2">(2)</A>
+
+</P>
+
+
+<H1><A NAME="SEC5" HREF="avl.html#TOC5">Tree Creation</A></H1>
+
+<P>
+These functions deal with creation and destruction of AVL trees.
+
+</P>
+<P>
+<DL>
+<DT><U>Function:</U> avl_tree * <B>avl_create</B> <I>(avl_comparison_func <VAR>compare</VAR>, void *<VAR>param</VAR>)</I>
+<DD><A NAME="IDX28"></A>
+<DT><U>Function:</U> avlt_tree * <B>avlt_create</B> <I>(avlt_comparison_func <VAR>compare</VAR>, void *<VAR>param</VAR>)</I>
+<DD><A NAME="IDX29"></A>
+<DT><U>Function:</U> avltr_tree * <B>avltr_create</B> <I>(avltr_comparison_func <VAR>compare</VAR>, void *<VAR>param</VAR>)</I>
+<DD><A NAME="IDX30"></A>
+<DT><U>Function:</U> rb_tree * <B>rb_create</B> <I>(avl_comparison_func <VAR>compare</VAR>, void *<VAR>param</VAR>)</I>
+<DD><A NAME="IDX31"></A>
+Create a new, empty tree with comparison function <VAR>compare</VAR>.
+Arbitrary user data <VAR>param</VAR> is saved so that it can be passed to
+user callback functions.
+</DL>
+
+</P>
+<P>
+<DL>
+<DT><U>Function:</U> void <B>avl_destroy</B> <I>(avl_tree *<VAR>tree</VAR>, avl_node_func <VAR>free</VAR>)</I>
+<DD><A NAME="IDX32"></A>
+<DT><U>Function:</U> void <B>avlt_destroy</B> <I>(avlt_tree *<VAR>tree</VAR>, avl_node_func <VAR>free</VAR>)</I>
+<DD><A NAME="IDX33"></A>
+<DT><U>Function:</U> void <B>avltr_destroy</B> <I>(avltr_tree *<VAR>tree</VAR>, avl_node_func <VAR>free</VAR>)</I>
+<DD><A NAME="IDX34"></A>
+<DT><U>Function:</U> void <B>rb_destroy</B> <I>(rb_tree *<VAR>tree</VAR>, avl_node_func <VAR>free</VAR>)</I>
+<DD><A NAME="IDX35"></A>
+Destroys <VAR>tree</VAR>, releasing all of its storage.  If <VAR>free</VAR> is
+non-null, then it is called for every node in postorder before that node
+is freed.
+</DL>
+
+</P>
+<P>
+<DL>
+<DT><U>Function:</U> void <B>avl_free</B> <I>(avl_tree *<VAR>tree</VAR>)</I>
+<DD><A NAME="IDX36"></A>
+<DT><U>Function:</U> void <B>avlt_free</B> <I>(avlt_tree *<VAR>tree</VAR>)</I>
+<DD><A NAME="IDX37"></A>
+<DT><U>Function:</U> void <B>avltr_free</B> <I>(avltr_tree *<VAR>tree</VAR>)</I>
+<DD><A NAME="IDX38"></A>
+<DT><U>Function:</U> void <B>rb_free</B> <I>(rb_tree *<VAR>tree</VAR>)</I>
+<DD><A NAME="IDX39"></A>
+Destroys <VAR>tree</VAR>, releasing all of its storage.  The data in each
+node is freed with a call to the standard C library function
+<CODE>free</CODE>.
+</DL>
+
+</P>
+<P>
+<DL>
+<DT><U>Function:</U> avl_tree * <B>avl_copy</B> <I>(const avl_tree *<VAR>tree</VAR>, avl_copy_func <VAR>copy</VAR>)</I>
+<DD><A NAME="IDX40"></A>
+<DT><U>Function:</U> avlt_tree * <B>avl_copy</B> <I>(const avlt_tree *<VAR>tree</VAR>, avl_copy_func <VAR>copy</VAR>)</I>
+<DD><A NAME="IDX41"></A>
+<DT><U>Function:</U> avltr_tree * <B>avl_copy</B> <I>(const avltr_tree *<VAR>tree</VAR>, avl_copy_func <VAR>copy</VAR>)</I>
+<DD><A NAME="IDX42"></A>
+<DT><U>Function:</U> rb_tree * <B>rb_copy</B> <I>(const rb_tree *<VAR>tree</VAR>, avl_copy_func <VAR>copy</VAR>)</I>
+<DD><A NAME="IDX43"></A>
+Copies the contents of <VAR>tree</VAR> into a new tree, and returns the new
+tree.  If <VAR>copy</VAR> is non-null, then it is called to make a new copy
+of each node's data; otherwise, the node data is copied verbatim into
+the new tree.
+</DL>
+
+</P>
+<P>
+<DL>
+<DT><U>Function:</U> int <B>avl_count</B> <I>(const avl_tree *<VAR>tree</VAR>)</I>
+<DD><A NAME="IDX44"></A>
+<DT><U>Function:</U> int <B>avlt_count</B> <I>(const avlt_tree *<VAR>tree</VAR>)</I>
+<DD><A NAME="IDX45"></A>
+<DT><U>Function:</U> int <B>avltr_count</B> <I>(const avltr_tree *<VAR>tree</VAR>)</I>
+<DD><A NAME="IDX46"></A>
+<DT><U>Function:</U> int <B>rb_count</B> <I>(const rb_tree *<VAR>tree</VAR>)</I>
+<DD><A NAME="IDX47"></A>
+Returns the number of nodes in <VAR>tree</VAR>.
+</DL>
+
+</P>
+<P>
+<DL>
+<DT><U>Function:</U> void * <B>xmalloc</B> <I>(size_t <VAR>size</VAR>)</I>
+<DD><A NAME="IDX48"></A>
+This is not a function defined by libavl.  Instead, it is a function
+that the user program can define.  It must allocate <VAR>size</VAR> bytes
+using <CODE>malloc</CODE> and return it.  It can handle out-of-memory errors
+however it chooses, but it may not ever return a null pointer.
+
+</P>
+<P>
+If there is an <CODE>xmalloc</CODE> function defined for use by libavl, the
+source files (<TT>`avl.c'</TT>, <TT>`avlt.c'</TT>, <TT>`avltr.c'</TT>, <TT>`rb.c'</TT>)
+must be compiled with <CODE>HAVE_XMALLOC</CODE> defined.  Otherwise, the
+library will use its internal static <CODE>xmalloc</CODE>, which handles
+out-of-memory errors by printing a message <SAMP>`virtual memory
+exhausted'</SAMP> to stderr and terminating the program with exit code
+<CODE>EXIT_FAILURE</CODE>.
+</DL>
+
+</P>
+
+
+<H1><A NAME="SEC6" HREF="avl.html#TOC6">Insertion and Deletion</A></H1>
+
+<P>
+These function insert nodes, delete nodes, and search for nodes in
+trees.
+
+</P>
+<P>
+<DL>
+<DT><U>Function:</U> void ** <B>avl_probe</B> <I>(avl_tree *<VAR>tree</VAR>, void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX49"></A>
+<DT><U>Function:</U> void ** <B>avlt_probe</B> <I>(avlt_tree *<VAR>tree</VAR>, void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX50"></A>
+<DT><U>Function:</U> void ** <B>avltr_probe</B> <I>(avltr_tree *<VAR>tree</VAR>, void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX51"></A>
+<DT><U>Function:</U> void ** <B>rb_probe</B> <I>(rb_tree *<VAR>tree</VAR>, void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX52"></A>
+These are the workhorse functions for tree insertion.  They search
+<VAR>tree</VAR> for a node with data matching <VAR>data</VAR>.  If found, a
+pointer to the matching data is returned.  Otherwise, a new node is
+created for <VAR>data</VAR>, and a pointer to that data is returned.  In
+either case, the pointer returned can be changed by the user, but the
+key data used by the tree's comparison must not be changed<A NAME="DOCF3" HREF="avl.html#FOOT3">(3)</A>.
+
+</P>
+<P>
+It is usually easier to use one of the <CODE>avl_insert</CODE> or
+<CODE>avl_replace</CODE> functions instead of <CODE>avl_probe</CODE> directly.
+
+</P>
+<P>
+<STRONG>Please note:</STRONG> It's not a particularly good idea to insert a null
+pointer as a data item into a tree, because several libavl functions
+return a null pointer to indicate failure.  You can sometimes avoid a
+problem by using functions that return a pointer to a pointer instead of
+a plain pointer.  Also be wary of this when casting an arithmetic type
+to a void pointer for insertion--on typical architectures, 0's become
+null pointers when this is done.
+</DL>
+
+</P>
+<P>
+<DL>
+<DT><U>Function:</U> void * <B>avl_insert</B> <I>(avl_tree *<VAR>tree</VAR>, void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX53"></A>
+<DT><U>Function:</U> void * <B>avlt_insert</B> <I>(avlt_tree *<VAR>tree</VAR>, void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX54"></A>
+<DT><U>Function:</U> void * <B>avltr_insert</B> <I>(avltr_tree *<VAR>tree</VAR>, void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX55"></A>
+<DT><U>Function:</U> void * <B>rb_insert</B> <I>(rb_tree *<VAR>tree</VAR>, void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX56"></A>
+If a node with data matching <VAR>data</VAR> exists in <VAR>tree</VAR>, returns
+the matching data item.  Otherwise, inserts <VAR>data</VAR> into <VAR>tree</VAR>
+and returns a null pointer.
+</DL>
+
+</P>
+<P>
+<DL>
+<DT><U>Function:</U> void <B>avl_force_insert</B> <I>(avl_tree *<VAR>tree</VAR>, void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX57"></A>
+<DT><U>Function:</U> void <B>avlt_force_insert</B> <I>(avlt_tree *<VAR>tree</VAR>, void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX58"></A>
+<DT><U>Function:</U> void <B>avltr_force_insert</B> <I>(avltr_tree *<VAR>tree</VAR>, void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX59"></A>
+<DT><U>Function:</U> void <B>rb_force_insert</B> <I>(rb_tree *<VAR>tree</VAR>, void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX60"></A>
+Inserts <VAR>data</VAR> into <VAR>tree</VAR>.  If a node with data matching
+<VAR>data</VAR> exists in <VAR>tree</VAR>, aborts the program with an assertion
+violation.  This function is implemented as a macro; if it is used, the
+standard C header <CODE>assert.h</CODE> must also be included.  If macro
+<CODE>NDEBUG</CODE> is defined when a libavl header is included, these
+functions are short-circuited to a direct call to <CODE>avl_insert</CODE>,
+and no check is performed.
+</DL>
+
+</P>
+<P>
+<DL>
+<DT><U>Function:</U> void * <B>avl_replace</B> <I>(avl_tree *<VAR>tree</VAR>, void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX61"></A>
+<DT><U>Function:</U> void * <B>avlt_replace</B> <I>(avlt_tree *<VAR>tree</VAR>, void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX62"></A>
+<DT><U>Function:</U> void * <B>avltr_replace</B> <I>(avltr_tree *<VAR>tree</VAR>, void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX63"></A>
+<DT><U>Function:</U> void * <B>rb_replace</B> <I>(rb_tree *<VAR>tree</VAR>, void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX64"></A>
+If a node with data matching <VAR>data</VAR>, such that the comparison
+function returns 0, exists in <VAR>tree</VAR>, replaces the node's data with
+<VAR>data</VAR> and returns the node's former contents.  Otherwise, inserts
+<VAR>data</VAR> into <VAR>tree</VAR> and returns a null pointer.
+</DL>
+
+</P>
+<P>
+<DL>
+<DT><U>Function:</U> void * <B>avl_delete</B> <I>(avl_tree *<VAR>tree</VAR>, const void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX65"></A>
+<DT><U>Function:</U> void * <B>avlt_delete</B> <I>(avlt_tree *<VAR>tree</VAR>, const void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX66"></A>
+<DT><U>Function:</U> void * <B>avltr_delete</B> <I>(avltr_tree *<VAR>tree</VAR>, const void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX67"></A>
+<DT><U>Function:</U> void * <B>rb_delete</B> <I>(rb_tree *<VAR>tree</VAR>, const void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX68"></A>
+Searches <VAR>tree</VAR> for a node with data matching <VAR>data</VAR>.  If found,
+the node is deleted and its data is returned.  Otherwise, returns a null
+pointer.
+</DL>
+
+</P>
+<P>
+<DL>
+<DT><U>Function:</U> void * <B>avl_force_delete</B> <I>(avl_tree *<VAR>tree</VAR>, const void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX69"></A>
+<DT><U>Function:</U> void * <B>avlt_force_delete</B> <I>(avlt_tree *<VAR>tree</VAR>, const void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX70"></A>
+<DT><U>Function:</U> void * <B>avltr_force_delete</B> <I>(avltr_tree *<VAR>tree</VAR>, const void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX71"></A>
+<DT><U>Function:</U> void * <B>rb_force_delete</B> <I>(rb_tree *<VAR>tree</VAR>, const void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX72"></A>
+Deletes a node with data matching <VAR>data</VAR> from <VAR>tree</VAR>.  If no
+matching node is found, aborts the program with an assertion violation.
+If macro <CODE>NDEBUG</CODE> is declared when a libavl header is included,
+these functions are short-circuited to a direct call to
+<CODE>avl_delete</CODE>, and no check is performed.
+</DL>
+
+</P>
+
+
+<H1><A NAME="SEC7" HREF="avl.html#TOC7">Searching</A></H1>
+
+<P>
+These function search a tree for an item without making an insertion or
+a deletion.
+
+</P>
+<P>
+<DL>
+<DT><U>Function:</U> void * <B>avl_find</B> <I>(avl_tree *<VAR>tree</VAR>, const void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX73"></A>
+<DT><U>Function:</U> void ** <B>avlt_find</B> <I>(avlt_tree *<VAR>tree</VAR>, const void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX74"></A>
+<DT><U>Function:</U> void ** <B>avltr_find</B> <I>(avltr_tree *<VAR>tree</VAR>, const void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX75"></A>
+<DT><U>Function:</U> void * <B>rb_find</B> <I>(rb_tree *<VAR>tree</VAR>, const void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX76"></A>
+Searches <VAR>tree</VAR> for a node with data matching <VAR>data</VAR>, If found,
+returns the node's data (for threaded and right-threaded trees, a
+pointer to the node's data).  Otherwise, returns a null pointer.
+</DL>
+
+</P>
+<P>
+<DL>
+<DT><U>Function:</U> void * <B>avl_find_close</B> <I>(avl_tree *<VAR>tree</VAR>, const void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX77"></A>
+<DT><U>Function:</U> void ** <B>avlt_find_close</B> <I>(avlt_tree *<VAR>tree</VAR>, const void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX78"></A>
+<DT><U>Function:</U> void ** <B>avltr_find_close</B> <I>(avltr_tree *<VAR>tree</VAR>, const void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX79"></A>
+<DT><U>Function:</U> void * <B>rb_find_close</B> <I>(rb_tree *<VAR>tree</VAR>, const void *<VAR>data</VAR>)</I>
+<DD><A NAME="IDX80"></A>
+Searches <VAR>tree</VAR> for a node with data matching <VAR>data</VAR>.  If found,
+returns the node's data (for threaded and right-threaded trees, a
+pointer to the node's data).  If no matching item is found, then it
+finds a node whose data is "close" to <VAR>data</VAR>; either the node
+closest in value to <VAR>data</VAR>, or the node either before or after the
+node with the closest value.  Returns a null pointer if the tree does
+not contain any nodes.
+</DL>
+
+</P>
+
+
+<H1><A NAME="SEC8" HREF="avl.html#TOC8">Iteration</A></H1>
+
+<P>
+These functions allow the caller to iterate across the items in a tree.
+
+</P>
+<P>
+<DL>
+<DT><U>Function:</U> void <B>avl_walk</B> <I>(const avl_tree *<VAR>tree</VAR>, avl_node_func <VAR>operate</VAR>, void *<VAR>param</VAR>)</I>
+<DD><A NAME="IDX81"></A>
+<DT><U>Function:</U> void <B>avlt_walk</B> <I>(const avlt_tree *<VAR>tree</VAR>, avl_node_func <VAR>operate</VAR>, void *<VAR>param</VAR>)</I>
+<DD><A NAME="IDX82"></A>
+<DT><U>Function:</U> void <B>avltr_walk</B> <I>(const avltr_tree *<VAR>tree</VAR>, avl_node_func <VAR>operate</VAR>, void *<VAR>param</VAR>)</I>
+<DD><A NAME="IDX83"></A>
+<DT><U>Function:</U> void <B>rb_walk</B> <I>(const rb_tree *<VAR>tree</VAR>, avl_node_func <VAR>operate</VAR>, void *<VAR>param</VAR>)</I>
+<DD><A NAME="IDX84"></A>
+Walks through all the nodes in <VAR>tree</VAR>, and calls function
+<VAR>operate</VAR> for each node in inorder.  <VAR>param</VAR> overrides the value
+passed to <CODE>avl_create</CODE> (and family) for this operation only.
+<VAR>operate</VAR> must not change the key data in the nodes in a way that
+would reorder the data values or cause two values to become equal.
+</DL>
+
+</P>
+<P>
+<DL>
+<DT><U>Function:</U> void * <B>avl_traverse</B> <I>(const avl_tree *<VAR>tree</VAR>, avl_traverser *<VAR>trav</VAR>)</I>
+<DD><A NAME="IDX85"></A>
+<DT><U>Function:</U> void * <B>avlt_traverse</B> <I>(const avlt_tree *<VAR>tree</VAR>, avlt_traverser *<VAR>trav</VAR>)</I>
+<DD><A NAME="IDX86"></A>
+<DT><U>Function:</U> void * <B>avltr_traverse</B> <I>(const avltr_tree *<VAR>tree</VAR>, avltr_traverser *<VAR>trav</VAR>)</I>
+<DD><A NAME="IDX87"></A>
+<DT><U>Function:</U> void * <B>rb_traverse</B> <I>(const rb_tree *<VAR>tree</VAR>, rb_traverser *<VAR>trav</VAR>)</I>
+<DD><A NAME="IDX88"></A>
+Returns each of <VAR>tree</VAR>'s nodes' data values in sequence, then a null
+pointer to indicate the last item.  <VAR>trav</VAR> must be initialized
+before the first call, either in a declaration like that below, or using
+one of the functions below.
+
+</P>
+
+<PRE>
+avl_traverser trav = AVL_TRAVERSER_INIT;
+</PRE>
+
+<P>
+Each <CODE>avl_traverser</CODE> (and family) is a separate, independent
+iterator.
+
+</P>
+<P>
+For threaded and right-threaded trees, <CODE>avlt_next</CODE> or
+<CODE>avltr_next</CODE>, respectively, are faster and more memory-efficient
+than <CODE>avlt_traverse</CODE> or <CODE>avltr_traverse</CODE>.
+</DL>
+
+</P>
+<P>
+<DL>
+<DT><U>Function:</U> void * <B>avl_init_traverser</B> <I>(avl_traverser *<VAR>trav</VAR>)</I>
+<DD><A NAME="IDX89"></A>
+<DT><U>Function:</U> void * <B>avlt_init_traverser</B> <I>(avlt_traverser *<VAR>trav</VAR>)</I>
+<DD><A NAME="IDX90"></A>
+<DT><U>Function:</U> void * <B>avltr_init_traverser</B> <I>(avltr_traverser *<VAR>trav</VAR>)</I>
+<DD><A NAME="IDX91"></A>
+<DT><U>Function:</U> void * <B>rb_init_traverser</B> <I>(rb_traverser *<VAR>trav</VAR>)</I>
+<DD><A NAME="IDX92"></A>
+Initializes the specified tree traverser structure.  After this function
+is called, the next call to the corresponding <CODE>*_traverse</CODE> function
+will return the smallest value in the appropriate tree.
+</DL>
+
+</P>
+<P>
+<DL>
+<DT><U>Function:</U> void ** <B>avlt_next</B> <I>(const avlt_tree *<VAR>tree</VAR>, void **<VAR>data</VAR>)</I>
+<DD><A NAME="IDX93"></A>
+<DT><U>Function:</U> void ** <B>avltr_next</B> <I>(const avltr_tree *<VAR>tree</VAR>, void **<VAR>data</VAR>)</I>
+<DD><A NAME="IDX94"></A>
+<VAR>data</VAR> must be a null pointer or a pointer to a data item in AVL
+tree <VAR>tree</VAR>.  Returns a pointer to the next data item after
+<VAR>data</VAR> in <VAR>tree</VAR> in inorder (this is the first item if
+<VAR>data</VAR> is a null pointer), or a null pointer if <VAR>data</VAR> was the
+last item in <VAR>tree</VAR>.
+</DL>
+
+</P>
+<P>
+<DL>
+<DT><U>Function:</U> void ** <B>avltr_prev</B> <I>(const avltr_tree *<VAR>tree</VAR>, void **<VAR>data</VAR>)</I>
+<DD><A NAME="IDX95"></A>
+<VAR>data</VAR> must be a null pointer or a pointer to a data item in AVL
+tree <VAR>tree</VAR>.  Returns a pointer to the previous data item before
+<VAR>data</VAR> in <VAR>tree</VAR> in inorder (this is the last, or greatest
+valued, item if <VAR>data</VAR> is a null pointer), or a null pointer if
+<VAR>data</VAR> was the first item in <VAR>tree</VAR>.
+</DL>
+
+</P>
+
+
+<H1><A NAME="SEC9" HREF="avl.html#TOC9">Conversion</A></H1>
+
+<P>
+<DL>
+<DT><U>Function:</U> avlt_tree * <B>avlt_thread</B> <I>(avl_tree *<VAR>tree</VAR>)</I>
+<DD><A NAME="IDX96"></A>
+<DT><U>Function:</U> avltr_tree * <B>avltr_thread</B> <I>(avl_tree *<VAR>tree</VAR>)</I>
+<DD><A NAME="IDX97"></A>
+Adds symmetric threads or right threads, respectively, to unthreaded AVL
+tree <VAR>tree</VAR> and returns a pointer to <VAR>tree</VAR> cast to the
+appropriate type.  After one of these functions is called, threaded or
+right-threaded functions, as appropriate, must be used with <VAR>tree</VAR>;
+unthreaded functions may not be used.
+</DL>
+
+</P>
+<P>
+<DL>
+<DT><U>Function:</U> avl_tree * <B>avlt_unthread</B> <I>(avlt_tree *<VAR>tree</VAR>)</I>
+<DD><A NAME="IDX98"></A>
+<DT><U>Function:</U> avl_tree * <B>avltr_unthread</B> <I>(avltr_tree *<VAR>tree</VAR>)</I>
+<DD><A NAME="IDX99"></A>
+Cuts all threads in threaded or right-threaded, respectively, AVL tree
+<VAR>tree</VAR> and returns a pointer to <VAR>tree</VAR> cast to <CODE>avl_tree
+*</CODE>.  After one of these functions is called, unthreaded functions must
+be used with <VAR>tree</VAR>; threaded or right-threaded functions may not be
+used.
+</DL>
+
+</P>
+
+
+<H1><A NAME="SEC10" HREF="avl.html#TOC10">Author</A></H1>
+
+<P>
+<A NAME="IDX100"></A>
+<A NAME="IDX101"></A>
+<A NAME="IDX102"></A>
+<A NAME="IDX103"></A>
+libavl was written by Ben Pfaff <A HREF="mailto:blp@gnu.org"><TT>blp@gnu.org</TT></A>.
+
+</P>
+<P>
+libavl's generic tree algorithms and AVL algorithms are based on those
+found in Donald Knuth's venerable <CITE>Art of Computer Programming</CITE>
+series from Addison-Wesley, primarily Volumes 1 and 3.  libavl's
+red-black tree algorithms are based on those found in Cormen et al.,
+<CITE>Introduction to Algorithms</CITE>, 2nd ed., from MIT Press.
+
+</P>
+
+
+<H1><A NAME="SEC11" HREF="avl.html#TOC11">Index</A></H1>
+
+<P>
+<H2>a</H2>
+<DIR>
+<LI><A HREF="avl.html#IDX7">Adel'son-Velskii, G. M.</A>
+<LI><A HREF="avl.html#IDX103"><CITE>Art of Computer Programming</CITE></A>
+<LI><A HREF="avl.html#IDX101">author</A>
+<LI><A HREF="avl.html#IDX4">AVL tree</A>
+<LI><A HREF="avl.html#IDX20">avl_comparison_func</A>
+<LI><A HREF="avl.html#IDX40">avl_copy</A>, <A HREF="avl.html#IDX41">avl_copy</A>, <A HREF="avl.html#IDX42">avl_copy</A>
+<LI><A HREF="avl.html#IDX22">avl_copy_func</A>
+<LI><A HREF="avl.html#IDX44">avl_count</A>
+<LI><A HREF="avl.html#IDX28">avl_create</A>
+<LI><A HREF="avl.html#IDX65">avl_delete</A>
+<LI><A HREF="avl.html#IDX32">avl_destroy</A>
+<LI><A HREF="avl.html#IDX73">avl_find</A>
+<LI><A HREF="avl.html#IDX77">avl_find_close</A>
+<LI><A HREF="avl.html#IDX69">avl_force_delete</A>
+<LI><A HREF="avl.html#IDX57">avl_force_insert</A>
+<LI><A HREF="avl.html#IDX36">avl_free</A>
+<LI><A HREF="avl.html#IDX89">avl_init_traverser</A>
+<LI><A HREF="avl.html#IDX53">avl_insert</A>
+<LI><A HREF="avl.html#IDX23">AVL_MAX_HEIGHT</A>
+<LI><A HREF="avl.html#IDX12">avl_node</A>
+<LI><A HREF="avl.html#IDX21">avl_node_func</A>
+<LI><A HREF="avl.html#IDX49">avl_probe</A>
+<LI><A HREF="avl.html#IDX61">avl_replace</A>
+<LI><A HREF="avl.html#IDX85">avl_traverse</A>
+<LI><A HREF="avl.html#IDX16">avl_traverser</A>
+<LI><A HREF="avl.html#IDX8">avl_tree</A>
+<LI><A HREF="avl.html#IDX81">avl_walk</A>
+<LI><A HREF="avl.html#IDX45">avlt_count</A>
+<LI><A HREF="avl.html#IDX29">avlt_create</A>
+<LI><A HREF="avl.html#IDX66">avlt_delete</A>
+<LI><A HREF="avl.html#IDX33">avlt_destroy</A>
+<LI><A HREF="avl.html#IDX74">avlt_find</A>
+<LI><A HREF="avl.html#IDX78">avlt_find_close</A>
+<LI><A HREF="avl.html#IDX70">avlt_force_delete</A>
+<LI><A HREF="avl.html#IDX58">avlt_force_insert</A>
+<LI><A HREF="avl.html#IDX37">avlt_free</A>
+<LI><A HREF="avl.html#IDX90">avlt_init_traverser</A>
+<LI><A HREF="avl.html#IDX54">avlt_insert</A>
+<LI><A HREF="avl.html#IDX93">avlt_next</A>
+<LI><A HREF="avl.html#IDX13">avlt_node</A>
+<LI><A HREF="avl.html#IDX50">avlt_probe</A>
+<LI><A HREF="avl.html#IDX62">avlt_replace</A>
+<LI><A HREF="avl.html#IDX96">avlt_thread</A>
+<LI><A HREF="avl.html#IDX86">avlt_traverse</A>
+<LI><A HREF="avl.html#IDX17">avlt_traverser</A>
+<LI><A HREF="avl.html#IDX9">avlt_tree</A>
+<LI><A HREF="avl.html#IDX98">avlt_unthread</A>
+<LI><A HREF="avl.html#IDX82">avlt_walk</A>
+<LI><A HREF="avl.html#IDX46">avltr_count</A>
+<LI><A HREF="avl.html#IDX30">avltr_create</A>
+<LI><A HREF="avl.html#IDX67">avltr_delete</A>
+<LI><A HREF="avl.html#IDX34">avltr_destroy</A>
+<LI><A HREF="avl.html#IDX75">avltr_find</A>
+<LI><A HREF="avl.html#IDX79">avltr_find_close</A>
+<LI><A HREF="avl.html#IDX71">avltr_force_delete</A>
+<LI><A HREF="avl.html#IDX59">avltr_force_insert</A>
+<LI><A HREF="avl.html#IDX38">avltr_free</A>
+<LI><A HREF="avl.html#IDX91">avltr_init_traverser</A>
+<LI><A HREF="avl.html#IDX55">avltr_insert</A>
+<LI><A HREF="avl.html#IDX94">avltr_next</A>
+<LI><A HREF="avl.html#IDX14">avltr_node</A>
+<LI><A HREF="avl.html#IDX95">avltr_prev</A>
+<LI><A HREF="avl.html#IDX51">avltr_probe</A>
+<LI><A HREF="avl.html#IDX63">avltr_replace</A>
+<LI><A HREF="avl.html#IDX97">avltr_thread</A>
+<LI><A HREF="avl.html#IDX87">avltr_traverse</A>
+<LI><A HREF="avl.html#IDX18">avltr_traverser</A>
+<LI><A HREF="avl.html#IDX10">avltr_tree</A>
+<LI><A HREF="avl.html#IDX99">avltr_unthread</A>
+<LI><A HREF="avl.html#IDX83">avltr_walk</A>
+</DIR>
+<H2>b</H2>
+<DIR>
+<LI><A HREF="avl.html#IDX2">binary tree</A>
+</DIR>
+<H2>h</H2>
+<DIR>
+<LI><A HREF="avl.html#IDX1">hash table</A>
+</DIR>
+<H2>k</H2>
+<DIR>
+<LI><A HREF="avl.html#IDX102">Knuth, Donald Ervin</A>
+</DIR>
+<H2>l</H2>
+<DIR>
+<LI><A HREF="avl.html#IDX6">Landis, E. M.</A>
+</DIR>
+<H2>p</H2>
+<DIR>
+<LI><A HREF="avl.html#IDX100">Pfaff, Benjamin Levy</A>
+</DIR>
+<H2>r</H2>
+<DIR>
+<LI><A HREF="avl.html#IDX43">rb_copy</A>
+<LI><A HREF="avl.html#IDX47">rb_count</A>
+<LI><A HREF="avl.html#IDX31">rb_create</A>
+<LI><A HREF="avl.html#IDX68">rb_delete</A>
+<LI><A HREF="avl.html#IDX35">rb_destroy</A>
+<LI><A HREF="avl.html#IDX76">rb_find</A>
+<LI><A HREF="avl.html#IDX80">rb_find_close</A>
+<LI><A HREF="avl.html#IDX72">rb_force_delete</A>
+<LI><A HREF="avl.html#IDX60">rb_force_insert</A>
+<LI><A HREF="avl.html#IDX39">rb_free</A>
+<LI><A HREF="avl.html#IDX92">rb_init_traverser</A>
+<LI><A HREF="avl.html#IDX56">rb_insert</A>
+<LI><A HREF="avl.html#IDX24">RB_MAX_HEIGHT</A>
+<LI><A HREF="avl.html#IDX15">rb_node</A>
+<LI><A HREF="avl.html#IDX52">rb_probe</A>
+<LI><A HREF="avl.html#IDX64">rb_replace</A>
+<LI><A HREF="avl.html#IDX88">rb_traverse</A>
+<LI><A HREF="avl.html#IDX19">rb_traverser</A>
+<LI><A HREF="avl.html#IDX11">rb_tree</A>
+<LI><A HREF="avl.html#IDX84">rb_walk</A>
+<LI><A HREF="avl.html#IDX5">rebalancing</A>
+<LI><A HREF="avl.html#IDX3">red-black tree</A>
+<LI><A HREF="avl.html#IDX27">right threads</A>
+</DIR>
+<H2>t</H2>
+<DIR>
+<LI><A HREF="avl.html#IDX26">threads</A>
+</DIR>
+<H2>u</H2>
+<DIR>
+<LI><A HREF="avl.html#IDX25">unthreaded</A>
+</DIR>
+<H2>x</H2>
+<DIR>
+<LI><A HREF="avl.html#IDX48">xmalloc</A>
+</DIR>
+
+</P>
+<P><HR><P>
+<H1>Footnotes</H1>
+<H3><A NAME="FOOT1" HREF="avl.html#DOCF1">(1)</A></H3>
+<P>In tree traversal, <STRONG>inorder</STRONG> refers
+to visiting the nodes in their sorted order from smallest to largest.
+<H3><A NAME="FOOT2" HREF="avl.html#DOCF2">(2)</A></H3>
+<P>In general, you
+should build the sort of tree that you need to use, but occasionally it
+is useful to convert between tree types.
+<H3><A NAME="FOOT3" HREF="avl.html#DOCF3">(3)</A></H3>
+<P>It
+can be changed if this would not change the ordering of the nodes in the
+tree; i.e., if this would not cause the data in the node to be less than
+or equal to the previous node's data or greater than or equal to the
+next node's data.
+<P><HR><P>
+This document was generated on 6 October 1999 using the
+<A HREF="http://wwwcn.cern.ch/dci/texi2html/">texi2html</A>
+translator version 1.51a.</P>
+</BODY>
+</HTML>