| 1 |
/* @(#)osctest.c 19.1 (ES0-DMD) 02/25/03 13:56:11 */ |
| 2 |
/*=========================================================================== |
| 3 |
Copyright (C) 1995 European Southern Observatory (ESO) |
| 4 |
|
| 5 |
This program is free software; you can redistribute it and/or |
| 6 |
modify it under the terms of the GNU General Public License as |
| 7 |
published by the Free Software Foundation; either version 2 of |
| 8 |
the License, or (at your option) any later version. |
| 9 |
|
| 10 |
This program is distributed in the hope that it will be useful, |
| 11 |
but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 12 |
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 13 |
GNU General Public License for more details. |
| 14 |
|
| 15 |
You should have received a copy of the GNU General Public |
| 16 |
License along with this program; if not, write to the Free |
| 17 |
Software Foundation, Inc., 675 Massachusetss Ave, Cambridge, |
| 18 |
MA 02139, USA. |
| 19 |
|
| 20 |
Corresponding concerning ESO-MIDAS should be addressed as follows: |
| 21 |
Internet e-mail: [email protected] |
| 22 |
Postal address: European Southern Observatory |
| 23 |
Data Management Division |
| 24 |
Karl-Schwarzschild-Strasse 2 |
| 25 |
D 85748 Garching bei Muenchen |
| 26 |
GERMANY |
| 27 |
===========================================================================*/ |
| 28 |
|
| 29 |
/*+++++++++++ |
| 30 |
.TYPE Program |
| 31 |
.LANGUAGE C |
| 32 |
.IDENTIFICATION osctest.c |
| 33 |
.VERSION 1.0 23-Oct-1987: Creation |
| 34 |
.AUTHOR Francois Ochsenbein [ESO-IPG] |
| 35 |
.KEYWORDS Test of osc routines |
| 36 |
.ENVIRONMENT |
| 37 |
.COMMENTS |
| 38 |
|
| 39 |
-------------------------------------------------------------------------*/ |
| 40 |
|
| 41 |
#include <atype.h> |
| 42 |
|
| 43 |
static char msg[80]; |
| 44 |
static char s1[500], s2[500]; |
| 45 |
static unsigned char table[256] = |
| 46 |
{0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19, |
| 47 |
20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40, |
| 48 |
41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64, |
| 49 |
'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r', |
| 50 |
's','t','u','v','w','x','y','z',0133,0134,0135,0136,0137,0140, |
| 51 |
'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R', |
| 52 |
'S','T','U','V','W','X','Y','Z',0173,0174,0175,0176,0177}; |
| 53 |
|
| 54 |
char *s(); |
| 55 |
|
| 56 |
main() |
| 57 |
{ int i, n; |
| 58 |
char *p; |
| 59 |
|
| 60 |
puts("Test of osc (Char Strings) Routines"); |
| 61 |
|
| 62 |
while (1) |
| 63 |
{ |
| 64 |
printf("Operation: "); |
| 65 |
if (!gets(msg)) break; |
| 66 |
switch(msg[0]) |
| 67 |
|
| 68 |
{ case '?': help(); break; |
| 69 |
case 'f': case 'F': /* Fill strings */ |
| 70 |
p = s(msg+1); |
| 71 |
if (p) { printf("Length: "); gets(msg); n = atoi(msg); |
| 72 |
if (n >= sizeof(s1)-1) n = sizeof(s1)-1; |
| 73 |
printf("Fill char: "); gets(msg); |
| 74 |
*(p + oscfill(p, n, msg[0])) = 0; |
| 75 |
} |
| 76 |
break; |
| 77 |
case 'u': case 'U': /* Copy Until char */ |
| 78 |
n = oscopuc(s2, s1, strlen(s1)+1, msg[2]); |
| 79 |
*(s2+n) = '\0'; |
| 80 |
printf("Returned [%d]: %s\n", n, s2); |
| 81 |
break; |
| 82 |
case 'g': case 'G': /* Get strings */ |
| 83 |
p = s(msg+1); |
| 84 |
if (p) { printf("String: "); gets(p); break;} |
| 85 |
case 'd': case 'D': /* Display strings */ |
| 86 |
p = s(msg+1); |
| 87 |
if (p) puts(p); |
| 88 |
break; |
| 89 |
case 'm': case 'M': /* Copy char */ |
| 90 |
printf("Copied s1 to s2 =>%d\n", |
| 91 |
oscopy(s2, s1, strlen(s1)+1)); |
| 92 |
break; |
| 93 |
case 'l': case 'L': /* Locate char */ |
| 94 |
printf("Locate `%c' in s1 =>%d\n", msg[2], |
| 95 |
oscloc(s1, strlen(s1), msg[2])); |
| 96 |
break; |
| 97 |
case 'k': case 'K': /* Skip char */ |
| 98 |
printf("Locate `%c' in s1 =>%d\n", msg[2], |
| 99 |
oscskip(s1, strlen(s1), msg[2])); |
| 100 |
break; |
| 101 |
case 's': case 'S': /* Scan char */ |
| 102 |
n = atoi(&msg[2]); |
| 103 |
printf("Scan `%2X' in s1 =>%d\n", n, |
| 104 |
oscscan(s1, strlen(s1)+1, n, main_ascii)); |
| 105 |
break; |
| 106 |
case 'p': case 'P': /* Span char */ |
| 107 |
n = atoi(&msg[2]); |
| 108 |
printf("Span `%2X' in s1 =>%d\n", n, |
| 109 |
oscspan(s1, strlen(s1)+1, n, main_ascii)); |
| 110 |
break; |
| 111 |
case 'b': case 'B': /* Backwards */ |
| 112 |
switch(msg[1]){ |
| 113 |
case 'l': case 'L': /* Locate char */ |
| 114 |
printf("Locate `%c' in s1 =>%d\n", msg[3], |
| 115 |
oscbloc(s1, strlen(s1), msg[3])); |
| 116 |
break; |
| 117 |
case 'k': case 'K': /* Skip char */ |
| 118 |
printf("Locate `%c' in s1 =>%d\n", msg[3], |
| 119 |
oscbskip(s1, strlen(s1), msg[3])); |
| 120 |
break; |
| 121 |
case 's': case 'S': /* Scan char */ |
| 122 |
n = atoi(&msg[3]); |
| 123 |
printf("Scan `%2X' in s1 =>%d\n", n, |
| 124 |
oscbscan(s1, strlen(s1)+1, n, main_ascii)); |
| 125 |
break; |
| 126 |
case 'p': case 'P': /* Span char */ |
| 127 |
n = atoi(&msg[3]); |
| 128 |
printf("Span `%2X' in s1 =>%d\n", n, |
| 129 |
oscbspan(s1, strlen(s1)+1, n, main_ascii)); |
| 130 |
break; |
| 131 |
default: puts("***BAD***"); |
| 132 |
} break; |
| 133 |
case 't': case 'T': /* Translate s1 -> s2 */ |
| 134 |
printf("Translate =>%d\n", osctr(s2, s1, strlen(s1)+1, table)); |
| 135 |
break; |
| 136 |
|
| 137 |
case 'i': case 'I': /* Index s2 in s1 */ |
| 138 |
printf("Index =>%d\n", oscindex(s1, strlen(s1), |
| 139 |
s2, strlen(s2))); |
| 140 |
break; |
| 141 |
case 'c': case 'C': /* Compare s1 / s2 */ |
| 142 |
if (msg[1]) i = osccomp(s1, s2, strlen(s1)+1); |
| 143 |
else i = oscomp (s1, s2, strlen(s1)+1); |
| 144 |
printf("Compare =>%d\n", i); |
| 145 |
break; |
| 146 |
|
| 147 |
default: puts("***BAD***"); |
| 148 |
break; |
| 149 |
} |
| 150 |
} |
| 151 |
ospexit(0); |
| 152 |
} |
| 153 |
help() |
| 154 |
{ |
| 155 |
puts("Possibilities are: ? Help"); |
| 156 |
puts(" C Compare s1 to s2"); |
| 157 |
puts(" CC Compare case insensitive s1 to s2"); |
| 158 |
puts(" D1|D2 Display s1|s2"); |
| 159 |
puts(" G1|G2 Get s1|s2"); |
| 160 |
puts(" M Copy s1 -> s2"); |
| 161 |
puts(" F1|F2 Fill s1|s2"); |
| 162 |
puts(" L c Locate char c in s1"); |
| 163 |
puts(" BL c Locate Backwards c in s1"); |
| 164 |
puts(" K c Skip char c in s1"); |
| 165 |
puts(" BK c Skip Backwards char c in s1"); |
| 166 |
puts(" P m Span mask m in s1"); |
| 167 |
puts(" BP c Span Backwards mask m in s1"); |
| 168 |
puts(" S m Scan mask m in s1"); |
| 169 |
puts(" BS c Scan Backwards mask m in s1"); |
| 170 |
puts(" T Translate s1 into s2"); |
| 171 |
puts(" U c Copy s1 -> s2 Until char c"); |
| 172 |
puts(" I Index of s2 in s1"); |
| 173 |
puts("Masks: 1=U, 2=L, 4=D, 8=S, 16=P, 32=C, 64=X"); |
| 174 |
return(0); |
| 175 |
} |
| 176 |
|
| 177 |
char *s(str) /* Returns s1 or s2 or 0 */ |
| 178 |
char *str; |
| 179 |
{ |
| 180 |
int i; |
| 181 |
|
| 182 |
i = atoi(str); |
| 183 |
switch(i) |
| 184 |
{ case 1: return(s1); |
| 185 |
case 2: return(s2); |
| 186 |
default: return(0); |
| 187 |
} |
| 188 |
} |