Line data Source code
1 : /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
2 : /*
3 : * This file is part of the LibreOffice project.
4 : *
5 : * This Source Code Form is subject to the terms of the Mozilla Public
6 : * License, v. 2.0. If a copy of the MPL was not distributed with this
7 : * file, You can obtain one at http://mozilla.org/MPL/2.0/.
8 : *
9 : * This file incorporates work covered by the following license notice:
10 : *
11 : * Licensed to the Apache Software Foundation (ASF) under one or more
12 : * contributor license agreements. See the NOTICE file distributed
13 : * with this work for additional information regarding copyright
14 : * ownership. The ASF licenses this file to you under the Apache
15 : * License, Version 2.0 (the "License"); you may not use this file
16 : * except in compliance with the License. You may obtain a copy of
17 : * the License at http://www.apache.org/licenses/LICENSE-2.0 .
18 : */
19 :
20 : #ifndef INCLUDED_SDEXT_SOURCE_PDFIMPORT_TREE_TREEVISITING_HXX
21 : #define INCLUDED_SDEXT_SOURCE_PDFIMPORT_TREE_TREEVISITING_HXX
22 :
23 : #include <sal/config.h>
24 : #include <list>
25 :
26 :
27 : namespace pdfi
28 : {
29 : struct HyperlinkElement;
30 : struct TextElement;
31 : struct ParagraphElement;
32 : struct FrameElement;
33 : struct PolyPolyElement;
34 : struct ImageElement;
35 : struct PageElement;
36 : struct DocumentElement;
37 : struct Element;
38 :
39 : /** To be visited by all tree element types
40 :
41 : Visitor interface from the "visitor pattern". Implementor gets
42 : called with actual tree node instances.
43 : */
44 0 : struct ElementTreeVisitor
45 : {
46 : virtual void visit( HyperlinkElement&, const std::list< Element* >::const_iterator& ) = 0;
47 : virtual void visit( TextElement&, const std::list< Element* >::const_iterator& ) = 0;
48 : virtual void visit( ParagraphElement&, const std::list< Element* >::const_iterator& ) = 0;
49 : virtual void visit( FrameElement&, const std::list< Element* >::const_iterator& ) = 0;
50 : virtual void visit( PolyPolyElement&, const std::list< Element* >::const_iterator& ) = 0;
51 : virtual void visit( ImageElement&, const std::list< Element* >::const_iterator& ) = 0;
52 : virtual void visit( PageElement&, const std::list< Element* >::const_iterator& ) = 0;
53 : virtual void visit( DocumentElement&, const std::list< Element* >::const_iterator& ) = 0;
54 0 : virtual ~ElementTreeVisitor() {}
55 : };
56 : typedef boost::shared_ptr<ElementTreeVisitor> ElementTreeVisitorSharedPtr;
57 :
58 : /** Visitee interface
59 :
60 : To be implemented by every tree node that needs to be
61 : visitable.
62 : */
63 0 : struct ElementTreeVisitable
64 : {
65 : virtual void visitedBy( ElementTreeVisitor&, const std::list< Element* >::const_iterator& rParentIt ) = 0;
66 :
67 : protected:
68 0 : ~ElementTreeVisitable() {}
69 : };
70 : typedef boost::shared_ptr<ElementTreeVisitable> ElementTreeVisitableSharedPtr;
71 : }
72 :
73 : #endif
74 :
75 : /* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|