1*b618a1eeSThomas Cort /* $NetBSD: internals.h,v 1.8 2001/06/13 10:45:59 wiz Exp $ */ 2*b618a1eeSThomas Cort 3*b618a1eeSThomas Cort /*- 4*b618a1eeSThomas Cort * Copyright (c) 1998-1999 Brett Lymn (blymn@baea.com.au, brett_lymn@yahoo.com.au) 5*b618a1eeSThomas Cort * All rights reserved. 6*b618a1eeSThomas Cort * 7*b618a1eeSThomas Cort * Redistribution and use in source and binary forms, with or without 8*b618a1eeSThomas Cort * modification, are permitted provided that the following conditions 9*b618a1eeSThomas Cort * are met: 10*b618a1eeSThomas Cort * 1. Redistributions of source code must retain the above copyright 11*b618a1eeSThomas Cort * notice, this list of conditions and the following disclaimer. 12*b618a1eeSThomas Cort * 2. The name of the author may not be used to endorse or promote products 13*b618a1eeSThomas Cort * derived from this software without specific prior written permission 14*b618a1eeSThomas Cort * 15*b618a1eeSThomas Cort * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 16*b618a1eeSThomas Cort * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 17*b618a1eeSThomas Cort * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 18*b618a1eeSThomas Cort * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 19*b618a1eeSThomas Cort * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 20*b618a1eeSThomas Cort * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 21*b618a1eeSThomas Cort * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 22*b618a1eeSThomas Cort * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 23*b618a1eeSThomas Cort * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 24*b618a1eeSThomas Cort * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 25*b618a1eeSThomas Cort * 26*b618a1eeSThomas Cort * 27*b618a1eeSThomas Cort */ 28*b618a1eeSThomas Cort 29*b618a1eeSThomas Cort #include <menu.h> 30*b618a1eeSThomas Cort 31*b618a1eeSThomas Cort #ifndef INTERNALS_H 32*b618a1eeSThomas Cort #define INTERNALS_H 33*b618a1eeSThomas Cort 34*b618a1eeSThomas Cort #define MATCH_FORWARD 1 35*b618a1eeSThomas Cort #define MATCH_REVERSE 2 36*b618a1eeSThomas Cort #define MATCH_NEXT_FORWARD 3 37*b618a1eeSThomas Cort #define MATCH_NEXT_REVERSE 4 38*b618a1eeSThomas Cort 39*b618a1eeSThomas Cort /* stole this from curses.h */ 40*b618a1eeSThomas Cort #define max(a,b) ((a) > (b) ? a : b) 41*b618a1eeSThomas Cort 42*b618a1eeSThomas Cort /* function prototypes */ 43*b618a1eeSThomas Cort 44*b618a1eeSThomas Cort void _menui_draw_item(MENU *menu, int item); 45*b618a1eeSThomas Cort int _menui_draw_menu(MENU *menu); 46*b618a1eeSThomas Cort int _menui_goto_item(MENU *menu, ITEM *item, int new_top_row); 47*b618a1eeSThomas Cort int _menui_match_pattern(MENU *menu, int c, int direction , 48*b618a1eeSThomas Cort int *item_matched); 49*b618a1eeSThomas Cort int _menui_match_items(MENU *menu, int direction, int *item_matched); 50*b618a1eeSThomas Cort void _menui_max_item_size(MENU *menu); 51*b618a1eeSThomas Cort int _menui_stitch_items(MENU *menu); 52*b618a1eeSThomas Cort 53*b618a1eeSThomas Cort #endif 54