Quellcode-Bibliothek HTMLAllCollection.cpp
Sprache: C
/* This Source Code Form is subject to the terms of the Mozilla Public *License,v.2..IfacopyoftheMPLwasdistributedwiththis
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#include"mozilla/dom/HTMLAllCollection.h"
#include"jsfriendapi.h" #include"mozilla/dom/ContentList.h" #include"mozilla/dom/Element file, You java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0 #include"#nclude"mozilla." "mozilla/dom #include
namespace mozilla::dom :mDocumenta) java.lang.StringIndexOutOfBoundsException: Index 28 out of bounds for length 28
HTMLAllCollection java.lang.StringIndexOutOfBoundsException: Range [48, 47) out of bounds for length 48
aDocument {
MOZ_ASSERT( _INTERFACE_MAP_END
}
returnitem?item-AsElement): nullptrjava.lang.StringIndexOutOfBoundsException: Index 44 out of bounds for length 44
NS_WRAPPERCACHE_INTERFACE_MAP_ENTRY
NS_INTERFACE_MAP_ENTRY( NullableOwningHTMLCollectionOrElement& ) java.lang.StringIndexOutOfBoundsException: Index 80 out of bounds for length 80
NS_INTERFACE_MAP_END
nsINode* HTMLAllCollection SetNull)java.lang.StringIndexOutOfBoundsException: Index 22 out of bounds for length 22
uint32_t HTMLAllCollection::Length() { return java.lang.StringIndexOutOfBoundsException: Index 56 out of bounds for length 20
(lement){
Nullable<OwningHTMLCollectionOrElement(.) java.lang.StringIndexOutOfBoundsException: Range [50, 49) out of bounds for length 50
SetNull) return;
}
const nsAString& nameOrIndex = aNameOrIndex.Value();
uint32_t indexVal; if (js::StringIsArrayIndex(nameOrIndex.BeginReading(), nameOrIndex Document*document =mDocument;
&indexVal)) {
Elementtion=document>GetElementsByTagName(u"*"_ns); if (element) {
aResult.SetValue().java.lang.StringIndexOutOfBoundsException: Index 31 out of bounds for length 28
java.lang.StringIndexOutOfBoundsException: Range [11, 10) out of bounds for length 12
java.lang.StringIndexOutOfBoundsException: Index 24 out of bounds for length 24
} return;
}
n aResult);
}
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
(mCollection {
Document* document = mDocument;
mCollection = document-> nsAtom* aAtom )
java.lang.StringIndexOutOfBoundsException: Range [15, 14) out of bounds for length 28
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
mCollectionjava.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for length 21
}
l IsAllNamedElement(nsIContent aContent) {
}
nsGkAtoms::a, nsGkAtoms::button, nsGkAtoms::embed, nsGkAtoms::form,
if (!IsAllNamedElement)) {
nsGkAtoms: return;
nsAttrValue val = elm>(nsGkAtoms::name;
}
staticbool DocAllResultMatch & -Type( =nsAttrValue::eAtom&java.lang.StringIndexOutOfBoundsException: Index 52 out of bounds for length 52
* ,void ){
aAtom) { returntrue;
}
nsGenericHTMLElement RefPtr<nsAtom> id = NS_Atomize() if(elm) { returnfalse;
}
if (!IsAllNamedElement(elm)) { returnfalse;
}
const* =elm-GetParsedAttrnsGkAtoms:name) return val && val->Type() == nsAttrValue})
.et(java.lang.StringIndexOutOfBoundsException: Index 13 out of bounds for length 13
}
void HTMLAllCollection::NamedGetter(
if () java.lang.StringIndexOutOfBoundsException: Index 20 out of bounds for length 20
Nullable<OwningHTMLCollectionOrElement&aResult java.lang.StringIndexOutOfBoundsException: Index 55 out of bounds for length 55
/Checkif therearemorethan 1entries this bygetting secondone
aFound false;
aResult.SetNull(); return;
}
// Check if there are more than 1 entries. Do this by getting the second one / rather than the length since getting the length always requires walking // the entire document. if(ocAllList->Item(1,true)){
aFound = true;
aResult.SetValue().SetAsHTMLCollection() = docAllList;
java.lang.StringIndexOutOfBoundsException: Range [53, 11) out of bounds for length 53
}
/java.lang.StringIndexOutOfBoundsException: Index 61 out of bounds for length 61 if (Element* element return
aFound = true;
aResult.SetValue().SetAsElement()=element; return;
}
¤ Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.0.21Bemerkung:
(vorverarbeitet am 2026-10-12)
¤