[LON-CAPA-cvs] cvs: loncom /interface lonnavmaps.pm

[bowersj2]

bowersj2		Fri Feb  7 17:17:51 2003 EDT

  Modified files:              
    /loncom/interface	lonnavmaps.pm 
  Log:
  A special commit, just for Matthew.
  
  
Index: loncom/interface/lonnavmaps.pm
diff -u loncom/interface/lonnavmaps.pm:1.141 loncom/interface/lonnavmaps.pm:1.142
--- loncom/interface/lonnavmaps.pm:1.141	Fri Feb  7 17:16:53 2003
+++ loncom/interface/lonnavmaps.pm	Fri Feb  7 17:17:51 2003
@@ -2,7 +2,7 @@
 # The LearningOnline Network with CAPA
 # Navigate Maps Handler
 #
-# $Id: lonnavmaps.pm,v 1.141 2003/02/07 22:16:53 bowersj2 Exp $
+# $Id: lonnavmaps.pm,v 1.142 2003/02/07 22:17:51 bowersj2 Exp $
 #
 # Copyright Michigan State University Board of Trustees
 #
@@ -2500,7 +2500,7 @@
 
 =pod
 
-=item * B<parts>(): Returns a list reference containing sorted strings corresponding to each part of the problem. To count the number of parts, use the list in a scalar context, and subtract one if greater then two. (One part problems have a part 0. Multi-parts have a part 0, plus a part for each part. Filtering part 0 if you want it is up to you.)
+=item * B<parts>(): Returns a list reference containing sorted strings corresponding to each part of the problem. To count the number of parts, use the list in a scalar context, and subtract one if greater than two. (One part problems have a part 0. Multi-parts have a part 0, plus a part for each part. Filtering part 0 if you want it is up to you.)
 
 =item * B<countParts>(): Returns the number of parts of the problem a student can answer. Thus, for single part problems, returns 1. For multipart, it returns the number of parts in the problem, not including psuedo-part 0. Thus, B<parts> may return an array with fewer parts in it then countParts might lead you to believe.