blob: 518c39428f690648b27bdc3a2e7943dd7a12568c (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* 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/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#ifndef ADC_DISPLAY_OUT_TREE_HXX
#define ADC_DISPLAY_OUT_TREE_HXX
// USED SERVICES
// BASE CLASSES
// COMPONENTS
#include "out_position.hxx"
// PARAMETERS
namespace output
{
inline const char *
ModuleFileName()
{ return "module-ix.html"; }
inline const char *
IndexFilesDirName()
{ return "index-files"; }
inline const char *
IndexFile_A()
{ return "index-1.html"; }
class Tree
{
public:
// LIFECYCLE
Tree();
~Tree();
// OPERATIONS
void Set_Overview(
const StringVector &
i_path,
const String & i_sFileName );
Node & Set_NamesRoot(
const StringVector &
i_path );
Node & Set_IndexRoot(
const StringVector &
i_path );
Node & Set_ProjectsRoot(
const StringVector &
i_path );
Node & Provide_Node(
const StringVector &
i_path );
// ACCESS
Node & RootNode() { return *pRoot; }
Node & NamesRootNode() { return *pNamesRoot; }
Node & IndexRootNode() { return *pIndexRoot; }
Node & ProjectsRootNode() { return *pProjectsRoot; }
Position Root() { return Position(*pRoot); }
Position Overview() { return aOverview; }
Position NamesRoot() { return Position(*pNamesRoot); }
Position IndexRoot() { return Position(*pIndexRoot); }
Position ProjectsRoot() { return Position(*pProjectsRoot); }
private:
// forbidden:
Tree(const Tree&);
Tree & operator=(const Tree&);
// DATA
Dyn<Node> pRoot;
Node * pNamesRoot;
Node * pIndexRoot;
Node * pProjectsRoot;
Position aOverview;
};
// IMPLEMENTATION
inline Node &
Tree::Provide_Node( const StringVector & i_path )
{ return pRoot->Provide_Child(i_path); }
inline void
Tree::Set_Overview( const StringVector & i_path,
const String & i_sFileName )
{ aOverview.Set(Provide_Node(i_path), i_sFileName); }
inline Node &
Tree::Set_NamesRoot( const StringVector & i_path )
{ pNamesRoot = &Provide_Node(i_path);
return *pNamesRoot; }
inline Node &
Tree::Set_IndexRoot( const StringVector & i_path )
{ pIndexRoot = &Provide_Node(i_path);
return *pIndexRoot; }
inline Node &
Tree::Set_ProjectsRoot( const StringVector & i_path )
{ pProjectsRoot = &Provide_Node(i_path);
return *pProjectsRoot; }
} // namespace output
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
