File: accfrmobjmap.hxx

package info (click to toggle)
libreoffice 4%3A25.8.2-3
  • links: PTS, VCS
  • area: main
  • in suites: forky
  • size: 3,815,320 kB
  • sloc: cpp: 4,378,739; xml: 454,679; java: 257,215; python: 80,874; ansic: 33,824; perl: 30,304; javascript: 19,722; sh: 11,717; makefile: 10,622; cs: 8,865; yacc: 8,549; objc: 2,131; lex: 1,379; asm: 1,231; awk: 996; pascal: 914; csh: 20; sed: 5
file content (103 lines) | stat: -rw-r--r-- 3,763 bytes parent folder | download | duplicates (3)
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
/* -*- 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 INCLUDED_SW_SOURCE_CORE_ACCESS_ACCFRMOBJMAP_HXX
#define INCLUDED_SW_SOURCE_CORE_ACCESS_ACCFRMOBJMAP_HXX

#include <tools/gen.hxx>
#include <svx/svdtypes.hxx>
#include "accfrmobj.hxx"
#include <map>

class SwAccessibleMap;
class SwRect;
class SwFrame;
class SdrObject;

class SwAccessibleChildMapKey
{
public:
    enum LayerId { INVALID, HELL, TEXT, HEAVEN, CONTROLS, XWINDOW };

    SwAccessibleChildMapKey()
        : m_eLayerId( INVALID )
        , m_nOrdNum( 0 )
    {}

    SwAccessibleChildMapKey( LayerId eId, sal_uInt32 nOrd )
        : m_eLayerId( eId )
        , m_nOrdNum( nOrd )
    {}

    bool operator()( const SwAccessibleChildMapKey& r1,
                            const SwAccessibleChildMapKey& r2 ) const
    {
        if(r1.m_eLayerId == r2.m_eLayerId)
            return r1.m_nOrdNum < r2.m_nOrdNum;
        else
            return r1.m_eLayerId < r2.m_eLayerId;
    }

private:
    LayerId m_eLayerId;
    sal_uInt32 m_nOrdNum;
};


class SwAccessibleChildMap
{
public:
    typedef SwAccessibleChildMapKey                                             key_type;
    typedef sw::access::SwAccessibleChild                                       mapped_type;
    typedef std::pair<const key_type,mapped_type>                               value_type;
    typedef SwAccessibleChildMapKey                                             key_compare;
    typedef std::map<key_type,mapped_type,key_compare>::iterator                iterator;
    typedef std::map<key_type,mapped_type,key_compare>::const_iterator          const_iterator;
    typedef std::map<key_type,mapped_type,key_compare>::const_reverse_iterator  const_reverse_iterator;

private:
    const SdrLayerID mnHellId;
    const SdrLayerID mnControlsId;
    std::map<key_type,mapped_type,key_compare> maMap;

    std::pair< iterator, bool > insert( const sal_uInt32 nPos,
                                          const SwAccessibleChildMapKey::LayerId eLayerId,
                                          const sw::access::SwAccessibleChild& rLower );
    std::pair< iterator, bool > insert( const SdrObject* pObj,
                                          const sw::access::SwAccessibleChild& rLower );

public:
    SwAccessibleChildMap( const SwRect& rVisArea,
                          const SwFrame& rFrame,
                          SwAccessibleMap& rAccMap );

    static bool IsSortingRequired( const SwFrame& rFrame );

    const_iterator cbegin() const { return maMap.cbegin(); }
    const_iterator cend() const { return maMap.cend(); }
    const_reverse_iterator crbegin() const { return maMap.crbegin(); }
    const_reverse_iterator crend() const { return maMap.crend(); }

    template<class... Args>
    std::pair<iterator,bool> emplace(Args&&... args) { return maMap.emplace(std::forward<Args>(args)...); }
};

#endif

/* vim:set shiftwidth=4 softtabstop=4 expandtab: */