--- loncom/interface/lonquickgrades.pm 2002/11/15 19:32:09 1.2 +++ loncom/interface/lonquickgrades.pm 2003/06/23 20:01:20 1.16 @@ -31,9 +31,15 @@ package Apache::lonquickgrades; use strict; use Apache::Constants qw(:common :http); +use POSIX; sub handler { my $r = shift; + return real_handler($r); +} + +sub real_handler { + my $r = shift; &Apache::loncommon::get_unprocessed_cgi($ENV{QUERY_STRING}); @@ -64,75 +70,179 @@ sub handler { if (!defined($navmap)) { my $requrl = $r->uri; - $ENV{'user.error.msg'} = "$requrl:bre:0:0:Course not initialized"; + $ENV{'user.error.msg'} = "$requrl:bre:0:0:Navamp initialization failed."; return HTTP_NOT_ACCEPTABLE; } + + # Keep this hash in sync with %statusIconMap in lonnavmaps; they + # should match color/icon + my $res = $navmap->firstResource(); # temp resource to access constants # Header $r->print(&Apache::loncommon::bodytag('Quick Score Display','', '')); + $r->print(<This screen shows how many problems (or problem parts) you have completed, and +how many you have not yet done. You can also look at a detailed +score sheet.

+HEADER + $navmap->init(); # End navmap using boilerplate - # Col labels - $r->print(< - - Problem - Score - -TABLETOP - my $iterator = $navmap->getIterator(undef, undef, undef, 1); my $depth = 1; $iterator->next(); # ignore first BEGIN_MAP my $curRes = $iterator->next(); - my $totalAvailable = 0; - my $total = 0; - + + # General overview of the following: Walk along the course resources. + # For every problem in the resource, tell its parent maps how many + # parts and how many parts correct it has. After that, each map will + # have a count of the total parts underneath it, correct and otherwise. + # After that, we will walk through the course again and read off + # maps in order, with their data. + # (If in the future people decide not to be cumulative, only add + # the counts to the parent map.) + + my $totalParts = 0; my $totalPossible = 0; my $totalRight = 0; + my $now = time(); + my $topLevelParts = 0; my $topLevelRight = 0; + + # Pre-run: Count parts correct while ( $depth > 0 ) { if ($curRes == $iterator->BEGIN_MAP()) {$depth++;} if ($curRes == $iterator->END_MAP()) { $depth--; } - if (ref($curRes) && $curRes->is_problem()) { - my $title = $curRes->compTitle(); - $r->print(' '); + if (ref($curRes) && $curRes->is_problem() && !$curRes->randomout) + { + # Get number of correct, incorrect parts + my $parts = $curRes->parts(); + $totalParts += $curRes->countParts(); + my $partsRight = 0; my $stack = $iterator->getStack(); - my $src = Apache::lonnavmaps::getLinkForResource($stack); - my $srcHasQuestion = $src =~ /\?/; - my $link = $src. - ($srcHasQuestion?'&':'?') . - 'symb='.&Apache::lonnet::escape($curRes->symb()). - '"'; - $r->print("$title"); - my $avail = 0; - my $score = 0; - my $parts = $curRes->parts(); for my $part (@{$parts}) { - my $partAvail = $curRes->weight($part); - my $partScore = $curRes->awarded($part) * $partAvail; - $avail += $partAvail; - $score += $partScore; + my $status = $curRes->getCompletionStatus($part); + my $thisright = 0; + if ($status == $curRes->CORRECT || $status == $curRes->CORRECT_BY_OVERRIDE + || $status == $curRes->EXCUSED || $status == $curRes->ANSWER_SUBMITTED) { + $partsRight++; + $totalRight++; + $thisright = 1; + } + + my $dateStatus = $curRes->getDateStatus($part); + if ($curRes->opendate($part) < $now) { + $totalPossible++; + } + } + + if ($depth == 1) { # in top-level only + $topLevelParts += scalar(@{$parts}); + $topLevelRight += $partsRight; + $r->print($curRes->compTitle() . '
'); + } + + # Crawl down stack and record parts correct and total + for my $res (@{$stack}) { + if (ref($res) && $res->is_map()) { + if (!defined($res->{DATA}->{CHILD_PARTS})) { + $res->{DATA}->{CHILD_PARTS} = 0; + $res->{DATA}->{CHILD_CORRECT} = 0; + } + + $res->{DATA}->{CHILD_PARTS} += scalar(@{$parts}); + $res->{DATA}->{CHILD_CORRECT} += $partsRight; + } } + } + $curRes = $iterator->next(); + } + + $iterator = $navmap->getIterator(undef, undef, undef, 1); + $depth = 1; + $iterator->next(); # ignore first BEGIN_MAP + $curRes = $iterator->next(); + + my @start = (255, 255, 192); + my @end = (0, 192, 0); + + my $indentString = '     '; + + # Second pass: Print the maps. + $r->print(''); + $r->print('' . "\n\n"); + while ($depth > 0) { + if ($curRes == $iterator->BEGIN_MAP()) {$depth++;} + if ($curRes == $iterator->END_MAP()) { $depth--; } + + if (ref($curRes) && $curRes->is_map()) { + my $title = $curRes->compTitle(); - $r->print("\n"); - $totalAvailable += $avail; - $total += $score; + my $correct = $curRes->{DATA}->{CHILD_CORRECT}; + my $total = $curRes->{DATA}->{CHILD_PARTS}; + + if ($total > 0) { + my $ratio; + $ratio = $correct / $total; + my $color = mixColors(\@start, \@end, $ratio); + $r->print(""); + $r->print("\n"); + } } $curRes = $iterator->next(); } - $r->print("
SequenceDone / Total
$score / $avail
"); + + my $thisIndent = ''; + for (my $i = 1; $i < $depth; $i++) { $thisIndent .= $indentString; } + + $r->print("$thisIndent$title$thisIndent$correct / $total
Total Points Scored: $total"); - $r->print("
Total Points Available: $totalAvailable"); - $r->print("
\n\n"); + # If there were any problems at the top level, print an extra "catchall" + if ($topLevelParts > 0) { + my $ratio = $topLevelRight / $topLevelParts; + my $color = mixColors(\@start, \@end, $ratio); + $r->print(""); + $r->print("Problems Not Contained In A Folder"); + $r->print("$topLevelRight / $topLevelParts"); + } + + my $maxHelpLink = Apache::loncommon::help_open_topic("Quick_Grades_Possibly_Correct"); + + $r->print("Total Parts Done: $totalRight
"); + $r->print("Max Possible To Date $maxHelpLink: $totalPossible
"); + $r->print("Total Parts In Course: $totalParts\n\n"); + - $r->print(""); + $r->print(""); + + $navmap->untieHashes(); return OK; } +# Pass this two refs to arrays for the start and end color, and a number +# from 0 to 1 for how much of the latter you want to mix in. It will +# return a string ready to show ("#FFC309"); +sub mixColors { + my $start = shift; + my $end = shift; + my $ratio = shift; + + my ($a,$b); + my $final = ""; + $a = $start->[0]; $b = $end->[0]; + my $mix1 = POSIX::floor((1-$ratio)*$a + $ratio*$b); + $a = $start->[1]; $b = $end->[1]; + my $mix2 = POSIX::floor((1-$ratio)*$a + $ratio*$b); + $a = $start->[2]; $b = $end->[2]; + my $mix3 = POSIX::floor((1-$ratio)*$a + $ratio*$b); + + $final = sprintf "%02x%02x%02x", $mix1, $mix2, $mix3; + return "#" . $final; +} + 1;