File:  [LON-CAPA] / loncom / interface / lonquickgrades.pm
Revision 1.41: download - view: text, annotated - select for diffs
Thu Dec 20 10:18:19 2007 UTC (16 years, 4 months ago) by bisitz
Branches: MAIN
CVS tags: version_2_6_X, version_2_6_99_1, version_2_6_99_0, version_2_6_3, version_2_6_2, version_2_6_1, version_2_6_0, version_2_5_99_1, HEAD
- Localization: added some missing &mt('...')
- Changed "Total Points" to "Awarded Total Points" to make it more clear that this value only refers to the _awarded_ points

    1: # The LearningOnline Network with CAPA
    2: # Quick Student Grades Display
    3: #
    4: # $Id: lonquickgrades.pm,v 1.41 2007/12/20 10:18:19 bisitz Exp $
    5: #
    6: # Copyright Michigan State University Board of Trustees
    7: #
    8: # This file is part of the LearningOnline Network with CAPA (LON-CAPA).
    9: #
   10: # LON-CAPA is free software; you can redistribute it and/or modify
   11: # it under the terms of the GNU General Public License as published by
   12: # the Free Software Foundation; either version 2 of the License, or
   13: # (at your option) any later version.
   14: #
   15: # LON-CAPA is distributed in the hope that it will be useful,
   16: # but WITHOUT ANY WARRANTY; without even the implied warranty of
   17: # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   18: # GNU General Public License for more details.
   19: #
   20: # You should have received a copy of the GNU General Public License
   21: # along with LON-CAPA; if not, write to the Free Software
   22: # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
   23: #
   24: # /home/httpd/html/adm/gpl.txt
   25: #
   26: # http://www.lon-capa.org/
   27: #
   28: # Created Nov. 14, 2002 by Jeremy Bowers
   29: 
   30: package Apache::lonquickgrades;
   31: 
   32: use strict;
   33: use Apache::Constants qw(:common :http);
   34: use POSIX;
   35: use Apache::loncommon;
   36: use Apache::lonlocal;
   37: use Apache::lonnet;
   38: use Apache::grades;
   39: 
   40: sub handler {
   41:     my $r = shift;
   42:     return real_handler($r);
   43: }
   44: 
   45: sub real_handler {
   46:     my $r = shift;
   47: 
   48:     &Apache::loncommon::get_unprocessed_cgi($ENV{QUERY_STRING});
   49: 
   50:     # Handle header-only request
   51:     if ($env{'browser.mathml'}) {
   52: 	&Apache::loncommon::content_type($r,'text/xml');
   53:     } else {
   54: 	&Apache::loncommon::content_type($r,'text/html');
   55:     }
   56:     if ($r->header_only) {
   57: 	$r->send_http_header;
   58:         return OK;
   59:     }
   60: 
   61:     # Send header, don't cache this page
   62:     &Apache::loncommon::no_cache($r);
   63:     $r->send_http_header;
   64: 
   65:     my $showPoints = 
   66:         $env{'course.'.$env{'request.course.id'}.'.grading'} eq 'standard';
   67:     my $notshowSPRSlink = 
   68:         $env{'course.'.$env{'request.course.id'}.'.grading'} eq 'external';
   69: 
   70:     # Create the nav map
   71:     my $navmap = Apache::lonnavmaps::navmap->new();
   72: 
   73:     if (!defined($navmap)) {
   74:         my $requrl = $r->uri;
   75:         $env{'user.error.msg'} = "$requrl:bre:0:0:Navamp initialization failed.";
   76:         return HTTP_NOT_ACCEPTABLE;
   77:     }
   78: 
   79:     # Keep this hash in sync with %statusIconMap in lonnavmaps; they
   80:     # should match color/icon
   81:     my $res = $navmap->firstResource(); # temp resource to access constants
   82:  
   83:     # Header
   84:     my $title = $showPoints ? "Points Display" : "Completed Problems Display";
   85:     $r->print(&Apache::loncommon::start_page($title));
   86: 
   87:     if (!$showPoints && !$notshowSPRSlink ) {
   88:         $r->print(<<HEADER); 
   89: <p>This screen shows how many problems (or problem parts) you have completed, and
   90: how many you have not yet done. You can also look at <a href="/adm/studentcalc">a detailed
   91: score sheet</a>.</p>
   92: HEADER
   93:     }
   94: 
   95:     $r->print(&mt('This may take a few moments to display.'));
   96: 
   97:     $r->rflush();
   98: 
   99:     # End navmap using boilerplate
  100: 
  101:     my $iterator = $navmap->getIterator(undef, undef, undef, 1);
  102:     my $depth = 1;
  103:     $iterator->next(); # ignore first BEGIN_MAP
  104:     my $curRes = $iterator->next();
  105:     
  106:     # General overview of the following: Walk along the course resources.
  107:     # For every problem in the resource, tell its parent maps how many
  108:     # parts and how many parts correct it has. After that, each map will
  109:     # have a count of the total parts underneath it, correct and otherwise.
  110:     # After that, we will walk through the course again and read off
  111:     # maps in order, with their data. 
  112:     # (If in the future people decide not to be cumulative, only add
  113:     #  the counts to the parent map.)
  114:     # For convenience, "totalParts" is also "totalPoints" when we're looking
  115:     #  at points; I can't come up with a variable name that makes sense
  116:     #  equally for both cases.
  117: 
  118:     my $totalParts = 0; my $totalPossible = 0; my $totalRight = 0;
  119:     my $totalAttempted = 0;
  120:     my $now = time();
  121:     my $topLevelParts = 0; my $topLevelRight = 0; my $topLevelAttempted = 0;
  122: 
  123:     # Pre-run: Count parts correct
  124:     while ( $depth > 0 ) {
  125:         if ($curRes == $iterator->BEGIN_MAP()) {$depth++;}
  126:         if ($curRes == $iterator->END_MAP()) { $depth--; }
  127: 
  128:         if (ref($curRes) && $curRes->is_problem() && !$curRes->randomout)
  129:         {
  130:             # Get number of correct, incorrect parts
  131:             my $parts = $curRes->parts();
  132:             my $partsRight = 0;
  133: 	    my $partsCount = 0;
  134: 	    my $partsAttempted = 0;
  135:             my $stack = $iterator->getStack();
  136:             
  137:             for my $part (@{$parts}) {
  138: 		my $completionStatus = $curRes->getCompletionStatus($part);
  139: 		my $dateStatus = $curRes->getDateStatus($part);
  140: 		
  141:                 if ($completionStatus == $curRes->EXCUSED()) {
  142:                     next;
  143:                 }
  144: 		if ($showPoints) {
  145: 		    my $score = 0;
  146: 		    # If we're not telling status and the answer date isn't passed yet, 
  147: 		    # it's an "attempted" point
  148: 		    if ($curRes->problemstatus($part) eq 'no' &&
  149: 			($dateStatus != $curRes->ANSWER_OPEN)) {
  150: 			my $status = $curRes->simpleStatus($part);
  151: 			if ($status == $curRes->ATTEMPTED) {
  152: 			    $partsAttempted += $curRes->weight($part);
  153: 			    $totalAttempted += $partsAttempted;
  154: 			}
  155: 		    } else {
  156: 			$score = &Apache::grades::compute_points($curRes->weight($part), $curRes->awarded($part));
  157: 		    }
  158: 		    $partsRight += $score;
  159: 		    $totalRight += $score;
  160: 		    $partsCount += $curRes->weight($part);
  161: 
  162: 		    if ($curRes->opendate($part) < $now) {
  163: 			$totalPossible += $curRes->weight($part);
  164: 		    }
  165: 		    $totalParts += $curRes->weight($part);
  166: 		} else {
  167: 		    my $status = $curRes->simpleStatus($part);
  168: 		    my $thisright = 0;
  169: 		    $partsCount++;
  170: 		    if ($status == $curRes->CORRECT ||
  171: 			$status == $curRes->PARTIALLY_CORRECT ) {
  172: 			$partsRight++;
  173: 			$totalRight++;
  174: 			$thisright = 1;
  175: 		    }
  176: 
  177: 		    if ($status == $curRes->ATTEMPTED) {
  178: 			$partsAttempted++;
  179: 			$totalAttempted++;
  180: 		    }
  181: 		    
  182: 		    my $dateStatus = $curRes->getDateStatus($part);
  183: 		    $totalParts++;
  184: 		    if ($curRes->opendate($part) < $now) {
  185: 			$totalPossible++;
  186: 		    }
  187: 		}
  188:             }
  189: 
  190:             if ($depth == 1) { # in top-level only
  191: 		$topLevelParts += $partsCount;
  192: 		$topLevelRight += $partsRight;
  193: 		$topLevelAttempted += $partsAttempted;
  194: 	    }
  195: 
  196:             # Crawl down stack and record parts correct and total
  197:             for my $res (@{$stack}) {
  198:                 if (ref($res) && $res->is_map()) {
  199:                     if (!defined($res->{DATA}->{CHILD_PARTS})) {
  200:                         $res->{DATA}->{CHILD_PARTS} = 0;
  201:                         $res->{DATA}->{CHILD_CORRECT} = 0;
  202: 			$res->{DATA}->{CHILD_ATTEMPTED} = 0;
  203:                     }
  204:                     
  205:                     $res->{DATA}->{CHILD_PARTS} += $partsCount;
  206:                     $res->{DATA}->{CHILD_CORRECT} += $partsRight;
  207: 		    $res->{DATA}->{CHILD_ATTEMPTED} += $partsAttempted;
  208:                 }
  209:             }
  210:         }
  211:         $curRes = $iterator->next();
  212:     }
  213: 
  214:     $iterator = $navmap->getIterator(undef, undef, undef, 1);
  215:     $depth = 1;
  216:     $iterator->next(); # ignore first BEGIN_MAP
  217:     $curRes = $iterator->next();
  218: 
  219:     my @start = (255, 255, 192);
  220:     my @end   = (0, 192, 0);
  221: 
  222:     my $indentString = '&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;';
  223: 
  224:     # Second pass: Print the maps.
  225:     $r->print('<table cellspacing="3" border="2"><tr><td align="center"><b>' .
  226: 	      &mt('Folder') . '</b></td>');
  227:     $title = &mt($showPoints ? "Points Scored" : "Done");
  228:     if ($totalAttempted) {
  229: 	$title .= " / " . &mt("Attempted");
  230:     }
  231:     $r->print("<td align='center'>$title / "
  232: 	      . &mt('Total') . "</td><tr>\n\n");
  233:     while ($depth > 0) {
  234:         if ($curRes == $iterator->BEGIN_MAP()) {$depth++;}
  235:         if ($curRes == $iterator->END_MAP()) { $depth--; }
  236: 
  237:         if (ref($curRes) && $curRes->is_map()) {
  238:             my $title = $curRes->compTitle();
  239:             
  240:             my $correct = $curRes->{DATA}->{CHILD_CORRECT};
  241:             my $total = $curRes->{DATA}->{CHILD_PARTS};
  242: 	    my $attempted = $curRes->{DATA}->{CHILD_ATTEMPTED};
  243: 
  244:             if ($total > 0) {
  245:                 my $ratio;
  246:                 $ratio = $correct / $total;
  247:                 my $color = mixColors(\@start, \@end, $ratio);
  248:                 $r->print("<tr><td bgcolor='$color'>");
  249:                 
  250: 		my $thisIndent = '';
  251:                 for (my $i = 1; $i < $depth; $i++) { $thisIndent .= $indentString; }
  252:                 
  253:                 $r->print("$thisIndent$title</td>");
  254: 		if ($totalAttempted) {
  255: 		    $r->print("<td valign='top'>$thisIndent<nobr>$correct / $attempted / $total</nobr></td></tr>\n");
  256: 		} else {
  257: 		    $r->print("<td valign='top'>$thisIndent<nobr>$correct / $total</nobr></td></tr>\n");
  258: 		}
  259:             }
  260:         }
  261: 
  262:         $curRes = $iterator->next();
  263:     }
  264: 
  265:     # If there were any problems at the top level, print an extra "catchall"
  266:     if ($topLevelParts > 0) {
  267:         my $ratio = $topLevelRight / $topLevelParts;
  268:         my $color = mixColors(\@start, \@end, $ratio);
  269:         $r->print("<tr><td bgcolor='$color'>");
  270:         $r->print(&mt("Problems Not Contained In A Folder")."</td><td>");
  271:         $r->print("$topLevelRight / $topLevelParts</td></tr>");
  272:     }
  273: 
  274:     if ($showPoints) {
  275: 	my $maxHelpLink = Apache::loncommon::help_open_topic("Quick_Grades_Possibly_Correct");
  276: 
  277: 	$title = $showPoints ? "Points" : "Parts Done";
  278: 	my $totaltitle = $showPoints ? &mt("Awarded Total Points") : &mt("Total Parts Done");
  279: 	$r->print("<tr><td colspan='2' align='right'>$totaltitle: <b>$totalRight</b><br>");
  280: 	$r->print(&mt("Max Possible To Date")." $maxHelpLink: <b>$totalPossible</b><br>");
  281: 	$title = $showPoints ? "Points" : "Parts";
  282: 	$r->print(&mt("Total $title In Course").": <b>$totalParts</b></td></tr>\n\n");
  283:     }
  284: 
  285:     $r->print("</table>".&Apache::loncommon::end_page());
  286: 
  287:     return OK;
  288: }
  289: 
  290: # Pass this two refs to arrays for the start and end color, and a number
  291: # from 0 to 1 for how much of the latter you want to mix in. It will
  292: # return a string ready to show ("#FFC309");
  293: sub mixColors {
  294:     my $start = shift;
  295:     my $end = shift;
  296:     my $ratio = shift;
  297:     
  298:     my ($a,$b);
  299:     my $final = "";
  300:     $a = $start->[0]; $b = $end->[0];
  301:     my $mix1 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
  302:     $a = $start->[1]; $b = $end->[1];
  303:     my $mix2 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
  304:     $a = $start->[2]; $b = $end->[2];
  305:     my $mix3 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
  306: 
  307:     $final = sprintf "%02x%02x%02x", $mix1, $mix2, $mix3;
  308:     return "#" . $final;
  309: }
  310: 
  311: 1;

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>