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: my $showPoints = $ENV{'course.'.$ENV{'request.course.id'}.'.grading'} eq 'standard';
67:
68: # Create the nav map
69: my $navmap = Apache::lonnavmaps::navmap->new(
70: $ENV{"request.course.fn"}.".db",
71: $ENV{"request.course.fn"}."_parms.db", 1, 0, 1);
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 ? "Quick Points Display" : "Quick Completed Problems Display";
85: $r->print(&Apache::loncommon::bodytag($title, '', ''));
86:
87: if (!$showPoints) {
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("This may take a few moments to display.");
96:
97: $r->rflush();
98:
99: $navmap->init();
100:
101: # End navmap using boilerplate
102:
103: my $iterator = $navmap->getIterator(undef, undef, undef, 1);
104: my $depth = 1;
105: $iterator->next(); # ignore first BEGIN_MAP
106: my $curRes = $iterator->next();
107:
108: # General overview of the following: Walk along the course resources.
109: # For every problem in the resource, tell its parent maps how many
110: # parts and how many parts correct it has. After that, each map will
111: # have a count of the total parts underneath it, correct and otherwise.
112: # After that, we will walk through the course again and read off
113: # maps in order, with their data.
114: # (If in the future people decide not to be cumulative, only add
115: # the counts to the parent map.)
116: # For convenience, "totalParts" is also "totalPoints" when we're looking
117: # at points; I can't come up with a variable name that makes sense
118: # equally for both cases.
119:
120: my $totalParts = 0; my $totalPossible = 0; my $totalRight = 0;
121: my $now = time();
122: my $topLevelParts = 0; my $topLevelRight = 0;
123:
124: # Pre-run: Count parts correct
125: while ( $depth > 0 ) {
126: if ($curRes == $iterator->BEGIN_MAP()) {$depth++;}
127: if ($curRes == $iterator->END_MAP()) { $depth--; }
128:
129: if (ref($curRes) && $curRes->is_problem() && !$curRes->randomout)
130: {
131: # Get number of correct, incorrect parts
132: my $parts = $curRes->parts();
133: my $partsRight = 0;
134: my $partsCount = 0;
135: my $stack = $iterator->getStack();
136:
137: for my $part (@{$parts}) {
138: if ($showPoints) {
139: my $score = $curRes->weight($part) * $curRes->awarded($part);
140: $partsRight += $score;
141: $totalRight += $score;
142: $partsCount += $curRes->weight($part);
143:
144: if ($curRes->opendate($part) < $now) {
145: $totalPossible += $curRes->weight($part);
146: }
147: $totalParts += $curRes->weight($part);
148: } else {
149: my $status = $curRes->getCompletionStatus($part);
150: my $thisright = 0;
151: $partsCount++;
152: if ($status == $curRes->CORRECT ||
153: $status == $curRes->CORRECT_BY_OVERRIDE ||
154: $status == $curRes->EXCUSED ||
155: $status == $curRes->ANSWER_SUBMITTED) {
156: $partsRight++;
157: $totalRight++;
158: $thisright = 1;
159: }
160:
161: my $dateStatus = $curRes->getDateStatus($part);
162: $totalParts++;
163: if ($curRes->opendate($part) < $now) {
164: $totalPossible++;
165: }
166: }
167: }
168:
169: if ($depth == 1) { # in top-level only
170: $topLevelParts += $partsCount;
171: $topLevelRight += $partsRight;
172: }
173:
174: # Crawl down stack and record parts correct and total
175: for my $res (@{$stack}) {
176: if (ref($res) && $res->is_map()) {
177: if (!defined($res->{DATA}->{CHILD_PARTS})) {
178: $res->{DATA}->{CHILD_PARTS} = 0;
179: $res->{DATA}->{CHILD_CORRECT} = 0;
180: }
181:
182: $res->{DATA}->{CHILD_PARTS} += $partsCount;
183: $res->{DATA}->{CHILD_CORRECT} += $partsRight;
184: }
185: }
186: }
187: $curRes = $iterator->next();
188: }
189:
190: $iterator = $navmap->getIterator(undef, undef, undef, 1);
191: $depth = 1;
192: $iterator->next(); # ignore first BEGIN_MAP
193: $curRes = $iterator->next();
194:
195: my @start = (255, 255, 192);
196: my @end = (0, 192, 0);
197:
198: my $indentString = ' ';
199:
200: # Second pass: Print the maps.
201: $r->print('<table cellspacing="3" border="2"><tr><td align="center"><b>Folder</b></td>');
202: $title = $showPoints ? "Points Scored" : "Done";
203: $r->print("<td align='center'>$title / Total</td><tr>" . "\n\n");
204: while ($depth > 0) {
205: if ($curRes == $iterator->BEGIN_MAP()) {$depth++;}
206: if ($curRes == $iterator->END_MAP()) { $depth--; }
207:
208: if (ref($curRes) && $curRes->is_map()) {
209: my $title = $curRes->compTitle();
210:
211: my $correct = $curRes->{DATA}->{CHILD_CORRECT};
212: my $total = $curRes->{DATA}->{CHILD_PARTS};
213:
214: if ($total > 0) {
215: my $ratio;
216: $ratio = $correct / $total;
217: my $color = mixColors(\@start, \@end, $ratio);
218: $r->print("<tr><td bgcolor='$color'>");
219:
220: my $thisIndent = '';
221: for (my $i = 1; $i < $depth; $i++) { $thisIndent .= $indentString; }
222:
223: $r->print("$thisIndent$title</td>");
224: $r->print("<td valign='top'>$thisIndent<nobr>$correct / $total</nobr></td></tr>\n");
225: }
226: }
227:
228: $curRes = $iterator->next();
229: }
230:
231: # If there were any problems at the top level, print an extra "catchall"
232: if ($topLevelParts > 0) {
233: my $ratio = $topLevelRight / $topLevelParts;
234: my $color = mixColors(\@start, \@end, $ratio);
235: $r->print("<tr><td bgcolor='$color'>");
236: $r->print("Problems Not Contained In A Folder</td><td>");
237: $r->print("$topLevelRight / $topLevelParts</td></tr>");
238: }
239:
240: my $maxHelpLink = Apache::loncommon::help_open_topic("Quick_Grades_Possibly_Correct");
241:
242: $title = $showPoints ? "Points" : "Parts Done";
243:
244: $r->print("<tr><td colspan='2' align='right'>Total $title: <b>$totalRight</b><br>");
245: $r->print("Max Possible To Date $maxHelpLink: <b>$totalPossible</b><br>");
246: $title = $showPoints ? "Points" : "Parts";
247: $r->print("Total $title In Course: <b>$totalParts</b></td></tr>\n\n");
248:
249:
250: $r->print("</table></body></html>");
251:
252: $navmap->untieHashes();
253:
254: return OK;
255: }
256:
257: # Pass this two refs to arrays for the start and end color, and a number
258: # from 0 to 1 for how much of the latter you want to mix in. It will
259: # return a string ready to show ("#FFC309");
260: sub mixColors {
261: my $start = shift;
262: my $end = shift;
263: my $ratio = shift;
264:
265: my ($a,$b);
266: my $final = "";
267: $a = $start->[0]; $b = $end->[0];
268: my $mix1 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
269: $a = $start->[1]; $b = $end->[1];
270: my $mix2 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
271: $a = $start->[2]; $b = $end->[2];
272: my $mix3 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
273:
274: $final = sprintf "%02x%02x%02x", $mix1, $mix2, $mix3;
275: return "#" . $final;
276: }
277:
278: 1;
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/back.gif){kind=icon}
Return to lonquickgrades.pm CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [LON-CAPA] / loncom / interface