File size: 39,901 Bytes
00f42f8 5a3991e 00f42f8 e79873b 00f42f8 5a3991e 00f42f8 7badcff 00f42f8 5a3991e 00f42f8 0ba5932 5a3991e e79873b 7badcff 0ba5932 7badcff 0ba5932 8fb90d0 7badcff 8fb90d0 7badcff 8fb90d0 7badcff 0ba5932 7badcff 8fb90d0 0ba5932 8fb90d0 0ba5932 7badcff 0ba5932 7badcff 0ba5932 00f42f8 6322def 00f42f8 6322def 00f42f8 6322def 00f42f8 6322def 00f42f8 5a3991e 00f42f8 0ba5932 00f42f8 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 | /* The night sky: Mathly's rewards and the pictures behind them.
A skill is a star and a unit is a constellation. A skill is finished (its star lit) once every question was answered
right and the last MASTER_RUN answers were right at the first try, so a lucky guess or a remembered answer is not
enough; GOLD_RUN first-try answers in a row (or every question, when it has fewer) turn it gold. A finished skill
comes back for spaced review (`review`, after 1, 3, 7, 14, 30 and 60 days; a miss starts over). A finished skill not practised for
FADE_DAYS fades until one correct answer brightens it again. GOAL correct answers make a day; days in a row make the
streak, and one missed day does not break it. Now and then a comet crosses the screen and can be caught for the
collection. All of it lives in the student's progress (P, see math.js): run, gold, seen, days, comets, cometDay, and the
misconceptions met along the way (slips, see "misconception patterns").
Pure rules first, then the drawings (owl, constellations), then the effects (sound, sparkles, overlays). */
(function(){
"use strict";
const GOAL=5, FADE_DAYS=14, DAY=86400000, LABEL_W=96, MASTER_RUN=3, GOLD_RUN=5, INTERVALS=[1,3,7,14,30,60];
const masterNeed=n=>Math.min(MASTER_RUN,Math.max(1,n)), goldNeed=n=>Math.min(GOLD_RUN,Math.max(1,n));
const SPARK="M12 1.5C13.1 9 15 10.9 22.5 12C15 13.1 13.1 15 12 22.5C10.9 15 9 13.1 1.5 12C9 10.9 10.9 9 12 1.5Z";
const spark=(cls="")=>`<svg viewBox="0 0 24 24" class="${cls}" aria-hidden="true"><path d="${SPARK}"/></svg>`;
const FLAME=`<svg viewBox="0 0 24 24" aria-hidden="true"><path d="M12.6 1.8c.6 4.3 6.4 6.6 6.4 12.2a7 7 0 0 1-14 0c0-3 1.6-5 3-6.2-.1 2.4.9 4 2.4 4.4-.5-3.9-.1-7.6 2.2-10.4z"/></svg>`;
const esc=s=>String(s??"").replace(/[&<>"']/g,c=>({"&":"&","<":"<",">":">",'"':""","'":"'"}[c]));
/* ---------- rules ---------- */
const dayKey=(d=new Date())=>`${d.getFullYear()}-${String(d.getMonth()+1).padStart(2,"0")}-${String(d.getDate()).padStart(2,"0")}`;
const daysBack=(n,from)=>{const d=new Date(from);d.setDate(d.getDate()-n);return d};
function ensure(P){ for(const k of ["run","gold","seen","days","review","missed","examples"]) if(!P[k]||typeof P[k]!=="object") P[k]={}; for(const k of ["comets","slips"]) if(!Array.isArray(P[k])) P[k]=[]; return P; }
function fading(P,id,now=new Date()){
if(!P.done?.[id]) return false;
const t=Date.parse(P.seen?.[id]||P.done[id]);
return !isNaN(t)&&now-t>FADE_DAYS*DAY;
}
/* A correct answer in skill `id`. `first`: answered at the first try; `n`: the skill's questions; `finished`: the skill
is done after this answer. Returns what changed: a new gold star, the day's goal just reached, a faded star revived. */
function correct(P,id,{first,n,finished,now=new Date()}){
ensure(P);
const revived=fading(P,id,now), k=dayKey(now), t=now.toISOString();
P.days[k]=(P.days[k]||0)+1; P.seen[id]=t;
P.run[id]=first?(P.run[id]||0)+1:0;
const gold=!!finished&&!P.gold[id]&&P.run[id]>=goldNeed(n);
if(gold) P.gold[id]=t;
return {gold,goal:P.days[k]===GOAL,revived};
}
function wrong(P,id){ ensure(P); P.run[id]=0; (P.wrongs||={})[id]=(P.wrongs[id]||0)+1; } // wrongs: every wrong answer, per skill
/* ---------- spaced review ---------- */
const later=(days,now)=>dayKey(daysBack(-days,now));
// a skill just finished: first review tomorrow
function mastered(P,id,now=new Date()){ ensure(P); P.review[id]={box:0,due:later(INTERVALS[0],now)}; }
// a review answer: right moves the next review further away, wrong brings it back tomorrow
function reviewed(P,id,ok,now=new Date()){
ensure(P); const box=ok?Math.min((P.review[id]?.box??-1)+1,INTERVALS.length-1):0;
P.review[id]={box,due:later(INTERVALS[box],now)};
}
// is a finished skill due for review today? (one finished before reviews existed: a day after it was last seen)
function due(P,id,now=new Date()){
if(!P.done?.[id]) return false;
const r=P.review?.[id]; if(r?.due) return r.due<=dayKey(now);
const t=Date.parse(P.seen?.[id]||P.done[id]); return !isNaN(t)&&now-t>=DAY;
}
/* ---------- misconception patterns ----------
Every tagged wrong answer is kept in P.slips ({at, id: skill, q: question index, m: mistake tag, via: practice |
review | exam}), newest last, at most SLIP_MAX. patterns() reads it: a tag is recurring when it came up at least
twice in RECUR_DAYS and once in the last QUIET_DAYS; it has stopped when it once came up twice within RECUR_DAYS,
but not in the last QUIET_DAYS, and less than GONE_DAYS ago. */
const SLIP_MAX=500, RECUR_DAYS=30, QUIET_DAYS=14, GONE_DAYS=60, PATTERNS_SHOWN=3;
function slip(P,id,q,m,via,now=new Date()){
ensure(P); if(!m) return;
P.slips.push({at:now.toISOString(),id,q,m,via});
if(P.slips.length>SLIP_MAX) P.slips.splice(0,P.slips.length-SLIP_MAX);
}
// `mistakes`: the graph's mistakes by tag (for the skill each one sends back to)
function patterns(P,mistakes={},now=new Date()){
const by={};
for(const s of P.slips||[]){ const t=Date.parse(s?.at); if(s?.m&&!isNaN(t)&&t<=now) (by[s.m]||=[]).push({t,id:s.id}); }
const recurring=[], stopped=[], age=t=>(now-t)/DAY;
for(const [m,all] of Object.entries(by)){
all.sort((a,b)=>a.t-b.t);
const last=all.at(-1).t;
if(age(last)>=GONE_DAYS) continue;
const recent=all.filter(x=>age(x.t)<RECUR_DAYS);
const item=list=>{
const count={}, seen={};
for(const x of list){ count[x.id]=(count[x.id]||0)+1; seen[x.id]=x.t; }
const skills=Object.keys(count).sort((a,b)=>count[b]-count[a]||seen[b]-seen[a]);
return {m,n:list.length,skills,last:new Date(last).toISOString(),practise:mistakes[m]?.back||skills[0]};
};
if(age(last)<QUIET_DAYS){ if(recent.length>=2) recurring.push(item(recent)); }
else if(all.some((x,i)=>i>0&&(x.t-all[i-1].t)/DAY<=RECUR_DAYS)) stopped.push(item(all));
}
const rank=(a,b)=>b.skills.length-a.skills.length||b.n-a.n||b.last.localeCompare(a.last);
return {recurring:recurring.sort(rank).slice(0,PATTERNS_SHOWN),stopped:stopped.sort(rank).slice(0,PATTERNS_SHOWN)};
}
/* ---------- the class teacher's signals ----------
Who needs the teacher's attention, worked out from what the report loads for a student: the saved progress, and the
server's quiz sittings (see class_report.py). The progress is what the student's device reports, so these are prompts
to look, not grades. A week runs from Sunday. */
const INACTIVE_DAYS=7, STUCK_SLIPS=3, STUCK_WINDOW_DAYS=14, DROP_RATIO=.5, DROP_MIN_LAST_WEEK=10, LOW_GRADE=55;
const midnight=d=>new Date(d.getFullYear(),d.getMonth(),d.getDate());
const keyDate=k=>{ const m=/^(\d{4})-(\d\d)-(\d\d)$/.exec(k); return m?new Date(+m[1],m[2]-1,+m[3]):null; };
const daysBetween=(a,b)=>Math.round((midnight(b)-midnight(a))/DAY);
// the latest day the student answered right: from the per-day counts and from when each skill was last practised
function lastPractice(P){
const times=[];
for(const [k,n] of Object.entries(P.days||{})){ const d=keyDate(k); if(d&&n>0) times.push(d.getTime()); }
for(const v of Object.values(P.seen||{})){ const t=Date.parse(v); if(!isNaN(t)) times.push(t); }
return times.length?new Date(Math.max(...times)):null;
}
// right answers this week (from Sunday) and in the week before
function weekly(P,now=new Date()){
const start=midnight(now); start.setDate(start.getDate()-start.getDay());
const prev=new Date(start); prev.setDate(prev.getDate()-7);
let thisWeek=0, lastWeek=0;
for(const [k,n] of Object.entries(P.days||{})){
const d=keyDate(k); if(!d||!(n>0)) continue;
if(d>=start) thisWeek+=n; else if(d>=prev) lastWeek+=n;
}
return {thisWeek,lastWeek};
}
/* The reasons a student needs attention (empty: none). `student`: {signed_in, progress, quiz_sittings}.
`ctx`: {skills: name by skill id (the class's skills), units: [{id, name}] (the class units with a quiz)}. */
function attention(student,{skills={},units=[],assignments=[]}={},now=new Date()){
const P=student.progress, out=[];
if(!P) return student.signed_in?[{kind:"new",text:"ืขืื ืื ืืชืืื ืืชืจืื"}]:[];
const last=lastPractice(P);
if(last){ const n=daysBetween(last,now); if(n>=INACTIVE_DAYS) out.push({kind:"inactive",text:`ืื ืชืจืื ${n} ืืืื`}); }
const cut=now-STUCK_WINDOW_DAYS*DAY, count={};
for(const x of P.slips||[]){ const t=Date.parse(x?.at); if(x?.id&&!isNaN(t)&&t>=cut&&t<=now) count[x.id]=(count[x.id]||0)+1; }
const stuck=Object.keys(count).filter(id=>count[id]>=STUCK_SLIPS&&!P.done?.[id]&&skills[id]).sort((a,b)=>count[b]-count[a]);
if(stuck.length) out.push({kind:"stuck",skills:stuck,text:`${stuck.length===1?"ืชืงืืข ืืืืืื ืืช":"ืชืงืืข ืืืืืื ืืืืช"}: ${stuck.map(id=>skills[id]).join(", ")}`});
const w=weekly(P,now);
if(w.lastWeek>=DROP_MIN_LAST_WEEK&&w.thisWeek<w.lastWeek*DROP_RATIO)
out.push({kind:"drop",text:`ืืชืจืืื ืืจื: ${w.thisWeek} ืชืฉืืืืช ื ืืื ืืช ืืฉืืืข, ${w.lastWeek} ืืฉืืืข ืฉืขืืจ`});
for(const u of units){ // the server's grades only; without them (null) the signal is left out
// the official grade (the latest final sitting) when there is one, else the latest practice sitting
const graded=(student.quiz_sittings||[]).filter(x=>x.unit_id===u.id&&x.grade!=null).sort((a,b)=>String(a.submitted_at).localeCompare(String(b.submitted_at)));
const g=graded.filter(x=>x.mode==="final").at(-1)||graded.at(-1);
if(g&&g.grade<LOW_GRADE) out.push({kind:"grade",unit:u.id,final:g.mode==="final",text:`ืฆืืื ื ืืื ื${g.mode==="final"?"ืืืื ืืืกืื ืฉื":"ืืืื ืืืืืืง ืฉื"} ${u.name}: ${g.grade}`});
}
for(const a of assignments){ // an assignment past its due date and not finished (left out when a unit quiz cannot be told)
if(a.student_emails?.length&&!a.student_emails.includes(student.email)) continue; // focus practice for others
const st=assignmentState(a,P,{sittings:student.quiz_sittings,submissions:student.worksheet_submissions},now);
if(st.overdue&&st.items.every(x=>x.known)) out.push({kind:"assignment",assignment:a.id,text:`ืืฉืืื ืืืืืืจ: ${a.title}`});
}
return out;
}
/* ---------- assignments (app/assignments.py) ----------
Whether an assignment's items are done is worked out from what already exists, the same way on the student's home
screen and in the teacher's report. A skill is done when it is finished, whenever that was. A unit quiz is done when
the server has a sitting of it handed in after the assignment was made (`sittings`: [{unit_id, submitted_at}], null
when the server's record could not be read), and a practice exam when one covering all the item's units was taken
after that (P.quizzes), and a worksheet when the student handed in a solution (`submissions`: [{worksheet_id,
submitted_at, โฆ}] from app/worksheets.py, null when they could not be read). The third argument is {sittings,
submissions}; a bare array is the sittings. Dates are Jerusalem days: an item done on the due date is on time. */
const jerusalemDay=t=>new Date(t).toLocaleDateString("en-CA",{timeZone:"Asia/Jerusalem"}); // YYYY-MM-DD
function assignmentState(a,P,server,now=new Date()){
const {sittings,submissions}=Array.isArray(server)||server==null?{sittings:server,submissions:[]}:server;
const created=Date.parse(a.created_at)||0, due=String(a.due_on);
const earliest=list=>list.filter(Boolean).sort()[0]||null;
const items=(a.items||[]).map(item=>{
let at=null, known=true, submission=null, itemDue=due;
if(item.kind==="skill") at=P?.done?.[item.id]||null;
else if(item.kind==="unit_quiz"){
known=Array.isArray(sittings);
at=earliest((sittings||[]).filter(x=>x.unit_id===item.unit&&Date.parse(x.submitted_at)>created).map(x=>x.submitted_at));
}else if(item.kind==="exam")
at=earliest((P?.quizzes||[]).filter(x=>Date.parse(x.at)>created&&(item.units||[]).every(u=>(x.units||[]).includes(u))).map(x=>x.at));
else if(item.kind==="worksheet"){
known=Array.isArray(submissions);
submission=(submissions||[]).find(x=>x.worksheet_id===item.id)||null;
// returned for a fix: not done until the next version is handed in, by the new due date when the teacher gave one
at=submission&&submission.state!=="returned"?submission.submitted_at||null:null;
const back=submission?.state==="returned"?submission.return_due_on:(submission?.earlier||[]).find(e=>e.return_due_on)?.return_due_on;
if(back&&back>itemDue) itemDue=back;
}
return {item,done:!!at,at,known,submission,due:itemDue,returned:submission?.state==="returned",late:!!at&&jerusalemDay(at)>itemDue};
});
const doneCount=items.filter(x=>x.done).length, finished=items.length>0&&doneCount===items.length, today=jerusalemDay(now);
return {items,doneCount,total:items.length,finished,overdue:!finished&&items.some(x=>!x.done&&today>x.due),
late:finished&&items.some(x=>x.late),next:items.findIndex(x=>!x.done)};
}
/* Where a student most needs work, skill by skill (the teacher's focus profile and the student's exam preparation).
A skill's weakness score adds: unit-quiz points lost on it in the last 60 days (checked answers only; a question's
lost points are split between the skills it names), wrong answers in it in the last 14 days, being started but not
finished, and fading. The weights are here, in one place. */
const FOCUS={QUIZ_DAYS:60,WRONG_DAYS:14,TOP:5,W:{lost:2/25,wrong:1,unfinished:2,fading:1}};
function quizLost(sittings,now=new Date()){
const out={}, since=now-FOCUS.QUIZ_DAYS*DAY;
for(const v of sittings||[]){
const t=Date.parse(v?.submitted_at); if(isNaN(t)||t<since||t>now) continue;
for(const q of v.questions||[]){
if(q.earned==null||q.earned>=q.points||!q.skills?.length) continue;
const share=(q.points-q.earned)/q.skills.length;
for(const id of q.skills) out[id]=(out[id]||0)+share;
}
}
return out;
}
function focus(P,sittings,ids,now=new Date()){
P=P||{}; const lost=quizLost(sittings,now), since=now-FOCUS.WRONG_DAYS*DAY, wrong={};
for(const x of P.slips||[]){ const t=Date.parse(x?.at); if(x?.id&&!isNaN(t)&&t>=since&&t<=now) wrong[x.id]=(wrong[x.id]||0)+1; }
const out=[];
for(const id of ids){
const started=!!(P.tries?.[id]||(P.missed?.[id]||[]).length||P.seen?.[id]);
const f={id,lost:Math.round((lost[id]||0)*10)/10,wrong:wrong[id]||0,unfinished:started&&!P.done?.[id],fading:fading(P,id,now)};
f.score=f.lost*FOCUS.W.lost+f.wrong*FOCUS.W.wrong+(f.unfinished?FOCUS.W.unfinished:0)+(f.fading?FOCUS.W.fading:0);
if(f.score>0) out.push(f);
}
return out.sort((a,b)=>b.score-a.score||b.lost-a.lost||b.wrong-a.wrong);
}
/* ---------- quizzes chosen for each student (openspec student-home-and-exam-quizzes) ----------
chance(): how likely the student is to answer a topic right, from their answers so far: (right + 1) / (answers + 2),
lifted for a finished or gold topic and lowered while it fades. Under MIN_ANSWERS answers it is unknown (null).
pickQuiz(): questions for a quiz that aims at an expected score (`target`): topics the student started and has not
mastered ("close") first, then finished ones until the expected score reaches the target, at most PER_SKILL questions
a topic; topics with too few answers fill what is left, the most recently taught first. Topics never practised are
never asked. Questions the student saw in earlier attempts come last, the ones seen longest ago first.
The numbers are here, in one place. */
const CHANCE={MIN_ANSWERS:5,DONE:.8,GOLD:.9,FADING:.1,CLOSE:.75,UNKNOWN:.6,PER_SKILL:3};
function wrongsOf(P,id){
let n=0; for(const s of P.slips||[]) if(s?.id===id) n++;
return Math.max(n,+(P.wrongs?.[id])||0); // the slips keep the history from before P.wrongs, at most 500
}
const practised=(P,id)=>!!(P.tries?.[id]||P.seen?.[id]||(P.missed?.[id]||[]).length||P.done?.[id]);
function chance(P,id,now=new Date()){
const tries=+(P.tries?.[id])||0; if(tries<CHANCE.MIN_ANSWERS) return null;
let p=(tries-Math.min(tries,wrongsOf(P,id))+1)/(tries+2);
if(P.done?.[id]) p=Math.max(p,CHANCE.DONE);
if(P.gold?.[id]) p=Math.max(p,CHANCE.GOLD);
if(fading(P,id,now)) p-=CHANCE.FADING;
return Math.min(.99,Math.max(.01,p));
}
/* `pool`: [{id, qs: [question indexes with choices], rank: higher = taught more recently}]; `seen`: {"id:qi": time
last asked in this quiz}. Returns {items: [{id, qi}], expected (0..1), unknown: how many came from unknown topics}. */
function pickQuiz(P,pool,{target=.7,n=12,seen={},now=new Date(),random=Math.random}={}){
const topics=(pool||[]).filter(t=>t.qs?.length&&practised(P,t.id)).map(t=>({...t,c:chance(P,t.id,now),k:0,left:t.qs.slice()}));
const known=topics.filter(t=>t.c!=null), unknown=topics.filter(t=>t.c==null).sort((a,b)=>b.rank-a.rank);
const close=known.filter(t=>!P.done?.[t.id]||t.c<CHANCE.CLOSE).sort((a,b)=>b.c-a.c);
const solid=known.filter(t=>!close.includes(t)).sort((a,b)=>a.c-b.c);
const items=[]; let sum=0;
// one question of the topic: one not seen in this quiz before, else the one seen longest ago
const take=t=>{
const fresh=t.left.filter(qi=>!seen[`${t.id}:${qi}`]);
const qi=fresh.length?fresh[Math.floor(random()*fresh.length)]
:t.left.slice().sort((a,b)=>String(seen[`${t.id}:${a}`]).localeCompare(String(seen[`${t.id}:${b}`])))[0];
t.left.splice(t.left.indexOf(qi),1); t.k++;
items.push({id:t.id,qi}); sum+=t.c??CHANCE.UNKNOWN;
};
// the next topic of a list, taking turns, while it has room and questions
const turn=(list,cap)=>{ const t=list.filter(x=>x.k<cap&&x.left.length).sort((a,b)=>a.k-b.k)[0]; if(t) take(t); return !!t; };
while(items.length<n){
const low=!items.length||sum/items.length<target;
if(!(low?turn(solid,CHANCE.PER_SKILL)||turn(close,CHANCE.PER_SKILL):turn(close,CHANCE.PER_SKILL)||turn(solid,CHANCE.PER_SKILL))) break;
}
while(items.length<n&&turn(unknown,CHANCE.PER_SKILL));
while(items.length<n&&turn([...close,...solid,...unknown],Infinity)); // still short: more of the same topics
const fromUnknown=new Set(unknown.map(t=>t.id));
return {items,expected:items.length?sum/items.length:0,unknown:items.filter(x=>fromUnknown.has(x.id)).length};
}
/* One state for each thing a student owes, chosen in this order; the student's task list and the teacher's views use
the same, so both always say the same thing. */
const TASK_LABELS={returned:"ืืืืืจ ืืชืืงืื",late:"ืืืืืืจ",waiting:"ืืืชืื ืืืืืงื",checked:"ื ืืืง",handed:"ืืืืฉ",progress:"ืืชืืืื",new:"ืขืื ืื ืืชืืื"};
function taskState(f){
return f.returned?"returned":f.overdue?"late":f.waiting?"waiting":f.checked?"checked":f.handedIn?"handed":f.started?"progress":"new";
}
const subState=x=>x?(x.state||(x.checked_at?"checked":"submitted")):null;
// an assignment's state for one student (assignmentState's facts, read as one word)
function assignmentTask(a,P,server,now=new Date()){
const st=assignmentState(a,P,server,now), sheets=st.items.filter(x=>x.item.kind==="worksheet");
const state=taskState({returned:st.items.some(x=>x.returned),overdue:st.overdue,
waiting:sheets.some(x=>subState(x.submission)==="submitted"),
checked:st.finished&&sheets.length>0&&sheets.every(x=>subState(x.submission)==="checked"),
handedIn:st.finished,started:st.doneCount>0});
return {st,state,label:TASK_LABELS[state]};
}
// a final quiz open to the student: started, handed in (waiting for its results) or not yet
function finalTask(offer){
const state=taskState({waiting:!!offer.start?.sitting_id,started:!!offer.start});
return {state,label:state==="waiting"?"ืืืืฉ ยท ืืืชืื ืืชืืฆืืืช":TASK_LABELS[state]};
}
/* a star's look: gold, lit, fading (finished), next, open, locked, off */
function star(P,id,status,isNext){
if(status==="done") return P.gold?.[id]?"gold":fading(P,id)?"fading":"lit";
if(status==="open") return isNext?"next":"open";
return status;
}
const today=P=>(P.days||{})[dayKey()]||0;
function streak(P,now=new Date()){
const days=P.days||{}, met=d=>(days[dayKey(d)]||0)>=GOAL;
let n=0, missed=0;
for(let i=met(now)?0:1;i<1000;i++){ if(met(daysBack(i,now))){n++;missed=0} else if(++missed>1) break; }
return n;
}
const DAY_NAMES=["ื","ื","ื","ื","ื","ื","ืฉ"];
/* A day on the streak calendar: "met" (the goal was reached), "saved" (missed, but the streak went on over it:
the day before was met and the day after is met, or is today and still open), "some" (practised, short of the
goal) or "" (nothing). Today and later are "met" or "" only, since the day is not over. */
function dayState(P,d,now=new Date()){
const days=P.days||{}, n=k=>days[dayKey(k)]||0, met=k=>n(k)>=GOAL, t=dayKey(now), key=dayKey(d);
if(met(d)) return "met";
if(key>=t) return "";
const after=daysBack(-1,d);
if(met(daysBack(1,d))&&(met(after)||dayKey(after)===t)) return "saved";
return n(d)?"some":"";
}
// a month for the calendar, weeks from Sunday: blanks before the 1st, then {day,key,state,today,future}
function month(P,y,m,now=new Date()){
const first=new Date(y,m,1), len=new Date(y,m+1,0).getDate(), t=dayKey(now), cells=Array(first.getDay()).fill(null);
for(let i=1;i<=len;i++){ const d=new Date(y,m,i), key=dayKey(d); cells.push({day:i,key,state:dayState(P,d,now),today:key===t,future:key>t}); }
return cells;
}
// the longest streak ever, by the same rule as streak(): one missed day between met days does not break it
function best(P,now=new Date()){
const keys=Object.keys(P.days||{}).filter(k=>P.days[k]>=GOAL).sort(); if(!keys.length) return 0;
const [y,m,d]=keys[0].split("-").map(Number);
let top=0, run=0, missed=0;
for(const day=new Date(y,m-1,d);dayKey(day)<=dayKey(now);day.setDate(day.getDate()+1)){
if((P.days[dayKey(day)]||0)>=GOAL){ run++; missed=0; top=Math.max(top,run); } else if(++missed>1) run=0;
}
return top;
}
/* ---------- comets ---------- */
const COMETS=[
{id:"pi",sym:"ฯ",name:"ืคืื",fact:"ืืืืก ืืื ืืืืงืฃ ืฉื ืืขืื ืืงืืืจ ืฉืื. ืืกืคืจืืช ืฉืื ืืืจื ืื ืงืืื ืื ื ืืืจืืช ืืื ืืืืจืืช ืขื ืขืฆืื."},
{id:"fib",sym:"1,1,2,3,5",name:"ืคืืืื ืืฆืณื",fact:"ืื ืืกืคืจ ืืกืืจื ืืื ืกืืื ืฉื ื ืืงืืืืื. ืืกืืจื ืืืคืืขื ืืกืคืืจืืืช ืฉื ืืจืขืื ื ืืื ืืื ืืืืฆืืจืืืืื."},
{id:"phi",sym:"ฯ",name:"ืืืก ืืืื",fact:"ืืขืจื 1.618. ืืืืงืื ืงืืข ืื ืฉืืืืก ืืื ืืฉืื ืืืืง ืืืืื ืฉืืื ืืืืก ืืื ืืืืื ืืงืื. ืืืคืืข ืืคืจืืื, ืืฆืืคืื ืืืืื ืืช."},
{id:"inf",sym:"โ",name:"ืืื ืกืืฃ",fact:"ืืฉ ืืื ืกืืฃ ืืกืคืจืื ืฉืืืื, ืืืฉ ืื ืืื ืกืืฃ ืืกืคืจืื ืืื 0 ืึพ1. ืืชืืจืจ ืฉืืืื ืกืืฃ ืืฉื ื ืืืื ืืืชืจ."},
{id:"e",sym:"e",name:"ืืืกืคืจ e",fact:"ืืขืจื 2.718. ืืืคืืข ืืื ืืงืื ืฉืื ืืฉืื ืืื ืืงืฆื ืฉืชืืื ืืืืื ืฉืื: ืจืืืืช, ืืืืืืกืืืช, ืืืืืงืื."},
{id:"r2",sym:"โ2",name:"ืฉืืจืฉ 2",fact:"ืืืืจื ืฉื ืืืืกืื ืืจืืืืข ืฉืฆืืขื 1. ืืืจ ืืืืื ืื ืืงืืืื ืื ืืืืืื ืฉืื ืืคืฉืจ ืืืชืื ืืืชื ืืฉืืจ."},
{id:"zero",sym:"0",name:"ืืคืก",fact:"ืืืฉื ืืืคื ืฉื ืื ืื ืืื ืกืืื ืืืคืก. ืืื ืืืืข ืืืืื, ืืืืืืชื ืืคืฉืจ ืืืชืื ืื ืืกืคืจ ืืขืฉืจ ืกืคืจืืช ืืืื."},
{id:"pyth",sym:"aยฒ+bยฒ=cยฒ",name:"ืคืืชืืืจืก",fact:"ืืืฉืืืฉ ืืฉืจ ืืืืืช, ืกืืื ืจืืืืขื ืื ืืฆืืื ืฉืืื ืืจืืืืข ืืืชืจ. ืืืืข ืืืืชืจ ืึพ370 ืืืืืืช ืฉืื ืืช."},
{id:"prime",sym:"2,3,5,7",name:"ืืกืคืจืื ืจืืฉืื ืืื",fact:"ืืกืคืจืื ืฉืืชืืืงืื ืจืง ืึพ1 ืืืขืฆืื. ืืฉ ืืื ืกืืฃ ืืืื, ืืขืืืื ืื ืืื ืืืฆืคื ื ืฉื ืืืื ืืจื ื."},
{id:"pascal",sym:"1 2 1",name:"ืืฉืืืฉ ืคืกืงื",fact:"ืื ืืกืคืจ ืืื ืกืืื ืฉื ื ืืืกืคืจืื ืฉืืขืืื. ืืฉืืจืืช ืฉืื ื ืืชื ืืช ืืช ืืืงืืืื ืฉื (a + b) ืืื ืืืงื."},
{id:"euler",sym:"VโE+F=2",name:"ื ืืกืืช ืืืืืจ",fact:"ืืื ืืืฃ ืืฉืืืื, ืงืืืงืืืื ืคืืืช ืืงืฆืืขืืช ืืขืื ืคืืืช ืฉืืื ืชืืื 2. ื ืกื ืขื ืงืืืืื: 8 โ 12 + 6."},
{id:"mobius",sym:"โ",name:"ืืืขืช ืืืืืก",fact:"ืจืฆืืขืช ื ืืืจ ืขื ืืฆื ืกืืืื: ืืฉ ืื ืจืง ืฆื ืืื ืืฉืคื ืืืช. ื ืืื ืฉืืืืืช ืขืืื ืชืขืืืจ ืืฉื ื ืืดืฆืืืืืด."}];
/* a comet comes at most once a day: surely with the first gold star of all, otherwise by chance */
function cometDue(P,{gold}){
ensure(P);
if(P.comets.length>=COMETS.length||P.cometDay===dayKey()) return false;
return (gold&&!P.comets.length&&!P.cometDay)||Math.random()<.12;
}
function catchComet(P){
ensure(P);
const left=COMETS.filter(c=>!P.comets.includes(c.id)); if(!left.length) return null;
const c=left[Math.floor(Math.random()*left.length)]; P.comets.push(c.id); return c;
}
/* ---------- constellations ---------- */
/* Each unit is drawn as a shape from its subject, in a box 0..1 (x to the right, y down). `corners`: the stars sit on
the vertices first; `closed`: the outline returns to the start; `inner`: lines drawn inside once it is complete. */
const curve=(f,n=48)=>Array.from({length:n+1},(_,i)=>f(i/n));
const SHAPES={
t:{name:"ืืงืขืจื",aspect:.9,pts:curve(s=>[1-s,1-(2*s-1)**2])},
t2:{name:"ืืืืจืืืช",aspect:.75,corners:1,pts:[[1,1],[1,.5],[.5,.5],[.5,0],[0,0]]},
k:{name:"ืืืืชืื",aspect:1.15,closed:1,corners:1,pts:[[.5,0],[1,.36],[.5,1],[0,.36]],inner:[[[.5,0],[.5,1]],[[0,.36],[1,.36]]]},
i:{name:"ืืืฉืืืฉ",aspect:.9,closed:1,corners:1,pts:[[.5,0],[1,1],[0,1]],inner:[[[.5,0],[.5,1]]]},
q:{name:"ืืงืฉืช",aspect:.75,pts:curve(s=>[1-s,(2*s-1)**2])},
q2:{name:"ืืคืจืืืื",aspect:.85,pts:curve(s=>[1-s,1-(2*s-1)**2]),inner:[[[.5,0],[.5,1]]]},
a:{name:"ืืืืืืช",aspect:.7,closed:1,corners:1,pts:[[1,0],[1,1],[0,1]]},
l:{name:"ืืืฉืืืฉ ืืืฉืจ",aspect:.75,closed:1,corners:1,pts:[[1,0],[1,1],[0,1]]},
z:{name:"ืืืจืคื",aspect:.6,closed:1,corners:1,pts:[[.72,0],[1,1],[0,1],[.28,0]]},
z2:{name:"ืืืจืคื ืืืฉืจ",aspect:.6,closed:1,corners:1,pts:[[.6,0],[1,1],[0,1],[0,0]]},
e:{name:"ืืืืขื",aspect:.55,pts:curve(s=>[1-s,1-Math.sin(Math.PI*s)])},
v:{name:"ืืืฅ",aspect:.8,corners:1,pts:[[0,0],[1,.5],[0,1]]},
g:{name:"ืืืงืืืืืช",aspect:.6,closed:1,corners:1,pts:[[1,0],[.72,1],[0,1],[.28,0]]},
r:{name:"ืืืืคืจืืืื",aspect:.9,pts:curve(s=>{const x=.06+.94*(1-s);return [x,Math.min(1,.06/x)]})},
m:{name:"ืืืืื",aspect:.62,closed:1,corners:1,pts:[[1,0],[1,1],[0,1],[0,0]],inner:[[[1,0],[0,1]]]},
h:{name:"ืืงืืืืื",aspect:1.1,closed:1,corners:1,pts:[[.5,0],[1,.25],[1,.75],[.5,1],[0,.75],[0,.25]],inner:[[[.5,.5],[.5,1]],[[.5,.5],[0,.25]],[[.5,.5],[1,.25]]]},
s:{name:"ืืืคืืฉ",aspect:.75,pts:curve(s=>[1-s,(2*s-1)**2]),inner:[[[1,.12],[0,.88]]]},
n:{name:"ืืื",aspect:.5,pts:curve(s=>[1-s,.5-.5*Math.sin(2*Math.PI*s)])},
b:{name:"ืืืขืืื",aspect:1.25,closed:1,corners:1,pts:[[.5,0],[1,.5],[.5,1],[0,.5]],inner:[[[.5,0],[.5,1]],[[0,.5],[1,.5]]]},
c:{name:"ืืจืืืืข",aspect:1,closed:1,corners:1,pts:[[1,0],[1,1],[0,1],[0,0]],inner:[[[1,0],[0,1]],[[0,0],[1,1]]]},
o:{name:"ืืชืืืื",aspect:.8,closed:1,corners:1,pts:[[1,0],[1,1],[0,1]],inner:[[[1,1],[.5,.5]]]},
p:{name:"ืืจืงืื",aspect:1,pts:curve(s=>{const x=1-s;return [x,1-(Math.pow(40,x)-1)/39]})},
w:{name:"ืืืจืง",aspect:.6,corners:1,pts:[[1,1],[.75,0],[.5,.75],[.25,0],[0,1]]},
d:{name:"ืืืฉืืืฉืื ืืืืืื",aspect:.9,closed:1,corners:1,pts:[[.5,0],[1,1],[0,1]],inner:[[[.25,.5],[.75,.5]]]},
};
const FALLBACK={aspect:.7,corners:1,pts:[[1,.15],[.68,.85],[.36,.1],[0,.75]]};
const W=360, X0=60, X1=300, TOP=52, BOTTOM=64;
const lerp=(a,b,t)=>[a[0]+(b[0]-a[0])*t,a[1]+(b[1]-a[1])*t];
const dist=(a,b)=>Math.hypot(b[0]-a[0],b[1]-a[1]);
function segments(pts,closed){ const out=[]; for(let i=0;i<pts.length-1;i++) out.push([pts[i],pts[i+1]]); if(closed) out.push([pts[pts.length-1],pts[0]]); return out; }
function along(pts,closed,n){
const segs=segments(pts,closed), L=segs.reduce((s,[a,b])=>s+dist(a,b),0);
const at=d=>{ for(const [a,b] of segs){ const l=dist(a,b); if(d<=l+1e-9) return lerp(a,b,l?d/l:0); d-=l; } return segs[segs.length-1][1]; };
if(n<=0) return [];
if(closed) return Array.from({length:n},(_,i)=>at(L*i/n));
if(n===1) return [at(L/2)];
return Array.from({length:n},(_,i)=>at(L*i/(n-1)));
}
function onCorners(pts,closed,n){
const segs=segments(pts,closed), extra=segs.map(()=>0);
for(let k=0;k<n-pts.length;k++){ let best=0; segs.forEach(([a,b],i)=>{ if(dist(a,b)/(extra[i]+1)>dist(...segs[best])/(extra[best]+1)) best=i; }); extra[best]++; }
const out=[];
segs.forEach(([a,b],i)=>{ out.push(a); for(let j=1;j<=extra[i];j++) out.push(lerp(a,b,j/(extra[i]+1))); });
if(!closed) out.push(pts[pts.length-1]);
return out;
}
/* The drawing of unit `id` with `n` stars, in a box W wide and H high: the stars in the path's order, the outline's
segments, and the inner lines. A unit with many stars is drawn taller so that they keep apart. */
function shape(id,n,name){
const S=SHAPES[id]||{...FALLBACK,name};
const w=X1-X0, h=Math.round(Math.max(w*S.aspect,n>6?(n-1)*36:0)), H=TOP+h+BOTTOM;
const map=([x,y])=>[X0+x*w,TOP+y*h];
const pts=S.pts.map(map);
const stars=(S.corners&&n>=pts.length?onCorners(pts,!!S.closed,n):along(pts,!!S.closed,n));
return {name:S.name||name,H,stars,lines:segments(pts,!!S.closed),inner:(S.inner||[]).map(l=>l.map(map))};
}
/* Where each star's name goes: below, above, or beside it, whichever stays in the box and clear of the other stars
and names. `texts`: [{len, lines}] with len the name's characters and lines the extra lines under it. */
function labels(stars,texts,H){
const taken=stars.map(([x,y])=>[x-15,y-15,x+15,y+15]);
const overlap=(a,b)=>Math.max(0,Math.min(a[2],b[2])-Math.max(a[0],b[0]))*Math.max(0,Math.min(a[3],b[3])-Math.max(a[1],b[1]));
return stars.map(([x,y],i)=>{
const {len,lines=0}=texts[i], w=Math.min(LABEL_W,len*6.3+10), h=(Math.ceil(len*6.3/LABEL_W)+lines)*15+2;
const cands=[["below",x-w/2,y+19],["above",x-w/2,y-19-h],["right",x+19,y-h/2],["left",x-19-w,y-h/2]];
let best=null;
for(const [side,x0,y0] of cands){
const r=[x0,y0,x0+w,y0+h], out=(x0<0?-x0:0)+(r[2]>W?r[2]-W:0)+(y0<0?-y0:0)+(r[3]>H?r[3]-H:0);
const score=out*60+taken.reduce((s,t,k)=>s+(k===i?0:overlap(r,t)),0);
if(!best||score<best.score-.5) best={side,r,score};
}
taken.push(best.r);
return {side:best.side,x:best.r[0],y:best.r[1],w};
});
}
/* ---------- the owl ---------- */
const owl=(w=80,cls="")=>`<svg class="sky-owl ${cls}" width="${w}" height="${Math.round(w*1.04)}" viewBox="0 0 100 104" aria-hidden="true">
<path d="M20 34 26 6l17 18q7-3 14 0L74 6l6 28q12 22 4 44-9 24-34 24T16 78q-8-22 4-44Z" class="o-b"/>
<path d="M16 62q-8 14 2 28 4-10 4-22Z M84 62q8 14-2 28-4-10-4-22Z" class="o-b" opacity=".75"/>
<ellipse cx="50" cy="74" rx="22" ry="23" class="o-belly"/>
<path d="M40 70q3 3 6 0M54 70q3 3 6 0M44 80q3 3 6 0M50 80q3 3 6 0" class="o-feather"/>
<circle cx="35" cy="44" r="13" class="o-eye"/><circle cx="65" cy="44" r="13" class="o-eye"/>
<circle cx="37" cy="45" r="6.5" class="o-pupil"/><circle cx="63" cy="45" r="6.5" class="o-pupil"/>
<circle cx="39" cy="42.5" r="2" class="o-glint"/><circle cx="65" cy="42.5" r="2" class="o-glint"/>
<ellipse class="o-lid" cx="35" cy="44" rx="13.5" ry="13.5"/><ellipse class="o-lid" cx="65" cy="44" rx="13.5" ry="13.5"/>
<circle cx="35" cy="44" r="15.5" class="o-glass"/><circle cx="65" cy="44" r="15.5" class="o-glass"/>
<path d="M48 42q2-2 4 0" class="o-glass"/>
<path d="M45 56h10l-5 9Z" class="o-beak"/>
<path d="M38 99l-3 4M44 100v4M56 100v4M62 99l3 4" class="o-feet"/></svg>`;
/* Praise names what the student did, never what they are: fixing an earlier mistake is praised most. */
const PRAISE=["ื ืืื. ืขืืืื ืืืืืงืช.","ื ืืื. ืืืฉืื ืืืืจ.","ื ืืื, ืฉืื ืืืจื ืฉืื.","ื ืืื. ืืืงืชื ืขื ืืกืืฃ."];
const pick=a=>a[Math.floor(Math.random()*a.length)];
function praise({recovered=false,persisted=false,combo=0}={}){
if(recovered) return pick(["ืชืืงื ืชื ืฉืืื ืฉืืขืืชื ืื ืงืืื. ืืื ืืืืืื!","ืืคืขื ืื ืืฆื ื ืืื. ืืืขืืช ืืงืืื ืขืืจื."]);
if(persisted) return "ื ืืื. ืืืชืืื ืืฉืชืืื.";
if(combo>=3) return "ื ืืื, ืืืขืงืืืืช.";
return pick(PRAISE);
}
/* ---------- effects ---------- */
const RM=()=>matchMedia("(prefers-reduced-motion: reduce)").matches;
let host=null, fx=null, fc=null, parts=[], running=false, AC=null;
const soundOn=()=>{ try{ return localStorage.getItem("mathly.sound")!=="off"; }catch{ return true; } };
function setSound(on){ try{ localStorage.setItem("mathly.sound",on?"on":"off"); }catch{} }
function tone(fs,dur=.12,type="sine",gap=.07,vol=.15){
if(!soundOn()) return;
try{
AC=AC||new (window.AudioContext||window.webkitAudioContext)(); const t0=AC.currentTime+.01;
fs.forEach((f,i)=>{ const o=AC.createOscillator(), g=AC.createGain(), t=t0+i*gap; o.type=type; o.frequency.value=f;
g.gain.setValueAtTime(0,t); g.gain.linearRampToValueAtTime(vol,t+.012); g.gain.exponentialRampToValueAtTime(.0008,t+dur+.25);
o.connect(g).connect(AC.destination); o.start(t); o.stop(t+dur+.3); });
}catch{}
}
const sound={
ok:()=>tone([784,1175],.1,"sine",.08), combo:n=>tone([784,988,1175,1568].slice(0,Math.min(4,n+1)),.09,"sine",.06),
bad:()=>tone([196,165],.12,"triangle",.09,.08), win:()=>tone([523,659,784,1047,1319,1568],.2,"sine",.09),
goal:()=>tone([659,784,1047],.16,"sine",.1), comet:()=>tone([1568,2093,1760,2349],.12,"triangle",.07,.09), tap:()=>tone([1200],.03,"sine",0,.05)};
const buzz=p=>{ try{ navigator.vibrate&&navigator.vibrate(p); }catch{} };
function sizeFx(){ const d=devicePixelRatio||1; fx.width=innerWidth*d; fx.height=innerHeight*d; fc.setTransform(d,0,0,d,0,0); }
function sparkle(c,x,y,r){ c.beginPath(); c.moveTo(x,y-r); c.quadraticCurveTo(x+r*.15,y-r*.15,x+r,y); c.quadraticCurveTo(x+r*.15,y+r*.15,x,y+r);
c.quadraticCurveTo(x-r*.15,y+r*.15,x-r,y); c.quadraticCurveTo(x-r*.15,y-r*.15,x,y-r); c.fill(); }
/* sparks out of a point: a few for a correct answer, a shower for a star */
function burst(x,y,n=14,gold=false){
if(!fx||RM()) return;
const cols=gold?["#F7C948","#FFE7A3","#FFFFFF","#FF8B5C"]:["#7EE3C8","#EAF0FF","#C3A6F5","#74C3E6"];
for(let i=0;i<n;i++){ const a=Math.random()*Math.PI*2, v=2+Math.random()*(gold?9:5);
parts.push({x,y,vx:Math.cos(a)*v,vy:Math.sin(a)*v-(gold?3:1),r:2+Math.random()*(gold?6:4),c:cols[i%cols.length],life:1,d:.008+Math.random()*.014}); }
if(!running){ running=true; requestAnimationFrame(tick); }
}
const burstAt=(el,n,gold)=>{ if(!el) return; const r=el.getBoundingClientRect(); burst(r.left+r.width/2,r.top+r.height/2,n,gold); };
function tick(){
fc.clearRect(0,0,innerWidth,innerHeight);
for(const p of parts){ p.x+=p.vx; p.y+=p.vy; p.vy+=.14; p.vx*=.985; p.life-=p.d; fc.globalAlpha=Math.max(0,p.life); fc.fillStyle=p.c; sparkle(fc,p.x,p.y,p.r); }
parts=parts.filter(p=>p.life>0&&p.y<innerHeight+20); fc.globalAlpha=1;
if(parts.length) requestAnimationFrame(tick); else { running=false; fc.clearRect(0,0,innerWidth,innerHeight); }
}
/* the twinkling sky behind the screens */
function starfield(canvas){
const c=canvas.getContext("2d"); let stars=[];
const size=()=>{ const d=devicePixelRatio||1; canvas.width=innerWidth*d; canvas.height=innerHeight*d; c.setTransform(d,0,0,d,0,0);
stars=Array.from({length:Math.round(innerWidth*innerHeight/2600)},()=>({x:Math.random()*innerWidth,y:Math.random()*innerHeight,r:Math.random()*1.3+.2,p:Math.random()*6.28,s:.4+Math.random()*1.4})); paint(0); };
const paint=t=>{ c.clearRect(0,0,innerWidth,innerHeight); c.fillStyle="#DDE4FF";
for(const s of stars){ c.globalAlpha=Math.max(.08,.35+.45*Math.sin(s.p+t*.001*s.s)); c.beginPath(); c.arc(s.x,s.y,s.r,0,6.28); c.fill(); } c.globalAlpha=1; };
const loop=t=>{ if(!canvas.isConnected) return; if(host&&!host.hidden) paint(t); requestAnimationFrame(loop); };
addEventListener("resize",size); size(); if(!RM()) requestAnimationFrame(loop);
}
function mount(root){
host=root;
const bg=document.createElement("canvas"); bg.className="sky-bg"; bg.setAttribute("aria-hidden","true");
fx=document.createElement("canvas"); fx.className="sky-fx"; fx.setAttribute("aria-hidden","true"); fc=fx.getContext("2d");
root.prepend(bg); root.append(fx); starfield(bg); sizeFx(); addEventListener("resize",sizeFx);
}
function toast(html,ms=3400){
const t=document.createElement("div"); t.className="sky-toast"; t.setAttribute("role","status"); t.innerHTML=html;
(host||document.body).append(t); setTimeout(()=>t.remove(),ms);
}
/* A full-screen moment. `kind`: "gold", "lit" or "con"; `art` replaces the big star (a constellation, a comet card).
Resolves when the student goes on. */
function celebrate({kind="lit",title,sub="",extra="",art=""}){
return new Promise(done=>{
const c=document.createElement("div"); c.className=`sky-cele k-${kind}`; c.setAttribute("role","dialog"); c.setAttribute("aria-modal","true"); c.setAttribute("aria-label",title);
c.innerHTML=`<div class="in"><div class="rays"></div><div class="big">${art||spark()}</div><h2>${esc(title)}</h2>${sub?`<p>${sub}</p>`:""}${extra}
<button class="sky-btn${kind==="lit"?"":" gold"}" data-sky="go">ืืืืฉืื</button></div>`;
(host||document.body).append(c);
kind==="lit"?sound.ok():sound.win(); buzz(kind==="lit"?[40,40,60]:[40,60,40,60,120]);
setTimeout(()=>burstAt(c.querySelector(".big"),kind==="lit"?45:90,kind!=="lit"),250);
const btn=c.querySelector("[data-sky=go]"); btn.focus({preventScroll:true});
const close=()=>{ c.remove(); removeEventListener("keydown",key,true); done(); };
const key=e=>{ if(e.key==="Escape"){ e.stopPropagation(); close(); } };
addEventListener("keydown",key,true); btn.onclick=close;
});
}
/* A comet flies across; `onCatch` runs when it is tapped in time. */
function comet(onCatch){
const b=document.createElement("button"); b.className="sky-comet"; b.setAttribute("aria-label","ืฉืืื! ืืืฆื ืืื ืืชืคืืก ืืืชื");
b.innerHTML=`<svg viewBox="0 0 120 56" aria-hidden="true"><defs><linearGradient id="skyTail" x1="0" x2="1"><stop offset="0" stop-color="#F7C948" stop-opacity="0"/><stop offset="1" stop-color="#F7C948"/></linearGradient></defs>
<path d="M2 28 98 20 98 36Z" fill="url(#skyTail)"/><path d="${SPARK}" transform="translate(84 10) scale(1.5)" fill="#EAF0FF"/></svg>`;
(host||document.body).append(b); sound.comet(); toast("<b>ืฉืืื!</b> ืชืคืกื ืืืชื ืืคื ื ืฉืืื ืืืืฃ",2600);
const gone=()=>{ if(b.isConnected){ b.remove(); toast("ืืฉืืื ืืืฃ. ืฉืืืืื ืืืืจืื ืืื ืคืขื ืืืื ืชืจืืื."); } };
b.onclick=()=>{ const r=b.getBoundingClientRect(); b.remove(); burst(r.left+r.width-20,r.top+r.height/2,60,true); buzz([30,30,80]); onCatch(); };
b.addEventListener("animationend",gone);
if(RM()) setTimeout(gone,9000);
}
const cometCard=c=>`<div class="sky-card"><span class="sym">${esc(c.sym)}</span><b>${esc(c.name)}</b></div>`;
window.MathlySky={GOAL,chance,pickQuiz,CHANCE,practised,slip,patterns,assignmentState,focus,quizLost,FOCUS,assignmentTask,finalTask,taskState,TASK_LABELS,jerusalemDay,attention,weekly,lastPractice,FADE_DAYS,MASTER_RUN,GOLD_RUN,masterNeed,goldNeed,mastered,reviewed,due,COMETS,SPARK,spark,FLAME,owl,praise,dayKey,ensure,correct,wrong,fading,star,today,streak,dayState,month,best,
cometDue,catchComet,shape,labels,mount,burst,burstAt,sound,buzz,soundOn,setSound,toast,celebrate,comet,cometCard};
})();
|