summaryrefslogtreecommitdiffstats
path: root/urpmi.update
Commit message (Expand)AuthorAgeFilesLines
* One steps towards -T complianceRafael Garcia-Suarez2005-06-281-0/+3
* s/Mandrake/Mandriva/Pablo Saratxaga2005-04-251-1/+1
* Print usage messages to stdout, not stderrRafael Garcia-Suarez2005-02-011-1/+1
* let perl_checker be able to update translation catalogsThierry Vignaud2004-12-131-2/+2
* While we're at it, implement --no-ignore and make it work with -aRafael Garcia-Suarez2004-12-031-5/+7
* Add an --ignore option to urpmi.updateRafael Garcia-Suarez2004-12-031-31/+38
* Implement a new option, --norebuild, to urpmi, urpmi.update and urpmi.addmedia.Rafael Garcia-Suarez2004-10-141-0/+1
* Add options -q and -v (quiet and verbose) to urpmi.updateRafael Garcia-Suarez2004-07-271-1/+5
* Copyright updatesRafael Garcia-Suarez2004-07-221-1/+1
* changed MandrakeSoft -> MandrakesoftPablo Saratxaga2004-07-201-1/+1
* More checks for root capabilitiesRafael Garcia-Suarez2004-07-131-0/+3
* Some more cleanup and refactorization.Rafael Garcia-Suarez2004-04-191-1/+2
* Some more options refactorisation. The --from option of urpmi.addmediaRafael Garcia-Suarez2004-04-191-2/+2
* Factorize the message/prompt/I18N code of urpm* in a separate moduleRafael Garcia-Suarez2004-04-141-0/+1
* Factorize the code to handle command-line options for the urpm* toolsRafael Garcia-Suarez2004-04-131-39/+17
* fix --wget and --curl in urpmi.updateOlivier Blin2004-01-281-5/+2
* - 4.48Olivier Thauvin2003-12-241-0/+2
* fixed small options being blocking long options.Francois Pons2003-12-051-7/+7
* added --no-md5sum in help section of urpmi.update.Francois Pons2003-12-051-0/+1
* 4.4-31mdkFrancois Pons2003-09-041-2/+2
* 4.4-19mdkFrancois Pons2003-08-061-0/+1
* 4.3-5mdkFrancois Pons2003-04-221-1/+1
* 4.2-31mdkFrancois Pons2003-03-101-3/+3
* fixed newer export methodology.Francois Pons2003-03-061-3/+0
* changed name of _() function to N()Pablo Saratxaga2003-03-051-18/+18
* 4.2-24mdkFrancois Pons2003-02-271-0/+3
* 4.2-16mdkFrancois Pons2003-01-291-0/+2
* add --limit-rate support to urpmi, urpmi.addmedia and urpmi.updateFrancois Pons2003-01-241-0/+2
* 4.2-9mdkFrancois Pons2003-01-231-1/+1
* 4.1-3mdkFrancois Pons2002-11-281-6/+12
* 4.0-22mdkFrancois Pons2002-10-251-5/+6
* 4.0-13mdkFrancois Pons2002-09-051-1/+1
* 3.7-5mdkFrancois Pons2002-07-161-5/+7
* 3.7-3mdkFrancois Pons2002-07-111-0/+16
* 3.6-4mdkFrancois Pons2002-06-281-2/+5
* 3.2-4mdkFrancois Pons2002-01-281-4/+4
* corrected some English typosPablo Saratxaga2001-12-101-6/+6
* 3.0 of urpmi.Francois Pons2001-12-061-1/+0
* 2.2 with rpmtools 4.0.Francois Pons2001-12-051-6/+7
* updated pot filePablo Saratxaga2001-12-031-5/+5
* curl supportFrancois Pons2001-11-271-5/+10
* update to first 2.0 release.Francois Pons2001-11-061-0/+1
* new algorithm for searching packages.Francois Pons2001-06-251-2/+3
* *** empty log message ***Francois Pons2001-06-211-12/+5
* *** empty log message ***Francois Pons2001-04-101-0/+2
* Updated Finnish filePablo Saratxaga2001-04-041-2/+1
* *** empty log message ***Francois Pons2001-04-031-1/+6
* *** empty log message ***Francois Pons2001-03-261-1/+2
* updated Danish filePablo Saratxaga2001-02-261-1/+1
* *** empty log message ***Francois Pons2001-02-161-3/+12
generated by cgit v1.2.1 (git 2.21.0) at 2024-07-13 02:52:35 +0000
pan class="hl opt">((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-13 02:52:34 +0000