File:
[LON-CAPA] /
loncom /
interface /
lonquickgrades.pm
Revision
1.7:
download - view:
text,
annotated -
select for diffs
Tue Nov 26 14:45:25 2002 UTC (21 years, 9 months ago) by
bowersj2
Branches:
MAIN
CVS tags:
HEAD
* Slight color change; yellow now more pastel. Less unpleasent to look
at and I think the shading is more clear now, since more of the color
is changing.
* Now correctly doesn't count randomout-hidden parts. (Oops.)
* Added a message on top pointing the student to the spreadsheet, fixing
half of 995 (I think that's the bug num...).
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: # Create the nav map
67: my $navmap = Apache::lonnavmaps::navmap->new(
68: $ENV{"request.course.fn"}.".db",
69: $ENV{"request.course.fn"}."_parms.db", 1, 0);
70:
71: if (!defined($navmap)) {
72: my $requrl = $r->uri;
73: $ENV{'user.error.msg'} = "$requrl:bre:0:0:Navamp initialization failed.";
74: return HTTP_NOT_ACCEPTABLE;
75: }
76:
77: # Keep this hash in sync with %statusIconMap in lonnavmaps; they
78: # should match color/icon
79: my $res = $navmap->firstResource(); # temp resource to access constants
80:
81: if (!defined($navmap)) {
82: my $requrl = $r->uri;
83: $ENV{'user.error.msg'} = "$requrl:bre:0:0:Course not initialized";
84: return HTTP_NOT_ACCEPTABLE;
85: }
86:
87: # Header
88: $r->print(&Apache::loncommon::bodytag('Quick Score Display','',
89: ''));
90:
91: $r->print(<<HEADER);
92: <p>This screen shows how many problems (or problem parts) you have completed, and
93: how many you have not yet done. You can also look at <a href="/adm/classcalc">a detailed
94: score sheet</a>.</p>
95: HEADER
96:
97: $navmap->init();
98:
99: # End navmap using boilerplate
100:
101: my $iterator = $navmap->getIterator(undef, undef, undef, 1);
102: my $depth = 1;
103: $iterator->next(); # ignore first BEGIN_MAP
104: my $curRes = $iterator->next();
105:
106: # General overview of the following: Walk along the course resources.
107: # For every problem in the resource, tell its parent maps how many
108: # parts and how many parts correct it has. After that, each map will
109: # have a count of the total parts underneath it, correct and otherwise.
110: # After that, we will walk through the course again and read off
111: # maps in order, with their data.
112: # (If in the future people decide not to be cumulative, only add
113: # the counts to the parent map.)
114:
115: my $totalParts = 0; my $totalPossible = 0; my $totalRight = 0;
116:
117: # Pre-run: Count parts correct
118: while ( $depth > 0 ) {
119: if ($curRes == $iterator->BEGIN_MAP()) {$depth++;}
120: if ($curRes == $iterator->END_MAP()) { $depth--; }
121:
122: if (ref($curRes) && $curRes->is_problem() && !$curRes->randomout)
123: {
124: # Get number of correct, incorrect parts
125: my $parts = $curRes->parts();
126: if (scalar(@{$parts}) > 1) { shift @{$parts}; } # lose the first "0"
127: $totalParts += scalar(@{$parts});
128: my $partsRight = 0;
129: my $stack = $iterator->getStack();
130:
131: for my $part (@{$parts}) {
132: my $status = $curRes->getCompletionStatus($part);
133: if ($status == $curRes->CORRECT || $status == $curRes->CORRECT_BY_OVERRIDE
134: || $status == $curRes->EXCUSED) {
135: $partsRight++;
136: $totalRight++;
137: }
138:
139: my $dateStatus = $curRes->getDateStatus($part);
140: if ($status != $curRes->OPEN_LATER) {
141: $totalPossible++;
142: }
143: }
144:
145: # Crawl down stack and record parts correct and total
146: for my $res (@{$stack}) {
147: if (ref($res) && $res->is_map()) {
148: if (!defined($res->{DATA}->{CHILD_PARTS})) {
149: $res->{DATA}->{CHILD_PARTS} = 0;
150: $res->{DATA}->{CHILD_CORRECT} = 0;
151: }
152:
153: $res->{DATA}->{CHILD_PARTS} += scalar(@{$parts});
154: $res->{DATA}->{CHILD_CORRECT} += $partsRight;
155: }
156: }
157: }
158: $curRes = $iterator->next();
159: }
160:
161: $iterator = $navmap->getIterator(undef, undef, undef, 1);
162: my $depth = 1;
163: $iterator->next(); # ignore first BEGIN_MAP
164: my $curRes = $iterator->next();
165:
166: my @start = (255, 255, 192);
167: my @end = (0, 192, 0);
168:
169: my $indentString = ' ';
170:
171: my $unaccountedTotal = $totalParts;
172: my $unaccountedCorrect = $totalRight;
173:
174: # Second pass: Print the maps.
175: $r->print('<table cellspacing="3" border="2"><tr><td align="center"><b>Sequence</b></td>');
176: $r->print('<td align="center">Correct / Total</td><tr>' . "\n\n");
177: while ($depth > 0) {
178: if ($curRes == $iterator->BEGIN_MAP()) {$depth++;}
179: if ($curRes == $iterator->END_MAP()) { $depth--; }
180:
181: if (ref($curRes) && $curRes->is_map()) {
182: my $stack = $iterator->getStack();
183: my $src = Apache::lonnavmaps::getLinkForResource($stack);
184: my $srcHasQuestion = $src =~ /\?/;
185: my $link = $src.
186: ($srcHasQuestion?'&':'?') .
187: 'symb='.&Apache::lonnet::escape($curRes->symb()).
188: '"';
189: my $title = $curRes->compTitle();
190:
191: my $correct = $curRes->{DATA}->{CHILD_CORRECT};
192: my $total = $curRes->{DATA}->{CHILD_PARTS};
193:
194: $unaccountedTotal -= $total;
195: $unaccountedCorrect -= $correct;
196:
197: if ($total > 0) {
198: my $ratio;
199: $ratio = $correct / $total;
200: my $color = mixColors(\@start, \@end, $ratio);
201: $r->print("<tr><td bgcolor='$color'>");
202:
203: for (my $i = 1; $i < $depth; $i++) { $r->print($indentString); }
204:
205: $r->print("<a href='$link'>$title</a></td>");
206: $r->print("<td align='center'>$correct / $total</td></tr>\n");
207: }
208: }
209:
210: $curRes = $iterator->next();
211: }
212:
213: # If there were any problems at the top level, print an extra "catchall"
214: if ($unaccountedTotal > 0) {
215: my $ratio = $unaccountedCorrect / $unaccountedTotal;
216: my $color = mixColors(\@start, \@end, $ratio);
217: $r->print("<tr><td bgcolor='$color'>");
218: $r->print("Problems Not Contained In Sequences</td><td align='center'>");
219: $r->print("$unaccountedCorrect / $unaccountedTotal</td></tr>");
220: }
221:
222: my $maxHelpLink = Apache::loncommon::help_open_topic("Quick_Grades_Possibly_Correct");
223:
224: $r->print("<tr><td colspan='2' align='right'>Total Parts Correct: <b>$totalRight</b><br>");
225: $r->print("Max Possible To Date $maxHelpLink: <b>$totalPossible</b><br>");
226: $r->print("Total Parts In Course: <b>$totalParts</b></td></tr>\n\n");
227:
228:
229: $r->print("</table></body></html>");
230:
231: $navmap->untieHashes();
232:
233: return OK;
234: }
235:
236: # Pass this two refs to arrays for the start and end color, and a number
237: # from 0 to 1 for how much of the latter you want to mix in. It will
238: # return a string ready to show ("#FFC309");
239: sub mixColors {
240: my $start = shift;
241: my $end = shift;
242: my $ratio = shift;
243:
244: my $final = "";
245: my $a = $start->[0]; my $b = $end->[0];
246: my $mix1 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
247: my $a = $start->[1]; my $b = $end->[1];
248: my $mix2 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
249: my $a = $start->[2]; my $b = $end->[2];
250: my $mix3 = POSIX::floor((1-$ratio)*$a + $ratio*$b);
251:
252: my $final = sprintf "%2x%2x%2x", $mix1, $mix2, $mix3;
253: return "#" . $final;
254: }
255:
256: 1;
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>