Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 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 | 8x 36x 36x 36x 21x 21x 21x 21x 12x 12x 12x 21x 21x 30x 30x 10x 10x 12x 15x 15x 15x 40x 40x 1440x 70x 70x 15x | import { prereqEdgeData } from "../data/conceptGraph";
export const normalize = (s: string) => s.replace(/\\n/g, "\n");
// Minimal shape needed to sort assessments by their PrairieLearn "set" + number.
// Both Assessment and AssessmentManagementDTO satisfy this structurally.
interface AssessmentSetAndNumber {
pl_assessment_set_abbreviation?: string | null;
pl_assessment_number?: string | null;
}
// Sorts assessments by the combination of pl_assessment_set_abbreviation + pl_assessment_number
// (e.g. "HW1", "HW2", "Quiz1"), matching the ordering used on the PrairieLearn website.
export function compareByAssessmentSetAndNumber(
a: AssessmentSetAndNumber,
b: AssessmentSetAndNumber,
): number {
const aKey =
(a.pl_assessment_set_abbreviation ?? "") + (a.pl_assessment_number ?? "");
const bKey =
(b.pl_assessment_set_abbreviation ?? "") + (b.pl_assessment_number ?? "");
return aKey.localeCompare(bKey, undefined, { numeric: true });
}
export function toPastel(hex: string, strength: number = 0.1): string {
const r = parseInt(hex.slice(1, 3), 16);
const g = parseInt(hex.slice(3, 5), 16);
const b = parseInt(hex.slice(5, 7), 16);
return `rgb(${Math.round(r * strength + 255 * (1 - strength))}, ${Math.round(g * strength + 255 * (1 - strength))}, ${Math.round(b * strength + 255 * (1 - strength))})`;
}
// Same as computeLegacySubgraph, but parameterized with edges fetched from the
// backend (numeric concept ids) instead of the hardcoded legacy edge list, so
// it works for any course. Node ids are the concepts' numeric ids as strings,
// matching the React Flow node ids used by ScaffoldConceptGraph.
export function computeScaffoldSubgraph(
taggedIds: string[],
edges: { sourceId: number; targetId: number }[],
): Set<string> {
const result = new Set<string>(taggedIds);
let changed = true;
while (changed) {
changed = false;
for (const e of edges) {
const source = String(e.sourceId);
if (result.has(String(e.targetId)) && !result.has(source)) {
result.add(source);
changed = true;
}
}
}
return result;
}
// Walk the prereq graph upward from tagged concepts to include all ancestors
// (legacy, hardcoded-data version used by LegacyHomePage.tsx).
export function computeLegacySubgraph(taggedIds: string[]): Set<string> {
const result = new Set<string>(taggedIds);
let changed = true;
while (changed) {
changed = false;
for (const { source, target } of prereqEdgeData) {
if (result.has(target) && !result.has(source)) {
result.add(source);
changed = true;
}
}
}
return result;
}
|