[{"data":1,"prerenderedAt":1256},["ShallowReactive",2],{"navigation":3,"\u002Fsnt-2nde\u002Fzz-demo-widgets\u002Fwidgets-manipulation":585,"\u002Fsnt-2nde\u002Fzz-demo-widgets\u002Fwidgets-manipulation__counterpart":1249,"\u002Fsnt-2nde\u002Fzz-demo-widgets\u002Fwidgets-manipulation__slides":1249,"annexes-memo:\u002Fsnt-2nde\u002Fzz-demo-widgets\u002Fwidgets-manipulation":1249,"annexes-slides:\u002Fsnt-2nde\u002Fzz-demo-widgets\u002Fwidgets-manipulation":1249},[4,224,440],{"title":5,"path":6,"stem":7,"children":8},"SNT — Seconde","\u002Fsnt-2nde","0.snt-2nde\u002F0.index",[9,10,14,36,66,92,118,144,162,184,206],{"title":5,"path":6,"stem":7},{"title":11,"path":12,"stem":13},"REVIEW pédagogique — SNT 2nde","\u002Fsnt-2nde\u002Freview","0.snt-2nde\u002FREVIEW",{"title":15,"path":16,"stem":17,"children":18},"Internet","\u002Fsnt-2nde\u002Fsa-internet","0.snt-2nde\u002Fsa-internet\u002F0.index",[19,20,24,28,32],{"title":15,"path":16,"stem":17},{"title":21,"path":22,"stem":23},"Adresses symboliques et DNS","\u002Fsnt-2nde\u002Fsa-internet\u002Fadresses-dns","0.snt-2nde\u002Fsa-internet\u002F1.adresses-dns",{"title":25,"path":26,"stem":27},"Internet et les réseaux physiques","\u002Fsnt-2nde\u002Fsa-internet\u002Freseaux-physiques","0.snt-2nde\u002Fsa-internet\u002F2.reseaux-physiques",{"title":29,"path":30,"stem":31},"Protocoles TCP\u002FIP et routage des paquets","\u002Fsnt-2nde\u002Fsa-internet\u002Ftcp-ip-routage","0.snt-2nde\u002Fsa-internet\u002F3.tcp-ip-routage",{"title":33,"path":34,"stem":35},"Réseaux pair-à-pair","\u002Fsnt-2nde\u002Fsa-internet\u002Fpair-a-pair","0.snt-2nde\u002Fsa-internet\u002F4.pair-a-pair",{"title":37,"path":38,"stem":39,"children":40},"Le Web","\u002Fsnt-2nde\u002Fsb-web","0.snt-2nde\u002Fsb-web\u002F0.index",[41,42,46,50,54,58,62],{"title":37,"path":38,"stem":39},{"title":43,"path":44,"stem":45},"Histoire du Web","\u002Fsnt-2nde\u002Fsb-web\u002Fhistoire-web","0.snt-2nde\u002Fsb-web\u002F1.histoire-web",{"title":47,"path":48,"stem":49},"URL et hypertexte","\u002Fsnt-2nde\u002Fsb-web\u002Furl-hypertexte","0.snt-2nde\u002Fsb-web\u002F2.url-hypertexte",{"title":51,"path":52,"stem":53},"HTML et CSS — le contenu et la présentation","\u002Fsnt-2nde\u002Fsb-web\u002Fhtml-css","0.snt-2nde\u002Fsb-web\u002F3.html-css",{"title":55,"path":56,"stem":57},"Client-serveur et requêtes HTTP","\u002Fsnt-2nde\u002Fsb-web\u002Fclient-serveur-http","0.snt-2nde\u002Fsb-web\u002F4.client-serveur-http",{"title":59,"path":60,"stem":61},"Moteurs de recherche","\u002Fsnt-2nde\u002Fsb-web\u002Fmoteurs-recherche","0.snt-2nde\u002Fsb-web\u002F5.moteurs-recherche",{"title":63,"path":64,"stem":65},"Sécurité du navigateur et notions juridiques","\u002Fsnt-2nde\u002Fsb-web\u002Fsecurite-droits","0.snt-2nde\u002Fsb-web\u002F6.securite-droits",{"title":67,"path":68,"stem":69,"children":70},"Les réseaux sociaux","\u002Fsnt-2nde\u002Fsc-reseaux-sociaux","0.snt-2nde\u002Fsc-reseaux-sociaux\u002F0.index",[71,72,76,80,84,88],{"title":67,"path":68,"stem":69},{"title":73,"path":74,"stem":75},"Panorama des réseaux sociaux","\u002Fsnt-2nde\u002Fsc-reseaux-sociaux\u002Fpanorama-rs","0.snt-2nde\u002Fsc-reseaux-sociaux\u002F1.panorama-rs",{"title":77,"path":78,"stem":79},"Identité numérique et authentification","\u002Fsnt-2nde\u002Fsc-reseaux-sociaux\u002Fidentite-numerique","0.snt-2nde\u002Fsc-reseaux-sociaux\u002F2.identite-numerique",{"title":81,"path":82,"stem":83},"Le modèle économique des réseaux sociaux","\u002Fsnt-2nde\u002Fsc-reseaux-sociaux\u002Fmodele-economique","0.snt-2nde\u002Fsc-reseaux-sociaux\u002F3.modele-economique",{"title":85,"path":86,"stem":87},"Petit monde et graphes","\u002Fsnt-2nde\u002Fsc-reseaux-sociaux\u002Fpetit-monde-graphes","0.snt-2nde\u002Fsc-reseaux-sociaux\u002F4.petit-monde-graphes",{"title":89,"path":90,"stem":91},"La cyberviolence","\u002Fsnt-2nde\u002Fsc-reseaux-sociaux\u002Fcyberviolence","0.snt-2nde\u002Fsc-reseaux-sociaux\u002F5.cyberviolence",{"title":93,"path":94,"stem":95,"children":96},"Les données structurées et leur traitement","\u002Fsnt-2nde\u002Fsd-donnees-structurees","0.snt-2nde\u002Fsd-donnees-structurees\u002F0.index",[97,98,102,106,110,114],{"title":93,"path":94,"stem":95},{"title":99,"path":100,"stem":101},"Données et formats","\u002Fsnt-2nde\u002Fsd-donnees-structurees\u002Fdonnees-formats","0.snt-2nde\u002Fsd-donnees-structurees\u002F1.donnees-formats",{"title":103,"path":104,"stem":105},"Données structurées","\u002Fsnt-2nde\u002Fsd-donnees-structurees\u002Fdonnees-structurees","0.snt-2nde\u002Fsd-donnees-structurees\u002F2.donnees-structurees",{"title":107,"path":108,"stem":109},"Métadonnées","\u002Fsnt-2nde\u002Fsd-donnees-structurees\u002Fmetadonnees","0.snt-2nde\u002Fsd-donnees-structurees\u002F3.metadonnees",{"title":111,"path":112,"stem":113},"Traitement de tables","\u002Fsnt-2nde\u002Fsd-donnees-structurees\u002Ftraitement-tables","0.snt-2nde\u002Fsd-donnees-structurees\u002F4.traitement-tables",{"title":115,"path":116,"stem":117},"Le cloud","\u002Fsnt-2nde\u002Fsd-donnees-structurees\u002Fcloud","0.snt-2nde\u002Fsd-donnees-structurees\u002F5.cloud",{"title":119,"path":120,"stem":121,"children":122},"Localisation, cartographie et mobilité","\u002Fsnt-2nde\u002Fse-localisation-cartographie","0.snt-2nde\u002Fse-localisation-cartographie\u002F0.index",[123,124,128,132,136,140],{"title":119,"path":120,"stem":121},{"title":125,"path":126,"stem":127},"GPS et Galileo — se situer grâce aux satellites","\u002Fsnt-2nde\u002Fse-localisation-cartographie\u002Fgps-galileo","0.snt-2nde\u002Fse-localisation-cartographie\u002F1.gps-galileo",{"title":129,"path":130,"stem":131},"Décoder une trame NMEA","\u002Fsnt-2nde\u002Fse-localisation-cartographie\u002Ftrame-nmea","0.snt-2nde\u002Fse-localisation-cartographie\u002F2.trame-nmea",{"title":133,"path":134,"stem":135},"Cartes numériques — GeoPortail et OpenStreetMap","\u002Fsnt-2nde\u002Fse-localisation-cartographie\u002Fcartes-numeriques","0.snt-2nde\u002Fse-localisation-cartographie\u002F3.cartes-numeriques",{"title":137,"path":138,"stem":139},"Itinéraires et graphes","\u002Fsnt-2nde\u002Fse-localisation-cartographie\u002Fitineraires-graphes","0.snt-2nde\u002Fse-localisation-cartographie\u002F4.itineraires-graphes",{"title":141,"path":142,"stem":143},"Confidentialité de la position","\u002Fsnt-2nde\u002Fse-localisation-cartographie\u002Fconfidentialite-position","0.snt-2nde\u002Fse-localisation-cartographie\u002F5.confidentialite-position",{"title":145,"path":146,"stem":147,"children":148},"Informatique embarquée et objets connectés","\u002Fsnt-2nde\u002Fsf-info-embarquee","0.snt-2nde\u002Fsf-info-embarquee\u002F0.index",[149,150,154,158],{"title":145,"path":146,"stem":147},{"title":151,"path":152,"stem":153},"Systèmes informatiques embarqués","\u002Fsnt-2nde\u002Fsf-info-embarquee\u002Fsystemes-embarques","0.snt-2nde\u002Fsf-info-embarquee\u002F1.systemes-embarques",{"title":155,"path":156,"stem":157},"Capteurs et actionneurs","\u002Fsnt-2nde\u002Fsf-info-embarquee\u002Fcapteurs-actionneurs","0.snt-2nde\u002Fsf-info-embarquee\u002F2.capteurs-actionneurs",{"title":159,"path":160,"stem":161},"IHM et objets connectés","\u002Fsnt-2nde\u002Fsf-info-embarquee\u002Fihm-objet-connecte","0.snt-2nde\u002Fsf-info-embarquee\u002F3.ihm-objet-connecte",{"title":163,"path":164,"stem":165,"children":166},"Photographie numérique","\u002Fsnt-2nde\u002Fsg-photo-numerique","0.snt-2nde\u002Fsg-photo-numerique\u002F0.index",[167,168,172,176,180],{"title":163,"path":164,"stem":165},{"title":169,"path":170,"stem":171},"Photosites, pixels et résolution","\u002Fsnt-2nde\u002Fsg-photo-numerique\u002Fpixels-resolution","0.snt-2nde\u002Fsg-photo-numerique\u002F1.pixels-resolution",{"title":173,"path":174,"stem":175},"Les algorithmes de l'appareil photo","\u002Fsnt-2nde\u002Fsg-photo-numerique\u002Falgorithmes-photo","0.snt-2nde\u002Fsg-photo-numerique\u002F2.algorithmes-photo",{"title":177,"path":178,"stem":179},"Les métadonnées EXIF","\u002Fsnt-2nde\u002Fsg-photo-numerique\u002Fmetadonnees-exif","0.snt-2nde\u002Fsg-photo-numerique\u002F3.metadonnees-exif",{"title":181,"path":182,"stem":183},"Traiter une image en Python","\u002Fsnt-2nde\u002Fsg-photo-numerique\u002Ftraitement-rgb","0.snt-2nde\u002Fsg-photo-numerique\u002F4.traitement-rgb",{"title":185,"path":186,"stem":187,"children":188},"Notions transversales de programmation","\u002Fsnt-2nde\u002Fsh-prog-notions","0.snt-2nde\u002Fsh-prog-notions\u002F0.index",[189,190,194,198,202],{"title":185,"path":186,"stem":187},{"title":191,"path":192,"stem":193},"Séquences d'instructions et variables","\u002Fsnt-2nde\u002Fsh-prog-notions\u002Fsequences-affectations","0.snt-2nde\u002Fsh-prog-notions\u002F1.sequences-affectations",{"title":195,"path":196,"stem":197},"Instructions conditionnelles","\u002Fsnt-2nde\u002Fsh-prog-notions\u002Fconditionnelles","0.snt-2nde\u002Fsh-prog-notions\u002F2.conditionnelles",{"title":199,"path":200,"stem":201},"Boucles bornées et non bornées","\u002Fsnt-2nde\u002Fsh-prog-notions\u002Fboucles","0.snt-2nde\u002Fsh-prog-notions\u002F3.boucles",{"title":203,"path":204,"stem":205},"Définitions et appels de fonctions","\u002Fsnt-2nde\u002Fsh-prog-notions\u002Ffonctions","0.snt-2nde\u002Fsh-prog-notions\u002F4.fonctions",{"title":207,"path":208,"stem":209,"children":210},"Démo des widgets MDC","\u002Fsnt-2nde\u002Fzz-demo-widgets","0.snt-2nde\u002Fzz-demo-widgets\u002F0.index",[211,212,216,220],{"title":207,"path":208,"stem":209},{"title":213,"path":214,"stem":215},"Démo statique — callouts, code, BO, illustration","\u002Fsnt-2nde\u002Fzz-demo-widgets\u002Fstatique","0.snt-2nde\u002Fzz-demo-widgets\u002F1.statique",{"title":217,"path":218,"stem":219},"Démo interactive — self-eval et python-snippet","\u002Fsnt-2nde\u002Fzz-demo-widgets\u002Finteractif","0.snt-2nde\u002Fzz-demo-widgets\u002F2.interactif",{"title":221,"path":222,"stem":223},"Démo · 14 widgets de manipulation NSI","\u002Fsnt-2nde\u002Fzz-demo-widgets\u002Fwidgets-manipulation","0.snt-2nde\u002Fzz-demo-widgets\u002F3.widgets-manipulation",{"title":225,"path":226,"stem":227,"children":228},"NSI — Première","\u002Fnsi-1ere","1.nsi-1ere\u002F0.index",[229,230,234,256,282,304,328,354,380,410],{"title":225,"path":226,"stem":227},{"title":231,"path":232,"stem":233},"Relecture pédagogique — 8 chapitres NSI 1ère (PA → PH)","\u002Fnsi-1ere\u002Freview","1.nsi-1ere\u002FREVIEW",{"title":235,"path":236,"stem":237,"children":238},"Histoire de l'informatique","\u002Fnsi-1ere\u002Fpa-histoire-info","1.nsi-1ere\u002Fpa-histoire-info\u002F0.index",[239,240,244,248,252],{"title":235,"path":236,"stem":237},{"title":241,"path":242,"stem":243},"De la préantiquité aux machines à calculer","\u002Fnsi-1ere\u002Fpa-histoire-info\u002Fpreantiquite-aux-machines","1.nsi-1ere\u002Fpa-histoire-info\u002F1.preantiquite-aux-machines",{"title":245,"path":246,"stem":247},"La machine universelle (1930-1950)","\u002Fnsi-1ere\u002Fpa-histoire-info\u002Fmachine-universelle","1.nsi-1ere\u002Fpa-histoire-info\u002F2.machine-universelle",{"title":249,"path":250,"stem":251},"Les ordinateurs modernes (1947-1990)","\u002Fnsi-1ere\u002Fpa-histoire-info\u002Fordinateurs-modernes","1.nsi-1ere\u002Fpa-histoire-info\u002F3.ordinateurs-modernes",{"title":253,"path":254,"stem":255},"Réseaux, Web et IA (1969 à aujourd'hui)","\u002Fnsi-1ere\u002Fpa-histoire-info\u002Freseaux-et-web","1.nsi-1ere\u002Fpa-histoire-info\u002F4.reseaux-et-web",{"title":257,"path":258,"stem":259,"children":260},"Représentation des données — types et valeurs","\u002Fnsi-1ere\u002Fpb-types-valeurs","1.nsi-1ere\u002Fpb-types-valeurs\u002F0.index",[261,262,266,270,274,278],{"title":257,"path":258,"stem":259},{"title":263,"path":264,"stem":265},"Bases de numération et entiers positifs","\u002Fnsi-1ere\u002Fpb-types-valeurs\u002Fbases-entiers-positifs","1.nsi-1ere\u002Fpb-types-valeurs\u002F1.bases-entiers-positifs",{"title":267,"path":268,"stem":269},"Entiers relatifs et complément à deux","\u002Fnsi-1ere\u002Fpb-types-valeurs\u002Fentiers-relatifs","1.nsi-1ere\u002Fpb-types-valeurs\u002F2.entiers-relatifs",{"title":271,"path":272,"stem":273},"Nombres flottants et virgule flottante","\u002Fnsi-1ere\u002Fpb-types-valeurs\u002Fflottants","1.nsi-1ere\u002Fpb-types-valeurs\u002F3.flottants",{"title":275,"path":276,"stem":277},"Textes et encodages — ASCII, ISO-8859-1, Unicode","\u002Fnsi-1ere\u002Fpb-types-valeurs\u002Ftextes-encodages","1.nsi-1ere\u002Fpb-types-valeurs\u002F4.textes-encodages",{"title":279,"path":280,"stem":281},"Valeurs booléennes et opérateurs logiques","\u002Fnsi-1ere\u002Fpb-types-valeurs\u002Fbooleens","1.nsi-1ere\u002Fpb-types-valeurs\u002F5.booleens",{"title":283,"path":284,"stem":285,"children":286},"Représentation des données : types construits","\u002Fnsi-1ere\u002Fpc-types-construits","1.nsi-1ere\u002Fpc-types-construits\u002F0.index",[287,288,292,296,300],{"title":283,"path":284,"stem":285},{"title":289,"path":290,"stem":291},"Tableaux et listes","\u002Fnsi-1ere\u002Fpc-types-construits\u002Ftableaux-listes","1.nsi-1ere\u002Fpc-types-construits\u002F1.tableaux-listes",{"title":293,"path":294,"stem":295},"Listes en compréhension","\u002Fnsi-1ere\u002Fpc-types-construits\u002Fcomprehension","1.nsi-1ere\u002Fpc-types-construits\u002F2.comprehension",{"title":297,"path":298,"stem":299},"Tuples et p-uplets nommés","\u002Fnsi-1ere\u002Fpc-types-construits\u002Ftuples","1.nsi-1ere\u002Fpc-types-construits\u002F3.tuples",{"title":301,"path":302,"stem":303},"Dictionnaires","\u002Fnsi-1ere\u002Fpc-types-construits\u002Fdictionnaires","1.nsi-1ere\u002Fpc-types-construits\u002F4.dictionnaires",{"title":305,"path":306,"stem":307,"children":308},"Traitement de données en tables","\u002Fnsi-1ere\u002Fpd-tables-donnees","1.nsi-1ere\u002Fpd-tables-donnees\u002F0.index",[309,310,314,318,322],{"title":305,"path":306,"stem":307},{"title":311,"path":312,"stem":313},"Tables et CSV","\u002Fnsi-1ere\u002Fpd-tables-donnees\u002Ftables-csv","1.nsi-1ere\u002Fpd-tables-donnees\u002F1.tables-csv",{"title":315,"path":316,"stem":317},"Recherche et filtrage","\u002Fnsi-1ere\u002Fpd-tables-donnees\u002Frecherche","1.nsi-1ere\u002Fpd-tables-donnees\u002F2.recherche",{"title":319,"path":320,"stem":321},"Trier une table","\u002Fnsi-1ere\u002Fpd-tables-donnees\u002Ftri","1.nsi-1ere\u002Fpd-tables-donnees\u002F3.tri",{"title":323,"path":324,"stem":325,"children":326},"Fusion et indexation","\u002Fnsi-1ere\u002Fpd-tables-donnees\u002Ffusion-indexation","1.nsi-1ere\u002Fpd-tables-donnees\u002F4.fusion-indexation",[327],{"title":323,"path":324,"stem":325},{"title":329,"path":330,"stem":331,"children":332},"IHM sur le Web","\u002Fnsi-1ere\u002Fpe-ihm-web","1.nsi-1ere\u002Fpe-ihm-web\u002F0.index",[333,334,338,342,346,350],{"title":329,"path":330,"stem":331},{"title":335,"path":336,"stem":337},"HTML et CSS — rappel de structure","\u002Fnsi-1ere\u002Fpe-ihm-web\u002Fhtml-css-bases","1.nsi-1ere\u002Fpe-ihm-web\u002F1.html-css-bases",{"title":339,"path":340,"stem":341},"Formulaires HTML","\u002Fnsi-1ere\u002Fpe-ihm-web\u002Fformulaires","1.nsi-1ere\u002Fpe-ihm-web\u002F2.formulaires",{"title":343,"path":344,"stem":345},"Événements JavaScript","\u002Fnsi-1ere\u002Fpe-ihm-web\u002Fevenements-js","1.nsi-1ere\u002Fpe-ihm-web\u002F3.evenements-js",{"title":347,"path":348,"stem":349},"Manipulation du DOM","\u002Fnsi-1ere\u002Fpe-ihm-web\u002Fdom-interaction","1.nsi-1ere\u002Fpe-ihm-web\u002F4.dom-interaction",{"title":351,"path":352,"stem":353},"Client, serveur et HTTP","\u002Fnsi-1ere\u002Fpe-ihm-web\u002Fclient-serveur-http","1.nsi-1ere\u002Fpe-ihm-web\u002F5.client-serveur-http",{"title":355,"path":356,"stem":357,"children":358},"Architectures matérielles et systèmes d'exploitation","\u002Fnsi-1ere\u002Fpf-archi-os","1.nsi-1ere\u002Fpf-archi-os\u002F0.index",[359,360,364,368,372,376],{"title":355,"path":356,"stem":357},{"title":361,"path":362,"stem":363},"Le modèle de von Neumann","\u002Fnsi-1ere\u002Fpf-archi-os\u002Fvon-neumann","1.nsi-1ere\u002Fpf-archi-os\u002F1.von-neumann",{"title":365,"path":366,"stem":367},"Périphériques et interface homme-machine","\u002Fnsi-1ere\u002Fpf-archi-os\u002Fperipheriques-ihm","1.nsi-1ere\u002Fpf-archi-os\u002F2.peripheriques-ihm",{"title":369,"path":370,"stem":371},"Les systèmes d'exploitation","\u002Fnsi-1ere\u002Fpf-archi-os\u002Fsystemes-exploitation","1.nsi-1ere\u002Fpf-archi-os\u002F3.systemes-exploitation",{"title":373,"path":374,"stem":375},"Linux et le shell","\u002Fnsi-1ere\u002Fpf-archi-os\u002Flinux-shell","1.nsi-1ere\u002Fpf-archi-os\u002F4.linux-shell",{"title":377,"path":378,"stem":379},"Réseaux et protocoles","\u002Fnsi-1ere\u002Fpf-archi-os\u002Freseaux","1.nsi-1ere\u002Fpf-archi-os\u002F5.reseaux",{"title":381,"path":382,"stem":383,"children":384},"Langages et programmation","\u002Fnsi-1ere\u002Fpg-langages-prog","1.nsi-1ere\u002Fpg-langages-prog\u002F0.index",[385,386,390,394,398,402,406],{"title":381,"path":382,"stem":383},{"title":387,"path":388,"stem":389},"Diversité et unité des langages de programmation","\u002Fnsi-1ere\u002Fpg-langages-prog\u002Fdiversite-langages","1.nsi-1ere\u002Fpg-langages-prog\u002F1.diversite-langages",{"title":391,"path":392,"stem":393},"Constructions élémentaires","\u002Fnsi-1ere\u002Fpg-langages-prog\u002Fconstructions-elementaires","1.nsi-1ere\u002Fpg-langages-prog\u002F2.constructions-elementaires",{"title":395,"path":396,"stem":397},"Fonctions","\u002Fnsi-1ere\u002Fpg-langages-prog\u002Ffonctions","1.nsi-1ere\u002Fpg-langages-prog\u002F3.fonctions",{"title":399,"path":400,"stem":401},"Spécification d'une fonction","\u002Fnsi-1ere\u002Fpg-langages-prog\u002Fspecification","1.nsi-1ere\u002Fpg-langages-prog\u002F4.specification",{"title":403,"path":404,"stem":405},"Mise au point des programmes","\u002Fnsi-1ere\u002Fpg-langages-prog\u002Fmise-au-point","1.nsi-1ere\u002Fpg-langages-prog\u002F5.mise-au-point",{"title":407,"path":408,"stem":409},"Utilisation de bibliothèques","\u002Fnsi-1ere\u002Fpg-langages-prog\u002Fbibliotheques","1.nsi-1ere\u002Fpg-langages-prog\u002F6.bibliotheques",{"title":411,"path":412,"stem":413,"children":414},"Algorithmique","\u002Fnsi-1ere\u002Fph-algorithmique","1.nsi-1ere\u002Fph-algorithmique\u002F0.index",[415,416,420,424,428,432,436],{"title":411,"path":412,"stem":413},{"title":417,"path":418,"stem":419},"Parcours séquentiel d'un tableau","\u002Fnsi-1ere\u002Fph-algorithmique\u002Fparcours-sequentiel","1.nsi-1ere\u002Fph-algorithmique\u002F1.parcours-sequentiel",{"title":421,"path":422,"stem":423},"Bases de la complexité","\u002Fnsi-1ere\u002Fph-algorithmique\u002Fcomplexite-bases","1.nsi-1ere\u002Fph-algorithmique\u002F2.complexite-bases",{"title":425,"path":426,"stem":427},"Tris par sélection et par insertion","\u002Fnsi-1ere\u002Fph-algorithmique\u002Ftris","1.nsi-1ere\u002Fph-algorithmique\u002F3.tris",{"title":429,"path":430,"stem":431},"Recherche dichotomique","\u002Fnsi-1ere\u002Fph-algorithmique\u002Fdichotomie","1.nsi-1ere\u002Fph-algorithmique\u002F4.dichotomie",{"title":433,"path":434,"stem":435},"Algorithmes gloutons","\u002Fnsi-1ere\u002Fph-algorithmique\u002Fgloutons","1.nsi-1ere\u002Fph-algorithmique\u002F5.gloutons",{"title":437,"path":438,"stem":439},"Les k plus proches voisins (k-NN)","\u002Fnsi-1ere\u002Fph-algorithmique\u002Fknn","1.nsi-1ere\u002Fph-algorithmique\u002F6.knn",{"title":441,"path":442,"stem":443,"children":444},"NSI — Terminale","\u002Fnsi-tale","2.nsi-tale\u002F0.index",[445,446,450,476,498,536,560],{"title":441,"path":442,"stem":443},{"title":447,"path":448,"stem":449},"Review pédagogique — chapitres NSI Terminale (TA, TB, TC, TD, TE)","\u002Fnsi-tale\u002Freview","2.nsi-tale\u002FREVIEW",{"title":451,"path":452,"stem":453,"children":454},"Structures de données","\u002Fnsi-tale\u002Fta-structures-donnees","2.nsi-tale\u002Fta-structures-donnees\u002F0.index",[455,456,460,464,468,472],{"title":451,"path":452,"stem":453},{"title":457,"path":458,"stem":459},"Objet, classe, interface","\u002Fnsi-tale\u002Fta-structures-donnees\u002Finterface-implementation","2.nsi-tale\u002Fta-structures-donnees\u002F1.interface-implementation",{"title":461,"path":462,"stem":463},"Implémenter une structure — l'exemple de la file FIFO","\u002Fnsi-tale\u002Fta-structures-donnees\u002Fimplementer-une-structure","2.nsi-tale\u002Fta-structures-donnees\u002F2.implementer-une-structure",{"title":465,"path":466,"stem":467},"Listes, piles, files, dictionnaires","\u002Fnsi-tale\u002Fta-structures-donnees\u002Flistes-piles-files-dict","2.nsi-tale\u002Fta-structures-donnees\u002F3.listes-piles-files-dict",{"title":469,"path":470,"stem":471},"Arbres binaires","\u002Fnsi-tale\u002Fta-structures-donnees\u002Farbres-binaires","2.nsi-tale\u002Fta-structures-donnees\u002F4.arbres-binaires",{"title":473,"path":474,"stem":475},"Graphes","\u002Fnsi-tale\u002Fta-structures-donnees\u002Fgraphes","2.nsi-tale\u002Fta-structures-donnees\u002F5.graphes",{"title":477,"path":478,"stem":479,"children":480},"Bases de données","\u002Fnsi-tale\u002Ftb-bases-de-donnees","2.nsi-tale\u002Ftb-bases-de-donnees\u002F0.index",[481,482,486,490,494],{"title":477,"path":478,"stem":479},{"title":483,"path":484,"stem":485},"Le modèle relationnel","\u002Fnsi-tale\u002Ftb-bases-de-donnees\u002Fmodele-relationnel","2.nsi-tale\u002Ftb-bases-de-donnees\u002F1.modele-relationnel",{"title":487,"path":488,"stem":489},"Bases de données relationnelles et anomalies de schéma","\u002Fnsi-tale\u002Ftb-bases-de-donnees\u002Fbase-relationnelle","2.nsi-tale\u002Ftb-bases-de-donnees\u002F2.base-relationnelle",{"title":491,"path":492,"stem":493},"Le langage SQL","\u002Fnsi-tale\u002Ftb-bases-de-donnees\u002Fsql","2.nsi-tale\u002Ftb-bases-de-donnees\u002F3.sql",{"title":495,"path":496,"stem":497},"Les systèmes de gestion de bases de données","\u002Fnsi-tale\u002Ftb-bases-de-donnees\u002Fsgbd","2.nsi-tale\u002Ftb-bases-de-donnees\u002F4.sgbd",{"title":499,"path":500,"stem":501,"children":502},"Architectures matérielles, systèmes d'exploitation et réseaux","\u002Fnsi-tale\u002Ftc-archi-os-reseaux","2.nsi-tale\u002Ftc-archi-os-reseaux\u002F0.index",[503,504,508,512,516,520,524,528,532],{"title":499,"path":500,"stem":501},{"title":505,"path":506,"stem":507},"Le système sur puce (SoC)","\u002Fnsi-tale\u002Ftc-archi-os-reseaux\u002Fsysteme-sur-puce","2.nsi-tale\u002Ftc-archi-os-reseaux\u002F1.systeme-sur-puce",{"title":509,"path":510,"stem":511},"Processus et ordonnancement par l'OS","\u002Fnsi-tale\u002Ftc-archi-os-reseaux\u002Fprocessus-os","2.nsi-tale\u002Ftc-archi-os-reseaux\u002F2.processus-os",{"title":513,"path":514,"stem":515},"L'interblocage (deadlock)","\u002Fnsi-tale\u002Ftc-archi-os-reseaux\u002Finterblocage","2.nsi-tale\u002Ftc-archi-os-reseaux\u002F3.interblocage",{"title":517,"path":518,"stem":519},"Principes du routage","\u002Fnsi-tale\u002Ftc-archi-os-reseaux\u002Froutage-principes","2.nsi-tale\u002Ftc-archi-os-reseaux\u002F4.routage-principes",{"title":521,"path":522,"stem":523},"Protocoles de routage RIP et OSPF","\u002Fnsi-tale\u002Ftc-archi-os-reseaux\u002Fprotocoles-rip-ospf","2.nsi-tale\u002Ftc-archi-os-reseaux\u002F5.protocoles-rip-ospf",{"title":525,"path":526,"stem":527},"Chiffrement symétrique","\u002Fnsi-tale\u002Ftc-archi-os-reseaux\u002Fchiffrement-symetrique","2.nsi-tale\u002Ftc-archi-os-reseaux\u002F6.chiffrement-symetrique",{"title":529,"path":530,"stem":531},"Chiffrement asymétrique","\u002Fnsi-tale\u002Ftc-archi-os-reseaux\u002Fchiffrement-asymetrique","2.nsi-tale\u002Ftc-archi-os-reseaux\u002F7.chiffrement-asymetrique",{"title":533,"path":534,"stem":535},"HTTPS — l'échange de clé symétrique","\u002Fnsi-tale\u002Ftc-archi-os-reseaux\u002Fhttps-tls","2.nsi-tale\u002Ftc-archi-os-reseaux\u002F8.https-tls",{"title":381,"path":537,"stem":538,"children":539},"\u002Fnsi-tale\u002Ftd-langages-prog","2.nsi-tale\u002Ftd-langages-prog\u002F0.index",[540,541,544,548,552,556],{"title":381,"path":537,"stem":538},{"title":403,"path":542,"stem":543},"\u002Fnsi-tale\u002Ftd-langages-prog\u002Fmise-au-point","2.nsi-tale\u002Ftd-langages-prog\u002F1.mise-au-point",{"title":545,"path":546,"stem":547},"Modularité","\u002Fnsi-tale\u002Ftd-langages-prog\u002Fmodularite","2.nsi-tale\u002Ftd-langages-prog\u002F2.modularite",{"title":549,"path":550,"stem":551},"Récursivité","\u002Fnsi-tale\u002Ftd-langages-prog\u002Frecursivite","2.nsi-tale\u002Ftd-langages-prog\u002F3.recursivite",{"title":553,"path":554,"stem":555},"Paradigmes de programmation","\u002Fnsi-tale\u002Ftd-langages-prog\u002Fparadigmes","2.nsi-tale\u002Ftd-langages-prog\u002F4.paradigmes",{"title":557,"path":558,"stem":559},"Programme comme donnée — calculabilité et indécidabilité","\u002Fnsi-tale\u002Ftd-langages-prog\u002Fprogramme-comme-donnee","2.nsi-tale\u002Ftd-langages-prog\u002F5.programme-comme-donnee",{"title":411,"path":561,"stem":562,"children":563},"\u002Fnsi-tale\u002Fte-algorithmique","2.nsi-tale\u002Fte-algorithmique\u002F0.index",[564,565,569,573,577,581],{"title":411,"path":561,"stem":562},{"title":566,"path":567,"stem":568},"Algorithmes sur les arbres binaires","\u002Fnsi-tale\u002Fte-algorithmique\u002Farbres-binaires-algos","2.nsi-tale\u002Fte-algorithmique\u002F1.arbres-binaires-algos",{"title":570,"path":571,"stem":572},"Parcours de graphes — DFS, BFS, cycles, chemins","\u002Fnsi-tale\u002Fte-algorithmique\u002Fgraphes-parcours","2.nsi-tale\u002Fte-algorithmique\u002F2.graphes-parcours",{"title":574,"path":575,"stem":576},"Diviser pour régner","\u002Fnsi-tale\u002Fte-algorithmique\u002Fdiviser-pour-regner","2.nsi-tale\u002Fte-algorithmique\u002F3.diviser-pour-regner",{"title":578,"path":579,"stem":580},"Programmation dynamique","\u002Fnsi-tale\u002Fte-algorithmique\u002Fprogrammation-dynamique","2.nsi-tale\u002Fte-algorithmique\u002F4.programmation-dynamique",{"title":582,"path":583,"stem":584},"Recherche textuelle — l'algorithme de Boyer-Moore","\u002Fnsi-tale\u002Fte-algorithmique\u002Frecherche-textuelle","2.nsi-tale\u002Fte-algorithmique\u002F5.recherche-textuelle",{"id":586,"title":221,"bo":587,"body":602,"description":1248,"eval":1249,"extension":1250,"labo":1249,"meta":1251,"navigation":1252,"path":222,"quizzes":1253,"readingTime":784,"seo":1254,"stem":223,"tp":1249,"__hash__":1255},"cours\u002F0.snt-2nde\u002Fzz-demo-widgets\u002F3.widgets-manipulation.md",[588,589,590,591,592,593,594,595,596,597,598,599,600,601],"PB01","PB02","PB04","PB05","SB09","TC04","SH01","SC05","SG01","PH01","PH02","PA01","SF01","TE01",{"type":603,"value":604,"toc":1232},"minimark",[605,614,622,629,636,641,644,648,654,661,665,671,682,686,692,699,703,709,720,723,729,744,748,754,765,849,856,936,942,949,953,959,978,981,1003,1006,1026,1032,1039,1068,1074,1081,1086,1092,1099,1129,1135,1142,1151,1157,1167,1170,1176,1179,1183,1186,1191,1194,1200,1203,1228],[606,607,608,609,613],"p",{},"Cette page expose dans l'ordre les ",[610,611,612],"strong",{},"14 widgets MDC"," de manipulation NSI\nlivrés au sprint. Sert de banc d'essai visuel pour vérifier que chaque\nwidget répond correctement à ses props\u002Fslots, et de référence concrète\npour les rédacteurs de chapitre.",[606,615,616,617,621],{},"Chaque section porte le nom du widget en titre. Toutes les fiches détaillées\nsont en ",[618,619,620],"code",{},"apps\u002Fcours\u002FWIDGETS.md"," §5.5.",[623,624,626],"h2",{"id":625},"bit-toggle",[618,627,628],{},"::bit-toggle",[606,630,631,632,635],{},"Octet cliquable multi-base (décimal non signé, complément à 2, hex, octal).\nCible : ",[618,633,634],{},"pb-types-valeurs"," (PB01, PB03).",[625,637],{"bits":638,"initial":639,"mode":640},"8","10110101","both",[606,642,643],{},"Version 4 bits :",[625,645],{"bits":646,"initial":647},"4","1101",[623,649,651],{"id":650},"float-decomposer",[618,652,653],{},"::float-decomposer",[606,655,656,657,660],{},"Décomposition IEEE 754. Signe, exposant biaisé, mantisse, écart à la\nvaleur saisie. Bits cliquables. Cible : ",[618,658,659],{},"pb-types-valeurs\u002F3.flottants.md"," (PB02).",[650,662],{"initial":663,"precision":664},"0.1","double",[623,666,668],{"id":667},"utf8-bytes",[618,669,670],{},"::utf8-bytes",[606,672,673,674,677,678,681],{},"Table caractère → octets en ASCII \u002F Latin-1 \u002F UTF-8. ",[618,675,676],{},"?"," quand le\ncaractère sort de la table. Cible : ",[618,679,680],{},"pb-types-valeurs\u002F4.textes-encodages.md"," (PB04).",[667,683],{"encodings":684,"text":685},"ascii,latin1,utf8","café 🍫",[623,687,689],{"id":688},"bool-table",[618,690,691],{},"::bool-table",[606,693,694,695,698],{},"Formule éditable + table de vérité 2-4 variables. Cible :\n",[618,696,697],{},"pb-types-valeurs\u002F5.booleens.md"," (PB05).",[688,700],{"formula":701,"vars":702},"a and (b or not c)","a,b,c",[623,704,706],{"id":705},"url-decoder",[618,707,708],{},"::url-decoder",[606,710,711,712,715,716,719],{},"URL en segments colorisés + paramètres décodés. Cible : ",[618,713,714],{},"sb-web"," et\n",[618,717,718],{},"pe-ihm-web"," (SB09, PE01).",[705,721],{"url":722},"https:\u002F\u002Fnsi.rocks:8080\u002Fcours\u002Fsnt?q=URL&lang=fr#parse",[623,724,726],{"id":725},"xor-bit",[618,727,728],{},"::xor-bit",[606,730,731,732,735,736,739,740,743],{},"XOR symétrique bit-à-bit avec vérification M = C ⊕ k. Note : la prop\ns'appelle ",[618,733,734],{},"k"," (pas ",[618,737,738],{},"key",", mot réservé Vue). Cible :\n",[618,741,742],{},"tc-archi-os-reseaux\u002F6.chiffrement-symetrique.md"," (TC04).",[725,745],{"bits":638,"k":746,"message":747},"01011001","10110010",[623,749,751],{"id":750},"trace-table",[618,752,753],{},"::trace-table",[606,755,756,757,760,761,764],{},"Déroulé pas-à-pas d'un programme Python (interpréteur déterministe maison,\nsous-ensemble int\u002Fbool\u002Faffect\u002Fif\u002Fwhile\u002Ffor-range\u002Fprint\u002Farithm\u002Fbooléens\u002Fcomp).\nCible : ",[618,758,759],{},"sh-prog-notions\u002F*",", ",[618,762,763],{},"pg-langages-prog\u002F*"," (SH01-05, PG01).",[750,766,768,840],{"title":767},"Doubler jusqu'à dépasser 100",[769,770,772],"template",{"v-slot:code":771},"",[773,774,778],"pre",{"className":775,"code":776,"language":777,"meta":771,"style":771},"language-python shiki shiki-themes github-light github-light github-dark","n = 1\nwhile n \u003C 100:\n    n = n * 2\nprint(n)\n","python",[618,779,780,797,815,831],{"__ignoreMap":771},[781,782,785,789,793],"span",{"class":783,"line":784},"line",1,[781,786,788],{"class":787},"sxrX7","n ",[781,790,792],{"class":791},"s8jYJ","=",[781,794,796],{"class":795},"sBjJW"," 1\n",[781,798,800,803,806,809,812],{"class":783,"line":799},2,[781,801,802],{"class":791},"while",[781,804,805],{"class":787}," n ",[781,807,808],{"class":791},"\u003C",[781,810,811],{"class":795}," 100",[781,813,814],{"class":787},":\n",[781,816,818,821,823,825,828],{"class":783,"line":817},3,[781,819,820],{"class":787},"    n ",[781,822,792],{"class":791},[781,824,805],{"class":787},[781,826,827],{"class":791},"*",[781,829,830],{"class":795}," 2\n",[781,832,834,837],{"class":783,"line":833},4,[781,835,836],{"class":795},"print",[781,838,839],{"class":787},"(n)\n",[769,841,842],{"v-slot:variables":771},[843,844,845],"ul",{},[846,847,848],"li",{},"n",[606,850,851,852,855],{},"Avec une boucle ",[618,853,854],{},"for"," :",[750,857,859,926],{"title":858},"Somme 1..n",[769,860,861],{"v-slot:code":771},[773,862,864],{"className":775,"code":863,"language":777,"meta":771,"style":771},"total = 0\nfor i in range(1, 6):\n    total = total + i\nprint(total)\n",[618,865,866,876,903,919],{"__ignoreMap":771},[781,867,868,871,873],{"class":783,"line":784},[781,869,870],{"class":787},"total ",[781,872,792],{"class":791},[781,874,875],{"class":795}," 0\n",[781,877,878,880,883,886,889,892,895,897,900],{"class":783,"line":799},[781,879,854],{"class":791},[781,881,882],{"class":787}," i ",[781,884,885],{"class":791},"in",[781,887,888],{"class":795}," range",[781,890,891],{"class":787},"(",[781,893,894],{"class":795},"1",[781,896,760],{"class":787},[781,898,899],{"class":795},"6",[781,901,902],{"class":787},"):\n",[781,904,905,908,910,913,916],{"class":783,"line":817},[781,906,907],{"class":787},"    total ",[781,909,792],{"class":791},[781,911,912],{"class":787}," total ",[781,914,915],{"class":791},"+",[781,917,918],{"class":787}," i\n",[781,920,921,923],{"class":783,"line":833},[781,922,836],{"class":795},[781,924,925],{"class":787},"(total)\n",[769,927,928],{"v-slot:variables":771},[843,929,930,933],{},[846,931,932],{},"i",[846,934,935],{},"total",[623,937,939],{"id":938},"graph-metrics",[618,940,941],{},"::graph-metrics",[606,943,944,945,948],{},"Petit graphe non orienté + rayon \u002F diamètre \u002F centre + distance depuis\nun sommet sélectionné. Cible :\n",[618,946,947],{},"sc-reseaux-sociaux\u002F4.petit-monde-graphes.md"," (SC05).",[938,950],{"edges":951,"vertices":952},"A-B,A-D,B-C,C-D,C-E,D-F","A,B,C,D,E,F",[623,954,956],{"id":955},"metadata-reveal",[618,957,958],{},"::metadata-reveal",[606,960,961,962,965,966,969,970,973,974,977],{},"Métadonnées avec révélation à la demande (mode ",[618,963,964],{},"photo",") ou présentation\ncompacte (mode ",[618,967,968],{},"json","). Lien OpenStreetMap externe si coordonnée GPS\ndétectée. Cible : ",[618,971,972],{},"sg-photo-numerique\u002F3.metadonnees-exif.md"," (SG01) et\n",[618,975,976],{},"sd-donnees-structurees\u002F3.metadonnees.md"," (SD04).",[606,979,980],{},"Mode photo (EXIF révélée) :",[955,982,983],{"kind":964},[843,984,985,988,991,994,997,1000],{},[846,986,987],{},"Appareil: iPhone 14",[846,989,990],{},"Date: 2026-04-12 14:32",[846,992,993],{},"GPS: 48.8584° N, 2.2945° E",[846,995,996],{},"Ouverture: f\u002F1.8",[846,998,999],{},"ISO: 100",[846,1001,1002],{},"Résolution: 4032 × 3024",[606,1004,1005],{},"Mode JSON :",[955,1007,1009],{"kind":968,"title":1008},"Réponse de \u002Fapi\u002Fme",[843,1010,1011,1014,1017,1020,1023],{},[846,1012,1013],{},"id: 42",[846,1015,1016],{},"name: Alice",[846,1018,1019],{},"created_at: 2026-05-20T14:00:00Z",[846,1021,1022],{},"role: élève",[846,1024,1025],{},"preferences: { \"theme\": \"dark\", \"lang\": \"fr\" }",[623,1027,1029],{"id":1028},"scatter-knn",[618,1030,1031],{},"::scatter-knn",[606,1033,1034,1035,1038],{},"Nuage 2D + clic = point test, k voisins surlignés, vote majoritaire.\nCible : ",[618,1036,1037],{},"ph-algorithmique\u002F6.knn.md"," (PH01).",[1028,1040,1042],{"k":1041},"3",[843,1043,1044,1047,1050,1053,1056,1059,1062,1065],{},[846,1045,1046],{},"150, 7,   pomme",[846,1048,1049],{},"170, 7.5, pomme",[846,1051,1052],{},"140, 6.8, pomme",[846,1054,1055],{},"165, 7.2, pomme",[846,1057,1058],{},"120, 5.5, mandarine",[846,1060,1061],{},"110, 5,   mandarine",[846,1063,1064],{},"130, 5.8, mandarine",[846,1066,1067],{},"125, 5.3, mandarine",[623,1069,1071],{"id":1070},"slider-illustratif",[618,1072,1073],{},"::slider-illustratif",[606,1075,1076,1077,1080],{},"Curseur de n + barres en échelle log pour log₂\u002F√\u002Fn\u002Fn·log\u002Fn²\u002Fn³.\nCible : ",[618,1078,1079],{},"ph-algorithmique\u002F*"," (PH02).",[1070,1082],{"kind":1083,"max":1084,"min":894,"n":1085},"complexity","10000","100",[623,1087,1089],{"id":1088},"timeline-interactive",[618,1090,1091],{},"::timeline-interactive",[606,1093,1094,1095,1098],{},"Frise chronologique cliquable. Cible : ",[618,1096,1097],{},"pa-histoire-info\u002F*"," (PA01).",[1088,1100,1103],{"from":1101,"to":1102},"1940","2025",[843,1104,1105,1108,1111,1114,1117,1120,1123,1126],{},[846,1106,1107],{},"1947 — Premier transistor — Bell Labs, Bardeen \u002F Brattain \u002F Shockley posent la brique de toute l'électronique moderne.",[846,1109,1110],{},"1958 — Premier circuit intégré — Jack Kilby chez Texas Instruments.",[846,1112,1113],{},"1969 — ARPANET — premier message entre UCLA et Stanford, ancêtre d'Internet.",[846,1115,1116],{},"1971 — Microprocesseur Intel 4004 — premier CPU sur une puce.",[846,1118,1119],{},"1989 — Web — Tim Berners-Lee, CERN. HTTP, HTML, URL.",[846,1121,1122],{},"1991 — Linux — Linus Torvalds publie son noyau pour PC.",[846,1124,1125],{},"2007 — iPhone — l'informatique mobile devient grand public.",[846,1127,1128],{},"2022 — ChatGPT — l'IA générative grand public débarque.",[623,1130,1132],{"id":1131},"sensor-actuator-sim",[618,1133,1134],{},"::sensor-actuator-sim",[606,1136,1137,1138,1141],{},"Boucle perception → décision → action. Cible : ",[618,1139,1140],{},"sf-info-embarquee\u002F*"," (SF01-03).",[1131,1143],{"actuator":1144,"compare":1145,"max":1146,"min":1147,"sensor":1148,"threshold":1149,"unit":1150},"ventilateur",">","40","10","température","25","°C",[623,1152,1154],{"id":1153},"anim-step-by-step",[618,1155,1156],{},"::anim-step-by-step",[606,1158,1159,1160,1163,1164,1166],{},"Moteur d'animation pluggable. 4 algos en V1. Cible : ",[618,1161,1162],{},"te-algorithmique\u002F*",",\n",[618,1165,1079],{},", etc. (TE01, PH02-04).",[606,1168,1169],{},"Mode DFS sur graphe :",[1153,1171],{"algo":1172,"title":1173,"graph":1174,"start":1175},"dfs","DFS depuis A","A,B,C,D,E,F;A-B,A-C,B-D,C-E,C-F","A",[606,1177,1178],{},"Mode BFS sur le même graphe :",[1153,1180],{"algo":1181,"title":1182,"graph":1174,"start":1175},"bfs","BFS depuis A",[606,1184,1185],{},"Mode tri par sélection :",[1153,1187],{"algo":1188,"title":1189,"array":1190},"tri-selection","Tri sélection","5,2,8,1,9,3",[606,1192,1193],{},"Mode dichotomie :",[1153,1195],{"algo":1196,"title":1197,"array":1198,"target":1199},"dichotomie","Recherche dichotomique de 11","1,3,5,7,9,11,13,15,17","11",[1201,1202],"hr",{},[606,1204,1205,1206,1163,1209,760,1212,760,1215,1218,1219,1224,1225,1227],{},"Pour les widgets disponibles depuis plus longtemps (",[618,1207,1208],{},"::self-eval-qcm",[618,1210,1211],{},"::python-snippet",[618,1213,1214],{},"::illustration",[618,1216,1217],{},"::bo-ref","), voir la page voisine\n",[1220,1221,1223],"a",{"href":1222},"\u002F0.snt-2nde\u002Fzz-demo-widgets\u002F2.interactif","Démo interactive"," et la fiche\nde référence ",[618,1226,620],{}," §2-5.",[1229,1230,1231],"style",{},"html pre.shiki code .sxrX7, html code.shiki .sxrX7{--shiki-light:#24292E;--shiki-default:#24292E;--shiki-dark:#E1E4E8}html pre.shiki code .s8jYJ, html code.shiki .s8jYJ{--shiki-light:#D73A49;--shiki-default:#D73A49;--shiki-dark:#F97583}html pre.shiki code .sBjJW, html code.shiki .sBjJW{--shiki-light:#005CC5;--shiki-default:#005CC5;--shiki-dark:#79B8FF}html .light .shiki span {color: var(--shiki-light);background: var(--shiki-light-bg);font-style: var(--shiki-light-font-style);font-weight: var(--shiki-light-font-weight);text-decoration: var(--shiki-light-text-decoration);}html.light .shiki span {color: var(--shiki-light);background: var(--shiki-light-bg);font-style: var(--shiki-light-font-style);font-weight: var(--shiki-light-font-weight);text-decoration: var(--shiki-light-text-decoration);}html .default .shiki span {color: var(--shiki-default);background: var(--shiki-default-bg);font-style: var(--shiki-default-font-style);font-weight: var(--shiki-default-font-weight);text-decoration: var(--shiki-default-text-decoration);}html .shiki span {color: var(--shiki-default);background: var(--shiki-default-bg);font-style: var(--shiki-default-font-style);font-weight: var(--shiki-default-font-weight);text-decoration: var(--shiki-default-text-decoration);}html .dark .shiki span {color: var(--shiki-dark);background: var(--shiki-dark-bg);font-style: var(--shiki-dark-font-style);font-weight: var(--shiki-dark-font-weight);text-decoration: var(--shiki-dark-text-decoration);}html.dark .shiki span {color: var(--shiki-dark);background: var(--shiki-dark-bg);font-style: var(--shiki-dark-font-style);font-weight: var(--shiki-dark-font-weight);text-decoration: var(--shiki-dark-text-decoration);}",{"title":771,"searchDepth":799,"depth":799,"links":1233},[1234,1235,1236,1237,1238,1239,1240,1241,1242,1243,1244,1245,1246,1247],{"id":625,"depth":799,"text":628},{"id":650,"depth":799,"text":653},{"id":667,"depth":799,"text":670},{"id":688,"depth":799,"text":691},{"id":705,"depth":799,"text":708},{"id":725,"depth":799,"text":728},{"id":750,"depth":799,"text":753},{"id":938,"depth":799,"text":941},{"id":955,"depth":799,"text":958},{"id":1028,"depth":799,"text":1031},{"id":1070,"depth":799,"text":1073},{"id":1088,"depth":799,"text":1091},{"id":1131,"depth":799,"text":1134},{"id":1153,"depth":799,"text":1156},"Tous les widgets MDC livrés au sprint mai 2026 (§5.5 de WIDGETS.md). Une seule page pour les voir vivre.",null,"md",{},true,[],{"title":221,"description":1248},"lcVSxLmXXMG3JICNphmwD_oGU83hvx4JEScLyKi7_ZM",1788035589681]