X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=sources%2Foc%2Foc.h;fp=sources%2Foc%2Foc.h;h=6df67eb4a759f33997300750cd6e4ff1d60d32dd;hb=81362e35a140cd040e948b921053e74267f8a6e3;hp=0000000000000000000000000000000000000000;hpb=2cf032f4b987ba747c04159965aed78e3820d942;p=jpred.git

diff --git a/sources/oc/oc.h b/sources/oc/oc.h
new file mode 100644
index 0000000..6df67eb
--- /dev/null
+++ b/sources/oc/oc.h
@@ -0,0 +1,104 @@
+/* Include file of definitions for program oc (o.c). */
+
+#define val_A_B(arr,n,i,j) arr[i][j-i-1]
+
+/* structure to hold cluster details
+Note:  	Normally, parentA and parentB point to pre-existing
+	clusters stored above them in the array of clusters.
+	However, 
+       	If the cluster is a single entity, then parentA and parentB
+       	are set to NULL.
+       	If one or more of the parents are single entites, then
+       	the storage for the entites is malloc'd independently
+       	of the master cluster array.
+*/
+
+struct sc{
+	double score;	/* score for this cluster */
+	int n;		/* number of entitites in this cluster */
+	int *members;	/* entities - this is redundant but speeds code */
+	struct sc *parentA; /* one parent of this cluster */
+	struct sc *parentB; /* the other parent */
+	char lab;           /* lable set this to 1 normally.  0 if the cluster has been processed */
+};
+
+double **read_up_diag(FILE *infile, int n);
+char   **read_idents(FILE *infile, int n);
+void write_up_diag(FILE *infile, double **ret_val,int n);
+void show_entity(struct sc *entity,FILE *out);
+void show_inx_entity(struct sc *entity,int *inx,FILE *out);
+struct sc *make_entity(int i,double base_val);
+/* double val_A_B(double **arr,int n,int i,int j);*/
+double val_Grp_B(
+	double **arr,	/* upper diagonal array */
+	int n,		/* side of array */
+	int *grpA,	/* array containing entities of group */
+	int ng,		/* number of members in grpA */
+	int j,		/* entity to compare to grpA */
+	int choice	/* see above */
+);
+double val_Grp_Grp(
+	double **arr,	/* upper diagonal array */
+	int n,		/* side of array */
+	int *grpA,	/* array containing entities of group */
+	int ngA,	/* number of members in grpA */
+	int *grpB,	/* array containing entities of group B*/
+	int ngB,	/* number of members in grpB */
+	int choice	/* see above */
+);
+void remove_unclust(int *unclust,int *nunclust,int val);
+void iprintarr(int *arr,int n,FILE *out);
+int no_share(
+	    int *grpA,
+	    int ngA,
+	    int *grpB,
+	    int ngb
+);
+void add_notparent(int *np,int *n,int A);
+void remove_notparent(int *np,int *n,int A);
+void sub_notparent(int *np,int *n,int A,int B);    	
+double **GJDudarr(int n);
+void draw_dendrogram(FILE *fout,
+                     struct sc *clust,
+		     char **idents,
+                     int *inx,
+                     int n,
+		     int sim);
+
+double get_mean(int *arr,int *inx,int n);
+void draw_arch(FILE *fout,
+               float x1,
+               float x2,
+               float x3,
+               float y1,
+               float y2);
+
+double trans_y(double X,
+	       double Xmin,
+	       double Xmax,
+	       double Xrange,
+	       float Twidth,
+	       float Xoffset);
+
+double trans_x(double x,
+	       int sim,
+	       double Xmin,
+	       double Xmax,
+	       double Xrange,
+	       float Twidth,
+	       float Xoffset);
+void PSPutText(float x,float y,char *text,FILE *outf);
+void show_id_entity(struct sc *entity,char **id,FILE *out);
+
+void mark_parents(struct sc *entity);
+void write_unclustered(struct sc *entity,char **idents,FILE *fout);
+void up_diag_log(double **arr,int n);
+void print_amps_cluster(struct sc *entity,int *inx,FILE *fp);
+
+
+
+
+
+
+
+