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