1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62
|
static string Replace(string cChaine, string cCherche, string cRemplace, int? nDebut, int? nCompte)
{
if (cRemplace == null)
cRemplace = string.Empty;
bool lFirstParam = nDebut != null && nDebut != 1;
bool lSecondParam = nCompte != null;
if (nCompte == 0)
return cChaine;
if (lFirstParam && lSecondParam)
{
int j = -1;
for (int i = 0; i < nDebut; i++)
{
int j2 = cChaine.IndexOf(cCherche, j + 1);
if (j2 < j)
return cChaine;
j = j2;
}
int k = j - 1;
for (int i = 0; i < nCompte; i++)
{
int k2 = cChaine.IndexOf(cCherche, k + 1);
if (k2 < k)
return string.Concat(cChaine.Substring(0, j), cChaine.Substring(j).Replace(cCherche, cRemplace));
k = k2;
}
if (k > j)
k += cCherche.Length;
return string.Concat(cChaine.Substring(0, j), cChaine.Substring(j, k - j).Replace(cCherche, cRemplace), cChaine.Substring(k));
}
else if (lFirstParam)
{
int j = -1;
for (int i = 0; i < nDebut; i++)
{
int j2 = cChaine.IndexOf(cCherche, j + 1);
if (j2 < j)
return cChaine;
j = j2;
}
return string.Concat(cChaine.Substring(0, j), cChaine.Substring(j).Replace(cCherche, cRemplace));
}
else if (lSecondParam)
{
int k = -1;
for (int i = 0; i < nCompte; i++)
{
int k2 = cChaine.IndexOf(cCherche, k + 1);
if (k2 < k)
return cChaine.Replace(cCherche, cRemplace);
k = k2;
}
k += cCherche.Length;
return string.Concat(cChaine.Substring(0, k).Replace(cCherche, cRemplace), cChaine.Substring(k));
}
else
return cChaine.Replace(cCherche, cRemplace);
} |
Partager