Back to index

lightning-sunbird  0.9+nobinonly
NodeListDefinition.cpp
Go to the documentation of this file.
00001 /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
00002 /* ***** BEGIN LICENSE BLOCK *****
00003  * Version: MPL 1.1/GPL 2.0/LGPL 2.1
00004  *
00005  * The contents of this file are subject to the Mozilla Public License Version
00006  * 1.1 (the "License"); you may not use this file except in compliance with
00007  * the License. You may obtain a copy of the License at
00008  * http://www.mozilla.org/MPL/
00009  *
00010  * Software distributed under the License is distributed on an "AS IS" basis,
00011  * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
00012  * for the specific language governing rights and limitations under the
00013  * License.
00014  *
00015  * The Original Code is TransforMiiX XSLT processor code.
00016  *
00017  * The Initial Developer of the Original Code is
00018  * The MITRE Corporation.
00019  * Portions created by the Initial Developer are Copyright (C) 1999
00020  * the Initial Developer. All Rights Reserved.
00021  *
00022  * Contributor(s):
00023  *
00024  * Alternatively, the contents of this file may be used under the terms of
00025  * either the GNU General Public License Version 2 or later (the "GPL"), or
00026  * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
00027  * in which case the provisions of the GPL or the LGPL are applicable instead
00028  * of those above. If you wish to allow use of your version of this file only
00029  * under the terms of either the GPL or the LGPL, and not to allow others to
00030  * use your version of this file under the terms of the MPL, indicate your
00031  * decision by deleting the provisions above and replace them with the notice
00032  * and other provisions required by the GPL or the LGPL. If you do not delete
00033  * the provisions above, a recipient may use your version of this file under
00034  * the terms of any one of the MPL, the GPL or the LGPL.
00035  *
00036  * ***** END LICENSE BLOCK ***** */
00037 
00038 // Tom Kneeland (3/29/99)
00039 //
00040 //  Implementation of the Document Object Model Level 1 Core
00041 //    Implementation of the NodeListDefinition class
00042 //
00043 // Modification History:
00044 // Who  When      What
00045 // TK   03/29/99  Created
00046 //
00047 
00048 #include "dom.h"
00049 
00050 //
00051 //Create an empty node list.
00052 //
00053 NodeListDefinition::NodeListDefinition()
00054 {
00055   firstItem = nsnull;
00056   lastItem = nsnull;
00057   length = 0;
00058 }
00059 
00060 //
00061 //Free up the memory used by the List of Items.  Don't delete the actual nodes
00062 //though.
00063 //
00064 NodeListDefinition::~NodeListDefinition()
00065 {
00066   ListItem* pDeleteItem;
00067   ListItem* pListTraversal = firstItem;
00068 
00069   while (pListTraversal)
00070     {
00071     pDeleteItem = pListTraversal;
00072     pListTraversal = pListTraversal->next;
00073     delete pDeleteItem;
00074     }
00075 }
00076 
00077 //
00078 //Create a new ListItem, point it to the newNode, and append it to the current
00079 //list of nodes.
00080 //
00081 void NodeListDefinition::append(Node* newNode)
00082 {
00083   append(*newNode);
00084 }
00085 
00086 void NodeListDefinition::append(Node& newNode)
00087 {
00088   ListItem* newListItem = new ListItem;
00089   if (!newListItem)
00090       return;
00091 
00092   // Setup the new list item
00093   newListItem->node = &newNode;
00094   newListItem->prev = lastItem;
00095   newListItem->next = nsnull;
00096 
00097   //Append the list item
00098   if (lastItem)
00099     lastItem->next = newListItem;
00100 
00101   lastItem = newListItem;
00102 
00103   //Adjust firstItem if this new item is being added to an empty list
00104   if (!firstItem)
00105     firstItem = lastItem;
00106 
00107   //Need to increment the length of the list.  Inherited from NodeList
00108   length++;
00109 }
00110 
00111 //
00112 // Return the Node contained in the item specified
00113 //
00114 Node* NodeListDefinition::item(PRUint32 index)
00115 {
00116   PRUint32 selectLoop;
00117   ListItem* pListItem = firstItem;
00118 
00119   if (index < length)
00120     {
00121       for (selectLoop=0;selectLoop<index;selectLoop++)
00122         pListItem = pListItem->next;
00123 
00124       return pListItem->node;
00125     }
00126 
00127   return nsnull;
00128 }
00129 
00130 //
00131 // Return the number of items in the list
00132 //
00133 PRUint32 NodeListDefinition::getLength()
00134 {
00135   return length;
00136 }