Lines Matching full:sectors
39 #define SECTORS 16 // number of divisions in alpha and theta
69 cmsGDBPoint Gamut[SECTORS][SECTORS];
170 *alpha = (int) floor(((sp->alpha * (SECTORS)) / 360.0) );
171 *theta = (int) floor(((sp->theta * (SECTORS)) / 180.0) );
173 if (*alpha >= SECTORS)
174 *alpha = SECTORS-1;
175 if (*theta >= SECTORS)
176 *theta = SECTORS-1;
346 if (alpha < 0 || theta < 0 || alpha >= SECTORS || theta >= SECTORS) {
409 // Find near sectors. The list of sectors found is returned on Close[].
410 // The function returns the number of sectors as well.
452 a %= SECTORS;
453 t %= SECTORS;
456 if (a < 0) a = SECTORS + a;
457 if (t < 0) t = SECTORS + t;
493 sp.alpha = (cmsFloat64Number) ((alpha + 0.5) * 360.0) / (SECTORS);
494 sp.theta = (cmsFloat64Number) ((theta + 0.5) * 180.0) / (SECTORS);
504 // For all close sectors
529 templ.theta >= (theta*180.0/SECTORS) &&
530 templ.theta <= ((theta+1)*180.0/SECTORS) &&
531 templ.alpha >= (alpha*360.0/SECTORS) &&
532 templ.alpha <= ((alpha+1)*360.0/SECTORS)) {
557 for (alpha = 0; alpha < SECTORS; alpha++) {
563 for (alpha = 0; alpha < SECTORS; alpha++) {
565 if (!InterpolateMissingSector(gbd, alpha, SECTORS-1)) return FALSE;
570 for (theta = 1; theta < SECTORS; theta++) {
571 for (alpha = 0; alpha < SECTORS; alpha++) {
671 for (i=0; i < SECTORS; i++)
672 for (j=0; j < SECTORS; j++) {
681 if ((j == SECTORS - 1) && (i == SECTORS - 1))
696 for (i=0; i < SECTORS; i++)
697 for (j=0; j < SECTORS; j++) {
717 if ((j == SECTORS - 1) && (i == SECTORS - 1))
