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