Return to lonquickgrades.pm CVS log

Up to [LON-CAPA] / loncom / interface

- BUG#2390, removing the word quick from the display in lonquickgrades

    1: # The LearningOnline Network with CAPA
    2: # Quick Student Grades Display
    3: #
    4: # $Id: lonquickgrades.pm,v 1.30 2003/11/21 18:21:02 albertel 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: 
   38: sub handler {
   39:     my $r = shift;
   40:     return real_handler($r);
   41: }
   42: 
   43: sub real_handler {
   44:     my $r = shift;
   45: 
   46:     &Apache::loncommon::get_unprocessed_cgi($ENV{QUERY_STRING});
   47: 
   48:     # Handle header-only request
   49:     if ($r->header_only) {
   50:         if ($ENV{'browser.mathml'}) {
   51:             &Apache::loncommon::content_type($r,'text/xml');
   52:         } else {
   53:             &Apache::loncommon::content_type($r,'text/html');
   54:         }
   55:         $r->send_http_header;
   56:         return OK;
   57:     }
   58: 
   59:     # Send header, don't cache this page
   60:     if ($ENV{'browser.mathml'}) {
   61:         &Apache::loncommon::content_type($r, 'text/xml');
   62:     } else {
   63:         &Apache::loncommon::content_type($r, 'text/html');
   64:     }
   65:     &Apache::loncommon::no_cache($r);
   66:     $r->send_http_header;
   67: 
   68:     my $showPoints = 
   69:         $ENV{'course.'.$ENV{'request.course.id'}.'.grading'} eq 'standard';
   70:     my $notshowSPRSlink = 
   71:         $ENV{'course.'.$ENV{'request.course.id'}.'.grading'} eq 'external';
   72: 
   73:     # Create the nav map
   74:     my $navmap = Apache::lonnavmaps::navmap->new();
   75: 
   76:     if (!defined($navmap)) {
   77:         my $requrl = $r->uri;
   78:         $ENV{'user.error.msg'} = "$requrl:bre:0:0:Navamp initialization failed.";
   79:         return HTTP_NOT_ACCEPTABLE;
   80:     }
   81: 
   82:     # Keep this hash in sync with %statusIconMap in lonnavmaps; they
   83:     # should match color/icon
   84:     my $res = $navmap->firstResource(); # temp resource to access constants
   85:  
   86:     # Header
   87:     my $title = $showPoints ? "Points Display" : "Completed Problems Display";
   88:     $r->print(&Apache::loncommon::bodytag($title, '', ''));
   89: 
   90:     if (!$showPoints && !$notshowSPRSlink ) {
   91:         $r->print(<<HEADER); 
   92: <p>This screen shows how many problems (or problem parts) you have completed, and
   93: how many you have not yet done. You can also look at <a href="/adm/studentcalc">a detailed
   94: score sheet</a>.</p>
   95: HEADER
   96:     }
   97: 
   98:     $r->print("This may take a few moments to display.");
   99: 
  100:     $r->rflush();
  101: 
  102:     # End navmap using boilerplate
  103: 
  104:     my $iterator = $navmap->getIterator(undef, undef, undef, 1);
  105:     my $depth = 1;
  106:     $iterator->next(); # ignore first BEGIN_MAP
  107:     my $curRes = $iterator->next();
  108:     
  109:     # General overview of the following: Walk along the course resources.
  110:     # For every problem in the resource, tell its parent maps how many
  111:     # parts and how many parts correct it has. After that, each map will
  112:     # have a count of the total parts underneath it, correct and otherwise.
  113:     # After that, we will walk through the course again and read off
  114:     # maps in order, with their data. 
  115:     # (If in the future people decide not to be cumulative, only add
  116:     #  the counts to the parent map.)
  117:     # For convenience, "totalParts" is also "totalPoints" when we're looking
  118:     #  at points; I can't come up with a variable name that makes sense
  119:     #  equally for both cases.
  120: 
  121:     my $totalParts = 0; my $totalPossible = 0; my $totalRight = 0;
  122:     my $totalAttempted = 0;
  123:     my $now = time();
  124:     my $topLevelParts = 0; my $topLevelRight = 0; my $topLevelAttempted = 0;
  125: 
  126:     # Pre-run: Count parts correct
  127:     while ( $depth > 0 ) {
  128:         if ($curRes == $iterator->BEGIN_MAP()) {$depth++;}
  129:         if ($curRes == $iterator->END_MAP()) { $depth--; }
  130: 
  131:         if (ref($curRes) && $curRes->is_problem() && !$curRes->randomout)
  132:         {
  133:             # Get number of correct, incorrect parts
  134:             my $parts = $curRes->parts();
  135:             my $partsRight = 0;
  136: 	    my $partsCount = 0;
  137: 	    my $partsAttempted = 0;
  138:             my $stack = $iterator->getStack();
  139:             
  140:             for my $part (@{$parts}) {
  141: 		my $completionStatus = $curRes->getCompletionStatus($part);
  142: 		my $dateStatus = $curRes->getDateStatus($part);
  143: 		
  144:                 if ($completionStatus == $curRes->EXCUSED()) {
  145:                     next;
  146:                 }
  147: 		if ($showPoints) {
  148: 		    my $score = 0;
  149: 		    # If we're not telling status and the answer date isn't passed yet, 
  150: 		    # it's an "attempted" point
  151: 		    if ($curRes->problemstatus($part) eq 'no' &&
  152: 			($dateStatus != $curRes->ANSWER_OPEN)) {
  153: 			$partsAttempted += $curRes->weight($part);
  154: 			$totalAttempted += $partsAttempted;
  155: 		    } else {
  156: 			$score = $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->INCORRECT ) {
  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:     my $maxHelpLink = Apache::loncommon::help_open_topic("Quick_Grades_Possibly_Correct");
  275: 
  276:     $title = $showPoints ? "Points" : "Parts Done";
  277: 
  278:     $r->print("<tr><td colspan='2' align='right'>Total $title: <b>$totalRight</b><br>");
  279:     $r->print(&mt("Max Possible To Date")." $maxHelpLink: <b>$totalPossible</b><br>");
  280:     $title = $showPoints ? "Points" : "Parts";
  281:     $r->print(&mt("Total $title In Course").": <b>$totalParts</b></td></tr>\n\n");
  282: 
  283: 
  284:     $r->print("</table></body></html>");
  285: 
  286:     $navmap->untieHashes();
  287: 
  288:     return OK;
  289: }
  290: 
  291: # Pass this two refs to arrays for the start and end color, and a number
  292: # from 0 to 1 for how much of the latter you want to mix in. It will
  293: # return a string ready to show ("#FFC309");
  294: sub mixColors {
  295:     my $start = shift;
  296:     my $end = shift;
  297:     my $ratio = shift;
  298:     
  299:     my ($a,$b);
  300:     my $final = "";
  301:     $a = $start->[0]; $b = $end->[0];
  302:     my $mix1 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
  303:     $a = $start->[1]; $b = $end->[1];
  304:     my $mix2 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
  305:     $a = $start->[2]; $b = $end->[2];
  306:     my $mix3 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
  307: 
  308:     $final = sprintf "%02x%02x%02x", $mix1, $mix2, $mix3;
  309:     return "#" . $final;
  310: }
  311: 
  312: 1;