/* Gem.H: Gematria for Lares, 1.02 */
/* ReWritten by Frater A.U.D.C.A.L., 1992 */
int hvalue(char word[20])
{
int hval = 0;
int p = 0;
while (word[p] != '\0')
{
switch (word[p])
{
case '\'':
if ((word[p-2] == 'T') && (word[p-1] == 'z'))
hval = (hval + 900 - 90);
else
if (word[p-1] == 'K')
hval = (hval + 500 - 20);
else
if (word[p-1] == 'M')
hval = (hval + 600 - 40);
else
if (word[p-1] =='N')
hval = (hval + 700 - 50);
else
if (word[p-1] == 'P')
hval = (hval + 800 - 80);
break;
case 'a':
hval = hval + 1;
break;
case 'b':
hval = hval + 2;
break;
case 'c':
hval = hval + 8;
break;
case 'd':
hval = hval + 4;
break;
case 'e':
hval = hval + 5;
break;
case 'f':
hval = hval + 6;
break;
case 'g':
hval = hval + 3;
break;
case 'h':
if (word[p-1] == 'T')
{hval = (hval - 9 + 400);
}
else
if (word[p-1] == 'C')
{hval = (hval - 8 + 8);
}
else
if (word[p-1] == 'S')
{hval = (hval - 60 + 300);
}
else
hval = hval + 5;
break;
case 'i':
hval = hval + 10;
break;
case 'j':
hval = hval + 10;
break;
case 'k':
hval = hval + 20;
break;
case 'l':
hval = hval + 30;
break;
case 'm':
hval = hval + 40;
break;
case 'n':
hval = hval + 50;
break;
case 'o':
hval = hval + 70;
break;
case 'p':
hval = hval + 80;
break;
case 'q':
hval = hval + 100;
break;
case 'r':
hval = hval + 200;
break;
case 's':
hval = hval + 60;
break;
case 't':
hval = hval + 9;
break;
case 'u':
hval = hval + 6;
break;
case 'v':
hval = hval + 6;
break;
case 'w':
hval = hval + 12;
break;
case 'x':
hval = hval;
break;
case 'y':
hval = hval + 10;
break;
case 'z':
if (word[p-1] == 'T')
{hval = (hval - 9 + 90);
}
else
hval = hval + 7;
break;
case 'A':
hval = hval + 1;
break;
case 'B':
hval = hval + 2;
break;
case 'C':
hval = hval + 8;
break;
case 'D':
hval = hval + 4;
break;
case 'E':
hval = hval + 5;
break;
case 'F':
hval = hval + 6;
break;
case 'G':
hval = hval + 3;
break;
case 'H':
hval = hval + 5;
break;
case 'I':
hval = hval + 10;
break;
case 'J':
hval = hval + 10;
break;
case 'K':
hval = hval + 20;
break;
case 'L':
hval = hval + 30;
break;
case 'M':
hval = hval + 40;
break;
case 'N':
hval = hval + 50;
break;
case 'O':
hval = hval + 70;
break;
case 'P':
hval = hval + 80;
break;
case 'Q':
hval = hval + 100;
break;
case 'R':
hval = hval + 200;
break;
case 'S':
hval = hval + 60;
break;
case 'T':
hval = hval + 9;
break;
case 'U':
hval = hval + 6;
break;
case 'V':
hval = hval + 6;
break;
case 'W':
hval = hval + 12;
break;
case 'X':
hval = hval;
break;
case 'Y':
hval = hval + 10;
break;
case 'Z':
hval = hval + 7;
break;
}
p++;
}
return hval;
}
int gvalue(char word[20])
{
int gval = 0;
int p = 0;
while (word[p] != '\0')
{
switch (word[p])
{
case 'a':
gval = gval + 1;
break;
case 'b':
gval = gval + 2;
break;
case 'c':
gval = gval + 900;
break;
case 'd':
gval = gval + 4;
break;
case 'e':
gval = gval + 5;
break;
case 'f':
gval = gval + 6;
break;
case 'g':
gval = gval + 3;
break;
case 'h':
if (word[p-1] == 'T')
{gval = (gval - 300 + 9);
}
else
if (word[p-1] == 'C')
{gval = (gval - 200 + 600);
}
else
if (word[p-1] == 'P')
{gval = (gval - 80 + 500);
}
else
gval = gval + 8;
break;
case 'i':
gval = gval + 10;
break;
case 'j':
gval = gval + 10;
break;
case 'k':
gval = gval + 20;
break;
case 'l':
gval = gval + 30;
break;
case 'm':
gval = gval + 40;
break;
case 'n':
gval = gval + 50;
break;
case 'o':
gval = gval + 70;
break;
case 'p':
gval = gval + 80;
break;
case 'q':
gval = gval + 90;
break;
case 'r':
gval = gval + 100;
break;
case 's':
if (word[p-1] == 'P')
{gval = (gval - 80 + 700);
}
else
gval = gval + 200;
break;
case 't':
gval = gval + 300;
break;
case 'u':
gval = gval + 400;
break;
case 'v':
gval = gval + 400;
break;
case 'w':
gval = gval + 800;
break;
case 'x':
gval = gval + 60;
break;
case 'y':
gval = gval + 10;
break;
case 'z':
gval = gval + 7;
break;
case 'A':
gval = gval + 1;
break;
case 'B':
gval = gval + 2;
break;
case 'C':
gval = gval + 900;
break;
case 'D':
gval = gval + 4;
break;
case 'E':
gval = gval + 5;
break;
case 'F':
gval = gval + 6;
break;
case 'G':
gval = gval + 3;
break;
case 'H':
gval = gval + 8;
break;
case 'I':
gval = gval + 10;
break;
case 'J':
gval = gval + 10;
break;
case 'K':
gval = gval + 20;
break;
case 'L':
gval = gval + 30;
break;
case 'M':
gval = gval + 40;
break;
case 'N':
gval = gval + 50;
break;
case 'O':
gval = gval + 70;
break;
case 'P':
gval = gval + 80;
break;
case 'Q':
gval = gval + 90;
break;
case 'R':
gval = gval + 100;
break;
case 'S':
gval = gval + 200;
break;
case 'T':
gval = gval + 300;
break;
case 'U':
gval = gval + 400;
break;
case 'V':
gval = gval + 400;
break;
case 'W':
gval = gval + 800;
break;
case 'X':
gval = gval + 60;
break;
case 'Y':
gval = gval + 10;
break;
case 'Z':
gval = gval + 7;
break;
}
p++;
}
return gval;
}
int evalue(char word[20])
{
int eval = 0;
int p = 0;
while (word[p] != '\0')
{
switch (word[p])
{
case 'a':
eval = eval + 6;
break;
case 'b':
eval = eval + 5;
break;
case 'c':
eval = eval + 300;
break;
case 'd':
eval = eval + 4;
break;
case 'e':
eval = eval + 7;
break;
case 'f':
eval = eval + 300;
break;
case 'g':
eval = eval + 9;
break;
case 'h':
eval = eval + 1;
break;
case 'i':
eval = eval + 60;
break;
case 'j':
eval = eval + 60;
break;
case 'k':
eval = eval + 300;
break;
case 'l':
eval = eval + 40;
break;
case 'm':
eval = eval + 90;
break;
case 'n':
eval = eval + 50;
break;
case 'o':
eval = eval + 30;
break;
case 'p':
eval = eval + 8;
break;
case 'q':
eval = eval + 40;
break;
case 'r':
eval = eval + 100;
break;
case 's':
eval = eval + 10;
break;
case 't':
eval = eval + 400;
break;
case 'u':
eval = eval + 70;
break;
case 'v':
eval = eval + 70;
break;
case 'w':
eval = eval + 60;
break;
case 'x':
eval = eval + 400;
break;
case 'y':
eval = eval + 60;
break;
case 'z':
eval = eval + 1;
break;
case 'A':
eval = eval + 6;
break;
case 'B':
eval = eval + 5;
break;
case 'C':
eval = eval + 300;
break;
case 'D':
eval = eval + 31;
break;
case 'E':
eval = eval + 7;
break;
case 'F':
eval = eval + 300;
break;
case 'G':
eval = eval + 9;
break;
case 'H':
eval = eval + 1;
break;
case 'I':
eval = eval + 60;
break;
case 'J':
eval = eval + 60;
break;
case 'K':
eval = eval + 300;
break;
case 'L':
eval = eval + 40;
break;
case 'M':
eval = eval + 90;
break;
case 'N':
eval = eval + 50;
break;
case 'O':
eval = eval + 30;
break;
case 'P':
eval = eval + 8;
break;
case 'Q':
eval = eval + 40;
break;
case 'R':
eval = eval + 100;
break;
case 'S':
eval = eval + 10;
break;
case 'T':
eval = eval + 400;
break;
case 'U':
eval = eval + 70;
break;
case 'V':
eval = eval + 70;
break;
case 'W':
eval = eval + 60;
break;
case 'X':
eval = eval + 400;
break;
case 'Y':
eval = eval + 60;
break;
case 'Z':
eval = eval + 1;
break;
}
p++;
}
return eval;
}
int doca()
{
printf("\f\nWelcome to the first release of GEM, Gematria for Household Gods.");
printf("\n");
printf("\nDue to the limited nature of most keyboards, a sort of shorthand has");
printf("\nbeen adopted, making distinctions between certain letter combinations");
printf("\nto facilitate communication of either Theta \(Th\) vs. Tau Eta \(TH\), or");
printf("\nTzaddi \(Tz\) vs. Tau Zayin \(TZ\), and assignations to unoccupied letters");
printf("\nso as to aid in the perception of either an Epsilon \(E\) or an Eta \(H\).");
printf("\n");
printf("\n");
printf("\n");
printf("\nPress Enter to continue");
return 0;
}
int docb()
{
printf("\f\nGenerally, in either Upper or Lower case, with the Exceptions noted below:");
printf("\n");
printf("\nEnglish = Hebrew = Greek = Enochian");
printf("\n=========================================================================");
printf("\n A = Aleph = Alpha = Un");
printf("\n B = Beth = Beta = Pa");
printf("\n C = Cheth = Sampi = Veh");
printf("\n D = Daleth = Delta = Gal");
printf("\n E = He = Epsilon = Graph");
printf("\n F = Vau = Wau\(Digamma\) = Or");
printf("\n G = Gimel = Gamma = Ged");
printf("\n H = He = Eta = Na");
printf("\n I = Yod = Iota = Gon");
printf("\n J = Yod = Iota = Gon");
printf("\n K = Kaph = Kappa = Veh");
printf("\n L = Lamed = Lambda = Ur");
printf("\n M = Mem = Mu = Tal");
printf("\n");
printf("\n");
printf("\n");
printf("\n");
printf("\nPress Enter to continue");
return 0;
}
int docc()
{
printf("\f\n N = Nun = Nu = Drux");
printf("\n O = Ayin = Omicron/Omega = Med");
printf("\n P = Pe = Pi/Phi = Mals");
printf("\n Q = Qoph = Qoppa = Ger");
printf("\n R = Resh = Rho = Don");
printf("\n S = Samekh/Shin = Sigma = Fam");
printf("\n T = Teth/Tzaddi/Tau = Tau/Theta = Gisg");
printf("\n U = Vau = Upsilon = Van");
printf("\n V = Vau = Upsilon = Van");
printf("\n W = Double Vau = Double Upsilon = Double Van");
printf("\n X = = Xi/Chi = Pal");
printf("\n Y = Yod = Upsilon = Gon");
printf("\n Z = Zayin = Zeta = Ceph");
printf("\n");
printf("\n");
printf("\n");
printf("\n");
printf("\n");
printf("\n");
printf("\nPress Enter to continue");
return 0;
}
int docd()
{
printf("\f\n ");
printf("\n ");
printf("\n ");
printf("\nSee Values.Doc for Gem\'s latest evaluation of these letters and ");
printf("\ncombinations. It was created with Gem redirected to a file. Gem");
printf("\ncan also accept redirection from a file, but this effectively ");
printf("\nlimits it\'s input to the DOS command line limit of 128. This ");
printf("\nwill be addressed in the next release, along with on the fly ");
printf("\nattribution juggling.");
printf("\n");
printf("\n T.Iannotti");
printf("\n \{DATA\} \(718\)499-9277 ");
printf("\n");
printf("\n");
printf("\nPress Enter to continue");
return 0;
}
int doc2()
{
printf("Exceptions:");
printf("\nHebrew: Greek: Enochian");
printf("\n======================================================================");
printf("\nK = Kaph C = Sampi d = 4");
printf("\nK\' = Kaph final K = Kappa D = 31");
printf("\n ");
printf("\nM = Mem E = Epsilon ");
printf("\nM\' = Mem final H = Eta ");
printf("\n ");
printf("\nN = Nun O = Omicron ");
printf("\nN\' = Nun final W = Omega ");
printf("\n ");
printf("\nP = Pe Ps = Psi ");
printf("\nP\' = Pe final PS = Pi Sigma ");
printf("\n ");
printf("\nT = Teth T = Tau ");
printf("\nTh = Tau Th = Theta ");
printf("\n");
printf("\nTz = Tzaddi X = Xi ");
printf("\nS = Samekh Ch = Chi ");
printf("\nSh = Shin ");
return 0;
}
Return to The Skeptic Tank's main Index page.
The views and opinions stated within this web page are those of the
author or authors which wrote them and may not reflect the views and
opinions of the ISP or account user which hosts the web page. The
opinions may or may not be those of the Chairman of The Skeptic Tank.