void basis_mn_t3 ( double t[2*3], int n, double p[], double phi[], 
  double dphidx[], double dphidy[] );
void basis_mn_t6 ( double t[2*6], int n, double p[], double phi[], 
  double dphidx[], double dphidy[] );
char ch_cap ( char ch );
bool ch_eqi ( char ch1, char ch2 );
int ch_to_digit ( char ch );
double *dtable_data_read ( char *input_filename, int m, int n );
void dtable_header_read ( char *input_filename, int *m, int *n );
int file_column_count ( char *input_filename );
int file_row_count ( char *input_filename );
unsigned long get_seed ( void );
void grid_sample ( int node_num, double node_xy[], int triangle_order, 
  int triangle_num, int triangle_node[], int triangle_neighbor[], 
  double coef_node[], int x_number, int y_number, double x_vec[], 
  double y_vec[], double u_grid[] );
void grid_sample_size ( int node_num, double node_xy[], int number, 
  int *x_number, int *y_number );
int i4_max ( int i1, int i2 );
int i4_min ( int i1, int i2 );
int i4_uniform ( int b, int c, int *seed );
int i4row_compare ( int m, int n, int a[], int i, int j );
void i4row_sort_a ( int m, int n, int a[] );
void i4row_swap ( int m, int n, int a[], int irow1, int irow2 );
int *itable_data_read ( char *input_filename, int m, int n );
void itable_header_read ( char *input_filename, int *m, int *n );
float r4_abs ( float x );
int r4_nint ( float x );
float r4_uniform_01 ( int *seed );
double r8_huge ( void );
double r8_max ( double x, double y );
double r8_min ( double x, double y );
int r8_nint ( double x );
int s_len_trim ( char *s );
int s_to_i4 ( char *s, int *last, bool *error );
bool s_to_i4vec ( char *s, int n, int ivec[] );
double s_to_r8 ( char *s, int *lchar, bool *error );
bool s_to_r8vec ( char *s, int n, double rvec[] );
int s_word_count ( char *s );
void sort_heap_external ( int n, int *indx, int *i, int *j, int isgn );
void timestamp ( void );
void triangulation_order3_neighbor_triangles ( int triangle_num,
  int triangle_node[], int triangle_neighbor[] );
void triangulation_order6_neighbor_triangles ( int triangle_num,
  int triangle_node[], int triangle_neighbor[] );
void triangulation_search ( int node_num, double node_xy[], int triangle_order,
  int triangle_num, int triangle_node[], int triangle_neighbor[], 
  double p[2], int *triangle, int *edge );