PageSourceSearch

https://ici.radio-canada.ca/v5/dotca/dist/assets/actions-Cz2_mHto.js

js radio-canada.ca collected 2026-10-01 08:35:14 UTC 69,242 bytes, 2,128 lines download raw bytes

1import { A as Be, __tla as __tla_0 } from "./index-CdclUFIK.js";
2import { s as ze } from "./index-D0INf2ua.js";
3import { p as Se } from "./immer-DSWWq12A.js";
4import { g as Je } from "./_commonjsHelpers-DiKz65UP.js";
5import { a as Ye, b as Ke, __tla as __tla_1 } from "./_baseIsEqual-BsFvbevF.js";
6import { r as Xe, a as Ze, b as Qe, c as et, __tla as __tla_2 } from "./capitalize-Bxuw7kYC.js";
7import { e as xe, j as tt, __tla as __tla_3 } from "./convertToRem-qsX6JfyA.js";
8import { r as Re } from "./isArray-DqyYEE2K.js";
9import { a as at, l as st, b as C } from "./reselect-Bx_6x50c.js";
10import "./clientDateTime-O7SxnT9d.js";
11import { b as ee } from "./selectors-De4iM-dx.js";
12import { importShared as nt, __tla as __tla_4 } from "./__federation_fn_import-DF7fSgpK.js";
13import { i as rt, __tla as __tla_5 } from "./isEqual-ZL8WBtBj.js";
14let xa, ia, O, Xa, Ht, k, Za, Le, Ka, J, Os, ya, fa, Aa, is, ys, za, ss, We, _s, Is, Oa, ka, Pt, jt, D, ke, Fa, la, ja, w, kt, Ba, fs, ps, hs, ds, Ya, ms, qt, gt, dt, Nt, Mt, Ia, lt, Ea, bt, xs, Rs, Ls, rs, Es, ot, as, As, os, cs, vs, Ns, us, Ss, Sa, Na, ga, vt, Lt, Ve, gs, q, Ps, _a, Ca, Ta, Ge, Ts, ls, bs, Ra, Ma, ua, da, ha, ma, pa, it, ut, ct, mt, pt, ft, yt, ht, oa, Da, ks, ba, La, ca, E, wa, G, $a, Pa, Ha, ns, Ut, qa, Ua, Ja, Ms, X, es, Wa, Qa, va, ts, Va, Ga, Cs, $s, Fs, ws;
15let __tla = Promise.all([
16  (() => {
17    try {
18      return __tla_0;
19    } catch (e) {
20    }
21  })(),
22  (() => {
23    try {
24      return __tla_1;
25    } catch (e) {
26    }
27  })(),
28  (() => {
29    try {
30      return __tla_2;
31    } catch (e) {
32    }
33  })(),
34  (() => {
35    try {
36      return __tla_3;
37    } catch (e) {
38    }
39  })(),
40  (() => {
41    try {
42      return __tla_4;
43    } catch (e) {
44    }
45  })(),
46  (() => {
47    try {
48      return __tla_5;
49    } catch (e) {
50    }
51  })()
52]).then(async () => {
53  ia = "Nous et un nombre restreint de nos partenaires publicitaires utilisons des t\xE9moins pour recueillir certaines de vos donn\xE9es et les utilisons afin d\u2019am\xE9liorer votre exp\xE9rience et de vous pr\xE9senter des contenus et des publicit\xE9s personnalis\xE9s. Si vous n\u2019\xEAtes pas \xE0 l\u2019aise avec l\u2019utilisation de ces informations, ";
54  la = " avant de poursuivre votre visite.";
55  oa = "RC_NOTIFICATION_VIE_PRIVEE";
56  ca = " (nouvelle fen\xEAtre)";
57  ua = "app/schedule/live/musique";
58  da = "app/schedule/live/musiqueClassique";
59  ha = "app/schedule/live/premiere";
60  pa = "app/schedule/live/tele";
61  ma = "app/schedule/live/rdi";
62  ga = function() {
63    return {
64      type: "app/schedule/init"
65    };
66  };
67  fa = function(t) {
68    return {
69      type: "APP_LOCAL_STORAGE_E6NMANAGER_FAVORITE_RIDINGS_ADD",
70      payload: t
71    };
72  };
73  ya = function(t) {
74    return {
75      type: "APP_LOCAL_STORAGE_E6NMANAGER_FAVORITE_RIDINGS_REMOVE",
76      payload: t
77    };
78  };
79  ba = function(t) {
80    return {
81      type: "app/region/reload",
82      payload: {
83        withSchedule: t
84      }
85    };
86  };
87  va = function(t, e) {
88    return {
89      type: "app/legaldisclaimer/set",
90      payload: {
91        hasToDisplay: t,
92        withChangeCookies: e
93      }
94    };
95  };
96  Na = function(t) {
97    return {
98      type: "app/localStorage/saveMeteoHistory",
99      payload: t
100    };
101  };
102  Ma = function(t) {
103    return {
104      type: "NAVIGATION_SET_SUBMENU",
105      payload: {
106        subMenu: t || {}
107      }
108    };
109  };
110  La = function(t) {
111    return {
112      type: Be,
113      payload: {
114        model: t
115      }
116    };
117  };
118  Ia = function(t) {
119    return {
120      type: "APP_SET_TTL",
121      payload: t
122    };
123  };
124  var ne, re, ie, le;
125  it = function() {
126    if (le) return ie;
127    le = 1;
128    var t = Xe(), e = (function() {
129      if (re) return ne;
130      re = 1;
131      var a = xe();
132      return ne = function(s, r) {
133        return function(n, i) {
134          if (n == null) return n;
135          if (!a(n)) return s(n, i);
136          for (var p = n.length, h = r ? p : -1, l = Object(n); (r ? h-- : ++h < p) && i(l[h], h, l) !== false; ) ;
137          return n;
138        };
139      };
140    })()(t);
141    return ie = e;
142  };
143  let W, H, Ae, P, Y;
144  lt = "E6NMANAGER_FETCH_POLLING";
145  ot = "E6NMANAGER_SEARCH_FOR_RIDING";
146  ct = "E6NMANAGER_SET_ACTIVEDROPDOWNLISTOPTION";
147  ut = "E6NMANAGER_SET_ACTIVEFILTEROPTION";
148  dt = "E6NMANAGER_SET_CURRENT_RIDING";
149  ht = "E6NMANAGER_SET_CURRENT_TOOLTIP";
150  pt = "E6NMANAGER_SET_CURRENT_POLLING_ID";
151  mt = "E6NMANAGER_SET_FETCH_RESULTS_ERROR";
152  gt = "E6NMANAGER_SET_GLOBAL_DATA";
153  ft = "E6NMANAGER_SET_SEARCH_RESULTS";
154  yt = "E6NMANAGER_SET_STATIC_DATA";
155  Ea = "E6NMANAGER_START_REFRESH";
156  bt = "E6NMANAGER_STOP_REFRESH";
157  Sa = {
158    results: [],
159    totalNumberOfResults: 0
160  };
161  vt = "HEROHEADERELECTIONSRESULTS_FETCH_POLLING";
162  Nt = "HEROHEADERELECTIONSRESULTS_SET_POLLING_IS_ACTIVE";
163  Mt = "HEROHEADERELECTIONSRESULTS_SET_DATA";
164  Lt = "HEROHEADERELECTIONSRESULTS_GET_STATIC";
165  W = (t) => Array.isArray ? Array.isArray(t) : Object.prototype.toString.call(t) === "[object Array]";
166  H = (t) => typeof t == "string";
167  Ae = (t) => typeof t == "number";
168  P = (t) => t != null;
169  Y = (t) => !t.trim().length;
170  var b = {
171    isCaseSensitive: false,
172    includeScore: false,
173    keys: [],
174    shouldSort: true,
175    sortFn: (t, e) => t.score === e.score ? t.idx < e.idx ? -1 : 1 : t.score < e.score ? -1 : 1,
176    includeMatches: false,
177    findAllMatches: false,
178    minMatchCharLength: 1,
179    location: 0,
180    threshold: 0.6,
181    distance: 100,
182    useExtendedSearch: false,
183    getFn: function(t, e) {
184      let a = [], s = false;
185      const r = (n, i) => {
186        if (i) {
187          const p = i.indexOf(".");
188          let h = i, l = null;
189          p !== -1 && (h = i.slice(0, p), l = i.slice(p + 1));
190          const c = n[h];
191          if (P(c)) if (l || !H(c) && !Ae(c)) if (W(c)) {
192            s = true;
193            for (let o = 0, u = c.length; o < u; o += 1) r(c[o], l);
194          } else l && r(c, l);
195          else a.push(((o) => o == null ? "" : ((u) => {
196            if (typeof u == "string") return u;
197            let d = u + "";
198            return d == "0" && 1 / u == -1 / 0 ? "-0" : d;
199          })(o))(c));
200        } else a.push(n);
201      };
202      return r(t, e), s ? a : a[0];
203    }
204  };
205  function U(t, { errors: e = 0, currentLocation: a = 0, expectedLocation: s = 0, distance: r = b.distance } = {}) {
206    const n = e / t.length, i = Math.abs(s - a);
207    return r ? n + i / r : i ? 1 : n;
208  }
209  const V = 32;
210  function It(t, e, a, { location: s = b.location, distance: r = b.distance, threshold: n = b.threshold, findAllMatches: i = b.findAllMatches, minMatchCharLength: p = b.minMatchCharLength, includeMatches: h = b.includeMatches } = {}) {
211    if (e.length > V) throw new Error("Pattern length exceeds max of 32.");
212    const l = e.length, c = t.length, o = Math.max(0, Math.min(s, c));
213    let u = n, d = o;
214    const m = [];
215    if (h) for (let N = 0; N < c; N += 1) m[N] = 0;
216    let g;
217    for (; (g = t.indexOf(e, d)) > -1; ) {
218      let N = U(e, {
219        currentLocation: g,
220        expectedLocation: o,
221        distance: r
222      });
223      if (u = Math.min(N, u), d = g + l, h) {
224        let M = 0;
225        for (; M < l; ) m[g + M] = 1, M += 1;
226      }
227    }
228    d = -1;
229    let f = [], y = 1, L = l + c;
230    const S = 1 << (l <= 31 ? l - 1 : 30);
231    for (let N = 0; N < l; N += 1) {
232      let M = 0, v = L;
233      for (; M < v; ) U(e, {
234        errors: N,
235        currentLocation: o + v,
236        expectedLocation: o,
237        distance: r
238      }) <= u ? M = v : L = v, v = Math.floor((L - M) / 2 + M);
239      L = v;
240      let I = Math.max(1, o - v + 1), _ = i ? c : Math.min(o + v, c) + l, x = Array(_ + 2);
241      x[_ + 1] = (1 << N) - 1;
242      for (let R = _; R >= I; R -= 1) {
243        let T = R - 1, $ = a[t.charAt(T)];
244        if ($ && h && (m[T] = 1), x[R] = (x[R + 1] << 1 | 1) & $, N !== 0 && (x[R] |= (f[R + 1] | f[R]) << 1 | 1 | f[R + 1]), x[R] & S && (y = U(e, {
245          errors: N,
246          currentLocation: T,
247          expectedLocation: o,
248          distance: r
249        }), y <= u)) {
250          if (u = y, d = T, d <= o) break;
251          I = Math.max(1, 2 * o - d);
252        }
253      }
254      if (U(e, {
255        errors: N + 1,
256        currentLocation: o,
257        expectedLocation: o,
258        distance: r
259      }) > u) break;
260      f = x;
261    }
262    let A = {
263      isMatch: d >= 0,
264      score: y || 1e-3
265    };
266    return h && (A.matchedIndices = (function(N = [], M = b.minMatchCharLength) {
267      let v = [], I = -1, _ = -1, x = 0;
268      for (let R = N.length; x < R; x += 1) {
269        let T = N[x];
270        T && I === -1 ? I = x : T || I === -1 || (_ = x - 1, _ - I + 1 >= M && v.push([
271          I,
272          _
273        ]), I = -1);
274      }
275      return N[x - 1] && x - I >= M && v.push([
276        I,
277        x - 1
278      ]), v;
279    })(m, p)), A;
280  }
281  function Et(t) {
282    let e = {}, a = t.length;
283    for (let s = 0; s < a; s += 1) e[t.charAt(s)] = 0;
284    for (let s = 0; s < a; s += 1) e[t.charAt(s)] |= 1 << a - s - 1;
285    return e;
286  }
287  class Te {
288    constructor(e, { location: a = b.location, threshold: s = b.threshold, distance: r = b.distance, includeMatches: n = b.includeMatches, findAllMatches: i = b.findAllMatches, minMatchCharLength: p = b.minMatchCharLength, isCaseSensitive: h = b.isCaseSensitive } = {}) {
289      this.options = {
290        location: a,
291        threshold: s,
292        distance: r,
293        includeMatches: n,
294        findAllMatches: i,
295        minMatchCharLength: p,
296        isCaseSensitive: h
297      }, this.pattern = h ? e : e.toLowerCase(), this.chunks = [];
298      let l = 0;
299      for (; l < this.pattern.length; ) {
300        let c = this.pattern.substring(l, l + V);
301        this.chunks.push({
302          pattern: c,
303          alphabet: Et(c)
304        }), l += V;
305      }
306    }
307    searchIn(e) {
308      let a = e.$;
309      return this.searchInString(a);
310    }
311    searchInString(e) {
312      const { isCaseSensitive: a, includeMatches: s } = this.options;
313      if (a || (e = e.toLowerCase()), this.pattern === e) {
314        let d = {
315          isMatch: true,
316          score: 0
317        };
318        return s && (d.matchedIndices = [
319          [
320            0,
321            e.length - 1
322          ]
323        ]), d;
324      }
325      const { location: r, distance: n, threshold: i, findAllMatches: p, minMatchCharLength: h } = this.options;
326      let l = [], c = 0, o = false;
327      for (let d = 0, m = this.chunks.length; d < m; d += 1) {
328        let { pattern: g, alphabet: f } = this.chunks[d], y = It(e, g, f, {
329          location: r + V * d,
330          distance: n,
331          threshold: i,
332          findAllMatches: p,
333          minMatchCharLength: h,
334          includeMatches: s
335        });
336        const { isMatch: L, score: S, matchedIndices: A } = y;
337        L && (o = true), c += S, L && A && (l = [
338          ...l,
339          ...A
340        ]);
341      }
342      let u = {
343        isMatch: o,
344        score: o ? c / this.chunks.length : 1
345      };
346      return o && s && (u.matchedIndices = l), u;
347    }
348  }
349  class F {
350    constructor(e) {
351      this.pattern = e;
352    }
353    static isMultiMatch(e) {
354      return oe(e, this.multiRegex);
355    }
356    static isSingleMatch(e) {
357      return oe(e, this.singleRegex);
358    }
359    search() {
360    }
361  }
362  function oe(t, e) {
363    const a = t.match(e);
364    return a ? a[1] : null;
365  }
366  class _e extends F {
367    constructor(e) {
368      super(e);
369    }
370    static get type() {
371      return "exact";
372    }
373    static get multiRegex() {
374      return /^'"(.*)"$/;
375    }
376    static get singleRegex() {
377      return /^'(.*)$/;
378    }
379    search(e) {
380      let a, s = 0;
381      const r = [], n = this.pattern.length;
382      for (; (a = e.indexOf(this.pattern, s)) > -1; ) s = a + n, r.push([
383        a,
384        s - 1
385      ]);
386      const i = !!r.length;
387      return {
388        isMatch: i,
389        score: i ? 1 : 0,
390        matchedIndices: r
391      };
392    }
393  }
394  class Ce extends F {
395    constructor(e, { location: a = b.location, threshold: s = b.threshold, distance: r = b.distance, includeMatches: n = b.includeMatches, findAllMatches: i = b.findAllMatches, minMatchCharLength: p = b.minMatchCharLength, isCaseSensitive: h = b.isCaseSensitive } = {}) {
396      super(e), this._bitapSearch = new Te(e, {
397        location: a,
398        threshold: s,
399        distance: r,
400        includeMatches: n,
401        findAllMatches: i,
402        minMatchCharLength: p,
403        isCaseSensitive: h
404      });
405    }
406    static get type() {
407      return "fuzzy";
408    }
409    static get multiRegex() {
410      return /^"(.*)"$/;
411    }
412    static get singleRegex() {
413      return /^(.*)$/;
414    }
415    search(e) {
416      return this._bitapSearch.searchInString(e);
417    }
418  }
419  const Z = [
420    _e,
421    class extends F {
422      constructor(t) {
423        super(t);
424      }
425      static get type() {
426        return "prefix-exact";
427      }
428      static get multiRegex() {
429        return /^\^"(.*)"$/;
430      }
431      static get singleRegex() {
432        return /^\^(.*)$/;
433      }
434      search(t) {
435        const e = t.startsWith(this.pattern);
436        return {
437          isMatch: e,
438          score: e ? 0 : 1,
439          matchedIndices: [
440            0,
441            this.pattern.length - 1
442          ]
443        };
444      }
445    },
446    class extends F {
447      constructor(t) {
448        super(t);
449      }
450      static get type() {
451        return "inverse-prefix-exact";
452      }
453      static get multiRegex() {
454        return /^!\^"(.*)"$/;
455      }
456      static get singleRegex() {
457        return /^!\^(.*)$/;
458      }
459      search(t) {
460        const e = !t.startsWith(this.pattern);
461        return {
462          isMatch: e,
463          score: e ? 0 : 1,
464          matchedIndices: [
465            0,
466            t.length - 1
467          ]
468        };
469      }
470    },
471    class extends F {
472      constructor(t) {
473        super(t);
474      }
475      static get type() {
476        return "inverse-suffix-exact";
477      }
478      static get multiRegex() {
479        return /^!"(.*)"\$$/;
480      }
481      static get singleRegex() {
482        return /^!(.*)\$$/;
483      }
484      search(t) {
485        const e = !t.endsWith(this.pattern);
486        return {
487          isMatch: e,
488          score: e ? 0 : 1,
489          matchedIndices: [
490            0,
491            t.length - 1
492          ]
493        };
494      }
495    },
496    class extends F {
497      constructor(t) {
498        super(t);
499      }
500      static get type() {
501        return "suffix-exact";
502      }
503      static get multiRegex() {
504        return /^"(.*)"\$$/;
505      }
506      static get singleRegex() {
507        return /^(.*)\$$/;
508      }
509      search(t) {
510        const e = t.endsWith(this.pattern);
511        return {
512          isMatch: e,
513          score: e ? 0 : 1,
514          matchedIndices: [
515            t.length - this.pattern.length,
516            t.length - 1
517          ]
518        };
519      }
520    },
521    class extends F {
522      constructor(t) {
523        super(t);
524      }
525      static get type() {
526        return "inverse-exact";
527      }
528      static get multiRegex() {
529        return /^!"(.*)"$/;
530      }
531      static get singleRegex() {
532        return /^!(.*)$/;
533      }
534      search(t) {
535        const e = t.indexOf(this.pattern) === -1;
536        return {
537          isMatch: e,
538          score: e ? 0 : 1,
539          matchedIndices: [
540            0,
541            t.length - 1
542          ]
543        };
544      }
545    },
546    Ce
547  ], ce = Z.length, St = / +(?=([^\"]*\"[^\"]*\")*[^\"]*$)/, xt = /* @__PURE__ */ new Set([
548    Ce.type,
549    _e.type
550  ]), K = /[^ ]+/g;
551  function Oe(t, e, { getFn: a = b.getFn } = {}) {
552    let s = [];
553    if (H(e[0])) for (let r = 0, n = e.length; r < n; r += 1) {
554      const i = e[r];
555      if (P(i) && !Y(i)) {
556        let p = {
557          $: i,
558          idx: r,
559          t: i.match(K).length
560        };
561        s.push(p);
562      }
563    }
564    else {
565      const r = t.length;
566      for (let n = 0, i = e.length; n < i; n += 1) {
567        let p = e[n], h = {
568          idx: n,
569          $: {}
570        };
571        for (let l = 0; l < r; l += 1) {
572          let c = t[l], o = a(p, c);
573          if (P(o)) {
574            if (W(o)) {
575              let u = [];
576              const d = [
577                {
578                  arrayIndex: -1,
579                  value: o
580                }
581              ];
582              for (; d.length; ) {
583                const { arrayIndex: m, value: g } = d.pop();
584                if (P(g)) {
585                  if (H(g) && !Y(g)) {
586                    let f = {
587                      $: g,
588                      idx: m,
589                      t: g.match(K).length
590                    };
591                    u.push(f);
592                  } else if (W(g)) for (let f = 0, y = g.length; f < y; f += 1) d.push({
593                    arrayIndex: f,
594                    value: g[f]
595                  });
596                }
597              }
598              h.$[c] = u;
599            } else if (!Y(o)) {
600              let u = {
601                $: o,
602                t: o.match(K).length
603              };
604              h.$[c] = u;
605            }
606          }
607        }
608        s.push(h);
609      }
610    }
611    return s;
612  }
613  class Rt {
614    constructor(e) {
615      if (this._keys = {}, this._keyNames = [], this._length = e.length, e.length && H(e[0])) for (let a = 0; a < this._length; a += 1) {
616        const s = e[a];
617        this._keys[s] = {
618          weight: 1
619        }, this._keyNames.push(s);
620      }
621      else {
622        let a = 0;
623        for (let s = 0; s < this._length; s += 1) {
624          const r = e[s];
625          if (!Object.prototype.hasOwnProperty.call(r, "name")) throw new Error('Missing "name" property in key object');
626          const n = r.name;
627          if (this._keyNames.push(n), !Object.prototype.hasOwnProperty.call(r, "weight")) throw new Error('Missing "weight" property in key object');
628          const i = r.weight;
629          if (i <= 0 || i >= 1) throw new Error('"weight" property in key must be in the range of (0, 1)');
630          this._keys[n] = {
631            weight: i
632          }, a += i;
633        }
634        for (let s = 0; s < this._length; s += 1) {
635          const r = this._keyNames[s], n = this._keys[r].weight;
636          this._keys[r].weight = n / a;
637        }
638      }
639    }
640    get(e, a) {
641      return this._keys[e] ? this._keys[e][a] : -1;
642    }
643    keys() {
644      return this._keyNames;
645    }
646    count() {
647      return this._length;
648    }
649    toJSON() {
650      return JSON.stringify(this._keys);
651    }
652  }
653  function At(t, e) {
654    const a = t.matches;
655    if (e.matches = [], P(a)) for (let s = 0, r = a.length; s < r; s += 1) {
656      let n = a[s];
657      if (!P(n.indices) || n.indices.length === 0) continue;
658      let i = {
659        indices: n.indices,
660        value: n.value
661      };
662      n.key && (i.key = n.key), n.idx > -1 && (i.refIndex = n.idx), e.matches.push(i);
663    }
664  }
665  function Tt(t, e) {
666    e.score = t.score;
667  }
668  const Q = [];
669  class j {
670    constructor(e, a = {}, s = null) {
671      this.options = {
672        ...b,
673        ...a
674      }, this._processKeys(this.options.keys), this.setCollection(e, s);
675    }
676    setCollection(e, a = null) {
677      this.list = e, this.listIsStringArray = H(e[0]), a ? this.setIndex(a) : this.setIndex(this._createIndex());
678    }
679    setIndex(e) {
680      this._indexedList = e;
681    }
682    _processKeys(e) {
683      this._keyStore = new Rt(e);
684    }
685    _createIndex() {
686      return Oe(this._keyStore.keys(), this.list, {
687        getFn: this.options.getFn
688      });
689    }
690    search(e, a = {
691      limit: false
692    }) {
693      if (!(e = e.trim()).length) return [];
694      const { shouldSort: s } = this.options;
695      let r = null;
696      for (let i = 0, p = Q.length; i < p; i += 1) {
697        let h = Q[i];
698        if (h.condition(e, this.options)) {
699          r = new h(e, this.options);
700          break;
701        }
702      }
703      r || (r = new Te(e, this.options));
704      let n = this._searchUsing(r);
705      return this._computeScore(n), s && this._sort(n), a.limit && Ae(a.limit) && (n = n.slice(0, a.limit)), this._format(n);
706    }
707    _searchUsing(e) {
708      const a = this._indexedList, s = [], { includeMatches: r } = this.options;
709      if (this.listIsStringArray) for (let n = 0, i = a.length; n < i; n += 1) {
710        let p = a[n], { $: h, idx: l, t: c } = p;
711        if (!P(h)) continue;
712        let o = e.searchIn(p);
713        const { isMatch: u, score: d } = o;
714        if (!u) continue;
715        let m = {
716          score: d,
717          value: h,
718          t: c
719        };
720        r && (m.indices = o.matchedIndices), s.push({
721          item: h,
722          idx: l,
723          matches: [
724            m
725          ]
726        });
727      }
728      else {
729        const n = this._keyStore.keys(), i = this._keyStore.count();
730        for (let p = 0, h = a.length; p < h; p += 1) {
731          let { $: l, idx: c } = a[p];
732          if (!P(l)) continue;
733          let o = [];
734          for (let u = 0; u < i; u += 1) {
735            let d = n[u], m = l[d];
736            if (P(m)) if (W(m)) for (let g = 0, f = m.length; g < f; g += 1) {
737              let y = m[g];
738              const { $: L, idx: S, t: A } = y;
739              if (!P(L)) continue;
740              let N = e.searchIn(y);
741              const { isMatch: M, score: v } = N;
742              if (!M) continue;
743              let I = {
744                score: v,
745                key: d,
746                value: L,
747                idx: S,
748                t: A
749              };
750              r && (I.indices = N.matchedIndices), o.push(I);
751            }
752            else {
753              const { $: g, t: f } = m;
754              let y = e.searchIn(m);
755              const { isMatch: L, score: S } = y;
756              if (!L) continue;
757              let A = {
758                score: S,
759                key: d,
760                value: g,
761                t: f
762              };
763              r && (A.indices = y.matchedIndices), o.push(A);
764            }
765          }
766          o.length && s.push({
767            idx: c,
768            item: l,
769            matches: o
770          });
771        }
772      }
773      return s;
774    }
775    _computeScore(e) {
776      const a = e.length;
777      for (let s = 0; s < a; s += 1) {
778        const r = e[s], n = r.matches, i = n.length;
779        let p = 1;
780        for (let h = 0; h < i; h += 1) {
781          const l = n[h], { key: c, t: o } = l, u = this._keyStore.get(c, "weight"), d = u > -1 ? u : 1, m = l.score === 0 && u > -1 ? Number.EPSILON : l.score, g = 1 / Math.sqrt(o);
782          p *= Math.pow(m, d * g);
783        }
784        r.score = p;
785      }
786    }
787    _sort(e) {
788      e.sort(this.options.sortFn);
789    }
790    _format(e) {
791      const a = [], { includeMatches: s, includeScore: r } = this.options;
792      let n = [];
793      s && n.push(At), r && n.push(Tt);
794      for (let i = 0, p = e.length; i < p; i += 1) {
795        const h = e[i], { idx: l } = h, c = {
796          item: this.list[l],
797          refIndex: l
798        };
799        if (n.length) for (let o = 0, u = n.length; o < u; o += 1) n[o](h, c);
800        a.push(c);
801      }
802      return a;
803    }
804  }
805  var ue, de, he, pe, me, ge, fe, ye, be, ve, Ne, Me;
806  function _t() {
807    if (ye) return fe;
808    ye = 1;
809    var t = (function() {
810      if (ge) return me;
811      ge = 1;
812      var e = Ye();
813      return me = function(a, s) {
814        if (a !== s) {
815          var r = a !== void 0, n = a === null, i = a == a, p = e(a), h = s !== void 0, l = s === null, c = s == s, o = e(s);
816          if (!l && !o && !p && a >
816 s || p && h && c && !l && !o || n && h && c || !r && c || !i) return 1;
817          if (!n && !p && !o && a < s || o && r && i && !n && !p || l && r && i || !h && i || !c) return -1;
818        }
819        return 0;
820      };
821    })();
822    return fe = function(e, a, s) {
823      for (var r = -1, n = e.criteria, i = a.criteria, p = n.length, h = s.length; ++r < p; ) {
824        var l = t(n[r], i[r]);
825        if (l) return r >= h ? l : l * (s[r] == "desc" ? -1 : 1);
826      }
827      return e.index - a.index;
828    };
829  }
830  function Ct() {
831    if (ve) return be;
832    ve = 1;
833    var t = Ke(), e = Ze(), a = Qe(), s = (function() {
834      if (de) return ue;
835      de = 1;
836      var l = it(), c = xe();
837      return ue = function(o, u) {
838        var d = -1, m = c(o) ? Array(o.length) : [];
839        return l(o, function(g, f, y) {
840          m[++d] = u(g, f, y);
841        }), m;
842      };
843    })(), r = pe ? he : (pe = 1, he = function(l, c) {
844      var o = l.length;
845      for (l.sort(c); o--; ) l[o] = l[o].value;
846      return l;
847    }), n = tt(), i = _t(), p = et(), h = Re();
848    return be = function(l, c, o) {
849      c = c.length ? t(c, function(m) {
850        return h(m) ? function(g) {
851          return e(g, m.length === 1 ? m[0] : m);
852        } : m;
853      }) : [
854        p
855      ];
856      var u = -1;
857      c = t(c, n(a));
858      var d = s(l, function(m, g, f) {
859        return {
860          criteria: t(c, function(y) {
861            return y(m);
862          }),
863          index: ++u,
864          value: m
865        };
866      });
867      return r(d, function(m, g) {
868        return i(m, g, o);
869      });
870    };
871  }
872  (function(...t) {
873    Q.push(...t);
874  })(class {
875    constructor(t, { isCaseSensitive: e = b.isCaseSensitive, includeMatches: a = b.includeMatches, minMatchCharLength: s = b.minMatchCharLength, findAllMatches: r = b.findAllMatches, location: n = b.location, threshold: i = b.threshold, distance: p = b.distance } = {}) {
876      this.query = null, this.options = {
877        isCaseSensitive: e,
878        includeMatches: a,
879        minMatchCharLength: s,
880        findAllMatches: r,
881        location: n,
882        threshold: i,
883        distance: p
884      }, this.pattern = e ? t : t.toLowerCase(), this.query = (function(h, l = {}) {
885        return h.split("|").map((c) => {
886          let o = c.trim().split(St).filter((d) => d && !!d.trim()), u = [];
887          for (let d = 0, m = o.length; d < m; d += 1) {
888            const g = o[d];
889            let f = false, y = -1;
890            for (; !f && ++y < ce; ) {
891              const L = Z[y];
892              let S = L.isMultiMatch(g);
893              S && (u.push(new L(S, l)), f = true);
894            }
895            if (!f) for (y = -1; ++y < ce; ) {
896              const L = Z[y];
897              let S = L.isSingleMatch(g);
898              if (S) {
899                u.push(new L(S, l));
900                break;
901              }
902            }
903          }
904          return u;
905        });
906      })(this.pattern, this.options);
907    }
908    static condition(t, e) {
909      return e.useExtendedSearch;
910    }
911    searchIn(t) {
912      const e = this.query;
913      if (!e) return {
914        isMatch: false,
915        score: 1
916      };
917      let a = t.$;
918      const { includeMatches: s, isCaseSensitive: r } = this.options;
919      a = r ? a : a.toLowerCase();
920      let n = 0, i = [], p = 0;
921      for (let h = 0, l = e.length; h < l; h += 1) {
922        const c = e[h];
923        i.length = 0, n = 0;
924        for (let o = 0, u = c.length; o < u; o += 1) {
925          const d = c[o], { isMatch: m, matchedIndices: g, score: f } = d.search(a);
926          if (!m) {
927            p = 0, n = 0, i.length = 0;
928            break;
929          }
930          if (n += 1, p += f, s) {
931            const y = d.constructor.type;
932            xt.has(y) ? i = [
933              ...i,
934              ...g
935            ] : i.push(g);
936          }
937        }
938        if (n) {
939          let o = {
940            isMatch: true,
941            score: p / n
942          };
943          return s && (o.matchedIndices = i), o;
944        }
945      }
946      return {
947        isMatch: false,
948        score: 1
949      };
950    }
951  }), j.version = "5.2.3", j.createIndex = Oe, j.config = b;
952  var Ot = (function() {
953    if (Me) return Ne;
954    Me = 1;
955    var t = Ct(), e = Re();
956    return Ne = function(a, s, r, n) {
957      return a == null ? [] : (e(s) || (s = s == null ? [] : [
958        s
959      ]), e(r = n ? void 0 : r) || (r = r == null ? [] : [
960        r
961      ]), t(a, s, r));
962    };
963  })();
964  let B, Pe, wt, $t, we, $e, Fe, Ft, De, Ie;
965  B = Je(Ot);
966  ({ createSelector: Pe } = await nt("@reduxjs/toolkit"));
967  xa = (t) =>
967 Pe((e) => {
968    var _a2, _b;
969    return (_b = (_a2 = e.modules.toggleOptionsList) == null ? void 0 : _a2.instances) == null ? void 0 : _b[t];
970  }, (e) => e);
971  ke = (t, e) => Pe((a) => {
972    var _a2, _b, _c;
973    return (_c = (_b = (_a2 = a.modules.toggleOptionsList) == null ? void 0 : _a2.instances) == null ? void 0 : _b[t]) == null ? void 0 : _c.isChecked;
974  }, (a) => a === void 0 && e ? e : a);
975  Ra = "E6N_PAGE_REFRESH_SUBSCRIPTION_ID";
976  Aa = {
977    alerts: "e6n-alerts-id",
978    lists: "e6n-lists-id",
979    search: "e6n-search-id"
980  };
981  k = {
982    currentPolls: "{0} bureau{1} de scrutin sur&nbsp;{2}",
983    currentPollsXS: "{0} bureau{1} sur&nbsp;{2}",
984    noAhead: "La formation {0} n\u2019est en avance dans aucune circonscription. {1} du vote populaire.",
985    noElected: "La formation {0} est en avance dans {1} {2}. {3} du vote populaire.",
986    noResultsRidingsNumber: "Premiers r\xE9sultats encore attendus dans {0}&nbsp;circonscription{1}",
987    noVote: "Aucun r\xE9sultat pour {0}.",
988    ratioElectedRidings: "{0} \xE9lu{1} sur {2} circonscriptions",
989    turnoutTextual: "Taux de participation approximatif : {0}",
990    turnoutTextualEmpty: "\xE0 venir",
991    withElected: "La formation {0} est en avance dans {1} {2}, et {3} {4}. {5} du vote populaire."
992  };
993  Pt = {
994    addToFavorites: "(ajouter \xE0 votre liste de favoris)",
995    emptyStateListTextA11y: "Vous n\u2019avez pas encore de circonscription dans vos favoris. Pour ajouter une circonscription, appuyez sur le bouton Favoris dans les listes des circonscriptions/candidats",
996    emptyStateListText: "Vous n\u2019avez pas encore de circonscription dans vos favoris. Appuyez sur l\u2019\xE9toile pour en ajouter une.",
997    removeFromFavorites: "(retirer de votre liste de favoris)"
998  };
999  Ta = {
1000    emptyStateListText: "Vous trouverez ici la liste des circonscriptions o\xF9 le diff\xE9rentiel de vote entre les deux premiers candidats est le&nbsp;plus&nbsp;petit.",
1001    explanationTextA11y: "L\u2019ordre des circonscriptions de cette liste est appel\xE9 \xE0 changer r\xE9guli\xE8rement, lors des mises \xE0 jour de r\xE9sultats. Si vous utilisez un lecteur d\u2019\xE9cran, nous vous recommandons de modifier cette configuration. Changez l\u2019ordre d\u2019affichage pour l\u2019ordre alphab\xE9tique.",
1002    explanationOrderTextA11y: "Retour \xE0 l\u2019ordre d\u2019affichage par luttes les plus serr\xE9es."
1003  };
1004  _a = {
1005    emptyStateListText: "Toutes les circonscriptions ont un(e) candidat(e)&nbsp;d\xE9clar\xE9(e) \xE9lu(e).",
1006    emptyStateListTextA11y: "Toutes les circonscriptions ont un candidat d\xE9clar\xE9 \xE9lu."
1007  };
1008  kt = {
1009    emptyStateListText: "Aucun parti n\u2019a r\xE9alis\xE9 de gain jusqu\u2019\xE0&nbsp;maintenant.",
1010    listAttributeLabel: "Gain",
1011    listAttributeLabelA11y: " Ceci est un gain"
1012  };
1013  Ca = {
1014    emptyStateListText: "Aucun(e) candidat(e) n\u2019est en t\xEAte ou \xE9lu(e)."
1015  };
1016  G = {
1017    gov: "Gouvernement",
1018    govAria: " Ce parti formera le prochain gouvernement, mais nous ne savons pas encore s\u2019il sera minoritaire ou majoritaire",
1019    govAriaWithStatus: " Ce parti formera le prochain gouvernement et il sera {0}",
1020    maj: "Majoritaire",
1021    majLowerCase: "majoritaire",
1022    min: "Minoritaire",
1023    minLowerCase: "minoritaire",
1024    call: "Si la tendance se maintient, Radio-Canada pr\xE9voit que le prochain gouvernement sera {0}.",
1025    callWithParty: "form\xE9 par\u2026 {0}",
1026    callWithPartyAndStatus: "form\xE9 par\u2026 {0} et sera {1}"
1027  };
1028  Oa = 0;
1029  w = {
1030    expandList: "Afficher les {0} {1}",
1031    reduceList: "R\xE9duire la liste",
1032    ridingStatusLabel: "{2} : la formation {0} est {1}. {3} voix de {4}. {5}",
1033    ridingStatusLabelPlural: "{2} : il y a \xE9galit\xE9 entre les formations {0}",
1034    candidateStatusLabel: "{0} de {1} est {2} dans {3}. {4} voix de {5}",
1035    candidateStatusLabelPlural: "{0} de {1} est {2} dans {3}.",
1036    candidateStatusEqualityLabel: "\xE0 \xE9galit\xE9 avec un autre candidat",
1037    noResultsYetLabel: "{0} : premiers r\xE9sultats encore attendus",
1038    noCandidateResultsYetLabel: "{0} de {1} : premiers r\xE9sultats encore attendus dans {2}",
1039    emptyStateListText: "La liste que vous avez demand\xE9e n\u2019est pas disponible pour le moment.",
1040    dynamicListExplanation: "Les \xE9l\xE9ments des listes suivantes peuvent changer d\u2019ordre et d\u2019autres peuvent \xEAtre retir\xE9s ou ajout\xE9s au moment de la mise \xE0 jour des r\xE9sultats.",
1041    candidateButtonLabel: "candidats",
1042    ridingButtonLabel: "circonscriptions",
1043    isMinisterLabel: "Ministre",
1044    isPartyLeaderLabel: "chef",
1045    isPartyLeaderLabelFemale: "cheffe",
1046    skipLinkToListTab: "Retour aux onglets {0}"
1047  };
1048  Pa = {
1049    infoUpdateAndNavScreenReader: "Les r\xE9sultats \xE9lectoraux qui suivent sont mis \xE0 jour aux {0} secondes. Pour avoir acc\xE8s aux informations les plus r\xE9centes, naviguez r\xE9guli\xE8rement dans la page.",
1050    percentageDoNotDetermine: "Les pourcentages ne d\xE9terminent pas l\u2019issue de l\u2019\xE9lection; c\u2019est le nombre total d\u2019\xE9lus qui d\xE9termine la formation gagnante. Il s\u2019agit de r\xE9sultats non officiels. Le statut <em>\xE9lu(e)</em> est une pr\xE9vision de Radio-Canada."
1051  };
1052  wt = "En t\xEAte";
1053  $t = "\xC9lu(e)";
1054  we = "Votes";
1055  $e = "Parti";
1056  Fe = "% du vote";
1057  Ft = "Total";
1058  O = {
1059    ahead: "En t\xEAte",
1060    aheadNoCaps: "en t\xEAte",
1061    defeat: "D\xE9fait(e)",
1062    defeatFemale: "D\xE9faite",
1063    defeatMale: "D\xE9fait",
1064    elected: "\xC9lu(e)",
1065    electedFemale: "\xC9lue",
1066    electedMale: "\xC9lu",
1067    electedNoCaps: "\xE9lu(e)",
1068    equality: "\xC9galit\xE9",
1069    losing: "En difficult\xE9",
1070    voteSingularNoCaps: "vote",
1071    differentialPlus: "majorit\xE9",
1072    differentialMinus: "retard"
1073  };
1074  ka = {
1075    aheadCandidateWhileResults: "{0}, {1} de la formation {2} est {5} avance de {3} voix ({4}).",
1076    otherCandidates: "{0}, {1} de la formation {2} a {3} des voix."
1077  };
1078  wa = {
1079    dropdownMenuTitle: "Circonscriptions, candidats et favoris",
1080    electoralResults: "R\xE9sultats des \xE9lections \u2014 {0}",
1081    candidatesLightboxTitle: "R\xE9sultats d\xE9taill\xE9s",
1082    heroHeaderLightboxTitle: "R\xE9sultats d\xE9taill\xE9s",
1083    heroHeaderDashboardLinkTitle: "Voir les r\xE9sultats complets",
1084    heroHeaderTitle: "R\xE9sultats complets par parti politique",
1085    heroHeaderWidgetTitle: "Module des r\xE9sultats \xE9lectoraux \u2014 {0}",
1086    ridingLightBoxLabel: "R\xE9sultats de la circonscription par parti politique",
1087    nationalResults: "R\xE9sultats d\xE9taill\xE9s",
1088    nationalResultsAccessible: "R\xE9sultats complets par parti politique",
1089    ridingResults: "(acc\xE9der aux r\xE9sultats de la circonscription)",
1090    searchRidings: "Recherche de circonscriptions et candidats",
1091    searchRidingsWithPC: "Recherche d\u2019une circonscription ou d\u2019un candidat",
1092    map: "Carte des circonscriptions"
1093  };
1094  Le = {
1095    incumbencyLegendFemale: "D\xE9put\xE9e sortante *",
1096    incumbencyLegendMale: "D\xE9put\xE9 sortant *",
1097    incumbencyLegendTooltipMale: "D\xE9put\xE9 sortant",
1098    incumbencyLegendTooltipFemale: "D\xE9put\xE9e sortante"
1099  };
1100  X = {
1101    before: "before",
1102    during: "during",
1103    after: "after"
1104  };
1105  D = {
1106    candidateLabel: "Candidat(e)s",
1107    maximumSearchResults: 5,
1108    numberBeforeSearch: 3,
1109    ridingsLabel: "Circonscriptions",
1110    explicationEnterAction: "La touche Entrer vous permettra d\u2019acc\xE9der directement \xE0 la description d\xE9taill\xE9e du premier r\xE9sultat de recherche.",
1111    searchInputText: "Rechercher par circonscription ou candidat",
1112    ariaLabelNameAndSubtitle: "{0}, dans {1}"
1113  };
1114  $a = {
1115    after: "Derni\xE8re mise \xE0 jour : {0}",
1116    before: "D\xE9but du d\xE9pouillement des votes : {0}",
1117    nextUpdate: "Prochaine mise \xE0 jour : {0} seconde{1}",
1118    updating: "Prochaine mise \xE0 jour : en cours...",
1119    nextUpdateWidget: "Les r\xE9sultats \xE9lectoraux qui suivent seront mis \xE0 jour dans {0} seconde{1}"
1120  };
1121  Ge = {
1122    toggleLabelRidings: "Voir pourquoi ces circonscriptions sont importantes.",
1123    toggleLabelA11yRidings: "Afficher les descriptions et d\xE9couvrir pourquoi les circonscriptions de cette liste sont \xE0 surveiller.",
1124    toggleLabelCandidates: "Voir pourquoi nous avons choisi ces candidat(e)s.",
1125    toggleLabelA11yCandidates: "Afficher les descriptions et d\xE9couvrir pourquoi les candidates et les candidats de cette liste sont \xE0 surveiller.",
1126    reduxStoreLabel: "e6n-checkedbox-specifications"
1127  };
1128  Fa = {
1129    toggleLabel: "Cette diffusion est disponible avec le langage des signes (LSQ)",
1130    toggleOnA11yLabel: "Activer la diffusion avec le langage des signes",
1131    toggleOffA11yLabel: "D\xE9sactiver la diffusion avec le langage des signes",
1132    reduxStoreLabel: "e6n-checkedbox-sign-language"
1133  };
1134  E = at(st, (t, e) => rt(t, e));
1135  Ga = (t) => E((e) => {
1136    var _a2;
1137    return (_a2 = e.modules.heroHeaderElectionsResults) == null ? void 0 : _a2[t];
1138  }, (e) => e || null);
1139  De = (t) => (e) => {
1140    var _a2, _b;
1141    return ((_b = (_a2 = e.modules.heroHeaderElectionsResults) == null ? void 0 : _a2[t]) == null ? void 0 : _b.candidatePictureConventionPattern) || null;
1142  };
1143  Da = (t) => (e) => {
1144    var _a2, _b;
1145    return ((_b = (_a2 = e.modules.heroHeaderElectionsResults) == null ? void 0 : _a2[t]) == null ? void 0 : _b.pollingTime) || 0;
1146  };
1147  ja = (t) => (e) => {
1148    var _a2, _b;
1149    return ((_b = (_a2 = e.modules.heroHeaderElectionsResults) == null ? void 0 : _a2[t]) == null ? void 0 : _b.pollingIsActive) || false;
1150  };
1151  Ha = (t) => (e) => {
1152    var _a2, _b;
1153    return ((_b = (_a2 = e.modules.heroHeaderElectionsResults) == null ? void 0 : _a2[t]) == null ? void 0 : _b.utcStartDate) || null;
1154  };
1155  Ie = {
1156    distance: 1e3,
1157    keys: [
1158      "searchableName"
1159    ],
1160    location: 0,
1161    maxPatternLength: 64,
1162    minMatchCharLength: 3,
1163    shouldSort: true,
1164    threshold: 0.3
1165  };
1166  function Ee(t, e, a = null) {
1167    if (!t) return null;
1168    switch (e) {
1169      case "riding":
1170        return {
1171          id: t.item.id,
1172          name: t.item.name,
1173          ridingId: t.item.id,
1174          subtitle: a,
1175          type: "riding"
1176        };
1177      case "candidate":
1178        return {
1179          id: t.item.id,
1180          name: t.item.name,
1181          ridingId: t.item.ridingId,
1182          subtitle: a,
1183          type: "candidate"
1184        };
1185      default:
1186        return null;
1187    }
1188  }
1189  let je, z, Gt, He, qe, Dt, Ue, Vt, Wt, Bt;
1190  je = (t) => {
1191    let e = "";
1192    switch (t) {
1193      case "E":
1194      case "A":
1195        e = O.differentialPlus;
1196        break;
1197      case "L":
1198      case "D":
1199        e = O.differentialMinus;
1200    }
1201    return e;
1202  };
1203  z = (t, e) => {
1204    let a = "";
1205    switch (t) {
1206      case "D":
1207        a = e === "F" ? O.defeatFemale : O.defeatMale;
1208        break;
1209      case "E":
1210        a = e === "F" ? O.electedFemale : O.electedMale;
1211        break;
1212      case "A":
1213        a = O.ahead;
1214        break;
1215      case "L":
1216        a = O.losing;
1217        break;
1218      case "S":
1219        a = O.equality;
1220    }
1221    return a;
1222  };
1223  Gt = (t, e, a, s) => {
1224    let r = [];
1225    if (!e || e.length === 0) return r;
1226    const n = t == null ? void 0 : t.candidates, i = t == null ? void 0 : t.parties;
1227    return r = e.reduce((p, h) => {
1228      const l = ((c, o, u, d) => {
1229        if (!c) return null;
1230        const m = c == null ? void 0 : c[String(d)];
1231        return m ? Se(m, (g) => {
1232          g.statusTitle = z(m == null ? void 0 : m.status, m == null ? void 0 : m.gender), o && (g.party = o == null ? void 0 : o[String(g == null ? void 0 : g.partyId)]), g.candidateTitle = qe(g == null ? void 0 : g.gender, g == null ? void 0 : g.isMinister, g == null ? void 0 : g.isPartyLeader);
1233        }) : null;
1234      })(n, i, 0, h);
1235      return l && p.push(l), p;
1236    }, []), r;
1237  };
1238  He = (t, e, a, s, r, n, i, p, h, l, c, o, u, d, m, g, f, y) => ({
1239    id: t,
1240    partiesAcronyms: e,
1241    isActive: a,
1242    kicker: s,
1243    pictureAlt: r,
1244    pictureUrl: n,
1245    ridingId: i,
1246    status: h,
1247    statusTitle: l,
1248    title: p,
1249    withBigFollowButton: c,
1250    a11yTitleRiding: o,
1251    ariaLabelTitle: u,
1252    differential: d,
1253    differentialA11y: m,
1254    specification: g,
1255    hasAGain: f,
1256    candidateTitle: y
1257  });
1258  qe = (t, e, a) => {
1259    const s = t === "F" ? w.isPartyLeaderLabelFemale : w.isPartyLeaderLabel, r = e ? w.isMinisterLabel : null;
1260    return a ? s : r;
1261  };
1262  Dt = (t, e, a, s, r, n, i) => {
1263    if (!t || !e || !a) return null;
1264    const p = t == null ? void 0 : t.id, h = t == null ? void 0 : t.name;
1265    let l = null;
1266    r && (l = r.replace("{0}", p));
1267    const c = a ? {
1268      acronym: a == null ? void 0 : a.acronym,
1269      color: a == null ? void 0 : a.color,
1270      name: a == null ? void 0 : a.name
1271    } : null, o = e ? e == null ? void 0 : e.name : null, u = a ? a == null ? void 0 : a.name : null, d = t == null ? void 0 : t.status, m = t == null ? void 0 : t.gender, g = t == null ? void 0 : t.differentialTextual, f = t == null ? void 0 : t.differentialA11y, y = i ? t == null ? void 0 : t.specification : null, L = t == null ? void 0 : t.isPartyLeader, S = t == null ? void 0 : t.isMinister, A = qe(m, S, L), N = d ? ((M, v, I, _, x, R, T, $) => {
1272      let te = "", ae = "";
1273      $ && (ae = ", ".concat($));
1274      const se = "".concat(M).concat(ae);
1275      return te = I.toUpperCase() !== "S" ? w.candidateStatusLabel.replace("{0}", se).replace("{1}", v ? "la formation ".concat(v) : "").replace("{2}", z(I, _).toLowerCase()).replace("{3}", x).replace("{4}", R || "").replace("{5}", je(I)) : w.candidateStatusLabelPlural.replace("{0}", se).replace("{1}", v ? "la formation ".concat(v) : "").replace("{2}", w.candidateStatusEqualityLabel).replace("{3}", x), te;
1276    })(h, u, d, m, o, f, 0, A) : w.noCandidateResultsYetLabel.replace("{0}", h).replace("{1}", u).replace("{2}", o);
1277    return He(p, [
1278      c
1279    ], !!e && s === (e == null ? void 0 : e.id), o, h, l, e ? e == null ? void 0 : e.id : null, h, d, z(d, m), false, "", N, g, f, y, null, n.currentFilter 
1279!== 2 && n.currentFilter !== 3 ? A : null);
1280  };
1281  Ue = (t, e) => e ? B(t, [
1282    "priority",
1283    "name"
1284  ], [
1285    "asc",
1286    "asc"
1287  ]) : B(t, [
1288    "aheadNumber",
1289    "electedNumber",
1290    "voteNumber",
1291    "name"
1292  ], [
1293    "desc",
1294    "desc",
1295    "desc",
1296    "asc"
1297  ]);
1298  jt = (t) => E((e) => {
1299    var _a2, _b;
1300    return (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.currentRiding;
1301  }, (e) => {
1302    var _a2, _b;
1303    return (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.data;
1304  }, (e, a) => {
1305    if (!e || e === -1) return null;
1306    const s = a == null ? void 0 : a.ridings[e], r = s || null;
1307    if (r) {
1308      const n = Gt(a, r == null ? void 0 : r.candidateIds), i = r == null ? void 0 : r.closedPolls;
1309      return Se(r, (p) => {
1310        p.candidates = ((h, l) => l ? B(h, [
1311          (c) => c.isIncumbentCandidate === true,
1312          (c) => !!c.party && c.party.priority < 99,
1313          "lastName"
1314        ], [
1315          "desc",
1316          "desc",
1317          "asc"
1318        ]) : B(h, [
1319          "voteNumber",
1320          "lastName"
1321        ], [
1322          "desc",
1323          "asc"
1324        ]))(n, !i || i === 0);
1325      });
1326    }
1327    return r;
1328  });
1329  qa = (t) => E(Ht(t), Ut(t), (e, a) => e && e.closed && e.closed !== 0 ? e && e.open === 0 && e.closed > 0 || a === 0 ? X.after : X.during : X.before);
1330  Ht = (t) => E((e) => {
1331    var _a2, _b, _c;
1332    return (_c = (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.data) == null ? void 0 : _c.closedPolls;
1333  }, (e) => {
1334    var _a2, _b, _c;
1335    return (_c = (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.data) == null ? void 0 : _c.totalPolls;
1336  }, (e, a) => ({
1337    closed: e,
1338    open: a - e
1339  }));
1340  Ua = (t) => (e) => {
1341    var _a2, _b;
1342    return (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.currentPollingId;
1343  };
1344  Va = (t) => (e) => {
1345    var _a2, _b;
1346    return (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.globalLoaded;
1347  };
1348  Wa = (t) => (e) => {
1349    var _a2, _b, _c, _d;
1350    return typeof ((_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.fetchErrors) == "number" && ((_d = (_c = e.modules.e6NManager) == null ? void 0 : _c[t]) == null ? void 0 : _d.fetchErrors) > 3 || false;
1351  };
1352  Ba = (t, e) => (a) => {
1353    var _a2, _b;
1354    return ((_b = (_a2 = a.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.currentRiding) === e;
1355  };
1356  za = (t) => (e) => {
1357    var _a2, _b;
1358    return (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.currentRiding;
1359  };
1360  Ja = (t) => E((e) => {
1361    var _a2, _b, _c;
1362    return (_c = (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.data) == null ? void 0 : _c.governmentCall;
1363  }, (e) => {
1364    var _a2, _b, _c;
1365    return (_c = (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.data) == null ? void 0 : _c.parties;
1366  }, (e, a) => {
1367    if (!e) return null;
1368    const s = e, r = s.partyId !== 0 ? a == null ? void 0 : a[String(s.partyId)] : null, n = r ? r.name : null;
1369    return {
1370      status: s.status,
1371      partyId: s.partyId,
1372      partyName: n
1373    };
1374  });
1375  Ve = (t) => E((e) => {
1376    var _a2, _b;
1377    return (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.activeDropDownListOption;
1378  }, J(t), (e, a) => {
1379    if (!a) return null;
1380    for (let s = 0; s < a.length; s += 1) {
1381      const r = a[s];
1382      for (let n = 0; n < r.lists.length; n += 1) {
1383        const i = r.lists[n];
1384        if (i.id === e) return i;
1385      }
1386    }
1387    return null;
1388  });
1389  qt = (t) => E((e) => {
1390    var _a2, _b;
1391    return (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t.electionId]) == null ? void 0 : _b.activeFilterOption;
1392  }, (e) => e || null);
1393  q = (t) => E((e) => {
1394    var _a2, _b;
1395    return (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.activeDropDownListOption;
1396  }, (e) => e || null);
1397  Ya = (t) => E(q(t), J(t), ee(t), (e, a, s) => {
1398    const r = [];
1399    if (e === 3) {
1400      const n = {
1401        value: -1,
1402        text: "Mes favoris (".concat(s ? s.length : 0, ")")
1403      };
1404      return r.push(n), r;
1405    }
1406    for (let n = 0; n < a.length; n += 1) if (a[n].id === e) for (let i = 0; i < a[n].lists.length; i += 1) {
1407      let p = 0;
1408      for (let c = 0; c < a[n].lists[i].referencedIds.length; c += 1) p += a[n].lists[i].referencedIds[c].L.length;
1409      const h = "".concat(a[n].lists[i].name, " (").concat(p, ")");
1410      let l = null;
1411      a[n].lists[i].id !== 12 && (l = {
1412        value: a[n].lists[i].id,
1413        text: h
1414      }), r.push(l);
1415    }
1416    return r;
1417  });
1418  J = (t) => E((e) => {
1419    var _a2, _b, _c;
1420    return (_c = (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.data) == null ? void 0 : _c.lists;
1421  }, (e) => e || null);
1422  Ka = (t) => E(Ve(t), (e) => e ? {
1423    name: e.name,
1424    id: e.id
1425  } : null);
1426  Ut = (t) => C((e) => {
1427    var _a2, _b, _c;
1428    return (_c = (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.data) == null ? void 0 : _c.pollingTime;
1429  }, (e) => e || 0);
1430  Xa = (t) => E((e) => {
1431    var _a2, _b, _c;
1432    return (_c = (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.data) == null ? void 0 : _c.parties;
1433  }, (e) => {
1434    var _a2, _b, _c;
1435    return (_c = (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.data) == null ? void 0 : _c.closedPolls;
1436  }, (e, a) => {
1437    if (!e) return null;
1438    const s = Object.values(e), r = Ue(s, !a || a === 0).map((i) => [
1439      {
1440        html: i.name
1441      },
1442      {
1443        html: i.electedNumber ? i.electedNumber.toString() : "0"
1444      },
1445      {
1446        html: Number.isNaN(i.electedNumber) && Number.isNaN(i.aheadNumber) ? "0" : (i.aheadNumber - i.electedNumber).toString()
1447      },
1448      {
1449        html: i.aheadNumber ? i.aheadNumber.toString() : "0"
1450      },
1451      {
1452        html: i.voteNumberTextual ? i.voteNumberTextual : "0"
1453      },
1454      {
1455        html: i.votePercentTextual ? i.votePercentTextual : "0,0&nbsp;%"
1456      }
1457    ]), n = [
1458      {
1459        html: $e
1460      },
1461      {
1462        html: $t
1463      },
1464      {
1465        html: wt
1466      },
1467      {
1468        html: Ft
1469      },
1470      {
1471        html: we
1472      },
1473      {
1474        html: Fe
1475      }
1476    ];
1477    return r.unshift(n), r;
1478  });
1479  Za = (t) => E(jt(t), (e) => {
1480    if (!e) return null;
1481    let a = false;
1482    const s = e.candidates.map((n) => {
1483      const { party: i } = n, p = n.gender === "M" ? Le.incumbencyLegendTooltipMale : Le.incumbencyLegendTooltipFemale, h = n.isIncumbentCandidate ? "\n        ".concat(n.lastName, '\n        <strong class="hidden-tag">&nbsp;').concat(p, '</strong>\n        <strong aria-hidden="true" title="').concat(p, '">*</strong>\n      ') : "".concat(n.lastName), l = n.gender === "M" ? O.electedMale : O.electedFemale;
1484      return n.isIncumbentCandidate && n.gender === "F" && (a = true), [
1485        {
1486          html: "".concat(n.firstName, " ").concat(h),
1487          icon: {
1488            icon: n.status === "E" ? "svg-check" : "",
1489            title: "".concat(n.status === "E" ? l : "")
1490          }
1491        },
1492        {
1493          html: i ? i.name : null
1494        },
1495        {
1496          html: n.voteNumberTextual
1497        },
1498        {
1499          html: n.votePercentTextual || "0,0&nbsp;%"
1500        }
1501      ];
1502    }), r = [
1503      {
1504        html: "Candidat(e)"
1505      },
1506      {
1507        html: $e
1508      },
1509      {
1510        html: we
1511      },
1512      {
1513        html: Fe
1514      }
1515    ];
1516    return s.unshift(r), {
1517      candidates: s,
1518      closedPolls: e.closedPolls,
1519      pollsTotal: e.pollsTotal,
1520      ridingName: e.name,
1521      turnout: e.turnout,
1522      turnoutTextual: e.turnout > 0 ? e.turnoutTextual : k.turnoutTextualEmpty,
1523      status: e.status,
1524      isIncumbentFemale: a
1525    };
1526  });
1527  Qa = (t) => C((e) => {
1528    var _a2, _b, _c;
1529    return (_c = (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.data) == null ? void 0 : _c.noResultsRidingsNumber;
1530  }, (e) => {
1531    var _a2, _b, _c;
1532    return (_c = (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.data) == null ? void 0 : _c.ridingsNumberWithoutElected;
1533  }, (e) => {
1534    var _a2, _b, _c;
1535    return (_c = (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.data) == null ? void 0 : _c.ridings;
1536  }, (e, a, s) => {
1537    if (e === 1) return k.noResultsRidingsNumber.replace("{0}", e).replace("{1}", "");
1538    if (e > 1) return k.noResultsRidingsNumber.replace("{0}", e).replace("{1}", "s");
1539    const r = s ? Object.keys(s).length : 0;
1540    return k.ratioElectedRidings.replace("{0}", r - a).replace("{1}", r - a > 1 ? "(e)s" : "(e)").replace("{2}", r);
1541  });
1542  es = (t) => C((e) => {
1543    var _a2, _b, _c;
1544    return (_c = (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.data) == null ? void 0 : _c.turnoutTextual;
1545  }, (e) => k.turnoutTextual.replace("{0}", e === null ? k.turnoutTextualEmpty : e));
1546  ts = (t) => E((e) => {
1547    var _a2, _b;
1548    return (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.data;
1549  }, De(t), /* @__PURE__ */ ((e) => (a) => {
1550    var _a2, _b;
1551    return ((_b = (_a2 = a.modules.heroHeaderElectionsResults) == null ? void 0 : _a2[e]) == null ? void 0 : _b.partyIconConventionPattern) || null;
1552  })(t), /* @__PURE__ */ ((e) => (a) => {
1553    var _a2, _b;
1554    return ((_b = (_a2 = a.modules.heroHeaderElectionsResults) == null ? void 0 : _a2[e]) == null ? void 0 : _b.partyIconConventionPatternDark) || null;
1555  })(t), (e, a, s, r) => {
1556    if (!e) return [];
1557    const n = [], i = (e == null ? void 0 : e.parties) ? e == null ? void 0 : e.parties : {}, p = e == null ? void 0 : e.ridings, h = e == null ? void 0 : e.candidates, l = e == null ? void 0 : e.governmentCall, c = e == null ? void 0 : e.closedPolls;
1558    Object.values(i).forEach((u) => {
1559      u && (u.priority === 99 ? u.aheadNumber > 0 && n.push(u) : n.push(u));
1560    });
1561    const o = p ? Object.keys(p).length : 0;
1562    return Ue(n, !c || c === 0).map((u) => {
1563      const d = u.aheadNumber || 0, m = u.electedNumber || 0, g = h == null ? void 0 : h[String(u.chiefId)], f = g && a ? a.replace("{0}", g == null ? void 0 : g.id) : null, y = s ? s.replace("{0}", u.id) : null, L = r ? r.replace("{0}", u.id) : null, S = u.votePercentTextual || "0,0&nbsp;%", A = u.voteNumber || 0, N = l && (l == null ? void 0 : l.partyId) === u.id;
1564      let M = null;
1565      if (N) switch (l == null ? void 0 : l.status) {
1566        case 2:
1567          M = G.maj;
1568          break;
1569        case 1:
1570          M = G.min;
1571          break;
1572        case 0:
1573          M = G.gov;
1574      }
1575      let v = null;
1576      if (A === 0) v = k.noVote.replace("{0}", u.name);
1577      else if (A > 0) {
1578        if (d === 0) v = k.noAhead.replace("{0}", u.name).replace("{1}", S);
1579        else if (m === 0) v = k.noElected.replace("{0}", u.name).replace("{1}", d).replace("{2}", d > 1 ? "circonscriptions" : "circonscription").replace("{3}", S);
1580        else if (m > 0 && (v = k.withElected.replace("{0}", u.name).replace("{1}", d).replace("{2}", d > 1 ? "circonscriptions" : "circonscription").replace("{3}", m).replace("{4}", m > 1 ? "candidats sont consid\xE9r\xE9s comme \xE9lus" : "candidat est consid\xE9r\xE9 comme \xE9lu").replace("{5}", S), N)) {
1581          const I = l == null ? void 0 : l.status;
1582          I === 0 ? v += G.govAria : I >= 1 && (v += G.govAriaWithStatus.replace("{0}", I === 1 ? "minoritaire" : "majoritaire"));
1583        }
1584      }
1585      return {
1586        aheadNumber: d,
1587        ariaLabelResult: v,
1588        candidateName: g ? g == null ? void 0 : g.name : null,
1589        candidatePictureUrl: f,
1590        electedNumber: m,
1591        electedStatus: M,
1592        id: u.id,
1593        inLeadWidth: (d / o * 100).toFixed(1),
1594        partyColor: u.color,
1595        partyName: u.name,
1596        partyPictureUrl: y,
1597        partyPictureUrlDarkMode: L,
1598        progressionWidth: (m / o * 100).toFixed(1),
1599        strictlyAheadNumber: d - m,
1600        voteNumber: A,
1601        votePercent: S
1602      };
1603    });
1604  });
1605  as = (t) => E(We(t.id), (e) => {
1606    if (!e) return null;
1607    const a = {
1608      results: [],
1609      totalNumberOfResults: 0
1610    }, s = {
1611      name: "Circonscriptions",
1612      results: []
1613    };
1614    for (let r = 0; r < t.data.length; r += 1) {
1615      const n = Number(t.data[r]), i = Object.values(e).find((p) => p.id === n);
1616      if (i) {
1617        const p = {
1618          id: i.id,
1619          name: i.name,
1620          ridingId: i.id,
1621          subTitle: null,
1622          type: "riding"
1623        };
1624        a.totalNumberOfResults += 1, s.results.push(p);
1625      }
1626    }
1627    return s.results.length > 0 && a.results.push(s), a;
1628  });
1629  We = (t) => E((e) => {
1630    var _a2, _b, _c;
1631    return (_c = (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.data) == null ? void 0 : _c.ridings;
1632  }, (e) => e || null);
1633  ss = (t) => E((e) => {
1634    var _a2, _b, _c;
1635    return (_c = (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.data) == null ? void 0 : _c.parties;
1636  }, (e) => e || null);
1637  ns = (t) => C((e) => {
1638    var _a2, _b, _c;
1639    return (_c = (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.data) == null ? void 0 : _c.previousTimestamp;
1640  }, (e) => e);
1641  rs = (t) => C((e) => {
1642    var _a2, _b, _c;
1643    return (_c = (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.data) == null ? void 0 : _c.refreshToken;
1644  }, (e) => e);
1645  is = (t) => C((e) => {
1646    var _a2, _b, _c, _d, _e2, _f, _g;
1647    return (_g = (_f = (_c = (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.data) == null ? void 0 : _c.ridings) == null ? void 0 : _f[String((_e2 = (_d = e.modules.e6NManager) == null ? void 0 : _d[t]) == null ? void 0 : _e2.tooltipRidingId)]) == null ? void 0 : _g.name;
1648  }, (e) => e || null);
1649  ls = (t) => E((e) => {
1650    var _a2, _b;
1651    return (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.searchResults;
1652  }, (e) => e || null);
1653  os = (t) => {
1654    return E(We(t.id), (e = t.id, E((a) => {
1655      var _a2, _b, _c;
1656      return (_c = (_b = (_a2 = a.modules.e6NManager) == null ? void 0 : _a2[e]) == null ? void 0 : _b.data) == null ? void 0 : _c.candidates;
1657    }, (a) => a || null)), (a, s) => ((r, n, i) => {
1658      if (i && r && n) {
1659        const p = ze.toSearchableString(i, true), h = Object.values(r), l = Object.values(n), c = new j(h, Ie), o = new j(l, Ie), u = c.search(p), d = o.search(p), m = {
1660          totalNumberOfResults: u.length + d.length,
1661          results: []
1662        };
1663        if (u.length > 0 && m.results.push({
1664          name: D.ridingsLabel,
1665          results: u.slice(0, D.maximumSearchResults).map((g) => Ee(g, "riding"))
1666        }), m.results[0] && m.results[0].results.length === D.maximumSearchResults) return m;
1667        if (d.length > 0) {
1668          const g = D.maximumSearchResults - (m.results[0] ? m.results[0].results.length : 0);
1669          m.results.push({
1670            name: D.candidateLabel,
1671            results: d.slice(0, g).map((f) => Ee(f, "candidate", r[f.item.ridingId].name))
1672          });
1673        }
1674        return m;
1675      }
1676      return null;
1677    })(a, s, t.data));
1678    var e;
1679  };
1680  cs = (t) => C((e) => {
1681    var _a2, _b;
1682    return (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.currentRidingFocuses;
1683  }, (e) => e || null);
1684  us = (t) => C((e) => {
1685    var _a2, _b;
1686    return (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.data;
1687  }, (e) => {
1688    const a = e || null;
1689    return !!a && !!a.parties;
1690  });
1691  Vt = (t) => C(ee(t), J(t), q(t), (e) => {
1692    var _a2, _b;
1693    return (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.activeFilterOption;
1694  }, (e) => {
1695    var _a2, _b, _c;
1696    return (_c = (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.data) == null ? void 0 : _c.candidates;
1697  }, (e, a, s, r, n) => {
1698    const i = ((l, c) => {
1699      let o = null;
1700      return c && c.forEach((u) => {
1701        u.dropDownId === l && (o = u.filterId);
1702      }), o || (l ? l === 3 ? -1 : l : 1);
1703    })(s, r);
1704    if (i === -1 || s === 3) return ((l) => {
1705      const c = [], o = {
1706        filterId: null,
1707        groupName: null,
1708        subGroupItems: []
1709      };
1710      return l && l.forEach((u) => {
1711        const d = {
1712          id: u,
1713          ridingId: u,
1714          type: 1
1715        };
1716        o.subGroupItems.push(d);
1717      }), c.push(o), c;
1718    })(e);
1719    let p = null;
1720    a.forEach((l) => {
1721      l.id === s && (p = l);
1722    });
1723    let h = null;
1724    if (p.lists.forEach((l) => {
1725      l.id === i && (h = l);
1726    }), h.referencedIds.length < 2) {
1727      if (!s || s === 1) return ((l) => {
1728        const c = [], o = {
1729          filterId: null,
1730          groupName: null,
1731          subGroupItems: []
1732        }, u = l.referencedIds[0];
1733        return u.L && u.L.forEach((d) => {
1734          const m = {
1735            id: d,
1736            ridingId: d,
1737            type: 1
1738          };
1739          o.subGroupItems.push(m);
1740        }), c.push(o), c;
1741      })(h);
1742      if (s === 2) return ((l, c) => {
1743        const o = [], u = {
1744          filterId: null,
1745          groupName: null,
1746          subGroupItems: []
1747        }, d = l.referencedIds[0].L, m = d.map((g) => {
1748          const f = c == null ? void 0 : c[String(g)];
1749          return f ? f == null ? void 0 : f.ridingId : null;
1750        });
1751        if (d && m && d.length === m.length) for (let g = 0; g < d.length; g += 1) {
1752          const f = {
1753            id: d[g],
1754            ridingId: m[g],
1755            type: 2
1756          };
1757          u.subGroupItems.push(f);
1758        }
1759        return o.push(u), o;
1760      })(h, n);
1761    }
1762    return s && s !== 1 ? s === 2 ? ((l, c) => {
1763      const o = [];
1764      return l && l.referencedIds && l.referencedIds.forEach((u) => {
1765        const d = u.L, m = d.map((f) => {
1766          const y = c == null ? void 0 : c[String(f)];
1767          return y ? y == null ? void 0 : y.ridingId : null;
1768        }), g = {
1769          filterId: "".concat(l.id, "-").concat(u.I),
1770          groupName: u.NAME,
1771          subGroupItems: []
1772        };
1773        if (d && m && d.length === m.length) {
1774          for (let f = 0; f < d.length; f += 1) {
1775            const y = {
1776              id: d[f],
1777              ridingId: m[f],
1778              type: 2
1779            };
1780            g.subGroupItems.push(y);
1781          }
1782          o.push(g);
1783        }
1784      }), o;
1785    })(h, n) : null : ((l) => {
1786      const c = [];
1787      return l && l.referencedIds && l.referencedIds.forEach((o) => {
1788        const u = {
1789          filterId: "".concat(l.id, "-").concat(o.I),
1790          groupName: o.NAME,
1791          subGroupItems: []
1792        };
1793        o.L.forEach((d) => {
1794          const m = {
1795            id: d,
1796            ridingId: d,
1797            type: 1
1798          };
1799          u.subGroupItems.push(m);
1800        }), c.push(u);
1801      }), c;
1802    })(h);
1803  });
1804  Wt = (t) => C((e) => {
1805    var _a2, _b, _c, _d;
1806    return (_d = (_c = (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t.electionId]) == null ? void 0 : _b.data) == null ? void 0 : _c.ridings) == null ? void 0 : _d[String(t.data)];
1807  }, (e) => {
1808    var _a2, _b, _c;
1809    return (_c = (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t.electionId]) == null ? void 0 : _b.data) == null ? void 0 : _c.parties;
1810  }, (e) => {
1811    var _a2, _b, _c;
1812    return (_c = (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t.electionId]) == null ? void 0 : _b.data) == null ? void 0 : _c.currentRiding;
1813  }, ke("".concat(Ge.reduxStoreLabel), t.default), q(t.electionId), (e) => {
1814    var _a2, _b;
1815    return (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t.electionId]) == null ? void 0 : _b.activeFilterOption;
1816  }, (e, a, s, r, n, i) => {
1817    if (!e || !a) return null;
1818    const p = [], h = e == null ? void 0 : e.leadingPartyIds;
1819    if (h) for (let c = 0; c < h.length; c += 1) {
1820      const o = h == null ? void 0 : h[c];
1821      p.push(a == null ? void 0 : a[String(o)]);
1822    }
1823    let l = true;
1824    return i && n && i.forEach((c) => {
1825      c.dropDownId === n && c.filterId === 13 && (l = false);
1826    }), ((c, o, u, d, m) => {
1827      const g = c == null ? void 0 : c.id, f = c == null ? void 0 : c.name, y = c == null ? void 0 : c.status, L = c == null ? void 0 : c.differentialTextual, S = c == null ? void 0 : c.differentialA11y, A = je(y), N = z(y, "F"), M = u ? u.map((T) => T == null ? void 0 : T.name) : [], v = (c == null ? void 0 : c.hasAGain) && m, I = d ? c == null ? void 0 : c.specification : null;
1828      let _ = "";
1829      M && M.forEach((T, $) => {
1830        _ += T, $ !== M.length - 1 && ($ !== M.length - 2 ? _ += ", " : _ += " et ");
1831      });
1832      const x = u ? u.map((T) => ({
1833        color: T == null ? void 0 : T.color,
1834        acronym: T == null ? void 0 : T.acronym,
1835        name: T == null ? void 0 : T.name
1836      })) : null;
1837      let R = "";
1838      return _ && N ? (R = M.length === 1 ? w.ridingStatusLabel : w.ridingStatusLabelPlural, R = R.replace("{0}", _ || "").replace("{1}", N.toLowerCase()).replace("{2}", f).replace("{3}", S || "").replace("{4}", A).replace("{5}", v ? kt.listAttributeLabelA11y : "")) : R = w.noResultsYetLabel.replace("{0}", f), He(g, x, o === g, null, null, null, g, f, y, N, true, Pt.addToFavorites, R, L, null, I, v, null);
1839    })(e, s, p, r, l);
1840  });
1841  Bt = (t) => E(q(t.electionId), qt(t), (e, a) => {
1842    let s = null;
1843    return a && a.forEach((r) => {
1844      r.dropDownId === e && (s = r.filterId);
1845    }), s || e !== 3 ? s || (s = e) : s = -1, {
1846      dropDownId: e,
1847      currentFilter: s
1848    };
1849  });
1850  ds = (t) => E(Vt(t), (e) => e);
1851  hs = (t) => E(Wt(t), (e) => e);
1852  ps = (t) => E(((e) => C((a) => {
1853    var _a2, _b, _c, _d;
1854    return (_d = (_c = (_b = (_a2 = a.modules.e6NManager) == null ? void 0 : _a2[e.electionId]) == null ? void 0 : _b.data) == null ? void 0 : _c.candidates) == null ? void 0 : _d[String(e.data)];
1855  }, (a) => {
1856    var _a2, _b, _c;
1857    return (_c = (_b = (_a2 = a.modules.e6NManager) == null ? void 0 : _a2[e.electionId]) == null ? void 0 : _b.data) == null ? void 0 : _c.ridings;
1858  }, (a) => {
1859    var _a2, _b, _c;
1860    return (_c = (_b = (_a2 = a.modules.e6NManager) == null ? void 0 : _a2[e.electionId]) == null ? void 0 : _b.data) == null ? void 0 : _c.parties;
1861  }, (a) => {
1862    var _a2, _b, _c;
1863    return (_c = (_b = (_a2 = a.modules.e6NManager) == null ? void 0 : _a2[e.electionId]) == null ? void 0 : _b.data) == null ? void 0 : _c.currentRiding;
1864  }, ke("".concat(Ge.reduxStoreLabel), e.default), De(e.electionId), Bt(e), (a, s, r, n, i, p, h) => {
1865    if (!a || !s || !r) return null;
1866    const l = Object.values(r).find((o) => (o == null ? void 0 : o.id) === (a == null ? void 0 : a.partyId)), c = Object.values(s).find((o) => (o == null ? void 0 : o.id) === (a == null ? void 0 : a.ridingId));
1867    return Dt(a, c, l, n, p, h, i);
1868  }))(t), (e) => e);
1869  ms = (t) => C(J(t), q(t), (e) => {
1870    var _a2, _b;
1871    return (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.activeFilterOption;
1872  }, (e, a, s) => {
1873    if (a === 3) return {
1874      type: 1,
1875      hasSpecificationOption: false
1876    };
1877    const r = {
1878      type: a === 2 ? 0 : 1,
1879      hasSpecificationOption: a !== 2 && e && e[a - 1].lists[0].hasSpecificationOption
1880    };
1881    return s && e && e.forEach((n) => {
1882      n.id === a && n.lists.forEach((i) => {
1883        s.forEach((p) => {
1884          i.id === p.filterId && (r.type = i.type, r.hasSpecificationOption = i.hasSpecificationOption);
1885        });
1886      });
1887    }), r;
1888  });
1889  gs = (t) => C(Ve(t), (e) => !!e && e.id === -1);
1890  fs = (t) => C(ee(t.id), (e) => !!e && e.includes(t.ridingId));
1891  ys = (t) => C((e) => {
1892    var _a2, _b;
1893    return (_b = (_a2 = e.modules.e6NManager) == null ? void 0 : _a2[t]) == null ? void 0 : _b.currentRiding;
1894  }, (e) => e && e > -1);
1895  bs = /\d/;
1896  vs = /\s/g;
1897  Ns = /^([abceghj-nprstvxyABCEGHJ-NPRSTVXY][0-9][abceghj-nprstv-zABCEGHJ-NPRSTV-Z][0-9][abceghj-nprstv-zABCEGHJ-NPRSTV-Z][0-9])$/;
1898  Ms = (t) => t ? t.toString().length > 4 ? t.toString().replace(/\B(?=(\d{3})+(?!\d))/g, "\xA0") : t : 0;
1899  Ls = function(t, e) {
1900    return {
1901      type: lt,
1902      payload: {
1903        electionId: e,
1904        subscribers: t
1905      }
1906    };
1907  };
1908  Is = function(t, e, a) {
1909    return {
1910      type: dt,
1911      payload: {
1912        electionId: t,
1913        id: e,
1914        focus: a
1915      }
1916    };
1917  };
1918  Es = function(t) {
1919    return {
1920      type: gt,
1921      payload: t
1922    };
1923  };
1924  Ss = function(t) {
1925    return {
1926      type: yt,
1927      payload: t
1928    };
1929  };
1930  xs = function(t) {
1931    return {
1932      type: mt,
1933      payload: t
1934    };
1935  };
1936  Rs = function(t) {
1937    return {
1938      type: pt,
1939      payload: t
1940    };
1941  };
1942  As = function(t) {
1943    return {
1944      type: ft,
1945      payload: t
1946    };
1947  };
1948  Ts = function(t) {
1949    return {
1950      type: ot,
1951      payload: t
1952    };
1953  };
1954  _s = function(t) {
1955    return {
1956      type: ht,
1957      payload: t
1958    };
1959  };
1960  Cs = function(t) {
1961    return {
1962      type: bt,
1963      payload: t
1964    };
1965  };
1966  Os = function(t) {
1967    return {
1968      type: ct,
1969      payload: t
1970    };
1971  };
1972  Ps = function(t) {
1973    return {
1974      type: ut,
1975      payload: t
1976    };
1977  };
1978  ks = function(t) {
1979    return {
1980      type: Mt,
1981      data: t
1982    };
1983  };
1984  ws = function(t) {
1985    return {
1986      type: vt,
1987      data: t
1988    };
1989  };
1990  $s = function(t) {
1991    return {
1992      type: Nt,
1993      data: t
1994    };
1995  };
1996  Fs = function(t) {
1997    return {
1998      type: Lt,
1999      data: t
2000    };
2001  };
2002});
2003export {
2004  xa as $,
2005  ia as A,
2006  O as B,
2007  Xa as C,
2008  Ht as D,
2009  k as E,
2010  Za as F,
2011  Le as G,
2012  Ka as H,
2013  J as I,
2014  Os as J,
2015  ya as K,
2016  fa as L,
2017  Aa as M,
2018  is as N,
2019  ys as O,
2020  za as P,
2021  ss as Q,
2022  We as R,
2023  _s as S,
2024  Is as T,
2025  Oa as U,
2026  ka as V,
2027  Pt as W,
2028  jt as X,
2029  D as Y,
2030  ke as Z,
2031  Fa as _,
2032  __tla,
2033  la as a,
2034  ja as a$,
2035  w as a0,
2036  kt as a1,
2037  Ba as a2,
2038  fs as a3,
2039  ps as a4,
2040  hs as a5,
2041  ds as a6,
2042  Ya as a7,
2043  ms as a8,
2044  qt as a9,
2045  gt as aA,
2046  dt as aB,
2047  Nt as aC,
2048  Mt as aD,
2049  Ia as aE,
2050  lt as aF,
2051  Ea as aG,
2052  bt as aH,
2053  xs as aI,
2054  Rs as aJ,
2055  Ls as aK,
2056  rs as aL,
2057  Es as aM,
2058  ot as aN,
2059  as as aO,
2060  As as aP,
2061  os as aQ,
2062  cs as aR,
2063  vs as aS,
2064  Ns as aT,
2065  us as aU,
2066  Ss as aV,
2067  Sa as aW,
2068  Na as aX,
2069  ga as aY,
2070  vt as aZ,
2071  Lt as a_,
2072  Ve as aa,
2073  gs as ab,
2074  q as ac,
2075  Ps as ad,
2076  _a as ae,
2077  Ca as af,
2078  Ta as ag,
2079  Ge as ah,
2080  Ts as ai,
2081  ls as aj,
2082  bs as ak,
2083  Ra as al,
2084  Ma as am,
2085  ua as an,
2086  da as ao,
2087  ha as ap,
2088  ma as aq,
2089  pa as ar,
2090  it as as,
2091  ut as at,
2092  ct as au,
2093  mt as av,
2094  pt as aw,
2095  ft as ax,
2096  yt as ay,
2097  ht as az,
2098  oa as b,
2099  Da as b0,
2100  ks as b1,
2101  ba as b2,
2102  La as b3,
2103  ca as b4,
2104  E as c,
2105  wa as d,
2106  G as e,
2107  $a as f,
2108  Pa as g,
2109  Ha as h,
2110  ns as i,
2111  Ut as j,
2112  qa as k,
2113  Ua as l,
2114  Ja as m,
2115  Ms as n,
2116  X as o,
2117  es as p,
2118  Wa as q,
2119  Qa as r,
2120  va as s,
2121  ts as t,
2122  Va as u,
2123  Ga as v,
2124  Cs as w,
2125  $s as x,
2126  Fs as y,
2127  ws as z
2128};

Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.