File:  [LON-CAPA] / loncom / interface / lonquickgrades.pm
Revision 1.14: download - view: text, annotated - select for diffs
Fri Jun 13 19:11:56 2003 UTC (20 years, 11 months ago) by bowersj2
Branches: MAIN
CVS tags: version_0_99_2, HEAD
Fix bug 1653 - can't go to maps in /uploaded. Thus, for consistency,
can't go to any maps.

This *really* sucks for the quickgrades screen, but I don't think we
have alternatives unless *all* maps can be browsed.

    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: 
  112:     # Pre-run: Count parts correct
  113:     while ( $depth > 0 ) {
  114:         if ($curRes == $iterator->BEGIN_MAP()) {$depth++;}
  115:         if ($curRes == $iterator->END_MAP()) { $depth--; }
  116: 
  117:         if (ref($curRes) && $curRes->is_problem() && !$curRes->randomout)
  118:         {
  119:             # Get number of correct, incorrect parts
  120:             my $parts = $curRes->parts();
  121:             $totalParts += $curRes->countParts();
  122:             my $partsRight = 0;
  123:             my $stack = $iterator->getStack();
  124:             
  125:             for my $part (@{$parts}) {
  126:                 my $status = $curRes->getCompletionStatus($part);
  127:                 my $thisright = 0;
  128:                 if ($status == $curRes->CORRECT || $status == $curRes->CORRECT_BY_OVERRIDE
  129:                     || $status == $curRes->EXCUSED || $status == $curRes->ANSWER_SUBMITTED) {
  130:                     $partsRight++;
  131:                     $totalRight++;
  132:                     $thisright = 1;
  133:                 }
  134: 
  135:                 my $dateStatus = $curRes->getDateStatus($part);
  136:                 if ($curRes->opendate($part) < $now) {
  137:                     $totalPossible++;
  138:                 }
  139:             }
  140:             
  141:             # Crawl down stack and record parts correct and total
  142:             for my $res (@{$stack}) {
  143:                 if (ref($res) && $res->is_map()) {
  144:                     if (!defined($res->{DATA}->{CHILD_PARTS})) {
  145:                         $res->{DATA}->{CHILD_PARTS} = 0;
  146:                         $res->{DATA}->{CHILD_CORRECT} = 0;
  147:                     }
  148:                     
  149:                     $res->{DATA}->{CHILD_PARTS} += scalar(@{$parts});
  150:                     $res->{DATA}->{CHILD_CORRECT} += $partsRight;
  151:                 }
  152:             }
  153:         }
  154:         $curRes = $iterator->next();
  155:     }
  156: 
  157:     $iterator = $navmap->getIterator(undef, undef, undef, 1);
  158:     $depth = 1;
  159:     $iterator->next(); # ignore first BEGIN_MAP
  160:     $curRes = $iterator->next();
  161: 
  162:     my @start = (255, 255, 192);
  163:     my @end   = (0, 192, 0);
  164: 
  165:     my $indentString = '&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;';
  166: 
  167:     my $unaccountedTotal = $totalParts;
  168:     my $unaccountedCorrect = $totalRight;
  169: 
  170:     # Second pass: Print the maps.
  171:     $r->print('<table cellspacing="3" border="2"><tr><td align="center"><b>Sequence</b></td>');
  172:     $r->print('<td align="center">Done / Total</td><tr>' . "\n\n");
  173:     while ($depth > 0) {
  174:         if ($curRes == $iterator->BEGIN_MAP()) {$depth++;}
  175:         if ($curRes == $iterator->END_MAP()) { $depth--; }
  176: 
  177:         if (ref($curRes) && $curRes->is_map()) {
  178:             my $title = $curRes->compTitle();
  179:             
  180:             my $correct = $curRes->{DATA}->{CHILD_CORRECT};
  181:             my $total = $curRes->{DATA}->{CHILD_PARTS};
  182: 
  183:             $unaccountedTotal -= $total;
  184:             $unaccountedCorrect -= $correct;
  185: 
  186:             if ($total > 0) {
  187:                 my $ratio;
  188:                 $ratio = $correct / $total;
  189:                 my $color = mixColors(\@start, \@end, $ratio);
  190:                 $r->print("<tr><td bgcolor='$color'>");
  191:                 
  192:                 for (my $i = 1; $i < $depth; $i++) { $r->print($indentString); }
  193:                 
  194:                 $r->print("$title</td>");
  195:                 $r->print("<td align='center'>$correct / $total</td></tr>\n");
  196:             }
  197:         }
  198: 
  199:         $curRes = $iterator->next();
  200:     }
  201: 
  202:     # If there were any problems at the top level, print an extra "catchall"
  203:     if ($unaccountedTotal > 0) {
  204:         my $ratio = $unaccountedCorrect / $unaccountedTotal;
  205:         my $color = mixColors(\@start, \@end, $ratio);
  206:         $r->print("<tr><td bgcolor='$color'>");
  207:         $r->print("Problems Not Contained In A Folder</td><td align='center'>");
  208:         $r->print("$unaccountedCorrect / $unaccountedTotal</td></tr>");
  209:     }
  210: 
  211:     my $maxHelpLink = Apache::loncommon::help_open_topic("Quick_Grades_Possibly_Correct");
  212: 
  213:     $r->print("<tr><td colspan='2' align='right'>Total Parts Done: <b>$totalRight</b><br>");
  214:     $r->print("Max Possible To Date $maxHelpLink: <b>$totalPossible</b><br>");
  215:     $r->print("Total Parts In Course: <b>$totalParts</b></td></tr>\n\n");
  216: 
  217: 
  218:     $r->print("</table></body></html>");
  219: 
  220:     $navmap->untieHashes();
  221: 
  222:     return OK;
  223: }
  224: 
  225: # Pass this two refs to arrays for the start and end color, and a number
  226: # from 0 to 1 for how much of the latter you want to mix in. It will
  227: # return a string ready to show ("#FFC309");
  228: sub mixColors {
  229:     my $start = shift;
  230:     my $end = shift;
  231:     my $ratio = shift;
  232:     
  233:     my ($a,$b);
  234:     my $final = "";
  235:     $a = $start->[0]; $b = $end->[0];
  236:     my $mix1 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
  237:     $a = $start->[1]; $b = $end->[1];
  238:     my $mix2 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
  239:     $a = $start->[2]; $b = $end->[2];
  240:     my $mix3 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
  241: 
  242:     $final = sprintf "%2x%2x%2x", $mix1, $mix2, $mix3;
  243:     return "#" . $final;
  244: }
  245: 
  246: 1;

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