types.w,v

Lin-Kernighan heuristic for the TSP and minimum weight perfect matching

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.111
date	98.08.23.21.38.40;	author neto;	state Exp;
branches;
next	1.110;

1.110
date	98.08.20.18.35.56;	author neto;	state Exp;
branches;
next	1.109;

1.109
date	98.08.07.23.05.38;	author neto;	state Exp;
branches;
next	1.108;

1.108
date	98.08.07.20.39.24;	author neto;	state Exp;
branches;
next	1.107;

1.107
date	98.07.16.21.58.55;	author neto;	state Exp;
branches;
next	1.106;

1.106
date	98.06.19.16.23.17;	author neto;	state Exp;
branches;
next	1.105;

1.105
date	97.12.20.22.33.35;	author neto;	state Exp;
branches;
next	1.104;

1.104
date	97.12.13.19.43.37;	author neto;	state Exp;
branches;
next	1.103;

1.103
date	96.06.26.10.57.50;	author neto;	state Exp;
branches;
next	1.102;

1.102
date	96.06.20.16.01.18;	author neto;	state Exp;
branches;
next	1.101;

1.101
date	96.06.20.15.50.18;	author neto;	state Exp;
branches;
next	;


desc
@Typesetting instructions for all the typedef'd types.
@


1.111
log
@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.110
log
@Added tabu hash types
@
text
@d43 10
@


1.109
log
@Added dirty set t
@
text
@d38 5
@


1.108
log
@Added dirty module.
@
text
@d37 1
@


1.107
log
@Added the LGPL notice in each file.
@
text
@d34 3
@


1.106
log
@Adde priority queue stuff.
@
text
@d1 1
@


1.105
log
@Added decluster edge t
@
text
@d27 6
@


1.104
log
@Added prng t and decluster tree type.
@
text
@d26 1
@


1.103
log
@Added types used by kdtree.w
@
text
@d24 2
@


1.102
log
@Changed @@f to @@s to suppress the outputting of the format definition.
@
text
@d9 3
d23 1
@


1.101
log
@First version
@
text
@d4 2
a5 2
@@f dict_node_t int
@@f dict_t int
d7 1
a7 1
@@f eligible_t int
d9 1
a9 1
@@f length_t int
d11 1
a11 1
@@f nn_entry_t int
d13 2
a14 2
@@f pool_block_freelist_t int
@@f pool_t int
d16 4
a19 4
@@f tsp_instance_t int
@@f edge_weight_type_t int
@@f edge_weight_format_t int
@@f coord_2d int
@