Home | History | Annotate | Download | only in svg
      1 /*
      2  * Copyright (C) 2007 Nikolas Zimmermann <zimmermann (at) kde.org>
      3  *
      4  * This library is free software; you can redistribute it and/or
      5  * modify it under the terms of the GNU Library General Public
      6  * License as published by the Free Software Foundation; either
      7  * version 2 of the License, or (at your option) any later version.
      8  *
      9  * This library is distributed in the hope that it will be useful,
     10  * but WITHOUT ANY WARRANTY; without even the implied warranty of
     11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
     12  * Library General Public License for more details.
     13  *
     14  * You should have received a copy of the GNU Library General Public License
     15  * along with this library; see the file COPYING.LIB.  If not, write to
     16  * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
     17  * Boston, MA 02110-1301, USA.
     18  */
     19 
     20 #include "config.h"
     21 
     22 #include "core/svg/SVGElementInstanceList.h"
     23 #include "core/svg/SVGElementInstance.h"
     24 
     25 namespace WebCore {
     26 
     27 SVGElementInstanceList::SVGElementInstanceList(PassRefPtr<SVGElementInstance> rootInstance)
     28     : m_rootInstance(rootInstance)
     29 {
     30     ScriptWrappable::init(this);
     31 }
     32 
     33 unsigned SVGElementInstanceList::length() const
     34 {
     35     // NOTE: We could use the same caching facilities, like the ones "ChildNodeList" uses.
     36     unsigned length = 0;
     37     for (SVGElementInstance* instance = m_rootInstance->firstChild(); instance; instance = instance->nextSibling())
     38         length++;
     39     return length;
     40 }
     41 
     42 SVGElementInstance* SVGElementInstanceList::item(unsigned index)
     43 {
     44     unsigned pos = 0;
     45     SVGElementInstance* instance = m_rootInstance->firstChild();
     46     while (instance && pos < index) {
     47         instance = instance->nextSibling();
     48         pos++;
     49     }
     50     return instance;
     51 }
     52 
     53 }
     54