summaryrefslogtreecommitdiffstats
path: root/po/eo.po
diff options
context:
space:
mode:
authorThierry Vignaud <tvignaud@mandriva.org>2003-11-17 15:27:37 +0000
committerThierry Vignaud <tvignaud@mandriva.org>2003-11-17 15:27:37 +0000
commit86ac46ea702c2c6c46027a6febe3d0b2ada7977b (patch)
tree94e063c73dd8819527ee7136a53b60c61afa3c9d /po/eo.po
parent435fbdcd0e75665f7b0885109927664600c97219 (diff)
downloaddrakwizard-86ac46ea702c2c6c46027a6febe3d0b2ada7977b.tar
drakwizard-86ac46ea702c2c6c46027a6febe3d0b2ada7977b.tar.gz
drakwizard-86ac46ea702c2c6c46027a6febe3d0b2ada7977b.tar.bz2
drakwizard-86ac46ea702c2c6c46027a6febe3d0b2ada7977b.tar.xz
drakwizard-86ac46ea702c2c6c46027a6febe3d0b2ada7977b.zip
typo fix
Diffstat (limited to 'po/eo.po')
-rw-r--r--po/eo.po13
1 files changed, 6 insertions, 7 deletions
diff --git a/po/eo.po b/po/eo.po
index cb6fe07b..0caa85bb 100644
--- a/po/eo.po
+++ b/po/eo.po
@@ -6,7 +6,7 @@
msgid ""
msgstr ""
"Project-Id-Version: drakwizard-eo\n"
-"POT-Creation-Date: 2003-11-17 15:24+0000\n"
+"POT-Creation-Date: 2003-11-17 15:44+0000\n"
"PO-Revision-Date: 2003-08-09 15:18+0000\n"
"Last-Translator: Vilhelmo Lutermano <vlutermano@free.fr>\n"
"Language-Team: Esperanto <eo@li.org>\n"
@@ -24,7 +24,7 @@ msgstr "Konfigurad-sorĉilo"
#: ../news_wizard/Inn.pm_.c:71 ../proxy_wizard/Squid.pm_.c:81
#: ../proxy_wizard/Squid.pm_.c:88 ../samba_wizard/Samba.pm_.c:140
#: ../samba_wizard/Samba.pm_.c:188 ../time_wizard/Ntp.pm_.c:137
-#: ../web_wizard/Apache.pm_.c:83
+#: ../time_wizard/Ntp.pm_.c:144 ../web_wizard/Apache.pm_.c:83
#, fuzzy
msgid "Warning."
msgstr "Averto"
@@ -1349,11 +1349,6 @@ msgstr "Mi testas la alireblon de la tempo-serviloj"
msgid "Time zone:"
msgstr "Horzono:"
-#: ../time_wizard/Ntp.pm_.c:144
-#, fuzzy
-msgid "Warming."
-msgstr "Averto"
-
#: ../time_wizard/Ntp.pm_.c:145
msgid "The time servers are not responding. The causes could be:"
msgstr "La tempo-serviloj ne resondas. La kialoj povas esti:"
@@ -1511,6 +1506,10 @@ msgstr ""
"La sorĉilo sukcese konfiguris vian intraretan/interretan Teksaĵ-servilon"
#, fuzzy
+#~ msgid "Warming."
+#~ msgstr "Averto"
+
+#, fuzzy
#~ msgid "Congratulationss"
#~ msgstr "Gratulon"
generated by cgit v1.2.1 (git 2.21.0) at 2024-07-06 17:29:50 +0000
0'>150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 
/* Copyright (c) 1992, 1999, 2001 John E. Davis
 * This file is part of the S-Lang library.
 *
 * You may distribute under the terms of either the GNU General Public
 * License or the Perl Artistic License.
 */
#include "slinclud.h"

#include "slang.h"
#include "_slang.h"

#ifdef upcase
# undef upcase
#endif

#define upcase(ch) (cs ? ch : UPPER_CASE(ch))

static unsigned char *search_forward (register unsigned char *beg,
				      unsigned char *end,
				      unsigned char *key,
				      register int key_len, int cs, int *ind)
{
   register unsigned char char1;
   unsigned char *pos;
   int j, str_len;
   register unsigned char ch;
   register int db;

   str_len = (int) (end - beg);
   if (str_len < key_len) return (NULL);
   
   if (key_len == 0)
     return NULL;

   char1 = key[key_len - 1];
   beg += (key_len - 1);

   while(1)
     {
	if (cs) while (beg < end)
	  {
	     ch = *beg;
	     db = ind[(unsigned char) ch];
	     if ((db < key_len) && (ch == char1)) break;
	     beg += db; /* ind[(unsigned char) ch]; */
	  }
	else while (beg < end)
	  {
	     ch = *beg;
	     db = ind[(unsigned char) ch];
	     if ((db < key_len) &&
		 (UPPER_CASE(ch) == char1)) break;
	     beg += db; /* ind[(unsigned char) ch]; */
	  }

	if (beg >= end) return(NULL);

	pos = beg - (key_len - 1);
	for (j = 0; j < key_len; j++)
	  {
	     ch = upcase(pos[j]);
	     if (ch != (unsigned char) key[j]) break;
	  }

	if (j == key_len) return(pos);
	beg += 1;
     }
}

static unsigned char *search_backward (unsigned char *beg,unsigned char *end,
				       unsigned char *key, int key_len,
				       int cs, int *ind)
{
   unsigned char ch, char1;
   int j, str_len, ofs;

    str_len = (int) (end - beg);
    if (str_len < key_len) return (NULL);
   
   if (key_len == 0)
     return NULL;
	
   /*  end -= (key_len - 1); */
   end -= key_len;

    char1 = key[0];

    while(1)
      {
	 while ((beg <= end) && (ch = *end, ch = upcase(ch), ch != char1))
	   {
	      ofs = ind[(unsigned char) ch];
#ifdef __MSDOS__
	      /* This is needed for msdos segment wrapping problems */
	      if (beg + ofs > end) return(NULL);
#endif
	      end -= ofs;
	   }
	 if (beg > end) return(NULL);
	 for (j = 1; j < key_len; j++)
	   {
	      ch = upcase(end[j]);
	      if (ch != key[j]) break;
	   }
	 if (j == key_len) return(end);
	 end--;
      }
}

unsigned char *SLsearch (unsigned char *pmin, unsigned char *pmax,
			 SLsearch_Type *st)
{
   if (st->dir > 0) return search_forward (pmin, pmax, st->key,
					   st->key_len, st->cs, st->ind);
   else return search_backward (pmin, pmax, st->key,
				st->key_len, st->cs, st->ind);
}

static int Case_Tables_Ok;

int SLsearch_init (char *str, int dir, int cs, SLsearch_Type *st)
{
   int i, maxi;
   register int max = strlen(str);
   unsigned char *w, *work = st->key;
   register int *indp, *indpm;
   int *ind = st->ind;

   if (max >= (int) sizeof (st->key))
     {
	SLang_doerror ("Search string too long.");
	return -1;
     }

   st->dir = dir; st->cs = cs;

   if (!Case_Tables_Ok) SLang_init_case_tables ();

   if (dir > 0)
     {
	w = work;
     }
   else
     {
	maxi = max - 1;
	str = str + maxi;
	w = work + maxi;
     }

   /* for (i = 0; i < 256; i++) ind[i] = max; */
   indp = ind; indpm = ind + 256;
   while (indp < indpm)
     {
	*indp++ = max;
	*indp++ = max;
	*indp++ = max;
	*indp++ = max;
     }

   i = 0;
   if (cs) while (i < max)
     {
	i++;
	maxi = max - i;
	*w = *str;
	ind[(unsigned char) *str] = maxi;
	str += dir; w += dir;
     }
   else while (i < max)
     {
	i++;
	maxi = max - i;
	*w = UPPER_CASE(*str);
	ind[(unsigned char) *w] = maxi;
	ind[(unsigned char) LOWER_CASE(*str)] = maxi;
	str += dir; w += dir;
     }

   work[max] = 0;
   st->key_len = max;
   return max;
}

/* 8bit clean upper and lowercase macros */
unsigned char _SLChg_LCase_Lut[256];
unsigned char _SLChg_UCase_Lut[256];

void SLang_define_case (int *u, int *l)
{
   unsigned char up = (unsigned char) *u, dn = (unsigned char) *l;

   _SLChg_LCase_Lut[up] = dn;
   _SLChg_LCase_Lut[dn] = dn;
   _SLChg_UCase_Lut[dn] = up;
   _SLChg_UCase_Lut[up] = up;
}

void SLang_init_case_tables (void)
{
   int i, j;
   if (Case_Tables_Ok) return;

   for (i = 0; i < 256; i++)
     {
	_SLChg_UCase_Lut[i] = i;
	_SLChg_LCase_Lut[i] = i;
     }

   for (i = 'A'; i <= 'Z'; i++)
     {
	j = i + 32;
	_SLChg_UCase_Lut[j] = i;
	_SLChg_LCase_Lut[i] = j;
     }
#ifdef PC_SYSTEM
   /* Initialize for DOS code page 437. */
   _SLChg_UCase_Lut[135] = 128; _SLChg_LCase_Lut[128] = 135;
   _SLChg_UCase_Lut[132] = 142; _SLChg_LCase_Lut[142] = 132;
   _SLChg_UCase_Lut[134] = 143; _SLChg_LCase_Lut[143] = 134;
   _SLChg_UCase_Lut[130] = 144; _SLChg_LCase_Lut[144] = 130;
   _SLChg_UCase_Lut[145] = 146; _SLChg_LCase_Lut[146] = 145;
   _SLChg_UCase_Lut[148] = 153; _SLChg_LCase_Lut[153] = 148;
   _SLChg_UCase_Lut[129] = 154; _SLChg_LCase_Lut[154] = 129;
   _SLChg_UCase_Lut[164] = 165; _SLChg_LCase_Lut[165] = 164;
#else
   /* ISO Latin */
   for (i = 192; i <= 221; i++)
     {
	j = i + 32;
	_SLChg_UCase_Lut[j] = i;
	_SLChg_LCase_Lut[i] = j;
     }
   _SLChg_UCase_Lut[215] = 215; _SLChg_LCase_Lut[215] = 215;
   _SLChg_UCase_Lut[223] = 223; _SLChg_LCase_Lut[223] = 223;
   _SLChg_UCase_Lut[247] = 247; _SLChg_LCase_Lut[247] = 247;
   _SLChg_UCase_Lut[255] = 255; _SLChg_LCase_Lut[255] = 255;
#endif
   Case_Tables_Ok = 1;
}
generated by cgit v1.2.1 (git 2.21.0) at 2024-07-06 17:29:50 +0000