Difference between revisions of "Script Classes for Adventure Games/List Class"

Revision as of 01:14, 7 December 2015

Chapter: 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26
27 | 28 | 29 | 30 | 31 | 32 | 33 | 34 | 35 | 36 | 37 | 38 | 39 | 40 | 41 | 42 | 43 | 44 | 45 | 46 | 47 | 48 | 49 | 50 | Index

The List Class

Date: 5 April 1988

A List is just a Collection which has a specified order to its elements.

Adds elements to the end of the list in the order specified.

====
first:

Returns the kNode of the first element in the List.

====
next: kNode

Returns the kNode of the element which follows kNode in the List, 0 if kNode is the end of the List.

====
at: n

Returns the element (not the kNode) at position n in the List.

====
last:

Returns the kNode of the last element in the List.

====
prev: kNode

Returns the kNode of the element preceding kNode in the List, 0 if kNode is the first element of the List.

====
addToFront: element [element ...]

Add elements to the beginning of the List.

====
addToEnd: element [element ...]

Add elements to the end of the List.

====
indexOf: element

Return the index of element in the list. If the element is not in the list, return -1.

@@ Line 62: / Line 62: @@
 &nbsp;
-xxxxxxx body xxxxxxxx
+==<br /> The List Class ==
+A List is just a Collection which has a specified order to its elements.
+{|
+|In file||system.sc
+|-
+|Inherits from||Collection
+|-
+|Inherited by||Inventory
+|-
+|            || Set
+|}
+===<br /> Properties ===
+&nbsp;
+===<br /> Methods ===
+====<br /> add: element [element ...] ====
+<blockquote>Adds elements to the end of the list in the order specified.</blockquote>
+====<br /> first:
+<blockquote>Returns the kNode of the first element in the List.</blockquote>
+====<br /> next: kNode
+<blockquote>Returns the kNode of the element which follows kNode in the List, 0 if kNode is the end of the List.</blockquote>
+====<br /> at: n
+<blockquote>Returns the element (not the kNode) at position n in the List.</blockquote>
+====<br /> last:
+<blockquote>Returns the kNode of the last element in the List.</blockquote>
+====<br /> prev: kNode
+<blockquote>Returns the kNode of the element preceding kNode in the List, 0 if kNode is the first element of the List.</blockquote>
+====<br /> addToFront: element [element ...]
+<blockquote>Add elements to the beginning of the List.</blockquote>
+====<br /> addToEnd: element [element ...]
+<blockquote>Add elements to the end of the List.</blockquote>
+====<br /> indexOf: element
+<blockquote>Return the index of element in the list. If the element is not in the list, return -1.</blockquote>
 &nbsp;