Branch data Line data Source code
1 : : /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
2 : : /*************************************************************************
3 : : *
4 : : * The Contents of this file are made available subject to the terms of
5 : : * either of the following licenses
6 : : *
7 : : * - GNU Lesser General Public License Version 2.1
8 : : * - Sun Industry Standards Source License Version 1.1
9 : : *
10 : : * Sun Microsystems Inc., October, 2000
11 : : *
12 : : * GNU Lesser General Public License Version 2.1
13 : : * =============================================
14 : : * Copyright 2000 by Sun Microsystems, Inc.
15 : : * 901 San Antonio Road, Palo Alto, CA 94303, USA
16 : : *
17 : : * This library is free software; you can redistribute it and/or
18 : : * modify it under the terms of the GNU Lesser General Public
19 : : * License version 2.1, as published by the Free Software Foundation.
20 : : *
21 : : * This library is distributed in the hope that it will be useful,
22 : : * but WITHOUT ANY WARRANTY; without even the implied warranty of
23 : : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
24 : : * Lesser General Public License for more details.
25 : : *
26 : : * You should have received a copy of the GNU Lesser General Public
27 : : * License along with this library; if not, write to the Free Software
28 : : * Foundation, Inc., 59 Temple Place, Suite 330, Boston,
29 : : * MA 02111-1307 USA
30 : : *
31 : : *
32 : : * Sun Industry Standards Source License Version 1.1
33 : : * =================================================
34 : : * The contents of this file are subject to the Sun Industry Standards
35 : : * Source License Version 1.1 (the "License"); You may not use this file
36 : : * except in compliance with the License. You may obtain a copy of the
37 : : * License at http://www.openoffice.org/license.html.
38 : : *
39 : : * Software provided under this License is provided on an "AS IS" basis,
40 : : * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
41 : : * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,
42 : : * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.
43 : : * See the License for the specific provisions governing your rights and
44 : : * obligations concerning the Software.
45 : : *
46 : : * The Initial Developer of the Original Code is: IBM Corporation
47 : : *
48 : : * Copyright: 2008 by IBM Corporation
49 : : *
50 : : * All Rights Reserved.
51 : : *
52 : : * Contributor(s): _______________________________________
53 : : *
54 : : *
55 : : ************************************************************************/
56 : : #include "lwpbookmarkmgr.hxx"
57 : :
58 : 0 : void LwpBookmarkMgr::AddXFBookmarkStart(OUString sName,XFBookmarkStart* pMark)
59 : : {
60 : 0 : std::map<OUString,XFBookmarkStart*>::iterator iter;
61 [ # # ]: 0 : iter = m_MapStart.find(sName);
62 [ # # ]: 0 : if (iter == m_MapStart.end())//not find
63 : : {
64 [ # # ]: 0 : m_MapStart[sName] = pMark;
65 : : }
66 : : else //have exist the same bookmark name
67 : : {
68 : 0 : XFBookmarkStart* pFind = iter->second;
69 : 0 : OUString totalName = pFind->GetDivision() + A2OUSTR(":");
70 : 0 : totalName += pFind->GetName();
71 : 0 : pFind->SetName(totalName);
72 [ # # ]: 0 : m_MapStart[totalName] = pFind;
73 [ # # ]: 0 : m_MapStart[sName] = pMark;
74 : : }
75 : 0 : }
76 : 0 : void LwpBookmarkMgr::AddXFBookmarkEnd(OUString sName,XFBookmarkEnd* pMark)
77 : : {
78 : 0 : std::map<OUString,XFBookmarkEnd*>::iterator iter;
79 [ # # ]: 0 : iter = m_MapEnd.find(sName);
80 [ # # ]: 0 : if (iter == m_MapEnd.end())//not find
81 : : {
82 [ # # ]: 0 : m_MapEnd[sName] = pMark;
83 : : }
84 : : else //have exist the same bookmark name
85 : : {
86 : 0 : XFBookmarkEnd* pFind = iter->second;
87 : 0 : OUString totalName = pFind->GetDivision() + A2OUSTR(":");
88 : 0 : totalName += pFind->GetName();
89 : 0 : pFind->SetName(totalName);
90 [ # # ]: 0 : m_MapEnd[totalName] = pFind;
91 [ # # ]: 0 : m_MapEnd[sName] = pMark;
92 : : }
93 : 0 : }
94 : 0 : sal_Bool LwpBookmarkMgr::FindBookmark(OUString sName)
95 : : {
96 : 0 : std::map<OUString,XFBookmarkStart*>::iterator iter;
97 [ # # ]: 0 : iter = m_MapStart.find(sName);
98 [ # # ]: 0 : if (iter != m_MapStart.end())
99 : 0 : return sal_True;
100 : : else
101 : 0 : return sal_False;
102 : : }
103 : :
104 [ + - ]: 18 : LwpBookmarkMgr::LwpBookmarkMgr()
105 : : {
106 : 18 : m_MapStart.clear();
107 : 18 : m_MapEnd.clear();
108 : 18 : }
109 : 18 : LwpBookmarkMgr::~LwpBookmarkMgr()
110 : : {
111 : 18 : m_MapStart.clear();
112 : 18 : m_MapEnd.clear();
113 : 18 : }
114 : :
115 : : /* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|