File:
[LON-CAPA] /
loncom /
interface /
lonquickgrades.pm
Revision
1.23:
download - view:
text,
annotated -
select for diffs
Thu Aug 7 14:29:43 2003 UTC (21 years ago) by
bowersj2
Branches:
MAIN
CVS tags:
HEAD
Remove the requirement to pass in the nav hash and the param hash;
nobody ever does it and I'm pretty sure it will never be useful. (If it
is, it can be easily added back in as an optional parameter later;
meanwhile it just confuses things.)
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 =
67: $ENV{'course.'.$ENV{'request.course.id'}.'.grading'} eq 'standard';
68:
69: # Create the nav map
70: my $navmap = Apache::lonnavmaps::navmap->new(1, 0, 1);
71:
72: if (!defined($navmap)) {
73: my $requrl = $r->uri;
74: $ENV{'user.error.msg'} = "$requrl:bre:0:0:Navamp initialization failed.";
75: return HTTP_NOT_ACCEPTABLE;
76: }
77:
78: # Keep this hash in sync with %statusIconMap in lonnavmaps; they
79: # should match color/icon
80: my $res = $navmap->firstResource(); # temp resource to access constants
81:
82: # Header
83: my $title = $showPoints ? "Quick Points Display" : "Quick Completed Problems Display";
84: $r->print(&Apache::loncommon::bodytag($title, '', ''));
85:
86: if (!$showPoints) {
87: $r->print(<<HEADER);
88: <p>This screen shows how many problems (or problem parts) you have completed, and
89: how many you have not yet done. You can also look at <a href="/adm/studentcalc">a detailed
90: score sheet</a>.</p>
91: HEADER
92: }
93:
94: $r->print("This may take a few moments to display.");
95:
96: $r->rflush();
97:
98: $navmap->init();
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 $now = time();
121: my $topLevelParts = 0; my $topLevelRight = 0;
122:
123: # Pre-run: Count parts correct
124: while ( $depth > 0 ) {
125: if ($curRes == $iterator->BEGIN_MAP()) {$depth++;}
126: if ($curRes == $iterator->END_MAP()) { $depth--; }
127:
128: if (ref($curRes) && $curRes->is_problem() && !$curRes->randomout)
129: {
130: # Get number of correct, incorrect parts
131: my $parts = $curRes->parts();
132: my $partsRight = 0;
133: my $partsCount = 0;
134: my $stack = $iterator->getStack();
135:
136: for my $part (@{$parts}) {
137: if ($curRes->getCompletionStatus($part) == $curRes->EXCUSED()) {
138: next;
139: }
140: if ($showPoints) {
141: my $score = $curRes->weight($part) * $curRes->awarded($part);
142: $partsRight += $score;
143: $totalRight += $score;
144: $partsCount += $curRes->weight($part);
145:
146: if ($curRes->opendate($part) < $now) {
147: $totalPossible += $curRes->weight($part);
148: }
149: $totalParts += $curRes->weight($part);
150: } else {
151: my $status = $curRes->getCompletionStatus($part);
152: my $thisright = 0;
153: $partsCount++;
154: if ($status == $curRes->CORRECT ||
155: $status == $curRes->CORRECT_BY_OVERRIDE ||
156: $status == $curRes->ANSWER_SUBMITTED) {
157: $partsRight++;
158: $totalRight++;
159: $thisright = 1;
160: }
161:
162: my $dateStatus = $curRes->getDateStatus($part);
163: $totalParts++;
164: if ($curRes->opendate($part) < $now) {
165: $totalPossible++;
166: }
167: }
168: }
169:
170: if ($depth == 1) { # in top-level only
171: $topLevelParts += $partsCount;
172: $topLevelRight += $partsRight;
173: }
174:
175: # Crawl down stack and record parts correct and total
176: for my $res (@{$stack}) {
177: if (ref($res) && $res->is_map()) {
178: if (!defined($res->{DATA}->{CHILD_PARTS})) {
179: $res->{DATA}->{CHILD_PARTS} = 0;
180: $res->{DATA}->{CHILD_CORRECT} = 0;
181: }
182:
183: $res->{DATA}->{CHILD_PARTS} += $partsCount;
184: $res->{DATA}->{CHILD_CORRECT} += $partsRight;
185: }
186: }
187: }
188: $curRes = $iterator->next();
189: }
190:
191: $iterator = $navmap->getIterator(undef, undef, undef, 1);
192: $depth = 1;
193: $iterator->next(); # ignore first BEGIN_MAP
194: $curRes = $iterator->next();
195:
196: my @start = (255, 255, 192);
197: my @end = (0, 192, 0);
198:
199: my $indentString = ' ';
200:
201: # Second pass: Print the maps.
202: $r->print('<table cellspacing="3" border="2"><tr><td align="center"><b>Folder</b></td>');
203: $title = $showPoints ? "Points Scored" : "Done";
204: $r->print("<td align='center'>$title / Total</td><tr>" . "\n\n");
205: while ($depth > 0) {
206: if ($curRes == $iterator->BEGIN_MAP()) {$depth++;}
207: if ($curRes == $iterator->END_MAP()) { $depth--; }
208:
209: if (ref($curRes) && $curRes->is_map()) {
210: my $title = $curRes->compTitle();
211:
212: my $correct = $curRes->{DATA}->{CHILD_CORRECT};
213: my $total = $curRes->{DATA}->{CHILD_PARTS};
214:
215: if ($total > 0) {
216: my $ratio;
217: $ratio = $correct / $total;
218: my $color = mixColors(\@start, \@end, $ratio);
219: $r->print("<tr><td bgcolor='$color'>");
220:
221: my $thisIndent = '';
222: for (my $i = 1; $i < $depth; $i++) { $thisIndent .= $indentString; }
223:
224: $r->print("$thisIndent$title</td>");
225: $r->print("<td valign='top'>$thisIndent<nobr>$correct / $total</nobr></td></tr>\n");
226: }
227: }
228:
229: $curRes = $iterator->next();
230: }
231:
232: # If there were any problems at the top level, print an extra "catchall"
233: if ($topLevelParts > 0) {
234: my $ratio = $topLevelRight / $topLevelParts;
235: my $color = mixColors(\@start, \@end, $ratio);
236: $r->print("<tr><td bgcolor='$color'>");
237: $r->print("Problems Not Contained In A Folder</td><td>");
238: $r->print("$topLevelRight / $topLevelParts</td></tr>");
239: }
240:
241: my $maxHelpLink = Apache::loncommon::help_open_topic("Quick_Grades_Possibly_Correct");
242:
243: $title = $showPoints ? "Points" : "Parts Done";
244:
245: $r->print("<tr><td colspan='2' align='right'>Total $title: <b>$totalRight</b><br>");
246: $r->print("Max Possible To Date $maxHelpLink: <b>$totalPossible</b><br>");
247: $title = $showPoints ? "Points" : "Parts";
248: $r->print("Total $title In Course: <b>$totalParts</b></td></tr>\n\n");
249:
250:
251: $r->print("</table></body></html>");
252:
253: $navmap->untieHashes();
254:
255: return OK;
256: }
257:
258: # Pass this two refs to arrays for the start and end color, and a number
259: # from 0 to 1 for how much of the latter you want to mix in. It will
260: # return a string ready to show ("#FFC309");
261: sub mixColors {
262: my $start = shift;
263: my $end = shift;
264: my $ratio = shift;
265:
266: my ($a,$b);
267: my $final = "";
268: $a = $start->[0]; $b = $end->[0];
269: my $mix1 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
270: $a = $start->[1]; $b = $end->[1];
271: my $mix2 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
272: $a = $start->[2]; $b = $end->[2];
273: my $mix3 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
274:
275: $final = sprintf "%02x%02x%02x", $mix1, $mix2, $mix3;
276: return "#" . $final;
277: }
278:
279: 1;
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>