Daniel@0
|
1 /* Part of DML (Digital Music Laboratory)
|
Daniel@0
|
2 Copyright 2014-2015 Samer Abdallah, University of London
|
Daniel@0
|
3
|
Daniel@0
|
4 This program is free software; you can redistribute it and/or
|
Daniel@0
|
5 modify it under the terms of the GNU General Public License
|
Daniel@0
|
6 as published by the Free Software Foundation; either version 2
|
Daniel@0
|
7 of the License, or (at your option) any later version.
|
Daniel@0
|
8
|
Daniel@0
|
9 This program is distributed in the hope that it will be useful,
|
Daniel@0
|
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
|
Daniel@0
|
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
Daniel@0
|
12 GNU General Public License for more details.
|
Daniel@0
|
13
|
Daniel@0
|
14 You should have received a copy of the GNU General Public
|
Daniel@0
|
15 License along with this library; if not, write to the Free Software
|
Daniel@0
|
16 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
Daniel@0
|
17 */
|
Daniel@0
|
18
|
Daniel@0
|
19 :- module(xmltraverse, [traverse/3, op(720,xfx,@), op(750,xfy,~), op(750,xfy,..) ]).
|
Daniel@0
|
20 % for traverse/3 paths
|
Daniel@0
|
21 :- op(720,xfx,@).
|
Daniel@0
|
22 :- op(750,xfy,~).
|
Daniel@0
|
23 :- op(750,xfy,..).
|
Daniel@0
|
24
|
Daniel@0
|
25 %% traverse(+Dir:oneof([f,b]), +Doc:xml_element, -P:xml_path) is nondet.
|
Daniel@0
|
26 %
|
Daniel@0
|
27 % Succeeds once for each path through an XML element starting at the top
|
Daniel@0
|
28 % and travelling all or part of the way down through the tree structure.
|
Daniel@0
|
29 traverse(f,El,Path) :- traverse_f(El,Path).
|
Daniel@0
|
30 traverse(b,El,Path) :- traverse_b([],El,Path).
|
Daniel@0
|
31
|
Daniel@0
|
32 traverse_f(Other,{Other}) :- atomic(Other), !.
|
Daniel@0
|
33 traverse_f(Element,\Element).
|
Daniel@0
|
34 traverse_f(element(Name,_,_), n(Name)).
|
Daniel@0
|
35 traverse_f(element(Name,Attribs,_),Name @ A) :- member(A,Attribs).
|
Daniel@0
|
36 traverse_f(element(Name,_,Content),Name .. Path1) :-
|
Daniel@0
|
37 ( Path1 = \Content
|
Daniel@0
|
38 ; Path1 = (I~Path2),
|
Daniel@0
|
39 nth1(I,Content,SubE),
|
Daniel@0
|
40 traverse_f(SubE,Path2)
|
Daniel@0
|
41 ).
|
Daniel@0
|
42
|
Daniel@0
|
43
|
Daniel@0
|
44 traverse_b(L,Other,{Other}..L) :- atomic(Other), !.
|
Daniel@0
|
45 traverse_b(L,element(Name,Attribs,Content),Path) :- !,
|
Daniel@0
|
46 ( Path = (A @ Name .. L), member(A,Attribs)
|
Daniel@0
|
47 ; nth1(N,Content,SubE),
|
Daniel@0
|
48 traverse_b(N ~ Name..L,SubE,Path)
|
Daniel@0
|
49 ).
|
Daniel@0
|
50
|