Fix GNU C++ version check
[LibreOffice.git] / sw / inc / SwNodeNum.hxx
blobc0faf2e514aad7a3d52e847b9876fcd013c77ffb
1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
2 /*
3 * This file is part of the LibreOffice project.
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/.
9 * This file incorporates work covered by the following license notice:
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 .
19 #pragma once
21 #include "SwNumberTree.hxx"
23 class SwTextNode;
24 struct SwPosition;
25 class SwNumRule;
27 class SAL_DLLPUBLIC_RTTI SwNodeNum final : public SwNumberTreeNode
29 public:
30 explicit SwNodeNum(SwTextNode* pTextNode, bool isHiddenRedlines);
31 // note: this is only for creating phantom nodes and root nodes; these
32 // never have a text node
33 explicit SwNodeNum(SwNumRule* pNumRule);
34 virtual ~SwNodeNum() override;
36 SwNumRule* GetNumRule() const { return mpNumRule; }
37 void ChangeNumRule(SwNumRule& rNumRule);
38 SwTextNode* GetTextNode() const { return mpTextNode; }
40 virtual bool IsNotificationEnabled(const SwDoc& rDoc) const override;
42 virtual bool IsContinuous() const override;
44 virtual bool IsCounted() const override;
46 virtual bool LessThan(const SwNumberTreeNode& rNode) const override;
48 virtual bool IsRestart() const override;
50 virtual SwNumberTree::tSwNumTreeNumber GetStartValue() const override;
52 SwPosition GetPosition() const;
54 // The number tree root node is deleted, when the corresponding numbering
55 // rule is deleted. In this situation the number tree should be empty -
56 // still registered text nodes aren't allowed. But it is possible, that
57 // text nodes of the undo nodes array are still registered. These will be
58 // unregistered.
59 // Text nodes of the document nodes array aren't allowed to be registered
60 // in this situation - this will be asserted.
61 static void HandleNumberTreeRootNodeDelete(SwNodeNum& rNodeNum);
63 /** determines the <SwNodeNum> instance, which is preceding the given text node
65 #i81002#
67 const SwNodeNum* GetPrecedingNodeNumOf(const SwTextNode& rTextNode) const;
69 private:
70 virtual SwNumberTreeNode* Create() const override;
72 // --> #i64010#
73 virtual bool HasCountedChildren() const override;
74 virtual bool IsCountedForNumbering() const override;
76 // method called before this tree node has been added to the list tree
77 virtual void PreAdd() override;
78 // method called at a child after this child has been removed from the list tree
79 virtual void PostRemove() override;
81 SwTextNode* const mpTextNode;
82 SwNumRule* mpNumRule;
83 bool m_isHiddenRedlines;
85 static void UnregisterMeAndChildrenDueToRootDelete(SwNodeNum& rNodeNum);
87 SwNodeNum(const SwNodeNum&) = delete;
88 SwNodeNum& operator=(const SwNodeNum&) = delete;
90 virtual bool IsCountPhantoms() const override;
92 virtual bool IsNotifiable(const SwDoc& rDoc) const override;
94 virtual void NotifyNode() override;
97 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */