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