Return to lonquickgrades.pm CVS log

Up to [LON-CAPA] / loncom / interface

Now displays only sequences with problems in them, displays totals,
has help for "Max Possible To Date" to explain it, and has a
catchall "Problems not in Sequences" if there are problems directly
in the top-level sequence. Still may not be perfect but it should
be closer.

Also see (forthcoming) mail to the dev list.

    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:     # Keep this hash in sync with %statusIconMap in lonnavmaps; they
   72:     # should match color/icon
   73:     my $res = $navmap->firstResource(); # temp resource to access constants
   74: 
   75:     if (!defined($navmap)) {
   76:         my $requrl = $r->uri;
   77:         $ENV{'user.error.msg'} = "$requrl:bre:0:0:Course not initialized";
   78:         return HTTP_NOT_ACCEPTABLE;
   79:     }
   80:  
   81:     # Header
   82:     $r->print(&Apache::loncommon::bodytag('Quick Score Display','',
   83:                                           ''));
   84: 
   85:     $navmap->init();
   86: 
   87:     # End navmap using boilerplate
   88: 
   89:     my $iterator = $navmap->getIterator(undef, undef, undef, 1);
   90:     my $depth = 1;
   91:     $iterator->next(); # ignore first BEGIN_MAP
   92:     my $curRes = $iterator->next();
   93:     
   94:     # General overview of the following: Walk along the course resources.
   95:     # For every problem in the resource, tell its parent maps how many
   96:     # parts and how many parts correct it has. After that, each map will
   97:     # have a count of the total parts underneath it, correct and otherwise.
   98:     # After that, we will walk through the course again and read off
   99:     # maps in order, with their data. 
  100:     # (If in the future people decide not to be cumulative, only add
  101:     #  the counts to the parent map.)
  102: 
  103:     my $totalParts = 0; my $totalPossible = 0; my $totalRight = 0;
  104: 
  105:     # Pre-run: Count parts correct
  106:     while ( $depth > 0 ) {
  107:         if ($curRes == $iterator->BEGIN_MAP()) {$depth++;}
  108:         if ($curRes == $iterator->END_MAP()) { $depth--; }
  109: 
  110:         if (ref($curRes) && $curRes->is_problem())
  111:         {
  112:             # Get number of correct, incorrect parts
  113:             my $parts = $curRes->parts();
  114:             if (scalar(@{$parts}) > 1) { shift @{$parts}; } # lose the first "0"
  115:             $totalParts += scalar(@{$parts});
  116:             my $partsRight = 0;
  117:             my $stack = $iterator->getStack();
  118:             
  119:             for my $part (@{$parts}) {
  120:                 my $status = $curRes->getCompletionStatus($part);
  121:                 if ($status == $curRes->CORRECT || $status == $curRes->CORRECT_BY_OVERRIDE
  122:                     || $status == $curRes->EXCUSED) {
  123:                     $partsRight++;
  124:                     $totalRight++;
  125:                 }
  126: 
  127:                 my $dateStatus = $curRes->getDateStatus($part);
  128:                 if ($status != $curRes->OPEN_LATER) {
  129:                     $totalPossible++;
  130:                 }
  131:             }
  132:             
  133:             # Crawl down stack and record parts correct and total
  134:             for my $res (@{$stack}) {
  135:                 if (ref($res) && $res->is_map()) {
  136:                     if (!defined($res->{DATA}->{CHILD_PARTS})) {
  137:                         $res->{DATA}->{CHILD_PARTS} = 0;
  138:                         $res->{DATA}->{CHILD_CORRECT} = 0;
  139:                     }
  140:                     
  141:                     $res->{DATA}->{CHILD_PARTS} += scalar(@{$parts});
  142:                     $res->{DATA}->{CHILD_CORRECT} += $partsRight;
  143:                 }
  144:             }
  145:         }
  146:         $curRes = $iterator->next();
  147:     }
  148: 
  149:     $iterator = $navmap->getIterator(undef, undef, undef, 1);
  150:     my $depth = 1;
  151:     $iterator->next(); # ignore first BEGIN_MAP
  152:     my $curRes = $iterator->next();
  153: 
  154:     my @start = (255, 255, 0);
  155:     my @end   = (0, 192, 0);
  156: 
  157:     my $indentString = '     ';
  158: 
  159:     my $unaccountedTotal = $totalParts;
  160:     my $unaccountedCorrect = $totalRight;
  161: 
  162:     # Second pass: Print the maps.
  163:     $r->print('<table cellspacing="3" border="2"><tr><td align="center"><b>Sequence</b></td>');
  164:     $r->print('<td align="center">Correct / Total</td><tr>' . "\n\n");
  165:     while ($depth > 0) {
  166:         if ($curRes == $iterator->BEGIN_MAP()) {$depth++;}
  167:         if ($curRes == $iterator->END_MAP()) { $depth--; }
  168: 
  169:         if (ref($curRes) && $curRes->is_map()) {
  170:             my $stack = $iterator->getStack();
  171:             my $src = Apache::lonnavmaps::getLinkForResource($stack);
  172:             my $srcHasQuestion = $src =~ /\?/;
  173:             my $link = $src.
  174:                 ($srcHasQuestion?'&':'?') .
  175:                 'symb='.&Apache::lonnet::escape($curRes->symb()).
  176:                 '"';
  177:             my $title = $curRes->compTitle();
  178:             
  179:             my $correct = $curRes->{DATA}->{CHILD_CORRECT};
  180:             my $total = $curRes->{DATA}->{CHILD_PARTS};
  181: 
  182:             $unaccountedTotal -= $total;
  183:             $unaccountedCorrect -= $correct;
  184: 
  185:             if ($total > 0) {
  186:                 my $ratio;
  187:                 $ratio = $correct / $total;
  188:                 my $color = mixColors(\@start, \@end, $ratio);
  189:                 $r->print("<tr><td bgcolor='$color'>");
  190:                 
  191:                 for (my $i = 1; $i < $depth; $i++) { $r->print($indentString); }
  192:                 
  193:                 $r->print("<a href='$link'>$title</a></td>");
  194:                 $r->print("<td align='center'>$correct / $total</td></tr>\n");
  195:             }
  196:         }
  197: 
  198:         $curRes = $iterator->next();
  199:     }
  200: 
  201:     # If there were any problems at the top level, print an extra "catchall"
  202:     if ($unaccountedTotal > 0) {
  203:         my $ratio = $unaccountedCorrect / $unaccountedTotal;
  204:         my $color = mixColors(\@start, \@end, $ratio);
  205:         $r->print("<tr><td bgcolor='$color'>");
  206:         $r->print("Problems Not Contained In Sequences</td><td align='center'>");
  207:         $r->print("$unaccountedCorrect / $unaccountedTotal</td></tr>");
  208:     }
  209: 
  210:     my $maxHelpLink = Apache::loncommon::help_open_topic("Quick_Grades_Possibly_Correct");
  211: 
  212:     $r->print("<tr><td colspan='2' align='right'>Total Parts Correct: <b>$totalRight</b><br>");
  213:     $r->print("Max Possible To Date $maxHelpLink: <b>$totalPossible</b><br>");
  214:     $r->print("Total Parts In Course: <b>$totalParts</b></td></tr>\n\n");
  215: 
  216: 
  217:     $r->print("</table></body></html>");
  218: 
  219:     $navmap->untieHashes();
  220: 
  221:     return OK;
  222: }
  223: 
  224: # Pass this two refs to arrays for the start and end color, and a number
  225: # from 0 to 1 for how much of the latter you want to mix in. It will
  226: # return a string ready to show ("#FFC309");
  227: sub mixColors {
  228:     my $start = shift;
  229:     my $end = shift;
  230:     my $ratio = shift;
  231:     
  232:     my $final = "";
  233:     my $a = $start->[0]; my $b = $end->[0];
  234:     my $mix1 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
  235:     my $a = $start->[1]; my $b = $end->[1];
  236:     my $mix2 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
  237:     my $a = $start->[2]; my $b = $end->[2];
  238:     my $mix3 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
  239: 
  240:     my $final = sprintf "%2x%2x%2x", $mix1, $mix2, $mix3;
  241:     return "#" . $final;
  242: }
  243: 
  244: 1;