Return to lonquickgrades.pm CVS log

Up to [LON-CAPA] / loncom / interface

Amazingly, Mozilla got "green" out of "# 0c0 0". Mac IE wasn't quite as
accomodating, and just turned it black. This update will fix that. (This
occurred when a student got all problems in a sequence correct in
quickgrades; I'm surprised nobody complained about this earlier, since
it's been in there since day one.)

    1: # The LearningOnline Network with CAPA
    2: # Quick Student Grades Display
    3: #
    4: # $Id:
    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: 
   36: sub handler {
   37:     my $r = shift;
   38:     return real_handler($r);
   39: }
   40: 
   41: sub real_handler {
   42:     my $r = shift;
   43: 
   44:     &Apache::loncommon::get_unprocessed_cgi($ENV{QUERY_STRING});
   45: 
   46:     # Handle header-only request
   47:     if ($r->header_only) {
   48:         if ($ENV{'browser.mathml'}) {
   49:             $r->content_type('text/xml');
   50:         } else {
   51:             $r->content_type('text/html');
   52:         }
   53:         $r->send_http_header;
   54:         return OK;
   55:     }
   56: 
   57:     # Send header, don't cache this page
   58:     if ($ENV{'browser.mathml'}) {
   59:         $r->content_type('text/xml');
   60:     } else {
   61:         $r->content_type('text/html');
   62:     }
   63:     &Apache::loncommon::no_cache($r);
   64:     $r->send_http_header;
   65: 
   66:     # Create the nav map
   67:     my $navmap = Apache::lonnavmaps::navmap->new(
   68:                         $ENV{"request.course.fn"}.".db",
   69:                         $ENV{"request.course.fn"}."_parms.db", 1, 0);
   70: 
   71:     if (!defined($navmap)) {
   72:         my $requrl = $r->uri;
   73:         $ENV{'user.error.msg'} = "$requrl:bre:0:0:Navamp initialization failed.";
   74:         return HTTP_NOT_ACCEPTABLE;
   75:     }
   76: 
   77:     # Keep this hash in sync with %statusIconMap in lonnavmaps; they
   78:     # should match color/icon
   79:     my $res = $navmap->firstResource(); # temp resource to access constants
   80:  
   81:     # Header
   82:     $r->print(&Apache::loncommon::bodytag('Quick Score Display','',
   83:                                           ''));
   84: 
   85:     $r->print(<<HEADER);
   86: <p>This screen shows how many problems (or problem parts) you have completed, and
   87: how many you have not yet done. You can also look at <a href="/adm/studentcalc">a detailed
   88: score sheet</a>.</p>
   89: HEADER
   90: 
   91:     $navmap->init();
   92: 
   93:     # End navmap using boilerplate
   94: 
   95:     my $iterator = $navmap->getIterator(undef, undef, undef, 1);
   96:     my $depth = 1;
   97:     $iterator->next(); # ignore first BEGIN_MAP
   98:     my $curRes = $iterator->next();
   99:     
  100:     # General overview of the following: Walk along the course resources.
  101:     # For every problem in the resource, tell its parent maps how many
  102:     # parts and how many parts correct it has. After that, each map will
  103:     # have a count of the total parts underneath it, correct and otherwise.
  104:     # After that, we will walk through the course again and read off
  105:     # maps in order, with their data. 
  106:     # (If in the future people decide not to be cumulative, only add
  107:     #  the counts to the parent map.)
  108: 
  109:     my $totalParts = 0; my $totalPossible = 0; my $totalRight = 0;
  110:     my $now = time();
  111:     my $topLevelParts = 0; my $topLevelRight = 0;
  112: 
  113:     # Pre-run: Count parts correct
  114:     while ( $depth > 0 ) {
  115:         if ($curRes == $iterator->BEGIN_MAP()) {$depth++;}
  116:         if ($curRes == $iterator->END_MAP()) { $depth--; }
  117: 
  118:         if (ref($curRes) && $curRes->is_problem() && !$curRes->randomout)
  119:         {
  120:             # Get number of correct, incorrect parts
  121:             my $parts = $curRes->parts();
  122:             $totalParts += $curRes->countParts();
  123:             my $partsRight = 0;
  124:             my $stack = $iterator->getStack();
  125:             
  126:             for my $part (@{$parts}) {
  127:                 my $status = $curRes->getCompletionStatus($part);
  128:                 my $thisright = 0;
  129:                 if ($status == $curRes->CORRECT || $status == $curRes->CORRECT_BY_OVERRIDE
  130:                     || $status == $curRes->EXCUSED || $status == $curRes->ANSWER_SUBMITTED) {
  131:                     $partsRight++;
  132:                     $totalRight++;
  133:                     $thisright = 1;
  134:                 }
  135: 
  136:                 my $dateStatus = $curRes->getDateStatus($part);
  137:                 if ($curRes->opendate($part) < $now) {
  138:                     $totalPossible++;
  139:                 }
  140:             }
  141: 
  142:             if ($depth == 1) { # in top-level only
  143: 		$topLevelParts += scalar(@{$parts});
  144: 		$topLevelRight += $partsRight;
  145: 		$r->print($curRes->compTitle() . '<br>');
  146: 	    }
  147: 
  148:             # Crawl down stack and record parts correct and total
  149:             for my $res (@{$stack}) {
  150:                 if (ref($res) && $res->is_map()) {
  151:                     if (!defined($res->{DATA}->{CHILD_PARTS})) {
  152:                         $res->{DATA}->{CHILD_PARTS} = 0;
  153:                         $res->{DATA}->{CHILD_CORRECT} = 0;
  154:                     }
  155:                     
  156:                     $res->{DATA}->{CHILD_PARTS} += scalar(@{$parts});
  157:                     $res->{DATA}->{CHILD_CORRECT} += $partsRight;
  158:                 }
  159:             }
  160:         }
  161:         $curRes = $iterator->next();
  162:     }
  163: 
  164:     $iterator = $navmap->getIterator(undef, undef, undef, 1);
  165:     $depth = 1;
  166:     $iterator->next(); # ignore first BEGIN_MAP
  167:     $curRes = $iterator->next();
  168: 
  169:     my @start = (255, 255, 192);
  170:     my @end   = (0, 192, 0);
  171: 
  172:     my $indentString = '&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;';
  173: 
  174:     # Second pass: Print the maps.
  175:     $r->print('<table cellspacing="3" border="2"><tr><td align="center"><b>Sequence</b></td>');
  176:     $r->print('<td align="center">Done / Total</td><tr>' . "\n\n");
  177:     while ($depth > 0) {
  178:         if ($curRes == $iterator->BEGIN_MAP()) {$depth++;}
  179:         if ($curRes == $iterator->END_MAP()) { $depth--; }
  180: 
  181:         if (ref($curRes) && $curRes->is_map()) {
  182:             my $title = $curRes->compTitle();
  183:             
  184:             my $correct = $curRes->{DATA}->{CHILD_CORRECT};
  185:             my $total = $curRes->{DATA}->{CHILD_PARTS};
  186: 
  187:             if ($total > 0) {
  188:                 my $ratio;
  189:                 $ratio = $correct / $total;
  190:                 my $color = mixColors(\@start, \@end, $ratio);
  191:                 $r->print("<tr><td bgcolor='$color'>");
  192:                 
  193: 		my $thisIndent = '';
  194:                 for (my $i = 1; $i < $depth; $i++) { $thisIndent .= $indentString; }
  195:                 
  196:                 $r->print("$thisIndent$title</td>");
  197:                 $r->print("<td valign='top'>$thisIndent<nobr>$correct / $total</nobr></td></tr>\n");
  198:             }
  199:         }
  200: 
  201:         $curRes = $iterator->next();
  202:     }
  203: 
  204:     # If there were any problems at the top level, print an extra "catchall"
  205:     if ($topLevelParts > 0) {
  206:         my $ratio = $topLevelRight / $topLevelParts;
  207:         my $color = mixColors(\@start, \@end, $ratio);
  208:         $r->print("<tr><td bgcolor='$color'>");
  209:         $r->print("Problems Not Contained In A Folder</td><td>");
  210:         $r->print("$topLevelRight / $topLevelParts</td></tr>");
  211:     }
  212: 
  213:     my $maxHelpLink = Apache::loncommon::help_open_topic("Quick_Grades_Possibly_Correct");
  214: 
  215:     $r->print("<tr><td colspan='2' align='right'>Total Parts Done: <b>$totalRight</b><br>");
  216:     $r->print("Max Possible To Date $maxHelpLink: <b>$totalPossible</b><br>");
  217:     $r->print("Total Parts In Course: <b>$totalParts</b></td></tr>\n\n");
  218: 
  219: 
  220:     $r->print("</table></body></html>");
  221: 
  222:     $navmap->untieHashes();
  223: 
  224:     return OK;
  225: }
  226: 
  227: # Pass this two refs to arrays for the start and end color, and a number
  228: # from 0 to 1 for how much of the latter you want to mix in. It will
  229: # return a string ready to show ("#FFC309");
  230: sub mixColors {
  231:     my $start = shift;
  232:     my $end = shift;
  233:     my $ratio = shift;
  234:     
  235:     my ($a,$b);
  236:     my $final = "";
  237:     $a = $start->[0]; $b = $end->[0];
  238:     my $mix1 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
  239:     $a = $start->[1]; $b = $end->[1];
  240:     my $mix2 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
  241:     $a = $start->[2]; $b = $end->[2];
  242:     my $mix3 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
  243: 
  244:     $final = sprintf "%02x%02x%02x", $mix1, $mix2, $mix3;
  245:     return "#" . $final;
  246: }
  247: 
  248: 1;