#define HASHNKEY4(n,c4,c3,c2,c1) HASHKEY5((n)+'a',c4,c3,c2,c1)
#define HASHNKEY5(n,c5,c4,c3,c2,c1) HASHKEY6((n)+'a',c5,c4,c3,c2,c1)
-#if _BLD_ast && defined(__EXPORT__)
-#define extern __EXPORT__
-#endif
extern long strkey(const char *);
extern void virtual_weight(Agedge_t *);
extern void zapinlist(elist *, Agedge_t *);
-#if defined(_BLD_dot) && defined(_DLL)
-# define extern __EXPORT__
-#endif
extern Agraph_t* dot_root(void *);
extern void dot_concentrate(Agraph_t *);
extern void dot_mincross(Agraph_t *, int);
#undef RS /* hp.pa <signal.h> grabs this!! */
-#if _BLD_expr && defined(__EXPORT__)
-#define extern __EXPORT__
-#endif
-#if !_BLD_expr && defined(__IMPORT__)
-#define extern extern __IMPORT__
-#endif
-
#include <expr/exparse.h>
#undef extern
};
-#if _BLD_expr && defined(__EXPORT__)
-#define extern __EXPORT__
-#endif
extern Exnode_t* excast(Expr_t*, Exnode_t*, int, Exnode_t*, int);
extern Exnode_t* exnoncast(Exnode_t *);
#endif
-#if defined(_BLD_pathplan) && defined(__EXPORT__)
-# define extern __EXPORT__
-#endif
/* find shortest euclidean path within a simple polygon */
extern int Pshortestpath(Ppoly_t * boundary, Ppoint_t endpoints[2],
extern "C" {
#endif
-#if defined(_BLD_pathplan) && defined(__EXPORT__)
-# define extern __EXPORT__
-#endif
/* open a visibility graph
* Points in polygonal obstacles must be in clockwise order.
#define sfstderr ((Sfio_t*)_ast_dll->_ast_stderr)
#endif
-#if defined(_BLD_sfio) && defined(__EXPORT__)
-#define extern __EXPORT__
-#endif
extern Sfio_t *sfnew(Sfio_t *, void *, size_t, int, int);
extern Sfio_t *sfopen(Sfio_t *, const char *, const char *);
return TCL_OK;
}
-#if defined(_BLD_tcldot) && defined(_DLL)
-__EXPORT__
-#endif
int Tcldot_Init(Tcl_Interp * interp)
{
ictx_t *ictx;