head	1.111;access	david	neto;symbols	zero-five-zero:1.111	zero-four-seventeen:1.111	zero-four-ten:1.111	zero-four-nine:1.110	zero-four-eight:1.109	zero-four-five:1.109	zero-four-zero:1.107;locks	neto:1.111;1.111date	98.08.23.21.38.40;	author neto;	state Exp;branches;next	1.110;1.110date	98.08.20.18.35.56;	author neto;	state Exp;branches;next	1.109;1.109date	98.08.07.23.05.38;	author neto;	state Exp;branches;next	1.108;1.108date	98.08.07.20.39.24;	author neto;	state Exp;branches;next	1.107;1.107date	98.07.16.21.58.55;	author neto;	state Exp;branches;next	1.106;1.106date	98.06.19.16.23.17;	author neto;	state Exp;branches;next	1.105;1.105date	97.12.20.22.33.35;	author neto;	state Exp;branches;next	1.104;1.104date	97.12.13.19.43.37;	author neto;	state Exp;branches;next	1.103;1.103date	96.06.26.10.57.50;	author neto;	state Exp;branches;next	1.102;1.102date	96.06.20.16.01.18;	author neto;	state Exp;branches;next	1.101;1.101date	96.06.20.15.50.18;	author neto;	state Exp;branches;next	;desc@Typesetting instructions for all the typedef'd types.@1.111log@Added types for tspgen@text@% This file is in the public domain.% Typeset these typedef'd types as if they are |int|.  I put this in% a separate .w file so that it's convenient for other .w files.@@s dict_node_t int@@s dict_t int@@s eligible_t int@@s E2_box_t int@@s E2_node_t int@@s length_t int@@s nn_entry_t int@@s pool_block_freelist_t int@@s pool_t int@@s tsp_instance_t int@@s edge_weight_type_t int@@s edge_weight_format_t int@@s coord_2d int@@s prng_t int@@s decluster_tree_t int@@s decluster_edge_t int@@s search_node_t int@@s onetree_node_t int@@s pq_t int@@s pq_cmp_func_t int@@s dirty_queue_node_t int@@s dirty_queue_node_s int@@s dirty_set_t int@@s tabu_hash_elem_s int@@s tabu_hash_elem_t int@@s tabu_hash_s int@@s tabu_hash_t int% These are for tspgen.w@@s edge_t int@@s tree_t int@@s hull_sortbox_t int@@s hull_vertex_t int@@s point_t int% These are from gb_flip (with my gb_flip.ch modifications)@@s gb_prng_t int@1.110log@Added tabu hash types@text@d43 10@1.109log@Added dirty set t@text@d38 5@1.108log@Added dirty module.@text@d37 1@1.107log@Added the LGPL notice in each file.@text@d34 3@1.106log@Adde priority queue stuff.@text@d1 1@1.105log@Added decluster edge t@text@d27 6@1.104log@Added prng t and decluster tree type.@text@d26 1@1.103log@Added types used by kdtree.w@text@d24 2@1.102log@Changed @@f to @@s to suppress the outputting of the format definition.@text@d9 3d23 1@1.101log@First version@text@d4 2a5 2@@f dict_node_t int@@f dict_t intd7 1a7 1@@f eligible_t intd9 1a9 1@@f length_t intd11 1a11 1@@f nn_entry_t intd13 2a14 2@@f pool_block_freelist_t int@@f pool_t intd16 4a19 4@@f tsp_instance_t int@@f edge_weight_type_t int@@f edge_weight_format_t int@@f coord_2d int@