| 1 | /* |
|---|
| 2 | * This file is generated by aisc_mkpt. |
|---|
| 3 | * Any changes you make here will be overwritten later! |
|---|
| 4 | * |
|---|
| 5 | */ |
|---|
| 6 | |
|---|
| 7 | #ifndef P_ |
|---|
| 8 | # if defined(__STDC__) || defined(__cplusplus) |
|---|
| 9 | # define P_(s) s |
|---|
| 10 | # else |
|---|
| 11 | # define P_(s) () |
|---|
| 12 | # endif |
|---|
| 13 | #else |
|---|
| 14 | # error P_ already defined elsewhere |
|---|
| 15 | #endif |
|---|
| 16 | |
|---|
| 17 | /* define ARB attributes: */ |
|---|
| 18 | #ifndef ATTRIBUTES_H |
|---|
| 19 | # include <attributes.h> |
|---|
| 20 | #endif |
|---|
| 21 | |
|---|
| 22 | |
|---|
| 23 | /* trs_hash.cxx */ |
|---|
| 24 | long TRS_create_hash P_((long size)); |
|---|
| 25 | long TRS_read_hash P_((long hash, const char *key)); |
|---|
| 26 | long TRS_write_hash P_((long hash, const char *key, long val)); |
|---|
| 27 | long TRS_write_hash_no_strdup P_((long hash, char *key, long val)); |
|---|
| 28 | long TRS_incr_hash P_((long hash, const char *key)); |
|---|
| 29 | long TRS_free_hash_entries P_((long hash)); |
|---|
| 30 | long TRS_free_hash P_((long hash)); |
|---|
| 31 | long TRS_free_hash_entries_free_pointer P_((long hash)); |
|---|
| 32 | long TRS_free_hash_free_pointer P_((long hash)); |
|---|
| 33 | long TRS_hash_do_loop P_((long hash, long func (const char *key, long val ))); |
|---|
| 34 | long TRS_create_hashi P_((long size)); |
|---|
| 35 | long TRS_read_hashi P_((long hashi, long key)); |
|---|
| 36 | long TRS_write_hashi P_((long hashi, long key, long val)); |
|---|
| 37 | long TRS_free_hashi P_((long hash)); |
|---|
| 38 | |
|---|
| 39 | /* tree_lib.cxx */ |
|---|
| 40 | char *TRS_export_error P_((const char *templat, ...)) __ATTR__FORMAT(1); |
|---|
| 41 | char *TRS_get_error P_((void)); |
|---|
| 42 | void *TRS_stropen P_((long init_size)); |
|---|
| 43 | char *TRS_strclose P_((void *strstruct, int optimize)); |
|---|
| 44 | void TRS_strcat P_((void *strstruct, const char *ptr)); |
|---|
| 45 | void TRS_chrcat P_((void *strstruct, char ch)); |
|---|
| 46 | char *TRS_mergesort P_((void **array, long start, long end, long (*compare )(void *, void *, char *cd ), char *client_data)); |
|---|
| 47 | char *TRS_read_file P_((const char *path)); |
|---|
| 48 | char *TRS_map_FILE P_((const char *path, FILE *in, int writeable)); |
|---|
| 49 | char *TRS_map_file P_((const char *path, int writeable)); |
|---|
| 50 | long TRS_size_of_file P_((const char *path)); |
|---|
| 51 | long TRS_size_of_FILE P_((const char *path, FILE *in)); |
|---|
| 52 | char *T2J_send_tree P_((CAT_node_id focus)); |
|---|
| 53 | char *T2J_transform P_((int mode, char *path_of_tree, struct T2J_transfer_struct *data, CAT_node_id focus, FILE *out)); |
|---|
| 54 | char *T2J_send_bit_coded_tree P_((char *path_of_tree, FILE *out)); |
|---|
| 55 | char *T2J_send_branch_lengths P_((char *path_of_tree, FILE *out)); |
|---|
| 56 | char *T2J_send_newick_tree P_((const char *path_of_tree, char *changedNodes, char *selectedNodes, const char *grouped_nodes, FILE *out)); |
|---|
| 57 | struct T2J_transfer_struct *T2J_read_query_result_from_data P_((char *data, CAT_FIELDS catfield)); |
|---|
| 58 | struct T2J_transfer_struct *T2J_read_query_result_from_pts P_((char *data)); |
|---|
| 59 | struct T2J_transfer_struct *T2J_read_query_result_from_file P_((char *path, CAT_FIELDS catfield)); |
|---|
| 60 | char *T2J_transfer_fullnames1 P_((char *path_of_tree, FILE *out)); |
|---|
| 61 | char *T2J_transfer_fullnames2 P_((char *path_of_tree, FILE *out)); |
|---|
| 62 | char *T2J_transfer_group_names P_((char *path_of_tree, FILE *out)); |
|---|
| 63 | void T2J_convert_colors_into_selection P_((void)); |
|---|
| 64 | char *T2J_get_selection P_((char *path_of_tree, char *sel, const char *varname, int all_nodes, CAT_FIELDS field_name, CAT_node_id *focusout, char **maxnodeout, double *maxnodehits)); |
|---|
| 65 | void T2J_set_color_of_selection P_((char *sel)); |
|---|
| 66 | |
|---|
| 67 | /* trs_server.cxx */ |
|---|
| 68 | |
|---|
| 69 | #undef P_ |
|---|
