Back to index

lightning-sunbird  0.9+nobinonly
NamedNodeMap.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 NamedNodeMap class
00042 //
00043 
00044 #include "dom.h"
00045 
00046 NamedNodeMap::NamedNodeMap()
00047 {
00048 }
00049 
00050 NamedNodeMap::~NamedNodeMap()
00051 {
00052 }
00053 
00054 Node* NamedNodeMap::getNamedItem(const nsAString& name)
00055 {
00056   ListItem* pSearchItem = findListItemByName(name);
00057 
00058   if (pSearchItem)
00059     return pSearchItem->node;
00060   else
00061     return nsnull;
00062 }
00063 
00064 Node* NamedNodeMap::setNamedItem(Node* arg)
00065 {
00066   //Since the DOM does not specify any ording for the NamedNodeMap, just
00067   //try and remove the new node (arg).  If successful, return a pointer to
00068   //the removed item.  Reguardless of wheter the node already existed or not,
00069   //insert the new node at the end of the list.
00070   nsAutoString nodeName;
00071   arg->getNodeName(nodeName);
00072   Node* pReplacedNode = removeNamedItem(nodeName);
00073 
00074   NodeListDefinition::append(arg);
00075 
00076   return pReplacedNode;
00077 }
00078 
00079 Node* NamedNodeMap::removeNamedItem(const nsAString& name)
00080 {
00081   NodeListDefinition::ListItem* pSearchItem;
00082   Node* returnNode;
00083 
00084   pSearchItem = findListItemByName(name);
00085 
00086   if (pSearchItem)
00087     {
00088       if (pSearchItem != firstItem)
00089         pSearchItem->prev->next = pSearchItem->next;
00090       else
00091         firstItem = pSearchItem->next;
00092 
00093       if (pSearchItem != lastItem)
00094         pSearchItem->next->prev = pSearchItem->prev;
00095       else
00096         lastItem = pSearchItem->prev;
00097 
00098       pSearchItem->next = nsnull;
00099       pSearchItem->prev = nsnull;
00100 
00101       length--;
00102       returnNode = pSearchItem->node;
00103       delete pSearchItem;
00104 
00105       return returnNode;
00106     }
00107 
00108 
00109   return nsnull;
00110 }
00111 
00112 NodeListDefinition::ListItem*
00113   NamedNodeMap::findListItemByName(const nsAString& name)
00114 {
00115   NodeListDefinition::ListItem* pSearchItem = firstItem;
00116 
00117   while (pSearchItem)
00118     {
00119       nsAutoString nodeName;
00120       pSearchItem->node->getNodeName(nodeName);
00121       if (name.Equals(nodeName))
00122         return pSearchItem;
00123 
00124       pSearchItem = pSearchItem->next;
00125     }
00126 
00127   return nsnull;
00128 }
00129 
00130 AttrMap::AttrMap()
00131 {
00132     ownerElement = nsnull;
00133 }
00134 
00135 AttrMap::~AttrMap()
00136 {
00137 }
00138 
00139 Node* AttrMap::setNamedItem(Node* arg)
00140 {
00141   if (arg->getNodeType() != Node::ATTRIBUTE_NODE)
00142     return nsnull;
00143   ((Attr*)arg)->ownerElement = ownerElement;
00144   return NamedNodeMap::setNamedItem(arg);
00145 }
00146 
00147 Node* AttrMap::removeNamedItem(const nsAString& name)
00148 {
00149   Attr* node = (Attr*)NamedNodeMap::removeNamedItem(name);
00150   if (node)
00151     node->ownerElement = nsnull;
00152   return node;
00153 }
00154 
00155 void AttrMap::clear()
00156 {
00157   ListItem* pDeleteItem;
00158   ListItem* pListTraversal = firstItem;
00159 
00160   while (pListTraversal) {
00161     pDeleteItem = pListTraversal;
00162     pListTraversal = pListTraversal->next;
00163     delete pDeleteItem->node;
00164     delete pDeleteItem;
00165   }
00166   firstItem = 0;
00167   lastItem = 0;
00168   length = 0;
00169 }