'
+ .&mt('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 [_1]a detailed score sheet[_2].'
+ ,'','')
+ .'
');
+ }
- $navmap->init();
+ $r->print('
-
- | Problem |
- Score |
-
-TABLETOP
+ # End navmap using boilerplate
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.)
+ # 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 $totalAttempted = 0;
+ my $now = time();
+ my $topLevelParts = 0; my $topLevelRight = 0; my $topLevelAttempted = 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();
+ my $partsRight = 0;
+ my $partsCount = 0;
+ my $partsAttempted = 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 $completionStatus = $curRes->getCompletionStatus($part);
+ my $dateStatus = $curRes->getDateStatus($part);
+
+ if ($completionStatus == $curRes->EXCUSED()) {
+ next;
+ }
+ if ($showPoints) {
+ my $score = 0;
+ # If we're not telling status and the answer date isn't passed yet,
+ # it's an "attempted" point
+ if ((($curRes->problemstatus($part) eq 'no') ||
+ ($curRes->problemstatus($part) eq 'no_feedback_ever')) &&
+ ($dateStatus != $curRes->ANSWER_OPEN)) {
+ my $status = $curRes->simpleStatus($part);
+ if ($status == $curRes->ATTEMPTED) {
+ $partsAttempted += $curRes->weight($part);
+ $totalAttempted += $partsAttempted;
+ }
+ } else {
+ $score = &Apache::grades::compute_points($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->simpleStatus($part);
+ my $thisright = 0;
+ $partsCount++;
+ if ($status == $curRes->CORRECT ||
+ $status == $curRes->PARTIALLY_CORRECT ) {
+ $partsRight++;
+ $totalRight++;
+ $thisright = 1;
+ }
+
+ if ($status == $curRes->ATTEMPTED) {
+ $partsAttempted++;
+ $totalAttempted++;
+ }
+
+ my $dateStatus = $curRes->getDateStatus($part);
+ $totalParts++;
+ if ($curRes->opendate($part) < $now) {
+ $totalPossible++;
+ }
+ }
}
+
+ if ($depth == 1) { # in top-level only
+ $topLevelParts += $partsCount;
+ $topLevelRight += $partsRight;
+ $topLevelAttempted += $partsAttempted;
+ }
+
+ # 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_ATTEMPTED} = 0;
+ }
+
+ $res->{DATA}->{CHILD_PARTS} += $partsCount;
+ $res->{DATA}->{CHILD_CORRECT} += $partsRight;
+ $res->{DATA}->{CHILD_ATTEMPTED} += $partsAttempted;
+ }
+ }
+ }
+ $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(&Apache::loncommon::start_data_table()
+ .&Apache::loncommon::start_data_table_header_row()
+ .''.&mt('Folder').' | ');
+ $title = &mt($showPoints ? "Points Scored" : "Done");
+ if ($totalAttempted) {
+ $title .= " / " . &mt("Attempted");
+ }
+ $r->print("$title".($notshowTotals?'':" / ".&mt('Total')).' | '
+ .&Apache::loncommon::end_data_table_header_row());
+ 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("$score / $avail |
\n");
- $totalAvailable += $avail;
- $total += $score;
+ my $correct = $curRes->{DATA}->{CHILD_CORRECT};
+ my $total = $curRes->{DATA}->{CHILD_PARTS};
+ my $attempted = $curRes->{DATA}->{CHILD_ATTEMPTED};
+
+ if ($total > 0) {
+ my $ratio;
+ $ratio = $correct / $total;
+ my $color = &mixColors(\@start, \@end, $ratio);
+ $r->print(&Apache::loncommon::start_data_table_row()
+ .'');
+
+ my $thisIndent = '';
+ for (my $i = 1; $i < $depth; $i++) { $thisIndent .= $indentString; }
+
+ $r->print("$thisIndent$title | ");
+ if ($totalAttempted) {
+ $r->print(''
+ .$thisIndent
+ .''
+ .$correct.' / '.$attempted.($notshowTotals?'':' / '.$total)
+ .' | '
+ .&Apache::loncommon::end_data_table_row()
+ );
+ } else {
+ $r->print(''
+ .$thisIndent
+ .''
+ .$correct.($notshowTotals?'':' / '.$total)
+ .' | '
+ .&Apache::loncommon::end_data_table_row());
+ }
+ }
}
$curRes = $iterator->next();
}
- $r->print("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(&Apache::loncommon::start_data_table_row()
+ .'');
+ $r->print(&mt("Problems Not Contained In A Folder")." | ");
+ $r->print("$topLevelRight / $topLevelParts | "
+ .&Apache::loncommon::end_data_table_row());
+ }
+
+ if ($showPoints) {
+ my $maxHelpLink = &Apache::loncommon::help_open_topic("Quick_Grades_Possibly_Correct");
+
+ $title = $showPoints ? "Points" : "Parts Done";
+ my $totaltitle = $showPoints ? &mt("Awarded Total Points") : &mt("Total Parts Done");
+ $r->print(&Apache::loncommon::start_data_table_row()
+ .''.$totaltitle.': '.$totalRight.'
');
+ $r->print(&mt('Max Possible To Date')." $maxHelpLink: $totalPossible
");
+ $title = $showPoints ? "Points" : "Parts";
+ $r->print(&mt("Total $title In Course").': '.$totalParts.' | '
+ .&Apache::loncommon::end_data_table_row());
+ }
- $r->print("