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