version 1.5, 2002/11/22 20:07:11
|
version 1.22.2.1, 2003/09/23 01:52:57
|
Line 63 sub real_handler {
|
Line 63 sub real_handler {
|
&Apache::loncommon::no_cache($r); |
&Apache::loncommon::no_cache($r); |
$r->send_http_header; |
$r->send_http_header; |
|
|
|
my $showPoints = |
|
$ENV{'course.'.$ENV{'request.course.id'}.'.grading'} eq 'standard'; |
|
|
# Create the nav map |
# Create the nav map |
my $navmap = Apache::lonnavmaps::navmap->new( |
my $navmap = Apache::lonnavmaps::navmap->new( |
$ENV{"request.course.fn"}.".db", |
$ENV{"request.course.fn"}.".db", |
$ENV{"request.course.fn"}."_parms.db", 1, 0); |
$ENV{"request.course.fn"}."_parms.db", 1, 0, 1); |
|
|
# Keep this hash in sync with %statusIconMap in lonnavmaps; they |
|
# should match color/icon |
|
my $res = $navmap->firstResource(); # temp resource to access constants |
|
|
|
if (!defined($navmap)) { |
if (!defined($navmap)) { |
my $requrl = $r->uri; |
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; |
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 |
# Header |
$r->print(&Apache::loncommon::bodytag('Quick Score Display','', |
my $title = $showPoints ? "Quick Points Display" : "Quick Completed Problems Display"; |
'')); |
$r->print(&Apache::loncommon::bodytag($title, '', '')); |
|
|
|
if (!$showPoints) { |
|
$r->print(<<HEADER); |
|
<p>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 href="/adm/studentcalc">a detailed |
|
score sheet</a>.</p> |
|
HEADER |
|
} |
|
|
|
$r->print("This may take a few moments to display."); |
|
|
|
$r->rflush(); |
|
|
$navmap->init(); |
$navmap->init(); |
|
|
Line 99 sub real_handler {
|
Line 114 sub real_handler {
|
# maps in order, with their data. |
# maps in order, with their data. |
# (If in the future people decide not to be cumulative, only add |
# (If in the future people decide not to be cumulative, only add |
# the counts to the parent map.) |
# the counts to the parent map.) |
|
# For convenience, "totalParts" is also "totalPoints" when we're looking |
|
# at points; I can't come up with a variable name that makes sense |
|
# equally for both cases. |
|
|
my $totalParts = 0; my $totalPossible = 0; my $totalRight = 0; |
my $totalParts = 0; my $totalPossible = 0; my $totalRight = 0; |
|
my $now = time(); |
|
my $topLevelParts = 0; my $topLevelRight = 0; |
|
|
# Pre-run: Count parts correct |
# Pre-run: Count parts correct |
while ( $depth > 0 ) { |
while ( $depth > 0 ) { |
if ($curRes == $iterator->BEGIN_MAP()) {$depth++;} |
if ($curRes == $iterator->BEGIN_MAP()) {$depth++;} |
if ($curRes == $iterator->END_MAP()) { $depth--; } |
if ($curRes == $iterator->END_MAP()) { $depth--; } |
|
|
if (ref($curRes) && $curRes->is_problem()) |
if (ref($curRes) && $curRes->is_problem() && !$curRes->randomout) |
{ |
{ |
# Get number of correct, incorrect parts |
# Get number of correct, incorrect parts |
my $parts = $curRes->parts(); |
my $parts = $curRes->parts(); |
if (scalar(@{$parts}) > 1) { shift @{$parts}; } # lose the first "0" |
|
$totalParts += scalar(@{$parts}); |
|
my $partsRight = 0; |
my $partsRight = 0; |
|
my $partsCount = 0; |
my $stack = $iterator->getStack(); |
my $stack = $iterator->getStack(); |
|
|
for my $part (@{$parts}) { |
for my $part (@{$parts}) { |
my $status = $curRes->getCompletionStatus($part); |
if ($curRes->getCompletionStatus($part) == $curRes->EXCUSED()) { |
if ($status == $curRes->CORRECT || $status == $curRes->CORRECT_BY_OVERRIDE |
next; |
|| $status == $curRes->EXCUSED) { |
|
$partsRight++; |
|
$totalRight++; |
|
} |
|
|
|
my $dateStatus = $curRes->getDateStatus($part); |
|
if ($status != $curRes->OPEN_LATER) { |
|
$totalPossible++; |
|
} |
} |
|
if ($showPoints) { |
|
my $score = $curRes->weight($part) * $curRes->awarded($part); |
|
$partsRight += $score; |
|
$totalRight += $score; |
|
$partsCount += $curRes->weight($part); |
|
|
|
if ($curRes->opendate($part) < $now) { |
|
$totalPossible += $curRes->weight($part); |
|
} |
|
$totalParts += $curRes->weight($part); |
|
} else { |
|
my $status = $curRes->status($part); |
|
my $thisright = 0; |
|
$partsCount++; |
|
if ($status == $curRes->CORRECT || |
|
$status == $curRes->EXCUSED) { |
|
$partsRight++; |
|
$totalRight++; |
|
$thisright = 1; |
|
} |
|
|
|
my $dateStatus = $curRes->getDateStatus($part); |
|
$totalParts++; |
|
if ($curRes->opendate($part) < $now) { |
|
$totalPossible++; |
|
} |
|
} |
} |
} |
|
|
|
if ($depth == 1) { # in top-level only |
|
$topLevelParts += $partsCount; |
|
$topLevelRight += $partsRight; |
|
} |
|
|
# Crawl down stack and record parts correct and total |
# Crawl down stack and record parts correct and total |
for my $res (@{$stack}) { |
for my $res (@{$stack}) { |
if (ref($res) && $res->is_map()) { |
if (ref($res) && $res->is_map()) { |
Line 138 sub real_handler {
|
Line 181 sub real_handler {
|
$res->{DATA}->{CHILD_CORRECT} = 0; |
$res->{DATA}->{CHILD_CORRECT} = 0; |
} |
} |
|
|
$res->{DATA}->{CHILD_PARTS} += scalar(@{$parts}); |
$res->{DATA}->{CHILD_PARTS} += $partsCount; |
$res->{DATA}->{CHILD_CORRECT} += $partsRight; |
$res->{DATA}->{CHILD_CORRECT} += $partsRight; |
} |
} |
} |
} |
Line 147 sub real_handler {
|
Line 190 sub real_handler {
|
} |
} |
|
|
$iterator = $navmap->getIterator(undef, undef, undef, 1); |
$iterator = $navmap->getIterator(undef, undef, undef, 1); |
my $depth = 1; |
$depth = 1; |
$iterator->next(); # ignore first BEGIN_MAP |
$iterator->next(); # ignore first BEGIN_MAP |
my $curRes = $iterator->next(); |
$curRes = $iterator->next(); |
|
|
my @start = (255, 255, 0); |
my @start = (255, 255, 192); |
my @end = (0, 192, 0); |
my @end = (0, 192, 0); |
|
|
my $indentString = ' '; |
my $indentString = ' '; |
|
|
# Second pass: Print the maps. |
# Second pass: Print the maps. |
$r->print('<table cellspacing="3" border="2"><tr><td align="center"><b>Sequence</b></td>'); |
$r->print('<table cellspacing="3" border="2"><tr><td align="center"><b>Folder</b></td>'); |
$r->print('<td align="center">Correct / Total</td><tr>' . "\n\n"); |
$title = $showPoints ? "Points Scored" : "Done"; |
|
$r->print("<td align='center'>$title / Total</td><tr>" . "\n\n"); |
while ($depth > 0) { |
while ($depth > 0) { |
if ($curRes == $iterator->BEGIN_MAP()) {$depth++;} |
if ($curRes == $iterator->BEGIN_MAP()) {$depth++;} |
if ($curRes == $iterator->END_MAP()) { $depth--; } |
if ($curRes == $iterator->END_MAP()) { $depth--; } |
|
|
if (ref($curRes) && $curRes->is_map()) { |
if (ref($curRes) && $curRes->is_map()) { |
my $stack = $iterator->getStack(); |
|
my $src = Apache::lonnavmaps::getLinkForResource($stack); |
|
my $srcHasQuestion = $src =~ /\?/; |
|
my $link = $src. |
|
($srcHasQuestion?'&':'?') . |
|
'symb='.&Apache::lonnet::escape($curRes->symb()). |
|
'"'; |
|
my $title = $curRes->compTitle(); |
my $title = $curRes->compTitle(); |
|
|
my $correct = $curRes->{DATA}->{CHILD_CORRECT}; |
my $correct = $curRes->{DATA}->{CHILD_CORRECT}; |
my $total = $curRes->{DATA}->{CHILD_PARTS}; |
my $total = $curRes->{DATA}->{CHILD_PARTS}; |
|
|
my $ratio; |
if ($total > 0) { |
$ratio = $total==0 ? 1 : $correct / $total; |
my $ratio; |
my $color = mixColors(\@start, \@end, $ratio); |
$ratio = $correct / $total; |
$r->print("<tr><td bgcolor='$color'>"); |
my $color = mixColors(\@start, \@end, $ratio); |
|
$r->print("<tr><td bgcolor='$color'>"); |
for (my $i = 1; $i < $depth; $i++) { $r->print($indentString); } |
|
|
my $thisIndent = ''; |
$r->print("<a href='$link'>$title</a></td>"); |
for (my $i = 1; $i < $depth; $i++) { $thisIndent .= $indentString; } |
$r->print("<td>$correct / $total</td></tr>\n"); |
|
|
$r->print("$thisIndent$title</td>"); |
|
$r->print("<td valign='top'>$thisIndent<nobr>$correct / $total</nobr></td></tr>\n"); |
|
} |
} |
} |
|
|
$curRes = $iterator->next(); |
$curRes = $iterator->next(); |
} |
} |
|
|
|
# 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("<tr><td bgcolor='$color'>"); |
|
$r->print("Problems Not Contained In A Folder</td><td>"); |
|
$r->print("$topLevelRight / $topLevelParts</td></tr>"); |
|
} |
|
|
|
my $maxHelpLink = Apache::loncommon::help_open_topic("Quick_Grades_Possibly_Correct"); |
|
|
$r->print("\n</tr>\n\n"); |
$title = $showPoints ? "Points" : "Parts Done"; |
|
|
$r->print("<tr><td colspan='2' align='right'>Total Parts Correct: <b>$totalRight</b><br>"); |
$r->print("<tr><td colspan='2' align='right'>Total $title: <b>$totalRight</b><br>"); |
$r->print("Number Of Parts Possibly Correct: <b>$totalPossible</b><br>"); |
$r->print("Max Possible To Date $maxHelpLink: <b>$totalPossible</b><br>"); |
$r->print("Total Parts In Course: <b>$totalParts</b></td></tr>\n\n"); |
$title = $showPoints ? "Points" : "Parts"; |
|
$r->print("Total $title In Course: <b>$totalParts</b></td></tr>\n\n"); |
|
|
|
|
$r->print("</table></body></html>"); |
$r->print("</table></body></html>"); |
Line 213 sub mixColors {
|
Line 264 sub mixColors {
|
my $end = shift; |
my $end = shift; |
my $ratio = shift; |
my $ratio = shift; |
|
|
|
my ($a,$b); |
my $final = ""; |
my $final = ""; |
my $a = $start->[0]; my $b = $end->[0]; |
$a = $start->[0]; $b = $end->[0]; |
my $mix1 = POSIX::floor((1-$ratio)*$a + $ratio*$b); |
my $mix1 = POSIX::floor((1-$ratio)*$a + $ratio*$b); |
my $a = $start->[1]; my $b = $end->[1]; |
$a = $start->[1]; $b = $end->[1]; |
my $mix2 = POSIX::floor((1-$ratio)*$a + $ratio*$b); |
my $mix2 = POSIX::floor((1-$ratio)*$a + $ratio*$b); |
my $a = $start->[2]; my $b = $end->[2]; |
$a = $start->[2]; $b = $end->[2]; |
my $mix3 = POSIX::floor((1-$ratio)*$a + $ratio*$b); |
my $mix3 = POSIX::floor((1-$ratio)*$a + $ratio*$b); |
|
|
my $final = sprintf "%2x%2x%2x", $mix1, $mix2, $mix3; |
$final = sprintf "%02x%02x%02x", $mix1, $mix2, $mix3; |
return "#" . $final; |
return "#" . $final; |
} |
} |
|
|