!_TAG_FILE_FORMAT	2	/extended format; --format=1 will not append ;" to lines/
!_TAG_FILE_SORTED	1	/0=unsorted, 1=sorted, 2=foldcase/
!_TAG_PROGRAM_AUTHOR	Darren Hiebert	/dhiebert@users.sourceforge.net/
!_TAG_PROGRAM_NAME	Exuberant Ctags	//
!_TAG_PROGRAM_URL	http://ctags.sourceforge.net	/official site/
!_TAG_PROGRAM_VERSION	5.5.4	//
1	makefile	/^CFLAGS		+= $(READLINE:1=-DREADLINE)$/;"	m
1	makefile	/^LIBS		+= $(READLINE:1=-lreadline -lncurses)$/;"	m
AOUT	makefile	/^AOUT		= mathomatic$/;"	m
ARR_CNT	am.h	26;"	d
ARR_CNT	primes/matho-primes.c	55;"	d	file:
AUTHOR	doc/manpage.html	/^<a name="AUTHOR"><\/a>$/;"	a
BUFFER_SIZE	primes/matho-primes.c	60;"	d	file:
CONSTANT	am.h	/^	CONSTANT,$/;"	e	enum:kind_list
DEFAULT_N_TOKENS	am.h	66;"	d
DESCRIPTION	doc/manpage.html	/^<a name="DESCRIPTION"><\/a>$/;"	a
DIVIDE	am.h	107;"	d
DIVISOR_SIZE	am.h	68;"	d
DOCS	makefile	/^DOCS		= COPYING README.txt changes.txt$/;"	m
ENVIRONMENT	doc/manpage.html	/^<a name="ENVIRONMENT"><\/a>$/;"	a
FACTORIAL	am.h	110;"	d
FILES	doc/manpage.html	/^<a name="FILES"><\/a>$/;"	a
GENERAL	doc/manpage.html	/^<a name="GENERAL"><\/a>$/;"	a
HTML_PROMPT	am.h	45;"	d
IMAGINARY	am.h	96;"	d
INFINITY_NAME	parse.c	9;"	d	file:
MAN1	makefile	/^MAN1		= mathomatic.1$/;"	m
MANPAGES1	primes/makefile	/^MANPAGES1	= matho-primes.1 matho-pascal.1 matho-sumsq.1$/;"	m
MATCH_ANY	am.h	98;"	d
MAX_CMD_LEN	am.h	47;"	d
MAX_COMPARE_TERMS	simplify.c	9;"	d	file:
MAX_DIGITS	primes/matho-primes.c	344;"	d	file:
MAX_K_INTEGER	am.h	28;"	d
MAX_K_INTEGER	primes/matho-primes.c	57;"	d	file:
MAX_LINES	primes/matho-pascal.c	38;"	d	file:
MAX_PROMPT_LEN	am.h	48;"	d
MAX_RAISE_POWER	solve.c	9;"	d	file:
MAX_ROOT	complex.c	29;"	d	file:
MAX_SUBSCRIPT	am.h	79;"	d
MAX_VARS	am.h	73;"	d
MAX_VAR_LEN	am.h	71;"	d
MAX_VAR_NAMES	am.h	70;"	d
MINUS	am.h	105;"	d
MODULUS	am.h	108;"	d
MathSupport	fact/fact.java	/^public class MathSupport$/;"	c
NAME	doc/manpage.html	/^<a name="NAME"><\/a>$/;"	a
NEGATE	am.h	111;"	d
N_EQUATIONS	am.h	59;"	d
OBJECTS	makefile	/^OBJECTS		= main.o globals.o am.o solve.o help.o parse.o cmds.o simplify.o \\$/;"	m
OPERATOR	am.h	/^	OPERATOR$/;"	e	enum:kind_list
OPTIONS	doc/manpage.html	/^<a name="OPTIONS"><\/a>$/;"	a
OPT_MIN_SIZE	cmds.c	9;"	d	file:
P	help.c	384;"	d	file:
PLUS	am.h	104;"	d
POWER	am.h	109;"	d
PROMPT	am.h	44;"	d
RC_FILE	am.h	51;"	d
RC_FILE	am.h	53;"	d
REMAINDER_IS_ZERO	poly.c	13;"	d	file:
REPORTING BUGS	doc/manpage.html	/^<a name="REPORTING BUGS"><\/a>$/;"	a
SIGN	am.h	97;"	d
SILENT	am.h	11;"	d
STANDARD_SCREEN_COLUMNS	am.h	39;"	d
STANDARD_SCREEN_ROWS	am.h	40;"	d
SUBSCRIPT_MASK	am.h	78;"	d
SYNOPSIS	doc/manpage.html	/^<a name="SYNOPSIS"><\/a>$/;"	a
TARGETS	makefile	/^TARGETS		= $(AOUT) doc\/manpage.html$/;"	m
TARGETS	primes/makefile	/^TARGETS		= matho-primes matho-pascal matho-sumsq$/;"	m
TIMES	am.h	106;"	d
TIOCGWINSZ	main.c	40;"	d	file:
TMP_FILE	am.h	42;"	d
VALUE_CNT	poly.c	1710;"	d	file:
VARIABLE	am.h	/^	VARIABLE,$/;"	e	enum:kind_list
VAR_MASK	am.h	76;"	d
VAR_OFFSET	am.h	75;"	d
VAR_SHIFT	am.h	77;"	d
VERSION	makefile	/^VERSION		= `cat VERSION`$/;"	m
V_ANSWER	am.h	99;"	d
V_E	am.h	94;"	d
V_INTEGER	am.h	101;"	d
V_NULL	am.h	93;"	d
V_PI	am.h	95;"	d
V_TEMP	am.h	100;"	d
_	am.h	34;"	d
_	am.h	36;"	d
alarmhandler	main.c	/^alarmhandler(sig)$/;"	f
alloc_next_espace	am.c	/^alloc_next_espace()$/;"	f
always_positive	am.h	31;"	d
approximate_roots	globals.c	/^int		approximate_roots;	\/* true if in calculate command (force approximations) *\/$/;"	v
array	primes/matho-pascal.c	/^long double	*array[MAX_LINES];$/;"	v
autosolve	globals.c	/^int		autosolve = true;		\/* Allows solving by just typing the variable name at the prompt *\/$/;"	v
basic_size	poly.c	/^basic_size(p1, len)$/;"	f
big_fplus	factor.c	/^big_fplus(equation, level, diff_sign, sop1, op1, op2, i1, i2, b1, b2, ai, aj, i, j, e1, e2)$/;"	f	file:
binary_parenthesize	parse.c	/^binary_parenthesize(equation, n, i)$/;"	f
blt	am.h	30;"	d
bold_colors	globals.c	/^int		bold_colors;			\/* true for bold colors *\/$/;"	v
buffer_size	primes/matho-primes.c	/^int	buffer_size = BUFFER_SIZE;	\/* for variable size prime buffer *\/$/;"	v
calc	simplify.c	/^calc(op1p, k1p, op2, k2)$/;"	f	file:
calc_simp	simplify.c	/^calc_simp(equation, np)$/;"	f
calculate	doc/am.html	/^<a name="calculate"><\/a>$/;"	a
calculate_cmd	cmds.c	/^calculate_cmd(cp)$/;"	f
calculate_triangle	primes/matho-pascal.c	/^calculate_triangle()$/;"	f
carray	list.c	/^static int	carray[] = {$/;"	v	file:
case_sensitive_flag	globals.c	/^int		case_sensitive_flag = true;	\/* "set case_sensitive" flag *\/$/;"	v
cell_size	primes/matho-pascal.c	/^int		cell_size = 6;$/;"	v
center_buf	primes/matho-pascal.c	/^center_buf(int line_number, int cell_size)$/;"	f
centered	primes/matho-pascal.c	/^int		centered = true;$/;"	v
check_err	am.c	/^check_err()$/;"	f
clean_up	am.c	/^clean_up()$/;"	f
clear	doc/am.html	/^<a name="clear"><\/a>$/;"	a
clear_all	am.c	/^clear_all()$/;"	f
clear_cmd	cmds.c	/^clear_cmd(cp)$/;"	f
clear_sign_array	am.c	/^clear_sign_array()$/;"	f
code	doc/am.html	/^<a name="code"><\/a>$/;"	a
code_cmd	cmds.c	/^code_cmd(cp)$/;"	f
color_flag	globals.c	/^int		color_flag = true;		\/* true for color mode *\/$/;"	v
com_list	help.c	/^static com_type com_list[] = {$/;"	v	file:
com_type	help.c	/^} com_type;$/;"	t	file:
combine_constants	simplify.c	/^combine_constants(equation, np, iflag)$/;"	f
compare	doc/am.html	/^<a name="compare"><\/a>$/;"	a
compare_cmd	cmds.c	/^compare_cmd(cp)$/;"	f
compare_lhs	cmds.c	/^compare_lhs(i, j)$/;"	f	file:
compare_recurse	simplify.c	/^compare_recurse(p1, n1, l1, p2, n2, l2, diff_signp)$/;"	f	file:
compare_rhs	cmds.c	/^compare_rhs(i, j, diff_signp)$/;"	f	file:
complex_add	complex_lib.c	/^complex_add(a, b)$/;"	f
complex_div	complex_lib.c	/^complex_div(a, b)$/;"	f
complex_exp	complex_lib.c	/^complex_exp(a)$/;"	f
complex_fixup	complex_lib.c	/^complex_fixup(ap)$/;"	f
complex_func	cmds.c	/^complex_func(cp, imag_flag)$/;"	f	file:
complex_log	complex_lib.c	/^complex_log(a)$/;"	f
complex_mult	complex_lib.c	/^complex_mult(a, b)$/;"	f
complex_negate	complex_lib.c	/^complex_negate(a)$/;"	f
complex_pow	complex_lib.c	/^complex_pow(a, b)$/;"	f
complex_root_simp	complex.c	/^complex_root_simp(equation, np)$/;"	f
complexs	complex.h	/^typedef struct complexs {	\/* complex number structure *\/$/;"	s
complexs	complex.h	/^} complexs;$/;"	t
const_recurse	simplify.c	/^const_recurse(equation, np, loc, level, iflag)$/;"	f	file:
constant	am.h	/^	double	constant;	\/* internal storage for mathematical constants *\/$/;"	m
copy	doc/am.html	/^<a name="copy"><\/a>$/;"	a
copy_cmd	cmds.c	/^copy_cmd(cp)$/;"	f
count	am.h	/^	int	count;		\/* number of times the variable occurs *\/$/;"	m
cur_color	globals.c	/^int		cur_color = -1;			\/* current color *\/$/;"	v
cur_equation	globals.c	/^int		cur_equation;			\/* current equation space number (origin 0) *\/$/;"	v
cur_line	list.c	/^int	cur_line;	\/* current line *\/$/;"	v
cur_pos	list.c	/^int	cur_pos;	\/* current position in the current line on the screen *\/$/;"	v
current_not_defined	am.c	/^current_not_defined()$/;"	f
d_recurse	diff.c	/^d_recurse(equation, np, loc, level, v)$/;"	f	file:
debug_level	globals.c	/^int		debug_level;			\/* current debug level *\/$/;"	v
debug_string	am.h	129;"	d
debug_string	am.h	134;"	d
decstrtol	am.c	/^decstrtol(cp, cpp)$/;"	f
default_color	list.c	/^default_color()$/;"	f
derivative	doc/am.html	/^<a name="derivative"><\/a>$/;"	a
derivative_cmd	diff.c	/^derivative_cmd(cp)$/;"	f
differentiate	diff.c	/^differentiate(equation, np, v)$/;"	f
dir_path	globals.c	/^char		*dir_path;			\/* directory path to the executable *\/$/;"	v
dirname1	main.c	/^dirname1(cp)$/;"	f
display2d	globals.c	/^int		display2d = true;		\/* "set display2d" flag *\/$/;"	v
display_triangle	primes/matho-pascal.c	/^display_triangle()$/;"	f
display_unique	factor_int.c	/^display_unique()$/;"	f
div_imaginary	simplify.c	/^div_imaginary(equation, np)$/;"	f
div_remainder	poly.c	/^div_remainder(equation, np, poly_flag, quick_flag)$/;"	f
divide	doc/am.html	/^<a name="divide"><\/a>$/;"	a
divide_cmd	cmds.c	/^divide_cmd(cp)$/;"	f
divisor	poly.c	/^token_type	divisor[DIVISOR_SIZE];		\/* static data areas for polynomial and smart division *\/$/;"	v
do_gcd	poly.c	/^do_gcd(vp)$/;"	f	file:
domain_check	globals.c	/^int		domain_check;		\/* flag to track domain errors in the pow() function *\/$/;"	v
edit	doc/am.html	/^<a name="edit"><\/a>$/;"	a
edit_cmd	cmds.c	/^edit_cmd(cp)$/;"	f
edit_sub	cmds.c	/^edit_sub(cp)$/;"	f	file:
elim_factor	primes/matho-primes.c	/^elim_factor(long double arg)$/;"	f
elim_k	simplify.c	/^elim_k(equation, np)$/;"	f
elim_loop	simplify.c	/^elim_loop(equation, np)$/;"	f
elim_sign	simplify.c	/^elim_sign(equation, np)$/;"	f
elim_sub	cmds.c	/^elim_sub(i, v)$/;"	f	file:
eliminate	doc/am.html	/^<a name="eliminate"><\/a>$/;"	a
eliminate_cmd	cmds.c	/^eliminate_cmd(cp)$/;"	f
end_value	primes/matho-primes.c	/^long double start_value, number, end_value;$/;"	v
epsilon	complex_lib.c	14;"	d	file:
epsilon	globals.c	/^double		epsilon		= 0.00000000000005;	\/* for larger accumulated round-off errors *\/$/;"	v
error	am.h	126;"	d
error	am.h	131;"	d
error_huge	am.c	/^error_huge()$/;"	f
error_str	globals.c	/^char		*error_str;		\/* last error when SILENT is defined *\/$/;"	v
exit_program	main.c	/^exit_program(exit_value)$/;"	f
exp_contains_infinity	am.c	/^exp_contains_infinity(p1, n1)$/;"	f
extra_garbage	am.c	/^extra_garbage(cp)$/;"	f
extrema	doc/am.html	/^<a name="extrema"><\/a>$/;"	a
extrema_cmd	diff.c	/^extrema_cmd(cp)$/;"	f
f_to_fraction	gcd.c	/^f_to_fraction(d, numeratorp, denominatorp)$/;"	f
fact	fact/fact.c	/^fact(arg)$/;"	f
fact	fact/fact.java	/^	public static double fact(double x)$/;"	m	class:MathSupport
fact	fact/fact.java	/^	public static double fact(int x)$/;"	m	class:MathSupport
fact	fact/fact.py	/^def fact(x):$/;"	f
fact	fact/intfact.c	/^fact(arg)$/;"	f
factor	doc/am.html	/^<a name="factor"><\/a>$/;"	a
factor_cmd	cmds.c	/^factor_cmd(cp)$/;"	f
factor_constants	factor_int.c	/^factor_constants(equation, np, level_code)$/;"	f
factor_divide	factor.c	/^factor_divide(equation, np, v, d)$/;"	f
factor_int	factor_int.c	/^factor_int(equation, np)$/;"	f
factor_int_flag	globals.c	/^int		factor_int_flag;		\/* factor integers when displaying expressions *\/$/;"	v
factor_int_sub	factor_int.c	/^factor_int_sub(n)$/;"	f
factor_one	factor_int.c	/^factor_one(start)$/;"	f
factor_plus	factor.c	/^factor_plus(equation, np, v, d)$/;"	f
factor_power	factor.c	/^factor_power(equation, np)$/;"	f
factor_times	factor.c	/^factor_times(equation, np)$/;"	f
factorv	simplify.c	/^factorv(equation, np, v)$/;"	f
false	am.h	8;"	d
false	complex_lib.c	12;"	d	file:
false	primes/matho-pascal.c	36;"	d	file:
false	primes/matho-primes.c	45;"	d	file:
false	primes/matho-sumsq.c	39;"	d	file:
fc_recurse	factor_int.c	/^fc_recurse(equation, np, loc, level, level_code)$/;"	f	file:
finance_option	globals.c	/^int		finance_option;			\/* for displaying dollars and cents *\/$/;"	v
find_greatest_power	poly.c	/^find_greatest_power(p1, n1, vp1, pp1, tp1, lentp1, dcodep)$/;"	f
find_highest_count	poly.c	/^find_highest_count(p1, n1, p2, n2, vp1)$/;"	f
find_more	cmds.c	/^find_more(equation, np, en)$/;"	f	file:
findsq	primes/matho-sumsq.c	/^findsq(long d1)$/;"	f
flip	solve.c	/^flip(side1p, side1np, side2p, side2np)$/;"	f	file:
flist	doc/am.html	/^<a name="flist"><\/a>$/;"	a
flist	list.c	/^flist(equation, n, out_flag, pos, highp, lowp)$/;"	f	file:
flist_cmd	cmds.c	/^flist_cmd(cp)$/;"	f
flist_recurse	list.c	/^flist_recurse(equation, n, out_flag, line, pos, cur_level, highp, lowp)$/;"	f	file:
flist_sub	list.c	/^flist_sub(n)$/;"	f
found_var	am.c	/^found_var(equation, n, v)$/;"	f
fphandler	lib/lib.c	/^fphandler(int sig)$/;"	f
fphandler	main.c	/^fphandler(sig)$/;"	f
fplus_recurse	factor.c	/^fplus_recurse(equation, np, loc, level, v, d, whole_flag, div_only)$/;"	f	file:
fplus_sub	factor.c	/^fplus_sub(equation, np, loc, i1, n1, i2, n2, level, v, d, whole_flag, div_only)$/;"	f	file:
fpower_recurse	factor.c	/^fpower_recurse(equation, np, loc, level)$/;"	f	file:
fpower_sub	factor.c	/^fpower_sub(equation, np, loc, i1, n1, i2, n2, level)$/;"	f	file:
frac_side	simplify.c	/^frac_side(equation, np)$/;"	f
fraction	doc/am.html	/^<a name="fraction"><\/a>$/;"	a
fraction_cmd	cmds.c	/^fraction_cmd(cp)$/;"	f
ftimes_recurse	factor.c	/^ftimes_recurse(equation, np, loc, level)$/;"	f	file:
ftimes_sub	factor.c	/^ftimes_sub(equation, np, loc, i1, n1, i2, n2, level)$/;"	f	file:
func	help.c	/^	int	(*func)();		\/* function that handles this command *\/$/;"	m	file:
g_of_f	solve.c	/^g_of_f(op, operandp, side1p, side1np, side2p, side2np)$/;"	f	file:
gcd	gcd.c	/^gcd(d1, d2)$/;"	f
gcd_divisor	poly.c	/^token_type	gcd_divisor[DIVISOR_SIZE];	\/* static data area for polynomial GCD routine *\/$/;"	v
generate_primes	primes/matho-primes.c	/^generate_primes()$/;"	f
get_constant	complex.c	/^get_constant(equation, n, dp)$/;"	f
get_default_en	am.c	/^get_default_en(cp)$/;"	f
get_expr	am.c	/^get_expr(equation, np)$/;"	f
get_long_double_int	primes/matho-primes.c	/^get_long_double_int(char *cp, long double *dp)$/;"	f
get_range	am.c	/^get_range(cpp, ip, jp)$/;"	f
get_range_eol	am.c	/^get_range_eol(cpp, ip, jp)$/;"	f
get_string	am.c	/^get_string(string, n)$/;"	f
get_term	poly.c	/^get_term(p1, n1, count, tp1, lentp1)$/;"	f
get_yes_no	am.c	/^get_yes_no()$/;"	f
gfp	globals.c	/^FILE		*gfp;			\/* global output file pointer *\/$/;"	v
group_proc	super.c	/^group_proc(equation, np)$/;"	f
group_recurse	super.c	/^group_recurse(equation, np, loc, level)$/;"	f	file:
group_sub	super.c	/^group_sub(n)$/;"	f
handle_negate	parse.c	/^handle_negate(equation, np)$/;"	f
help	doc/am.html	/^<a name="help"><\/a>$/;"	a
help_cmd	help.c	/^help_cmd(cp)$/;"	f
high_prec	globals.c	/^int		high_prec;		\/* flag to output constants in higher precision (used when saving equations) *\/$/;"	v
html_carray	list.c	/^static char	*html_carray[] = {$/;"	v	file:
html_flag	globals.c	/^int		html_flag;		\/* true for HTML mode *\/$/;"	v
im	complex.h	/^	double	im;		\/* imaginary part *\/$/;"	m	struct:complexs
imaginary	doc/am.html	/^<a name="imaginary"><\/a>$/;"	a
imaginary_cmd	cmds.c	/^imaginary_cmd(cp)$/;"	f
increase	solve.c	/^increase(d, v)$/;"	f	file:
info	help.c	/^	char	*info;			\/* one line description of command *\/$/;"	m	file:
init_gvars	am.c	/^init_gvars()$/;"	f
init_mem	am.c	/^init_mem()$/;"	f
input_column	globals.c	/^int		input_column;		\/* current column number on the screen at the beginning of a parse *\/$/;"	v
int_dispatch	integrate.c	/^int_dispatch(equation, np, v, func)$/;"	f
int_expr	list.c	/^int_expr(equation, n)$/;"	f
integer_root_simp	simplify.c	/^integer_root_simp(equation, np)$/;"	f
integrate	doc/am.html	/^<a name="integrate"><\/a>$/;"	a
integrate_cmd	integrate.c	/^integrate_cmd(cp)$/;"	f
integrate_order	integrate.c	/^static double	integrate_order;	\/* global order of integration *\/$/;"	v	file:
integrate_sub	integrate.c	/^integrate_sub(equation, np, loc, eloc, v)$/;"	f	file:
inthandler	main.c	/^inthandler(sig)$/;"	f
introduction	doc/am.html	/^<a name="introduction"><\/a>$/;"	a
inv_laplace_sub	integrate.c	/^inv_laplace_sub(equation, np, loc, eloc, v)$/;"	f	file:
is_all	am.c	/^is_all(cp)$/;"	f
is_integer_expr	poly.c	/^is_integer_expr(equation, n)$/;"	f
is_no	cmds.c	/^is_no(cp)$/;"	f
isfinite	am.h	23;"	d
isvarchar	parse.c	/^isvarchar(ch)$/;"	f	file:
jmp_save	globals.c	/^jmp_buf		jmp_save;		\/* for setjmp() when an error is encountered *\/$/;"	v
kind	am.h	/^	enum kind_list	kind;	\/* kind of token *\/$/;"	m
kind_list	am.h	/^enum kind_list {		\/* kinds of tokens specified in the union below *\/$/;"	g
laplace	doc/am.html	/^<a name="laplace"><\/a>$/;"	a
laplace_cmd	integrate.c	/^laplace_cmd(cp)$/;"	f
laplace_sub	integrate.c	/^laplace_sub(equation, np, loc, eloc, v)$/;"	f	file:
last_prime	primes/matho-primes.c	/^long double	last_prime = -3.0;$/;"	v
last_temp_var	cmds.c	/^static int	last_temp_var = 0;$/;"	v	file:
len_d	poly.c	/^int		len_d;				\/* length of expression in gcd_divisor[] *\/$/;"	v
level	am.h	/^	int		level;	\/* level of parentheses, origin 1 *\/$/;"	m
level1_plus_count	am.c	/^level1_plus_count(p1, n1)$/;"	f
level_plus_count	am.c	/^level_plus_count(p1, n1, level)$/;"	f
lhs	globals.c	/^token_type	*lhs[N_EQUATIONS];		\/* The Left Hand Sides of equation spaces *\/$/;"	v
limit	doc/am.html	/^<a name="limit"><\/a>$/;"	a
limit_cmd	diff.c	/^limit_cmd(cp)$/;"	f
line_buf	primes/matho-pascal.c	/^char		line_buf[1000];$/;"	v
lines	primes/matho-pascal.c	/^int		lines = 26;$/;"	v
list	doc/am.html	/^<a name="list"><\/a>$/;"	a
list1_sub	list.c	/^list1_sub(n, export_flag)$/;"	f
list_c_equation	list.c	/^list_c_equation(en, language, int_flag)$/;"	f
list_cmd	cmds.c	/^list_cmd(cp)$/;"	f
list_code	list.c	/^list_code(equation, np, language, int_flag)$/;"	f
list_debug	list.c	/^list_debug(level, p1, n1, p2, n2)$/;"	f
list_equation	list.c	/^list_equation(n, export_flag)$/;"	f
list_expression	list.c	/^list_expression(equation, n, export_flag)$/;"	f
list_proc	list.c	/^list_proc(equation, n, export_flag)$/;"	f
list_string_sub	list.c	/^list_string_sub(equation, n, string, export_flag)$/;"	f
list_sub	list.c	/^list_sub(n)$/;"	f
list_tdebug	am.h	127;"	d
list_tdebug	am.h	132;"	d
list_var	list.c	/^list_var(v, lang_code)$/;"	f
load_rc	main.c	/^load_rc()$/;"	f
lsqrt	primes/lsqrt.c	/^lsqrt(long y)$/;"	f
main	lib/test.c	/^main(int argc, char **argv)$/;"	f
main	main.c	/^main(argc, argv)$/;"	f
main	primes/matho-pascal.c	/^main(int argc, char *argv[])$/;"	f
main	primes/matho-primes.c	/^main(int argc, char *argv[])$/;"	f
main	primes/matho-sumsq.c	/^main(int argc, char *argv[])$/;"	f
make_fractions	gcd.c	/^make_fractions(equation, np)$/;"	f
make_powers	integrate.c	/^make_powers(equation, np, v)$/;"	f
matho_init	lib/lib.c	/^matho_init()$/;"	f
matho_parse	lib/lib.c	/^matho_parse(char *input, char **outputp)$/;"	f
matho_process	lib/lib.c	/^matho_process(char *input, char **outputp)$/;"	f
max	am.h	15;"	d
max	primes/matho-primes.c	48;"	d	file:
min	am.h	19;"	d
min	primes/matho-primes.c	52;"	d	file:
min_level	am.c	/^min_level(equation, n)$/;"	f
mod_recurse	poly.c	/^mod_recurse(equation, np, loc, level)$/;"	f	file:
mod_simp	poly.c	/^mod_simp(equation, np)$/;"	f
multiply_out_unique	factor_int.c	/^multiply_out_unique()$/;"	f
my_round	gcd.c	/^my_round(d1)$/;"	f
my_strlcpy	parse.c	/^my_strlcpy(dest, src, n)$/;"	f
n_divisor	poly.c	/^int		n_divisor;$/;"	v
n_equations	globals.c	/^int		n_equations;			\/* number of equation spaces allocated *\/$/;"	v
n_lhs	globals.c	/^int		n_lhs[N_EQUATIONS];		\/* number of tokens in each lhs[] *\/$/;"	v
n_quotient	poly.c	/^int		n_quotient;$/;"	v
n_rhs	globals.c	/^int		n_rhs[N_EQUATIONS];		\/* number of tokens in each rhs[] *\/$/;"	v
n_tlhs	globals.c	/^int		n_tlhs;				\/* number of tokens in tlhs *\/$/;"	v
n_tokens	globals.c	/^int		n_tokens = DEFAULT_N_TOKENS;	\/* maximum size of expressions *\/$/;"	v
n_trhs	globals.c	/^int		n_trhs;				\/* number of tokens in trhs *\/$/;"	v
name	help.c	/^	char	*name;			\/* command name to be typed by user *\/$/;"	m	file:
next_espace	am.c	/^next_espace()$/;"	f
next_sign	am.c	/^next_sign(vp)$/;"	f
nintegrate	doc/am.html	/^<a name="nintegrate"><\/a>$/;"	a
nintegrate_cmd	integrate.c	/^nintegrate_cmd(cp)$/;"	f
nn	factor_int.c	/^static double nn, vv;$/;"	v	file:
no_divide	unfactor.c	/^no_divide(equation, np)$/;"	f	file:
no_vars	am.c	/^no_vars(source, n, vp)$/;"	f
not_defined	am.c	/^not_defined(i)$/;"	f
number	primes/matho-primes.c	/^long double start_value, number, end_value;$/;"	v
one_token	globals.c	/^token_type	one_token;			\/* the constant 1.0 as a token *\/$/;"	v
operatr	am.h	/^	int	operatr;	\/* internal storage for mathematical operators *\/$/;"	m
opt_en	cmds.c	/^static int	opt_en[N_EQUATIONS];$/;"	v	file:
opt_es	cmds.c	/^opt_es(equation, np)$/;"	f	file:
optimize	doc/am.html	/^<a name="optimize"><\/a>$/;"	a
optimize_cmd	cmds.c	/^optimize_cmd(cp)$/;"	f
order_recurse	simplify.c	/^order_recurse(equation, np, loc, level)$/;"	f	file:
org_recurse	simplify.c	/^org_recurse(equation, np, loc, level, elocp)$/;"	f	file:
org_up_level	simplify.c	/^org_up_level(bp, ep, level, invert)$/;"	f	file:
organize	simplify.c	/^organize(equation, np)$/;"	f
output_options	cmds.c	/^output_options()$/;"	f
pal_base	primes/matho-primes.c	/^long double	pal_base = 10;$/;"	v
pal_flag	primes/matho-primes.c	/^int		pal_flag, twin_flag;$/;"	v
parse	help.c	/^parse(n, cp)$/;"	f
parse_complex	complex.c	/^parse_complex(equation, n, cp)$/;"	f
parse_equation	parse.c	/^parse_equation(n, cp)$/;"	f
parse_expr	am.c	/^parse_expr(equation, np, cp)$/;"	f
parse_section	parse.c	/^parse_section(equation, np, cp)$/;"	f
parse_var	parse.c	/^parse_var(vp, cp)$/;"	f
parse_var2	help.c	/^parse_var2(vp, cp)$/;"	f
partial_flag	globals.c	/^int		partial_flag;		\/* true for partial unfactoring of algebraic fractions *\/$/;"	v
patch_root_div	unfactor.c	/^patch_root_div(equation, np)$/;"	f
pause	doc/am.html	/^<a name="pause"><\/a>$/;"	a
pause_cmd	cmds.c	/^pause_cmd(cp)$/;"	f
pdiv_recurse	poly.c	/^pdiv_recurse(equation, np, loc, level, code)$/;"	f	file:
pf_recurse	poly.c	/^pf_recurse(equation, np, loc, level)$/;"	f	file:
pf_sub	poly.c	/^pf_sub(equation, np, loc, len, level)$/;"	f	file:
point_flag	parse.c	/^int	point_flag;		\/* point to location of parse error if true *\/$/;"	v
poly2_gcd	poly.c	/^poly2_gcd(larger, llen, smaller, slen, v)$/;"	f
poly_div	poly.c	/^poly_div(d1, len1, d2, len2, vp)$/;"	f
poly_div_sub	poly.c	/^poly_div_sub(d1, len1, d2, len2, vp)$/;"	f	file:
poly_factor	poly.c	/^poly_factor(equation, np)$/;"	f
poly_gcd	poly.c	/^poly_gcd(larger, llen, smaller, slen, v)$/;"	f
poly_gcd_simp	poly.c	/^poly_gcd_simp(equation, np)$/;"	f
poly_in_v	poly.c	/^poly_in_v(equation, n, v, allow_divides)$/;"	f
poly_in_v_sub	poly.c	/^poly_in_v_sub(equation, n, v, allow_divides)$/;"	f	file:
polydiv_recurse	poly.c	/^polydiv_recurse(equation, np, loc, level)$/;"	f	file:
preserve_roots	globals.c	/^int		preserve_roots = true;		\/* set option to preserve 2^.5, etc. *\/$/;"	v
prime	primes/matho-primes.c	/^char	*prime;				\/* the boolean sieve array for the current window of numbers *\/$/;"	v
prior_sub	parse.c	/^prior_sub(equation, np)$/;"	f
process	help.c	/^process(cp)$/;"	f
process_parse	help.c	/^process_parse(n, cp)$/;"	f
product	doc/am.html	/^<a name="product"><\/a>$/;"	a
product_cmd	cmds.c	/^product_cmd(cp)$/;"	f
prog_name	globals.c	/^char		*prog_name = "mathomatic";	\/* name of this program *\/$/;"	v
prog_name	primes/matho-pascal.c	/^char		*prog_name = "matho-pascal";$/;"	v
prog_name	primes/matho-primes.c	/^char	*prog_name = "matho-primes";$/;"	v
prompt_str	globals.c	/^char		prompt_str[MAX_PROMPT_LEN];	\/* temp storage for prompt strings *\/$/;"	v
prompt_var	am.c	/^prompt_var(vp)$/;"	f
push	doc/am.html	/^<a name="push"><\/a>$/;"	a
push_cmd	cmds.c	/^push_cmd(cp)$/;"	f
push_en	cmds.c	/^push_en(en)$/;"	f
put_up_arrow	parse.c	/^put_up_arrow(cnt, cp)$/;"	f
quad_solve	solve.c	/^quad_solve(v)$/;"	f	file:
quiet_mode	globals.c	/^int		quiet_mode;		\/* quiet mode (don't display prompts) *\/$/;"	v
quit	doc/am.html	/^<a name="quit"><\/a>$/;"	a
quit_cmd	cmds.c	/^quit_cmd(cp)$/;"	f
quotient	poly.c	/^token_type	quotient[DIVISOR_SIZE];$/;"	v
rationalize	simplify.c	/^rationalize(equation, np)$/;"	f
re	complex.h	/^	double	re;		\/* real part *\/$/;"	m	struct:complexs
read	doc/am.html	/^<a name="read"><\/a>$/;"	a
read_cmd	cmds.c	/^read_cmd(cp)$/;"	f
real	doc/am.html	/^<a name="real"><\/a>$/;"	a
real_cmd	cmds.c	/^real_cmd(cp)$/;"	f
rect_to_polar	complex.c	/^rect_to_polar(x, y, radiusp, thetap)$/;"	f
remove_factors	poly.c	/^remove_factors()$/;"	f
reorder	simplify.c	/^reorder(equation, np)$/;"	f
repeat_count	solve.c	/^static int	repeat_count;$/;"	v	file:
replace	doc/am.html	/^<a name="replace"><\/a>$/;"	a
replace_cmd	cmds.c	/^replace_cmd(cp)$/;"	f
reset_attr	list.c	/^reset_attr()$/;"	f
resizehandler	main.c	/^resizehandler(sig)$/;"	f
result_str	globals.c	/^char		*result_str;		\/* returned result when using as library *\/$/;"	v
return_result	am.c	/^return_result(en)$/;"	f
rhs	globals.c	/^token_type	*rhs[N_EQUATIONS];		\/* The Right Hand Sides of equation spaces *\/$/;"	v
roots	doc/am.html	/^<a name="roots"><\/a>$/;"	a
roots_cmd	complex.c	/^roots_cmd(cp)$/;"	f
save	doc/am.html	/^<a name="save"><\/a>$/;"	a
save_cmd	cmds.c	/^save_cmd(cp)$/;"	f
save_factors	poly.c	/^save_factors(equation, np, loc1, len, level)$/;"	f	file:
scratch	globals.c	/^token_type	*scratch;			\/* very temporary storage for expressions *\/$/;"	v
screen_columns	globals.c	/^int		screen_columns = STANDARD_SCREEN_COLUMNS;	\/* screen width *\/$/;"	v
screen_columns	primes/matho-pascal.c	/^int		screen_columns = 80;$/;"	v
screen_rows	globals.c	/^int		screen_rows = STANDARD_SCREEN_ROWS;		\/* screen height *\/$/;"	v
se_compare	simplify.c	/^se_compare(p1, n1, p2, n2, diff_signp)$/;"	f
secondary_name	help.c	/^	char	*secondary_name;	\/* another name for this command *\/$/;"	m	file:
selecting	doc/am.html	/^<a name="selecting"><\/a>$/;"	a
set	doc/am.html	/^<a name="set"><\/a>$/;"	a
set_cmd	cmds.c	/^set_cmd(cp)$/;"	f
set_color	list.c	/^set_color(color)$/;"	f
set_error_level	parse.c	/^set_error_level(cp)$/;"	f
set_options	cmds.c	/^set_options(cp)$/;"	f
set_sign_array	am.c	/^set_sign_array()$/;"	f
set_signals	main.c	/^set_signals()$/;"	f	file:
sf_recurse	super.c	/^sf_recurse(equation, np, loc, level, start_flag)$/;"	f	file:
sf_sub	super.c	/^sf_sub(equation, np, loc, i1, n1, i2, n2, level, check_flag)$/;"	f	file:
shell_out	help.c	/^shell_out(cp)$/;"	f
side_debug	am.h	128;"	d
side_debug	am.h	133;"	d
sign_array	globals.c	/^sign_array_type	sign_array;		\/* for keeping track of unique "sign" variables *\/$/;"	v
sign_array_type	am.h	/^typedef	char	sign_array_type[MAX_SUBSCRIPT+2];$/;"	t
sign_flag	globals.c	/^int		sign_flag;		\/* true when all "sign" variables are to compare equal *\/$/;"	v
simp2_divide	simplify.c	/^simp2_divide(equation, np, v, fc_level)$/;"	f
simp2_power	simplify.c	/^simp2_power(equation, np)$/;"	f
simp_constant_power	simplify.c	/^simp_constant_power(equation, np)$/;"	f
simp_divide	simplify.c	/^simp_divide(equation, np)$/;"	f
simp_i	simplify.c	/^simp_i(equation, np)$/;"	f
simp_loop	simplify.c	/^simp_loop(equation, np)$/;"	f
simp_pp	simplify.c	/^simp_pp(equation, np)$/;"	f
simp_side	simplify.c	/^simp_side(equation, np)$/;"	f
simp_ssub	simplify.c	/^simp_ssub(equation, np, v, d, power_flag, times_flag, fc_level)$/;"	f
simp_sub	simplify.c	/^simp_sub(n)$/;"	f
simpa_side	simplify.c	/^simpa_side(equation, np, quick_flag)$/;"	f
simpb_side	simplify.c	/^simpb_side(equation, np, power_flag, fc_level)$/;"	f
simplify	doc/am.html	/^<a name="simplify"><\/a>$/;"	a
simplify_cmd	cmds.c	/^simplify_cmd(cp)$/;"	f
simps_side	simplify.c	/^simps_side(equation, np, zsolve)$/;"	f
simpv_side	simplify.c	/^simpv_side(equation, np, v)$/;"	f
skip_param	am.c	/^skip_param(cp)$/;"	f
skip_space	am.c	/^skip_space(cp)$/;"	f
small_epsilon	globals.c	/^double		small_epsilon	= 0.000000000000005;	\/* for small round-off errors *\/$/;"	v
smart_div	poly.c	/^smart_div(d1, len1, d2, len2)$/;"	f
solve	doc/am.html	/^<a name="solve"><\/a>$/;"	a
solve	solve.c	/^solve(want, have)$/;"	f
solve_cmd	cmds.c	/^solve_cmd(cp)$/;"	f
solve_sub	solve.c	/^solve_sub(wantp, wantn, leftp, leftnp, rightp, rightnp)$/;"	f
solved_equation	am.c	/^solved_equation(i)$/;"	f
solving	doc/am.html	/^<a name="solving"><\/a>$/;"	a
sort_type	am.h	/^} sort_type;$/;"	t
sp2_sub	simplify.c	/^sp2_sub(equation, np, i)$/;"	f	file:
sp_sub	simplify.c	/^sp_sub(equation, np, i)$/;"	f	file:
sq	factor_int.c	/^static double sq[] = {		\/* Additive array that skips over multiples of 2, 3, 5, and 7. *\/$/;"	v	file:
sq	primes/matho-primes.c	/^long double sq[] = {			\/* Additive array that skips over multiples of 2, 3, 5, and 7. *\/$/;"	v
squares	primes/matho-sumsq.c	/^long	squares[4];$/;"	v
start_value	primes/matho-primes.c	/^long double start_value, number, end_value;$/;"	v
storage_type	am.h	/^} storage_type;$/;"	t
str_tolower	parse.c	/^str_tolower(cp)$/;"	f
strcmp_tospace	am.c	/^strcmp_tospace(cp1, cp2)$/;"	f
sub_ufactor	unfactor.c	/^sub_ufactor(equation, np, ii)$/;"	f
subst_constants	parse.c	/^subst_constants(equation, np)$/;"	f
subst_var_with_exp	am.c	/^subst_var_with_exp(equation, np, expression, len, v)$/;"	f
subtract_itself	factor.c	/^subtract_itself(equation, np)$/;"	f
sum	doc/am.html	/^<a name="sum"><\/a>$/;"	a
sum_cmd	cmds.c	/^sum_cmd(cp)$/;"	f
sum_product	cmds.c	/^sum_product(cp, product_flag)$/;"	f	file:
sumsq	primes/matho-sumsq.c	/^sumsq(long d1, int n)$/;"	f
super_factor	super.c	/^super_factor(equation, np, start_flag)$/;"	f
swap	simplify.c	/^swap(equation, np, level, i1, i2)$/;"	f	file:
symb_flag	globals.c	/^int		symb_flag;		\/* true for "simplify symbolic" *\/$/;"	v
tally	doc/am.html	/^<a name="tally"><\/a>$/;"	a
tally_cmd	cmds.c	/^tally_cmd(cp)$/;"	f
taylor	doc/am.html	/^<a name="taylor"><\/a>$/;"	a
taylor_cmd	diff.c	/^taylor_cmd(cp)$/;"	f
term_value	poly.c	/^term_value(dp, p1, n1, loc)$/;"	f
test_mode	globals.c	/^int		test_mode;		\/* test mode flag (-t) *\/$/;"	v
test_pal	primes/matho-primes.c	/^test_pal(long double d, long double base)$/;"	f
tlhs	globals.c	/^token_type	*tlhs;				\/* LHS during solve and temporary storage for expressions *\/$/;"	v
token	am.h	/^	storage_type	token;	\/* the actual token *\/$/;"	m
token_type	am.h	/^} token_type;$/;"	t
trhs	globals.c	/^token_type	*trhs;				\/* RHS during solve and temporary storage for expressions *\/$/;"	v
true	am.h	7;"	d
true	complex_lib.c	11;"	d	file:
true	primes/matho-pascal.c	35;"	d	file:
true	primes/matho-primes.c	44;"	d	file:
true	primes/matho-sumsq.c	38;"	d	file:
true_modulus	globals.c	/^int		true_modulus;			\/* true for mathematically correct modulus *\/$/;"	v
try_factor	factor_int.c	/^try_factor(arg)$/;"	f	file:
twin_flag	primes/matho-primes.c	/^int		pal_flag, twin_flag;$/;"	v
ucnt	globals.c	/^int		ucnt[64];		\/* number of times the factor occurs *\/$/;"	v
uf_allpower	unfactor.c	/^uf_allpower(equation, np)$/;"	f
uf_neg_help	unfactor.c	/^uf_neg_help(equation, np)$/;"	f
uf_power	unfactor.c	/^uf_power(equation, np)$/;"	f
uf_pplus	unfactor.c	/^uf_pplus(equation, np)$/;"	f
uf_repeat	unfactor.c	/^uf_repeat(equation, np)$/;"	f
uf_repeat_always	unfactor.c	/^uf_repeat_always(equation, np)$/;"	f
uf_simp	unfactor.c	/^uf_simp(equation, np)$/;"	f
uf_simp_no_repeat	unfactor.c	/^uf_simp_no_repeat(equation, np)$/;"	f
uf_times	unfactor.c	/^uf_times(equation, np)$/;"	f
uf_tsimp	unfactor.c	/^uf_tsimp(equation, np)$/;"	f
ufactor	unfactor.c	/^ufactor(equation, np)$/;"	f
unf_sub	unfactor.c	/^unf_sub(equation, np, b1, loc, e1, level, ii)$/;"	f	file:
unfactor	doc/am.html	/^<a name="unfactor"><\/a>$/;"	a
unfactor_cmd	cmds.c	/^unfactor_cmd(cp)$/;"	f
unique	globals.c	/^double		unique[64];		\/* storage for the unique prime factors *\/$/;"	v
uno	globals.c	/^int		uno;			\/* number of unique factors stored in unique[] *\/$/;"	v
unsimp2_power	unfactor.c	/^unsimp2_power(equation, np)$/;"	f
unsimp_power	unfactor.c	/^unsimp_power(equation, np)$/;"	f
usage	help.c	/^	char	*usage;			\/* command syntax text *\/$/;"	m	file:
usage	main.c	/^usage()$/;"	f	file:
usage	primes/matho-pascal.c	/^usage()$/;"	f
usage	primes/matho-primes.c	/^usage()$/;"	f
usage2	primes/matho-primes.c	/^usage2()$/;"	f
usp2_sub	unfactor.c	/^usp2_sub(equation, np, i)$/;"	f
usp_sub	unfactor.c	/^usp_sub(equation, np, i)$/;"	f	file:
v	am.h	/^	long	v;		\/* variable *\/$/;"	m
var_count	am.c	/^var_count(p1, n1)$/;"	f
var_in_equation	am.c	/^var_in_equation(i, v)$/;"	f
var_is_const	parse.c	/^var_is_const(v, dp)$/;"	f
var_names	globals.c	/^char		*var_names[MAX_VAR_NAMES];	\/* storage for long variable names *\/$/;"	v
var_str	globals.c	/^char		var_str[MAX_VAR_LEN+80];	\/* temp storage for variable names *\/$/;"	v
variable	am.h	/^	long	variable;	\/* internal storage for mathematical variables *\/$/;"	m
vcmp	poly.c	/^vcmp(p1, p2)$/;"	f	file:
vcmp	simplify.c	/^vcmp(p1, p2)$/;"	f	file:
version	doc/am.html	/^<a name="version"><\/a>$/;"	a
version_cmd	cmds.c	/^version_cmd(cp)$/;"	f
version_report	cmds.c	/^version_report()$/;"	f
vv	factor_int.c	/^static double nn, vv;$/;"	v	file:
winsize	main.c	/^struct winsize	{int ws_col; int ws_row;};$/;"	s	file:
ws_col	main.c	/^struct winsize	{int ws_col; int ws_row;};$/;"	m	struct:winsize	file:
ws_row	main.c	/^struct winsize	{int ws_col; int ws_row;};$/;"	m	struct:winsize	file:
zero_token	globals.c	/^token_type	zero_token;			\/* the constant 0.0 as a token *\/$/;"	v
