1: # The LearningOnline Network with CAPA
2: # Quick Student Grades Display
3: #
4: # $Id: lonquickgrades.pm,v 1.37 2005/12/20 15:02:13 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: use Apache::lonnet;
38:
39: sub handler {
40: my $r = shift;
41: return real_handler($r);
42: }
43:
44: sub real_handler {
45: my $r = shift;
46:
47: &Apache::loncommon::get_unprocessed_cgi($ENV{QUERY_STRING});
48:
49: # Handle header-only request
50: if ($r->header_only) {
51: if ($env{'browser.mathml'}) {
52: &Apache::loncommon::content_type($r,'text/xml');
53: } else {
54: &Apache::loncommon::content_type($r,'text/html');
55: }
56: $r->send_http_header;
57: return OK;
58: }
59:
60: # Send header, don't cache this page
61: if ($env{'browser.mathml'}) {
62: &Apache::loncommon::content_type($r, 'text/xml');
63: } else {
64: &Apache::loncommon::content_type($r, 'text/html');
65: }
66: &Apache::loncommon::no_cache($r);
67: $r->send_http_header;
68:
69: my $showPoints =
70: $env{'course.'.$env{'request.course.id'}.'.grading'} eq 'standard';
71: my $notshowSPRSlink =
72: $env{'course.'.$env{'request.course.id'}.'.grading'} eq 'external';
73:
74: # Create the nav map
75: my $navmap = Apache::lonnavmaps::navmap->new();
76:
77: if (!defined($navmap)) {
78: my $requrl = $r->uri;
79: $env{'user.error.msg'} = "$requrl:bre:0:0:Navamp initialization failed.";
80: return HTTP_NOT_ACCEPTABLE;
81: }
82:
83: # Keep this hash in sync with %statusIconMap in lonnavmaps; they
84: # should match color/icon
85: my $res = $navmap->firstResource(); # temp resource to access constants
86:
87: # Header
88: my $title = $showPoints ? "Points Display" : "Completed Problems Display";
89: $r->print(&Apache::loncommon::bodytag($title, '', ''));
90:
91: if (!$showPoints && !$notshowSPRSlink ) {
92: $r->print(<<HEADER);
93: <p>This screen shows how many problems (or problem parts) you have completed, and
94: how many you have not yet done. You can also look at <a href="/adm/studentcalc">a detailed
95: score sheet</a>.</p>
96: HEADER
97: }
98:
99: $r->print("This may take a few moments to display.");
100:
101: $r->rflush();
102:
103: # End navmap using boilerplate
104:
105: my $iterator = $navmap->getIterator(undef, undef, undef, 1);
106: my $depth = 1;
107: $iterator->next(); # ignore first BEGIN_MAP
108: my $curRes = $iterator->next();
109:
110: # General overview of the following: Walk along the course resources.
111: # For every problem in the resource, tell its parent maps how many
112: # parts and how many parts correct it has. After that, each map will
113: # have a count of the total parts underneath it, correct and otherwise.
114: # After that, we will walk through the course again and read off
115: # maps in order, with their data.
116: # (If in the future people decide not to be cumulative, only add
117: # the counts to the parent map.)
118: # For convenience, "totalParts" is also "totalPoints" when we're looking
119: # at points; I can't come up with a variable name that makes sense
120: # equally for both cases.
121:
122: my $totalParts = 0; my $totalPossible = 0; my $totalRight = 0;
123: my $totalAttempted = 0;
124: my $now = time();
125: my $topLevelParts = 0; my $topLevelRight = 0; my $topLevelAttempted = 0;
126:
127: # Pre-run: Count parts correct
128: while ( $depth > 0 ) {
129: if ($curRes == $iterator->BEGIN_MAP()) {$depth++;}
130: if ($curRes == $iterator->END_MAP()) { $depth--; }
131:
132: if (ref($curRes) && $curRes->is_problem() && !$curRes->randomout)
133: {
134: # Get number of correct, incorrect parts
135: my $parts = $curRes->parts();
136: my $partsRight = 0;
137: my $partsCount = 0;
138: my $partsAttempted = 0;
139: my $stack = $iterator->getStack();
140:
141: for my $part (@{$parts}) {
142: my $completionStatus = $curRes->getCompletionStatus($part);
143: my $dateStatus = $curRes->getDateStatus($part);
144:
145: if ($completionStatus == $curRes->EXCUSED()) {
146: next;
147: }
148: if ($showPoints) {
149: my $score = 0;
150: # If we're not telling status and the answer date isn't passed yet,
151: # it's an "attempted" point
152: if ($curRes->problemstatus($part) eq 'no' &&
153: ($dateStatus != $curRes->ANSWER_OPEN)) {
154: my $status = $curRes->simpleStatus($part);
155: if ($status == $curRes->ATTEMPTED) {
156: $partsAttempted += $curRes->weight($part);
157: $totalAttempted += $partsAttempted;
158: }
159: } else {
160: $score = $curRes->weight($part) * $curRes->awarded($part);
161: }
162: $partsRight += $score;
163: $totalRight += $score;
164: $partsCount += $curRes->weight($part);
165:
166: if ($curRes->opendate($part) < $now) {
167: $totalPossible += $curRes->weight($part);
168: }
169: $totalParts += $curRes->weight($part);
170: } else {
171: my $status = $curRes->simpleStatus($part);
172: my $thisright = 0;
173: $partsCount++;
174: if ($status == $curRes->CORRECT ||
175: $status == $curRes->PARTIALLY_CORRECT ) {
176: $partsRight++;
177: $totalRight++;
178: $thisright = 1;
179: }
180:
181: if ($status == $curRes->ATTEMPTED) {
182: $partsAttempted++;
183: $totalAttempted++;
184: }
185:
186: my $dateStatus = $curRes->getDateStatus($part);
187: $totalParts++;
188: if ($curRes->opendate($part) < $now) {
189: $totalPossible++;
190: }
191: }
192: }
193:
194: if ($depth == 1) { # in top-level only
195: $topLevelParts += $partsCount;
196: $topLevelRight += $partsRight;
197: $topLevelAttempted += $partsAttempted;
198: }
199:
200: # Crawl down stack and record parts correct and total
201: for my $res (@{$stack}) {
202: if (ref($res) && $res->is_map()) {
203: if (!defined($res->{DATA}->{CHILD_PARTS})) {
204: $res->{DATA}->{CHILD_PARTS} = 0;
205: $res->{DATA}->{CHILD_CORRECT} = 0;
206: $res->{DATA}->{CHILD_ATTEMPTED} = 0;
207: }
208:
209: $res->{DATA}->{CHILD_PARTS} += $partsCount;
210: $res->{DATA}->{CHILD_CORRECT} += $partsRight;
211: $res->{DATA}->{CHILD_ATTEMPTED} += $partsAttempted;
212: }
213: }
214: }
215: $curRes = $iterator->next();
216: }
217:
218: $iterator = $navmap->getIterator(undef, undef, undef, 1);
219: $depth = 1;
220: $iterator->next(); # ignore first BEGIN_MAP
221: $curRes = $iterator->next();
222:
223: my @start = (255, 255, 192);
224: my @end = (0, 192, 0);
225:
226: my $indentString = ' ';
227:
228: # Second pass: Print the maps.
229: $r->print('<table cellspacing="3" border="2"><tr><td align="center"><b>' .
230: &mt('Folder') . '</b></td>');
231: $title = &mt($showPoints ? "Points Scored" : "Done");
232: if ($totalAttempted) {
233: $title .= " / " . &mt("Attempted");
234: }
235: $r->print("<td align='center'>$title / "
236: . &mt('Total') . "</td><tr>\n\n");
237: while ($depth > 0) {
238: if ($curRes == $iterator->BEGIN_MAP()) {$depth++;}
239: if ($curRes == $iterator->END_MAP()) { $depth--; }
240:
241: if (ref($curRes) && $curRes->is_map()) {
242: my $title = $curRes->compTitle();
243:
244: my $correct = $curRes->{DATA}->{CHILD_CORRECT};
245: my $total = $curRes->{DATA}->{CHILD_PARTS};
246: my $attempted = $curRes->{DATA}->{CHILD_ATTEMPTED};
247:
248: if ($total > 0) {
249: my $ratio;
250: $ratio = $correct / $total;
251: my $color = mixColors(\@start, \@end, $ratio);
252: $r->print("<tr><td bgcolor='$color'>");
253:
254: my $thisIndent = '';
255: for (my $i = 1; $i < $depth; $i++) { $thisIndent .= $indentString; }
256:
257: $r->print("$thisIndent$title</td>");
258: if ($totalAttempted) {
259: $r->print("<td valign='top'>$thisIndent<nobr>$correct / $attempted / $total</nobr></td></tr>\n");
260: } else {
261: $r->print("<td valign='top'>$thisIndent<nobr>$correct / $total</nobr></td></tr>\n");
262: }
263: }
264: }
265:
266: $curRes = $iterator->next();
267: }
268:
269: # If there were any problems at the top level, print an extra "catchall"
270: if ($topLevelParts > 0) {
271: my $ratio = $topLevelRight / $topLevelParts;
272: my $color = mixColors(\@start, \@end, $ratio);
273: $r->print("<tr><td bgcolor='$color'>");
274: $r->print(&mt("Problems Not Contained In A Folder")."</td><td>");
275: $r->print("$topLevelRight / $topLevelParts</td></tr>");
276: }
277:
278: if ($showPoints) {
279: my $maxHelpLink = Apache::loncommon::help_open_topic("Quick_Grades_Possibly_Correct");
280:
281: $title = $showPoints ? "Points" : "Parts Done";
282:
283: $r->print("<tr><td colspan='2' align='right'>Total $title: <b>$totalRight</b><br>");
284: $r->print(&mt("Max Possible To Date")." $maxHelpLink: <b>$totalPossible</b><br>");
285: $title = $showPoints ? "Points" : "Parts";
286: $r->print(&mt("Total $title In Course").": <b>$totalParts</b></td></tr>\n\n");
287: }
288:
289: $r->print("</table></body></html>");
290:
291: return OK;
292: }
293:
294: # Pass this two refs to arrays for the start and end color, and a number
295: # from 0 to 1 for how much of the latter you want to mix in. It will
296: # return a string ready to show ("#FFC309");
297: sub mixColors {
298: my $start = shift;
299: my $end = shift;
300: my $ratio = shift;
301:
302: my ($a,$b);
303: my $final = "";
304: $a = $start->[0]; $b = $end->[0];
305: my $mix1 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
306: $a = $start->[1]; $b = $end->[1];
307: my $mix2 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
308: $a = $start->[2]; $b = $end->[2];
309: my $mix3 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
310:
311: $final = sprintf "%02x%02x%02x", $mix1, $mix2, $mix3;
312: return "#" . $final;
313: }
314:
315: 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