// Copyright (c) 2020 lumi // Copyright (c) 2020 Emmanuel Gil Peyrot // Copyright (c) 2020 Bastien Orivel // Copyright (c) 2020 Maxime “pep” Buquet // Copyright (c) 2020 Yue Liu // Copyright (c) 2020 Matt Bilker // Copyright (c) 2020 Xidorn Quan // // This Source Code Form is subject to the terms of the Mozilla Public // License, v. 2.0. If a copy of the MPL was not distributed with this // file, You can obtain one at http://mozilla.org/MPL/2.0/. //! Provides an `Element` type, which represents DOM nodes, and a builder to create them with. use crate::convert::IntoAttributeValue; use crate::error::{Error, Result}; use crate::namespaces::NSChoice; use crate::node::Node; use crate::prefixes::{Namespace, Prefix, Prefixes}; use std::collections::{btree_map, BTreeMap}; use std::io::Write; use std::borrow::Cow; use std::str; use quick_xml::events::{BytesDecl, BytesEnd, BytesStart, Event}; use quick_xml::Reader as EventReader; use quick_xml::Writer as EventWriter; use std::io::BufRead; use std::str::FromStr; use std::slice; /// helper function to escape a `&[u8]` and replace all /// xml special characters (<, >, &, ', ") with their corresponding /// xml escaped value. pub fn escape(raw: &[u8]) -> Cow<[u8]> { let mut escapes: Vec<(usize, &'static [u8])> = Vec::new(); let mut bytes = raw.iter(); fn to_escape(b: u8) -> bool { match b { b'<' | b'>' | b'\'' | b'&' | b'"' => true, _ => false, } } let mut loc = 0; while let Some(i) = bytes.position(|&b| to_escape(b)) { loc += i; match raw[loc] { b'<' => escapes.push((loc, b"<")), b'>' => escapes.push((loc, b">")), b'\'' => escapes.push((loc, b"'")), b'&' => escapes.push((loc, b"&")), b'"' => escapes.push((loc, b""")), _ => unreachable!("Only '<', '>','\', '&' and '\"' are escaped"), } loc += 1; } if escapes.is_empty() { Cow::Borrowed(raw) } else { let len = raw.len(); let mut v = Vec::with_capacity(len); let mut start = 0; for (i, r) in escapes { v.extend_from_slice(&raw[start..i]); v.extend_from_slice(r); start = i + 1; } if start < len { v.extend_from_slice(&raw[start..]); } Cow::Owned(v) } } #[derive(Clone, Eq, Debug)] /// A struct representing a DOM Element. pub struct Element { name: String, namespace: String, /// This is only used when deserializing. If you have to use a custom prefix use /// `ElementBuilder::prefix`. prefix: Option, prefixes: Prefixes, attributes: BTreeMap, children: Vec, } impl<'a> From<&'a Element> for String { fn from(elem: &'a Element) -> String { let mut writer = Vec::new(); elem.write_to(&mut writer).unwrap(); String::from_utf8(writer).unwrap() } } impl FromStr for Element { type Err = Error; fn from_str(s: &str) -> Result { let mut reader = EventReader::from_str(s); Element::from_reader(&mut reader) } } impl PartialEq for Element { fn eq(&self, other: &Self) -> bool { if self.name() == other.name() && self.ns() == other.ns() && self.attrs().eq(other.attrs()) { self.nodes() .zip(other.nodes()) .all(|(node1, node2)| node1 == node2) } else { false } } } fn ensure_no_prefix>(s: &S) -> Result<()> { let name_parts = s.as_ref().split(':').collect::>(); match name_parts.len() { 1 => Ok(()), _ => Err(Error::InvalidElement), } } impl Element { fn new>( name: String, namespace: String, prefix: Option, prefixes: P, attributes: BTreeMap, children: Vec, ) -> Element { ensure_no_prefix(&name).unwrap(); // TODO: Return Result instead. Element { name, namespace, prefix, prefixes: prefixes.into(), attributes, children, } } /// Return a builder for an `Element` with the given `name`. /// /// # Examples /// /// ```rust /// use minidom::Element; /// /// let elem = Element::builder("name", "namespace") /// .attr("name", "value") /// .append("inner") /// .build(); /// /// assert_eq!(elem.name(), "name"); /// assert_eq!(elem.ns(), "namespace".to_owned()); /// assert_eq!(elem.attr("name"), Some("value")); /// assert_eq!(elem.attr("inexistent"), None); /// assert_eq!(elem.text(), "inner"); /// ``` pub fn builder, NS: Into>(name: S, namespace: NS) -> ElementBuilder { ElementBuilder { root: Element::new( name.as_ref().to_string(), namespace.into(), None, None, BTreeMap::new(), Vec::new(), ), } } /// Returns a bare minimum `Element` with this name. /// /// # Examples /// /// ```rust /// use minidom::Element; /// /// let bare = Element::bare("name", "namespace"); /// /// assert_eq!(bare.name(), "name"); /// assert_eq!(bare.ns(), "namespace"); /// assert_eq!(bare.attr("name"), None); /// assert_eq!(bare.text(), ""); /// ``` pub fn bare, NS: Into>(name: S, namespace: NS) -> Element { Element::new( name.into(), namespace.into(), None, None, BTreeMap::new(), Vec::new(), ) } /// Returns a reference to the local name of this element (that is, without a possible prefix). pub fn name(&self) -> &str { &self.name } /// Returns a reference to the namespace of this element. pub fn ns(&self) -> String { self.namespace.clone() } /// Returns a reference to the value of the given attribute, if it exists, else `None`. pub fn attr(&self, name: &str) -> Option<&str> { if let Some(value) = self.attributes.get(name) { return Some(value); } None } /// Returns an iterator over the attributes of this element. /// /// # Example /// /// ```rust /// use minidom::Element; /// /// let elm: Element = "".parse().unwrap(); /// /// let mut iter = elm.attrs(); /// /// assert_eq!(iter.next().unwrap(), ("a", "b")); /// assert_eq!(iter.next(), None); /// ``` pub fn attrs(&self) -> Attrs { Attrs { iter: self.attributes.iter(), } } /// Returns an iterator over the attributes of this element, with the value being a mutable /// reference. pub fn attrs_mut(&mut self) -> AttrsMut { AttrsMut { iter: self.attributes.iter_mut(), } } /// Modifies the value of an attribute. pub fn set_attr, V: IntoAttributeValue>(&mut self, name: S, val: V) { let name = name.into(); let val = val.into_attribute_value(); if let Some(value) = self.attributes.get_mut(&name) { *value = val .expect("removing existing value via set_attr, this is not yet supported (TODO)"); // TODO return; } if let Some(val) = val { self.attributes.insert(name, val); } } /// Returns whether the element has the given name and namespace. /// /// # Examples /// /// ```rust /// use minidom::{Element, NSChoice}; /// /// let elem = Element::builder("name", "namespace").build(); /// /// assert_eq!(elem.is("name", "namespace"), true); /// assert_eq!(elem.is("name", "wrong"), false); /// assert_eq!(elem.is("wrong", "namespace"), false); /// assert_eq!(elem.is("wrong", "wrong"), false); /// /// assert_eq!(elem.is("name", NSChoice::OneOf("namespace")), true); /// assert_eq!(elem.is("name", NSChoice::OneOf("foo")), false); /// assert_eq!(elem.is("name", NSChoice::AnyOf(&["foo", "namespace"])), true); /// assert_eq!(elem.is("name", NSChoice::Any), true); /// ``` pub fn is<'a, N: AsRef, NS: Into>>(&self, name: N, namespace: NS) -> bool { self.name == name.as_ref() && namespace.into().compare(self.namespace.as_ref()) } /// Returns whether the element has the given namespace. /// /// # Examples /// /// ```rust /// use minidom::{Element, NSChoice}; /// /// let elem = Element::builder("name", "namespace").build(); /// /// assert_eq!(elem.has_ns("namespace"), true); /// assert_eq!(elem.has_ns("wrong"), false); /// /// assert_eq!(elem.has_ns(NSChoice::OneOf("namespace")), true); /// assert_eq!(elem.has_ns(NSChoice::OneOf("foo")), false); /// assert_eq!(elem.has_ns(NSChoice::AnyOf(&["foo", "namespace"])), true); /// assert_eq!(elem.has_ns(NSChoice::Any), true); /// ``` pub fn has_ns<'a, NS: Into>>(&self, namespace: NS) -> bool { namespace.into().compare(self.namespace.as_ref()) } /// Parse a document from an `EventReader`. pub fn from_reader(reader: &mut EventReader) -> Result { let mut buf = Vec::new(); let mut prefixes = BTreeMap::new(); let root: Element = loop { let e = reader.read_event(&mut buf)?; match e { Event::Empty(ref e) | Event::Start(ref e) => { break build_element(reader, e, &mut prefixes)?; } Event::Eof => { return Err(Error::EndOfDocument); } Event::Comment { .. } => { return Err(Error::NoComments); } Event::Text { .. } | Event::End { .. } | Event::CData { .. } | Event::Decl { .. } | Event::PI { .. } | Event::DocType { .. } => (), // TODO: may need more errors } }; let mut stack = vec![root]; let mut prefix_stack = vec![prefixes]; loop { match reader.read_event(&mut buf)? { Event::Empty(ref e) => { let mut prefixes = prefix_stack.last().unwrap().clone(); let elem = build_element(reader, e, &mut prefixes)?; // Since there is no Event::End after, directly append it to the current node stack.last_mut().unwrap().append_child(elem); } Event::Start(ref e) => { let mut prefixes = prefix_stack.last().unwrap().clone(); let elem = build_element(reader, e, &mut prefixes)?; stack.push(elem); prefix_stack.push(prefixes); } Event::End(ref e) => { if stack.len() <= 1 { break; } let prefixes = prefix_stack.pop().unwrap(); let elem = stack.pop().unwrap(); if let Some(to) = stack.last_mut() { // TODO: check whether this is correct, we are comparing &[u8]s, not &strs let elem_name = e.name(); let mut split_iter = elem_name.splitn(2, |u| *u == 0x3A); let possible_prefix = split_iter.next().unwrap(); // Can't be empty. let opening_prefix = { let mut tmp: Option> = None; for (prefix, ns) in prefixes { if ns == elem.namespace { tmp = Some(prefix.clone()); break; } } match tmp { Some(prefix) => prefix, None => return Err(Error::InvalidPrefix), } }; match split_iter.next() { // There is a prefix on the closing tag Some(name) => { // Does the closing prefix match the opening prefix? match opening_prefix { Some(prefix) if possible_prefix == prefix.as_bytes() => (), _ => return Err(Error::InvalidElementClosed), } // Does the closing tag name match the opening tag name? if name != elem.name().as_bytes() { return Err(Error::InvalidElementClosed); } } // There was no prefix on the closing tag None => { // Is there a prefix on the opening tag? match opening_prefix { Some(_) => return Err(Error::InvalidElementClosed), _ => (), } // Does the opening tag name match the closing one? if possible_prefix != elem.name().as_bytes() { return Err(Error::InvalidElementClosed); } } } to.append_child(elem); } } Event::Text(s) => { let text = s.unescape_and_decode(reader)?; if text != "" { let current_elem = stack.last_mut().unwrap(); current_elem.append_text_node(text); } } Event::CData(s) => { let text = reader.decode(&s)?.to_owned(); if text != "" { let current_elem = stack.last_mut().unwrap(); current_elem.append_text_node(text); } } Event::Eof => { break; } Event::Comment(_) => return Err(Error::NoComments), Event::Decl { .. } | Event::PI { .. } | Event::DocType { .. } => (), } } Ok(stack.pop().unwrap()) } /// Output a document to a `Writer`. pub fn write_to(&self, writer: &mut W) -> Result<()> { self.to_writer(&mut EventWriter::new(writer)) } /// Output a document to a `Writer`. pub fn write_to_decl(&self, writer: &mut W) -> Result<()> { self.to_writer_decl(&mut EventWriter::new(writer)) } /// Output the document to quick-xml `Writer` pub fn to_writer(&self, writer: &mut EventWriter) -> Result<()> { self.write_to_inner(writer, &mut BTreeMap::new()) } /// Output the document to quick-xml `Writer` pub fn to_writer_decl(&self, writer: &mut EventWriter) -> Result<()> { writer.write_event(Event::Decl(BytesDecl::new(b"1.0", Some(b"utf-8"), None)))?; self.write_to_inner(writer, &mut BTreeMap::new()) } /// Like `write_to()` but without the `` prelude pub fn write_to_inner( &self, writer: &mut EventWriter, all_prefixes: &mut BTreeMap, ) -> Result<()> { let local_prefixes: &BTreeMap, String> = self.prefixes.declared_prefixes(); // Element namespace // If the element prefix hasn't been set yet via a custom prefix, add it. let mut existing_self_prefix: Option> = None; for (prefix, ns) in local_prefixes.iter().chain(all_prefixes.iter()) { if ns == &self.namespace { existing_self_prefix = Some(prefix.clone()); } } let mut all_keys = all_prefixes.keys().cloned(); let mut local_keys = local_prefixes.keys().cloned(); let self_prefix: (Option, bool) = match existing_self_prefix { // No prefix exists already for our namespace None => { if local_keys.find(|p| p == &None).is_none() { // Use the None prefix if available (None, true) } else { // Otherwise generate one. Check if it isn't already used, if so increase the // number until we find a suitable one. let mut prefix_n = 0u8; while let Some(_) = all_keys.find(|p| p == &Some(format!("ns{}", prefix_n))) { prefix_n += 1; } (Some(format!("ns{}", prefix_n)), true) } } // Some prefix has already been declared (or is going to be) for our namespace. We // don't need to declare a new one. We do however need to remember which one to use in // the tag name. Some(prefix) => (prefix, false), }; let name = match self_prefix { (Some(ref prefix), _) => Cow::Owned(format!("{}:{}", prefix, self.name)), _ => Cow::Borrowed(&self.name), }; let mut start = BytesStart::borrowed(name.as_bytes(), name.len()); // Write self prefix if necessary match self_prefix { (Some(ref p), true) => { let key = format!("xmlns:{}", p); start.push_attribute((key.as_bytes(), self.namespace.as_bytes())); all_prefixes.insert(self_prefix.0, self.namespace.clone()); } (None, true) => { let key = format!("xmlns"); start.push_attribute((key.as_bytes(), self.namespace.as_bytes())); all_prefixes.insert(self_prefix.0, self.namespace.clone()); } _ => (), }; // Custom prefixes/namespace sets for (prefix, ns) in local_prefixes { match all_prefixes.get(prefix) { p @ Some(_) if p == prefix.as_ref() => (), _ => { let key = match prefix { None => String::from("xmlns"), Some(p) => format!("xmlns:{}", p), }; start.push_attribute((key.as_bytes(), ns.as_ref())); all_prefixes.insert(prefix.clone(), ns.clone()); } } } for (key, value) in &self.attributes { start.push_attribute((key.as_bytes(), escape(value.as_bytes()).as_ref())); } if self.children.is_empty() { writer.write_event(Event::Empty(start))?; return Ok(()); } writer.write_event(Event::Start(start))?; for child in &self.children { child.write_to_inner(writer, &mut all_prefixes.clone())?; } writer.write_event(Event::End(BytesEnd::borrowed(name.as_bytes())))?; Ok(()) } /// Returns an iterator over references to every child node of this element. /// /// # Examples /// /// ```rust /// use minidom::Element; /// /// let elem: Element = "abc".parse().unwrap(); /// /// let mut iter = elem.nodes(); /// /// assert_eq!(iter.next().unwrap().as_text().unwrap(), "a"); /// assert_eq!(iter.next().unwrap().as_element().unwrap().name(), "c1"); /// assert_eq!(iter.next().unwrap().as_text().unwrap(), "b"); /// assert_eq!(iter.next().unwrap().as_element().unwrap().name(), "c2"); /// assert_eq!(iter.next().unwrap().as_text().unwrap(), "c"); /// assert_eq!(iter.next(), None); /// ``` #[inline] pub fn nodes(&self) -> Nodes { self.children.iter() } /// Returns an iterator over mutable references to every child node of this element. #[inline] pub fn nodes_mut(&mut self) -> NodesMut { self.children.iter_mut() } /// Returns an iterator over references to every child element of this element. /// /// # Examples /// /// ```rust /// use minidom::Element; /// /// let elem: Element = "hellothisisignored".parse().unwrap(); /// /// let mut iter = elem.children(); /// assert_eq!(iter.next().unwrap().name(), "child1"); /// assert_eq!(iter.next().unwrap().name(), "child2"); /// assert_eq!(iter.next().unwrap().name(), "child3"); /// assert_eq!(iter.next(), None); /// ``` #[inline] pub fn children(&self) -> Children { Children { iter: self.children.iter(), } } /// Returns an iterator over mutable references to every child element of this element. #[inline] pub fn children_mut(&mut self) -> ChildrenMut { ChildrenMut { iter: self.children.iter_mut(), } } /// Returns an iterator over references to every text node of this element. /// /// # Examples /// /// ```rust /// use minidom::Element; /// /// let elem: Element = "hello world!".parse().unwrap(); /// /// let mut iter = elem.texts(); /// assert_eq!(iter.next().unwrap(), "hello"); /// assert_eq!(iter.next().unwrap(), " world!"); /// assert_eq!(iter.next(), None); /// ``` #[inline] pub fn texts(&self) -> Texts { Texts { iter: self.children.iter(), } } /// Returns an iterator over mutable references to every text node of this element. #[inline] pub fn texts_mut(&mut self) -> TextsMut { TextsMut { iter: self.children.iter_mut(), } } /// Appends a child node to the `Element`, returning the appended node. /// /// # Examples /// /// ```rust /// use minidom::Element; /// /// let mut elem = Element::bare("root", "ns1"); /// /// assert_eq!(elem.children().count(), 0); /// /// elem.append_child(Element::bare("child", "ns1")); /// /// { /// let mut iter = elem.children(); /// assert_eq!(iter.next().unwrap().name(), "child"); /// assert_eq!(iter.next(), None); /// } /// /// let child = elem.append_child(Element::bare("new", "ns1")); /// /// assert_eq!(child.name(), "new"); /// ``` pub fn append_child(&mut self, child: Element) -> &mut Element { self.children.push(Node::Element(child)); if let Node::Element(ref mut cld) = *self.children.last_mut().unwrap() { cld } else { unreachable!() } } /// Appends a text node to an `Element`. /// /// # Examples /// /// ```rust /// use minidom::Element; /// /// let mut elem = Element::bare("node", "ns1"); /// /// assert_eq!(elem.text(), ""); /// /// elem.append_text_node("text"); /// /// assert_eq!(elem.text(), "text"); /// ``` pub fn append_text_node>(&mut self, child: S) { self.children.push(Node::Text(child.into())); } /// Appends a node to an `Element`. /// /// # Examples /// /// ```rust /// use minidom::{Element, Node}; /// /// let mut elem = Element::bare("node", "ns1"); /// /// elem.append_node(Node::Text("hello".to_owned())); /// /// assert_eq!(elem.text(), "hello"); /// ``` pub fn append_node(&mut self, node: Node) { self.children.push(node); } /// Returns the concatenation of all text nodes in the `Element`. /// /// # Examples /// /// ```rust /// use minidom::Element; /// /// let elem: Element = "hello, world!".parse().unwrap(); /// /// assert_eq!(elem.text(), "hello, world!"); /// ``` pub fn text(&self) -> String { self.texts().fold(String::new(), |ret, new| ret + new) } /// Returns a reference to the first child element with the specific name and namespace, if it /// exists in the direct descendants of this `Element`, else returns `None`. /// /// # Examples /// /// ```rust /// use minidom::{Element, NSChoice}; /// /// let elem: Element = r#""#.parse().unwrap(); /// assert!(elem.get_child("a", "ns").unwrap().is("a", "ns")); /// assert!(elem.get_child("a", "other_ns").unwrap().is("a", "other_ns")); /// assert!(elem.get_child("b", "ns").unwrap().is("b", "ns")); /// assert_eq!(elem.get_child("c", "ns"), None); /// assert_eq!(elem.get_child("b", "other_ns"), None); /// assert_eq!(elem.get_child("a", "inexistent_ns"), None); /// ``` pub fn get_child<'a, N: AsRef, NS: Into>>( &self, name: N, namespace: NS, ) -> Option<&Element> { let namespace = namespace.into(); for fork in &self.children { if let Node::Element(ref e) = *fork { if e.is(name.as_ref(), namespace) { return Some(e); } } } None } /// Returns a mutable reference to the first child element with the specific name and namespace, /// if it exists in the direct descendants of this `Element`, else returns `None`. pub fn get_child_mut<'a, N: AsRef, NS: Into>>( &mut self, name: N, namespace: NS, ) -> Option<&mut Element> { let namespace = namespace.into(); for fork in &mut self.children { if let Node::Element(ref mut e) = *fork { if e.is(name.as_ref(), namespace) { return Some(e); } } } None } /// Returns whether a specific child with this name and namespace exists in the direct /// descendants of the `Element`. /// /// # Examples /// /// ```rust /// use minidom::{Element, NSChoice}; /// /// let elem: Element = r#""#.parse().unwrap(); /// assert_eq!(elem.has_child("a", "other_ns"), true); /// assert_eq!(elem.has_child("a", "ns"), true); /// assert_eq!(elem.has_child("a", "inexistent_ns"), false); /// assert_eq!(elem.has_child("b", "ns"), true); /// assert_eq!(elem.has_child("b", "other_ns"), false); /// assert_eq!(elem.has_child("b", "inexistent_ns"), false); /// ``` pub fn has_child<'a, N: AsRef, NS: Into>>( &self, name: N, namespace: NS, ) -> bool { self.get_child(name, namespace).is_some() } /// Removes the first child with this name and namespace, if it exists, and returns an /// `Option` containing this child if it succeeds. /// Returns `None` if no child matches this name and namespace. /// /// # Examples /// /// ```rust /// use minidom::{Element, NSChoice}; /// /// let mut elem: Element = r#""#.parse().unwrap(); /// assert!(elem.remove_child("a", "ns").unwrap().is("a", "ns")); /// assert!(elem.remove_child("a", "ns").is_none()); /// assert!(elem.remove_child("inexistent", "inexistent").is_none()); /// ``` pub fn remove_child<'a, N: AsRef, NS: Into>>( &mut self, name: N, namespace: NS, ) -> Option { let name = name.as_ref(); let namespace = namespace.into(); let idx = self.children.iter().position(|x| { if let Node::Element(ref elm) = x { elm.is(name, namespace) } else { false } })?; self.children.remove(idx).into_element() } } fn split_element_name>(s: S) -> Result<(Option, String)> { let name_parts = s.as_ref().split(':').collect::>(); match name_parts.len() { 2 => Ok((Some(name_parts[0].to_owned()), name_parts[1].to_owned())), 1 => Ok((None, name_parts[0].to_owned())), _ => Err(Error::InvalidElement), } } fn build_element( reader: &EventReader, event: &BytesStart, prefixes: &mut BTreeMap, ) -> Result { let (prefix, name) = split_element_name(str::from_utf8(event.name())?)?; let mut local_prefixes = BTreeMap::new(); let attributes = event .attributes() .map(|o| { let o = o?; let key = str::from_utf8(o.key)?.to_owned(); let value = o.unescape_and_decode_value(reader)?; Ok((key, value)) }) .filter(|o| match *o { Ok((ref key, ref value)) if key == "xmlns" => { local_prefixes.insert(None, value.clone()); prefixes.insert(None, value.clone()); false } Ok((ref key, ref value)) if key.starts_with("xmlns:") => { local_prefixes.insert(Some(key[6..].to_owned()), value.to_owned()); prefixes.insert(Some(key[6..].to_owned()), value.to_owned()); false } _ => true, }) .collect::>>()?; let namespace: &String = { if let Some(namespace) = local_prefixes.get(&prefix) { namespace } else if let Some(namespace) = prefixes.get(&prefix) { namespace } else { return Err(Error::MissingNamespace); } }; Ok(Element::new( name, namespace.clone(), // Note that this will always be Some(_) as we can't distinguish between the None case and // Some(None). At least we make sure the prefix has a namespace associated. Some(prefix), local_prefixes, attributes, Vec::new(), )) } /// An iterator over references to child elements of an `Element`. pub struct Children<'a> { iter: slice::Iter<'a, Node>, } impl<'a> Iterator for Children<'a> { type Item = &'a Element; fn next(&mut self) -> Option<&'a Element> { for item in &mut self.iter { if let Node::Element(ref child) = *item { return Some(child); } } None } } /// An iterator over mutable references to child elements of an `Element`. pub struct ChildrenMut<'a> { iter: slice::IterMut<'a, Node>, } impl<'a> Iterator for ChildrenMut<'a> { type Item = &'a mut Element; fn next(&mut self) -> Option<&'a mut Element> { for item in &mut self.iter { if let Node::Element(ref mut child) = *item { return Some(child); } } None } } /// An iterator over references to child text nodes of an `Element`. pub struct Texts<'a> { iter: slice::Iter<'a, Node>, } impl<'a> Iterator for Texts<'a> { type Item = &'a str; fn next(&mut self) -> Option<&'a str> { for item in &mut self.iter { if let Node::Text(ref child) = *item { return Some(child); } } None } } /// An iterator over mutable references to child text nodes of an `Element`. pub struct TextsMut<'a> { iter: slice::IterMut<'a, Node>, } impl<'a> Iterator for TextsMut<'a> { type Item = &'a mut String; fn next(&mut self) -> Option<&'a mut String> { for item in &mut self.iter { if let Node::Text(ref mut child) = *item { return Some(child); } } None } } /// An iterator over references to all child nodes of an `Element`. pub type Nodes<'a> = slice::Iter<'a, Node>; /// An iterator over mutable references to all child nodes of an `Element`. pub type NodesMut<'a> = slice::IterMut<'a, Node>; /// An iterator over the attributes of an `Element`. pub struct Attrs<'a> { iter: btree_map::Iter<'a, String, String>, } impl<'a> Iterator for Attrs<'a> { type Item = (&'a str, &'a str); fn next(&mut self) -> Option { self.iter.next().map(|(x, y)| (x.as_ref(), y.as_ref())) } } /// An iterator over the attributes of an `Element`, with the values mutable. pub struct AttrsMut<'a> { iter: btree_map::IterMut<'a, String, String>, } impl<'a> Iterator for AttrsMut<'a> { type Item = (&'a str, &'a mut String); fn next(&mut self) -> Option { self.iter.next().map(|(x, y)| (x.as_ref(), y)) } } /// A builder for `Element`s. pub struct ElementBuilder { root: Element, } impl ElementBuilder { /// Sets a custom prefix. It is not possible to set the same prefix twice. pub fn prefix>( mut self, prefix: Prefix, namespace: S, ) -> Result { if let Some(_) = self.root.prefixes.get(&prefix) { return Err(Error::DuplicatePrefix); } self.root.prefixes.insert(prefix, namespace.into()); Ok(self) } /// Sets an attribute. pub fn attr, V: IntoAttributeValue>( mut self, name: S, value: V, ) -> ElementBuilder { self.root.set_attr(name, value); self } /// Appends anything implementing `Into` into the tree. pub fn append>(mut self, node: T) -> ElementBuilder { self.root.append_node(node.into()); self } /// Appends an iterator of things implementing `Into` into the tree. pub fn append_all, I: IntoIterator>( mut self, iter: I, ) -> ElementBuilder { for node in iter { self.root.append_node(node.into()); } self } /// Builds the `Element`. pub fn build(self) -> Element { self.root } } #[cfg(test)] mod tests { use super::*; #[test] fn test_element_new() { use std::iter::FromIterator; let elem = Element::new( "name".to_owned(), "namespace".to_owned(), None, (None, "namespace".to_owned()), BTreeMap::from_iter(vec![("name".to_string(), "value".to_string())].into_iter()), Vec::new(), ); assert_eq!(elem.name(), "name"); assert_eq!(elem.ns(), "namespace".to_owned()); assert_eq!(elem.attr("name"), Some("value")); assert_eq!(elem.attr("inexistent"), None); } #[test] fn test_from_reader_simple() { let xml = ""; let mut reader = EventReader::from_str(xml); let elem = Element::from_reader(&mut reader); let elem2 = Element::builder("foo", "ns1").build(); assert_eq!(elem.unwrap(), elem2); } #[test] fn test_from_reader_nested() { let xml = ""; let mut reader = EventReader::from_str(xml); let elem = Element::from_reader(&mut reader); let nested = Element::builder("bar", "ns1").attr("baz", "qxx").build(); let elem2 = Element::builder("foo", "ns1").append(nested).build(); assert_eq!(elem.unwrap(), elem2); } #[test] fn test_from_reader_with_prefix() { let xml = ""; let mut reader = EventReader::from_str(xml); let elem = Element::from_reader(&mut reader); let nested = Element::builder("bar", "ns1").attr("baz", "qxx").build(); let elem2 = Element::builder("foo", "ns1").append(nested).build(); assert_eq!(elem.unwrap(), elem2); } #[test] fn test_from_reader_split_prefix() { let xml = ""; let mut reader = EventReader::from_str(xml); let elem = Element::from_reader(&mut reader).unwrap(); assert_eq!(elem.name(), String::from("bar")); assert_eq!(elem.ns(), String::from("ns1")); // Ensure the prefix is properly added to the store assert_eq!( elem.prefixes.get(&Some(String::from("foo"))), Some(&String::from("ns1")) ); } #[test] fn parses_spectest_xml() { // From: https://gitlab.com/lumi/minidom-rs/issues/8 let xml = r#" "#; let mut reader = EventReader::from_str(xml); let _ = Element::from_reader(&mut reader).unwrap(); } #[test] fn does_not_unescape_cdata() { let xml = "]]>"; let mut reader = EventReader::from_str(xml); let elem = Element::from_reader(&mut reader).unwrap(); assert_eq!(elem.text(), "'>blah"); } #[test] fn test_compare_all_ns() { let xml = ""; let mut reader = EventReader::from_str(xml); let elem = Element::from_reader(&mut reader).unwrap(); let elem2 = elem.clone(); let xml3 = ""; let mut reader3 = EventReader::from_str(xml3); let elem3 = Element::from_reader(&mut reader3).unwrap(); let xml4 = ""; let mut reader4 = EventReader::from_str(xml4); let elem4 = Element::from_reader(&mut reader4).unwrap(); assert_eq!(elem, elem2); assert_eq!(elem, elem3); assert_eq!(elem, elem4); } }