+++ /dev/null
-/* This file is part of GtkMathView-Bonobo, a Bonobo wrapper for GtkMathView.
- * Copyright (C) 2003 Luca Padovani <lpadovan@cs.unibo.it>
- * Pouria Masoudi <pmasoudi@cs.unibo.it>
- *
- * This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * This library is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this library; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
- *
- * For more information, please visit the project's home page
- * http://helm.cs.unibo.it/gtkmathview-bonobo
- * or send an email to <lpadovan@cs.unibo.it>
- */
-
-#include <config.h>
-
-#include <cassert>
-
-#include <sstream>
-
-#include <gdome.h>
-#include <gdome-util.h>
-
-#include <GdomeSmartDOM.hh>
-
-#include "aux.h"
-
-#define MATHML_NS_URI "http://www.w3.org/1998/Math/MathML"
-
-namespace DOM = GdomeSmartDOM;
-
-static DOM::Element
-findElementById(const DOM::Element& el,
- const DOM::GdomeString& ns, const DOM::GdomeString& name,
- const DOM::GdomeString& id)
-{
- assert(el);
- if (el.getAttributeNS(ns, name) == id)
- return el;
- else
- for (DOM::Node p = el.get_firstChild(); p; p = p.get_nextSibling())
- if (p.get_nodeType() == DOM::Node::ELEMENT_NODE)
- if (DOM::Element res = findElementById(p, ns, name, id))
- return res;
- return DOM::Element();
-}
-
-static unsigned
-getDepth(const DOM::Element& elem)
-{
- unsigned length = 0;
- DOM::Element p = elem;
-
- while (p)
- {
- p = p.get_parentNode();
- length++;
- }
-
- return length;
-}
-
-static DOM::Element
-findCommonAncestor(const DOM::Element& first, const DOM::Element& last)
-{
- if (!first || !last) return DOM::Element(0);
-
- DOM::Element p(first);
- DOM::Element q(last);
-
- if (p != q)
- {
- unsigned pDepth = getDepth(p);
- unsigned qDepth = getDepth(q);
-
- while (p && pDepth > qDepth)
- {
- p = p.get_parentNode();
- pDepth--;
- }
-
- while (q && qDepth > pDepth)
- {
- q = q.get_parentNode();
- qDepth--;
- }
-
- assert(pDepth == qDepth);
-
- while (p && q && p != q)
- {
- p = p.get_parentNode();
- q = q.get_parentNode();
- }
- }
-
- return p;
-}
-
-static void
-findCommonSiblings(const DOM::Element& first, const DOM::Element& last,
- DOM::Element& firstS, DOM::Element& lastS)
-{
- DOM::Element p(first);
- DOM::Element q(last);
-
- if (p != q)
- {
- unsigned pDepth = getDepth(p);
- unsigned qDepth = getDepth(q);
-
- while (p && pDepth > qDepth)
- {
- p = p.get_parentNode();
- pDepth--;
- }
-
- while (q && qDepth > pDepth)
- {
- q = q.get_parentNode();
- qDepth--;
- }
-
- assert(pDepth == qDepth);
-
- while (p && q && p.get_parentNode() != q.get_parentNode())
- {
- p = p.get_parentNode();
- q = q.get_parentNode();
- }
- }
-
- firstS = p;
- lastS = q;
-}
-
-static DOM::Node
-leftmostChild(const DOM::Node& node)
-{
- if (!node) return node;
-
- DOM::Node firstChild = node.get_firstChild();
- if (!firstChild) return node;
-
- return leftmostChild(firstChild);
-}
-
-static DOM::Node
-rightmostChild(const DOM::Node& node)
-{
- if (!node) return node;
-
- DOM::Node lastChild = node.get_lastChild();
- if (!lastChild) return node;
-
- return rightmostChild(lastChild);
-}
-
-static DOM::Node
-leftSibling(const DOM::Node& node)
-{
- DOM::Node p = node;
-
- if (!p) return p;
-
- while (p.get_parentNode() && p.get_parentNode().get_firstChild() == p)
- p = p.get_parentNode();
-
- if (!p.get_parentNode()) return DOM::Node(0);
-
- DOM::Node prevSibling = p.get_previousSibling();
- assert(prevSibling);
-
- return rightmostChild(prevSibling);
-}
-
-static DOM::Node
-rightSibling(const DOM::Node& node)
-{
- DOM::Node p = node;
-
- if (!p) return p;
-
- DOM::Node firstChild = p.get_firstChild();
- if (firstChild) return firstChild;
-
- while (p.get_parentNode() && p.get_parentNode().get_lastChild() == p)
- p = p.get_parentNode();
-
- if (!p.get_parentNode()) return DOM::Node(0);
-
- DOM::Node nextSibling = p.get_nextSibling();
- assert(nextSibling);
-
- return leftmostChild(nextSibling);
-}
-
-extern "C" GdomeElement*
-find_common_ancestor(GdomeElement* first, GdomeElement* last)
-{
- DOM::Element p(first);
- DOM::Element q(last);
- return gdome_cast_el(findCommonAncestor(p, q).gdome_object());
-}
-
-extern "C" GdomeElement*
-find_self_or_ancestor(GdomeElement* elem, const gchar* uri, const gchar* name)
-{
- DOM::Element el(elem);
-
- while (el && (el.get_namespaceURI() != uri || el.get_localName() != name))
- el = el.get_parentNode();
-
- return gdome_cast_el(el.gdome_object());
-}
-
-extern "C" void
-action_toggle(GdomeElement* elem)
-{
- DOM::Element el(elem);
- if (el.get_namespaceURI() != MATHML_NS_URI || el.get_localName() != "maction") return;
-
- guint idx;
- if (el.hasAttribute("selection"))
- idx = atoi(std::string(el.getAttribute("selection")).c_str());
- else idx = 1;
-
- idx++;
-
- std::ostringstream os;
- os << idx;
- el.setAttribute("selection", os.str());
-}
-
-extern "C" void
-find_common_siblings(GdomeElement* first, GdomeElement* last,
- GdomeElement** firstS, GdomeElement** lastS)
-{
- DOM::Element fs(0);
- DOM::Element ls(0);
-
- findCommonSiblings(DOM::Element(first), DOM::Element(last), fs, ls);
-
- if (firstS != NULL) *firstS = gdome_cast_el(fs.gdome_object());
- if (lastS != NULL) *lastS = gdome_cast_el(ls.gdome_object());
-}
-
-static DOM::Element
-findElementWithAttribute(const DOM::Element& elem, const std::string& name)
-{
- DOM::Element el(elem);
- while (el && !el.hasAttribute(name)) el = el.get_parentNode();
- return el;
-}
-
-static DOM::Element
-findElementWithAttributeNS(const DOM::Element& elem, const std::string& ns_uri, const std::string& name)
-{
- DOM::Element el(elem);
- while (el && !el.hasAttributeNS(ns_uri, name)) el = el.get_parentNode();
- return el;
-}
-
-extern "C" GdomeElement*
-find_element_with_id(GdomeElement* elem, GdomeDOMString* ns_uri, GdomeDOMString* name)
-{
- assert(name != NULL);
- DOM::Element el;
- if (ns_uri != NULL)
- el = findElementWithAttributeNS(DOM::Element(elem), DOM::GdomeString(ns_uri), DOM::GdomeString(name));
- else
- el = findElementWithAttribute(DOM::Element(elem), DOM::GdomeString(name));
- return gdome_cast_el(el.gdome_object());
-}
-
-extern "C" GdomeDOMString*
-find_hyperlink(GdomeElement* elem)
-{
- DOM::Element el = findElementWithAttribute(DOM::Element(elem),"href");
- if (el) return el.getAttribute("href").gdome_str();
- else return NULL;
-}
-
-extern "C" GdomeElement*
-find_element_by_id(GdomeElement* root, GdomeDOMString* ns_uri, GdomeDOMString* name,
- const gchar* id)
-{
- DOM::Element el = findElementById(DOM::Element(root),
- DOM::GdomeString(ns_uri), DOM::GdomeString(name),
- DOM::GdomeString(id));
- return gdome_cast_el(el.gdome_object());
-}
-
projects / helm.git / blobdiff