{"id":1073,"date":"2019-11-30T18:00:29","date_gmt":"2019-11-30T17:00:29","guid":{"rendered":"http:\/\/pierrard.eu\/programmation\/?p=1073"},"modified":"2022-01-25T11:30:55","modified_gmt":"2022-01-25T10:30:55","slug":"les-chaines-de-caracteres-2","status":"publish","type":"post","link":"https:\/\/pierrard.eu\/programmation\/?p=1073","title":{"rendered":"Les cha\u00eenes de caract\u00e8res"},"content":{"rendered":"\n
  1. D\u00e9claration<\/strong>
    1. var chaine : string<\/strong>;<\/li>
    2. var chaine : string<\/strong>[n]; avec n \u2264 255 <\/li><\/ol><\/li>
    3. Longueur \u21a6 <\/strong> nb_car := Length<\/strong>(chaine);<\/li>
    4. Regroupement <\/strong>de deux cha\u00eenes \u21a6 ch3 := ch1 +<\/strong> ch2;<\/li>
    5. Extraction<\/strong>
      1. Un seul<\/strong> caract\u00e8re \u21a6 car := chaine[i];<\/li>
      2. Plusieurs <\/strong>caract\u00e8res \u21a6 chaine := Copy<\/strong>(chaine,debut,combien); <\/li><\/ol><\/li>
      3. Comparaison <\/strong>de cha\u00eenes \u21a6 ch1 =<\/strong> ch2 ou ch1 <<\/strong> ch2 ou ch1 ><\/strong> ch2 ou …<\/li>
      4. Changement de la casse<\/strong>
        1. Majuscules \u21a6 <\/strong>ch2 := Upcase<\/strong>(chaine);<\/li>
        2. Minuscules \u21a6 <\/strong>ch2 := LowerCase<\/strong>(chaine); <\/li><\/ol><\/li>
        3. Recherche \u21a6 <\/strong>endroit := Pos<\/strong>(ch1,ch2); donne l’endroit o\u00f9 commence ch1 dans ch2<\/li>
        4. Effacement <\/strong>de caract\u00e8res \u21a6 Delete<\/strong>(chaine,debut,combien);<\/li>
        5. Insertion <\/strong>d’un sous-cha\u00eene \u21a6 Insert<\/strong>(ch1,ch2,endroit); ins\u00e8re ch1 dans ch2 \u00e0 la position sp\u00e9cifi\u00e9e<\/li>
        6. Cr\u00e9er une cha\u00eene form\u00e9e du m\u00eame caract\u00e8re \u21a6 chaine := StringOfChar<\/strong>(caractere,combien);<\/li>
        7. Num\u00e9rique <\/strong> \u2194 String<\/strong>
          1. La proc\u00e9dure Str <\/strong>transforme une valeur num\u00e9rique en cha\u00eene \u21a6 <\/strong> Str<\/strong>(127,chaine);<\/li>
          2. La proc\u00e9dure Val <\/strong>transforme une cha\u00eene en valeur num\u00e9rique, si possible \u21a6<\/strong>
            Val <\/strong>(\u2019 25 \u2019 ,i,code);<\/li>
          3. La fonction Chr <\/strong>convertit un code ASCII en caract\u00e8re \u21a6<\/strong> car := Chr<\/strong>(65); <\/li><\/ol><\/li>
          4. StringReplace <\/strong>remplace les occurrences (apparitions) d\u2019une sous-cha\u00eene par une autre dans une cha\u00eene \u21a6<\/strong>
            ch2 := StringReplace<\/strong>(chaine,’no’,’yes’,[rfReplaceAll] );<\/li><\/ol>\n\n\n\n

            <\/p>\n","protected":false},"excerpt":{"rendered":"

            D\u00e9claration var chaine : string; var chaine : string[n]; avec n \u2264 255 Longueur \u21a6 nb_car := Length(chaine); Regroupement de deux cha\u00eenes \u21a6 ch3 := ch1 + ch2; Extraction Un seul caract\u00e8re \u21a6 car := chaine[i]; Plusieurs caract\u00e8res \u21a6 chaine := Copy(chaine,debut,combien); Comparaison de cha\u00eenes \u21a6 ch1 = ch2 ou ch1 < ch2 ou ch1 > ch2 ou … Changement de la casse Majuscules \u21a6 ch2 := Upcase(chaine); Minuscules \u21a6 ch2 := LowerCase(chaine); Recherche \u21a6 endroit := Pos(ch1,ch2); donne l’endroit…<\/p>\n

            Lire la suite Lire la suite<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[2],"tags":[],"class_list":["post-1073","post","type-post","status-publish","format-standard","hentry","category-cinquieme"],"_links":{"self":[{"href":"https:\/\/pierrard.eu\/programmation\/index.php?rest_route=\/wp\/v2\/posts\/1073","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/pierrard.eu\/programmation\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/pierrard.eu\/programmation\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/pierrard.eu\/programmation\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/pierrard.eu\/programmation\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1073"}],"version-history":[{"count":15,"href":"https:\/\/pierrard.eu\/programmation\/index.php?rest_route=\/wp\/v2\/posts\/1073\/revisions"}],"predecessor-version":[{"id":1102,"href":"https:\/\/pierrard.eu\/programmation\/index.php?rest_route=\/wp\/v2\/posts\/1073\/revisions\/1102"}],"wp:attachment":[{"href":"https:\/\/pierrard.eu\/programmation\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1073"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/pierrard.eu\/programmation\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1073"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/pierrard.eu\/programmation\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1073"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}