⚡ Bolt: [Performance] Optimize GradebookMatrix creation from O(S*N^2) to O(S)

[xb1g]

💡 What
Replaced a nested forEach loop and .find() operation used to construct the GradebookMatrix with an $O(1)$ lookup dictionary built in a single sequential pass. I also ensured that the first matching submission is always correctly retained, preserving the existing behavior where the most recent submission (due to descending chronological sort) is selected.

🎯 Why
Previously, createGradebookMatrix in ClassroomGrading.tsx and SeedRoomGrading.tsx iterated through all students, and then all assessmentNodes. Inside that nested loop, it ran submissions.find(...) which is an $O(S)$ operation. This led to an overall time complexity of $O(S \times N \times S)$ or $O(S^2 \times N)$. As the number of students and submissions scales, this creates a severe performance bottleneck during grading dashboard rendering, potentially causing UI unresponsiveness and rendering blocking.

📊 Impact
Reduces the algorithmic complexity of matrix initialization from $O(S^2 \times N)$ to $O(S \times N)$, vastly improving performance and reducing render blocking in large classrooms with multiple assessments. Render and processing times are drastically reduced.

🔬 Measurement
Verify the change locally by entering a Classroom or Seed room with a significant number of enrolled students and assignments (hundreds or thousands). The grading dashboard should construct the assignment matrix instantly instead of hanging the main thread. Test suite pnpm test confirms all components render correctly without failure.

---

PR created automatically by Jules for task 8508505064459155522 started by @xb1g

[google-labs-jules]

👋 Jules, reporting for duty! I'm here to lend a hand with this pull request.

When you start a review, I'll add a 👀 emoji to each comment to let you know I've read it. I'll focus on feedback directed at me and will do my best to stay out of conversations between you and other bots or reviewers to keep the noise down.

I'll push a commit with your requested changes shortly after. Please note there might be a delay between these steps, but rest assured I'm on the job!

For more direct control, you can switch me to Reactive Mode. When this mode is on, I will only act on comments where you specifically mention me with @jules. You can find this option in the Pull Request section of your global Jules UI settings. You can always switch back!

New to Jules? Learn more at jules.google/docs.

---

For security, I will only act on instructions from the user who triggered this task.

[vercel]

The latest updates on your projects. Learn more about Vercel for GitHub.

Project	Deployment	Actions	Updated (UTC)
pseed	Ready	Preview, Comment	Mar 28, 2026 3:52am

[vercel]

Unable to deploy a commit from a private repository on your GitHub organization to the wachaa1319's projects team on Vercel, which is currently on the Hobby plan. In order to deploy, you can:

• Make your repository public or
• Upgrade to Pro. A Pro subscription is required to deploy from a private organization repository.
  • Click here to upgrade.

To read more about collaboration on Vercel, click here.

[Copilot]

Pull request overview

This PR optimizes grading dashboard initialization by replacing per-cell linear searches over the submissions list with a single-pass population step, reducing the cost of constructing the gradebook matrix for large cohorts. This fits into the platform’s grading UI (Classroom + Seed room) where large student/submission counts can otherwise cause noticeable render blocking.

Changes:

• Reworked createGradebookMatrix in both grading UIs to populate cells via a single pass over submissions (preserving “most recent submission wins” via descending sort order).
• Initialized matrices with consistent object shape (student -> assessment -> undefined) before population.
• Misc. formatting/structural readability updates (imports, JSX formatting).

Reviewed changes

Copilot reviewed 2 out of 2 changed files in this pull request and generated 2 comments.

File	Description
components/seeds/SeedRoomGrading.tsx	Optimizes gradebook matrix creation; includes additional formatting changes in data transformation/sorting and UI rendering.
components/classroom/ClassroomGrading.tsx	Optimizes gradebook matrix creation for classroom grading, plus formatting/readability updates across analytics and UI.

Comments suppressed due to low confidence (1)

components/seeds/SeedRoomGrading.tsx:294

• Sorting nodes by earliest submission date currently filters transformedSubmissions inside the sort comparator, which results in many repeated full scans (and new Date(...) parsing) during sorting. This is O(nodes × submissions × log(nodes)) and can become a major bottleneck at scale. Consider precomputing earliest-submission timestamps per assessment_id in a single pass and sorting using that lookup.

      // Sort assessment nodes by earliest submission date
      const sortedNodes = [...nodes].sort((a, b) => {
        // Find earliest submission for each assessment
        const aSubmissions = transformedSubmissions.filter(
          (s) => s.assessment_id === a.id,
        );
        const bSubmissions = transformedSubmissions.filter(
          (s) => s.assessment_id === b.id,
        );

        // Get earliest submission time for each
        const aEarliest =
          aSubmissions.length > 0
            ? Math.min(
                ...aSubmissions.map((s) => new Date(s.submitted_at).getTime()),
              )
            : Infinity;
        const bEarliest =
          bSubmissions.length > 0
            ? Math.min(
                ...bSubmissions.map((s) => new Date(s.submitted_at).getTime()),
              )
            : Infinity;

        // Sort by earliest submission time (ascending)
        return aEarliest - bEarliest;
      });

[cloudflare-workers-and-pages]

Deploying with    Cloudflare Workers

The latest updates on your project. Learn more about integrating Git with Workers.

Status	Name	Latest Commit	Updated (UTC)
❌ Deployment failed View logs	web	27c1857	May 11 2026, 06:40 PM