From 22f703cab05b7cd368f4de9e03991b7664dc5022 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?J=C3=B6rg=20Frings-F=C3=BCrst?= <debian@jff-webhosting.net>
Date: Mon, 1 Sep 2014 13:56:46 +0200
Subject: Initial import of argyll version 1.5.1-8

---
 target/simplat.h | 86 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 86 insertions(+)
 create mode 100644 target/simplat.h

(limited to 'target/simplat.h')

diff --git a/target/simplat.h b/target/simplat.h
new file mode 100644
index 0000000..4cede20
--- /dev/null
+++ b/target/simplat.h
@@ -0,0 +1,86 @@
+
+#ifndef SIMPLAT_H
+/* 
+ * Argyll Color Correction System
+ *
+ * Simplex perceptual space latice test point class
+ *
+ * Author: Graeme W. Gill
+ * Date:   27/3/2002
+ *
+ * Copyright 2002 - 2004 Graeme W. Gill
+ * All rights reserved.
+ *
+ * This material is licenced under the GNU AFFERO GENERAL PUBLIC LICENSE Version 3 :-
+ * see the License.txt file for licencing details.
+ */
+
+#define SPT_HASHSIZE 4463	/* Hash index size */
+
+/* A sample point node */
+struct _sptnode {
+	int    vald;		/* Valid flag */
+	int    x[MXTD];		/* Index */
+	double p[MXTD];		/* Device coordinate position */
+	double v[MXTD];		/* Subjective value (Labk) */
+	int    b;			/* 1 if a gamut point, 2 if a boundary point */
+	unsigned long expm[2];	/* -ve/+ve dimention explored flags */
+
+	int hp;				/* Hash linked list index */
+	int up;				/* Unexplored linked list index */
+}; typedef struct _sptnode sptnode;
+
+
+/* Main simplex latice object */
+struct _simplat {
+/* private: */
+	int di;			/* Point dimensionality */
+	double ilimit;	/* Ink limit - limit on sum of p[] */
+	int inp;		/* Intended number of points in list */
+	double angle;	/* Grid angle */
+	double bo[MXTD];	/* Basis origin */
+	double bv[MXTD][MXTD];	/* Simplex basis vectors */
+	int np;			/* Number of point nodes in list */
+	int nvp;		/* Number of valid point nodes in list */
+	int np_a;		/* Number of points allocated */
+	double dia;		/* Point spacing in latice */
+	sptnode *nodes;	/* Current array of nodes */
+	int bnp;		/* Number of point nodes in best list */
+	int bnvp;		/* Number of best valid point nodes in list */
+	int bnp_a;		/* Number of best points allocated */
+	double bdia;	/* Point spacing in best latice */
+	sptnode *bnodes;	/* Current best array of nodes */
+	int hash[SPT_HASHSIZE];	/* Hash index */
+	int unex;		/* Head of unexplored list index */
+	double tol;		/* Snap tollerance */
+
+	/* Perceptual function */
+	void (*percept)(void *od, double *out, double *in);
+	void *od;		/* Opaque data for perceptual point */
+	
+	/* Fixed points to avoid */
+	fxpos *fxlist;			/* List of existing fixed points (may be NULL) */
+	int fxno;				/* Number of existing fixes points */
+
+	int rix;				/* Next read index */
+
+/* public: */
+	/* Initialise, ready to read out all the points */
+	void (*reset)(struct _simplat *s);
+
+	/* Read the next set of non-fixed points values */
+	/* return non-zero when no more points */
+	int (*read)(struct _simplat *s, double *d, double *p);
+
+	/* Destroy ourselves */
+	void (*del)(struct _simplat *s);
+
+	}; typedef struct _simplat simplat;
+
+/* Constructor */
+extern simplat *new_simplat(int di, double ilimit, int npoints,
+	fxpos *fxlist, int fxno, double angle,
+	void (*percept)(void *od, double *out, double *in), void *od);
+
+#define SIMPLAT_H
+#endif /* SIMPLAT_H */
-- 
cgit v1.2.3