/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */ /* vim: set ts=8 sts=2 et sw=2 tw=80: */ /* 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/. */ #ifndef mozilla_RangeBoundary_h #define mozilla_RangeBoundary_h #include "nsCOMPtr.h" #include "nsIContent.h" #include "mozilla/Maybe.h" namespace mozilla { template class EditorDOMPointBase; // This class will maintain a reference to the child immediately // before the boundary's offset. We try to avoid computing the // offset as much as possible and just ensure mRef points to the // correct child. // // mParent // | // [child0] [child1] [child2] // / | // mRef mOffset=2 // // If mOffset == 0, mRef is null. // For text nodes, mRef will always be null and the offset will // be kept up-to-date. template class RangeBoundaryBase; typedef RangeBoundaryBase, nsCOMPtr> RangeBoundary; typedef RangeBoundaryBase RawRangeBoundary; // This class has two specializations, one using reference counting // pointers and one using raw pointers. This helps us avoid unnecessary // AddRef/Release calls. template class RangeBoundaryBase { template friend class RangeBoundaryBase; template friend class EditorDOMPointBase; friend void ImplCycleCollectionTraverse(nsCycleCollectionTraversalCallback&, RangeBoundary&, const char*, uint32_t); friend void ImplCycleCollectionUnlink(RangeBoundary&); public: RangeBoundaryBase(nsINode* aContainer, nsIContent* aRef) : mParent(aContainer), mRef(aRef) { if (!mRef) { mOffset = mozilla::Some(0); } else { NS_WARNING_ASSERTION(mRef->GetParentNode() == mParent, "Initializing RangeBoundary with invalid value"); mOffset.reset(); } } RangeBoundaryBase(nsINode* aContainer, int32_t aOffset) : mParent(aContainer), mRef(nullptr), mOffset(mozilla::Some(aOffset)) { if (mParent && mParent->IsContainerNode()) { // Find a reference node if (aOffset == static_cast(aContainer->GetChildCount())) { mRef = aContainer->GetLastChild(); } else if (aOffset != 0) { mRef = mParent->GetChildAt_Deprecated(aOffset - 1); } NS_WARNING_ASSERTION(mRef || aOffset == 0, "Constructing RangeBoundary with invalid value"); } NS_WARNING_ASSERTION(!mRef || mRef->GetParentNode() == mParent, "Constructing RangeBoundary with invalid value"); } RangeBoundaryBase() : mParent(nullptr), mRef(nullptr) {} // Needed for initializing RawRangeBoundary from an existing RangeBoundary. template explicit RangeBoundaryBase(const RangeBoundaryBase& aOther) : mParent(aOther.mParent), mRef(aOther.mRef), mOffset(aOther.mOffset) {} nsIContent* Ref() const { return mRef; } nsINode* Container() const { return mParent; } nsIContent* GetChildAtOffset() const { if (!mParent || !mParent->IsContainerNode()) { return nullptr; } if (!mRef) { MOZ_ASSERT(Offset() == 0, "invalid RangeBoundary"); return mParent->GetFirstChild(); } MOZ_ASSERT(mParent->GetChildAt_Deprecated(Offset()) == mRef->GetNextSibling()); return mRef->GetNextSibling(); } /** * GetNextSiblingOfChildOffset() returns next sibling of a child at offset. * If this refers after the last child or the container cannot have children, * this returns nullptr with warning. */ nsIContent* GetNextSiblingOfChildAtOffset() const { if (NS_WARN_IF(!mParent) || NS_WARN_IF(!mParent->IsContainerNode())) { return nullptr; } if (NS_WARN_IF(!mRef->GetNextSibling())) { // Already referring the end of the container. return nullptr; } return mRef->GetNextSibling()->GetNextSibling(); } /** * GetPreviousSiblingOfChildAtOffset() returns previous sibling of a child * at offset. If this refers the first child or the container cannot have * children, this returns nullptr with warning. */ nsIContent* GetPreviousSiblingOfChildAtOffset() const { if (NS_WARN_IF(!mParent) || NS_WARN_IF(!mParent->IsContainerNode())) { return nullptr; } if (NS_WARN_IF(!mRef)) { // Already referring the start of the container. return nullptr; } return mRef; } uint32_t Offset() const { if (mOffset.isSome()) { return mOffset.value(); } if (!mParent) { return 0; } MOZ_ASSERT(mRef); MOZ_ASSERT(mRef->GetParentNode() == mParent); mOffset = mozilla::Some(mParent->ComputeIndexOf(mRef) + 1); return mOffset.value(); } void InvalidateOffset() { MOZ_ASSERT(mParent); MOZ_ASSERT(mParent->IsContainerNode(), "Range is positioned on a text node!"); if (!mRef) { MOZ_ASSERT(mOffset.isSome() && mOffset.value() == 0, "Invalidating offset of invalid RangeBoundary?"); return; } mOffset.reset(); } void Set(nsINode* aContainer, int32_t aOffset) { mParent = aContainer; if (mParent && mParent->IsContainerNode()) { // Find a reference node if (aOffset == static_cast(aContainer->GetChildCount())) { mRef = aContainer->GetLastChild(); } else if (aOffset == 0) { mRef = nullptr; } else { mRef = mParent->GetChildAt_Deprecated(aOffset - 1); MOZ_ASSERT(mRef); } NS_WARNING_ASSERTION(mRef || aOffset == 0, "Setting RangeBoundary to invalid value"); } else { mRef = nullptr; } mOffset = mozilla::Some(aOffset); NS_WARNING_ASSERTION(!mRef || mRef->GetParentNode() == mParent, "Setting RangeBoundary to invalid value"); } void SetAfterRef(nsINode* aParent, nsIContent* aRef) { mParent = aParent; mRef = aRef; if (!mRef) { mOffset = mozilla::Some(0); } else { mOffset.reset(); } } bool IsSet() const { return mParent && (mRef || mOffset.isSome()); } bool IsSetAndValid() const { if (!IsSet()) { return false; } if (Ref()) { return Ref()->GetParentNode() == Container(); } return Offset() <= Container()->Length(); } bool IsStartOfContainer() const { // We're at the first point in the container if we don't have a reference, // and our offset is 0. If we don't have a Ref, we should already have an // offset, so we can just directly fetch it. return !Ref() && mOffset.value() == 0; } bool IsEndOfContainer() const { // We're at the last point in the container if Ref is a pointer to the last // child in Container(), or our Offset() is the same as the length of our // container. If we don't have a Ref, then we should already have an offset, // so we can just directly fetch it. return Ref() ? !Ref()->GetNextSibling() : mOffset.value() == Container()->Length(); } // Convenience methods for switching between the two types // of RangeBoundary. RangeBoundaryBase AsRaw() const { return RangeBoundaryBase(*this); } template RangeBoundaryBase& operator=(const RangeBoundaryBase& aOther) { // mParent and mRef can be strong pointers, so better to try to avoid any // extra AddRef/Release calls. if (mParent != aOther.mParent) { mParent = aOther.mParent; } if (mRef != aOther.mRef) { mRef = aOther.mRef; } mOffset = aOther.mOffset; return *this; } template bool operator==(const RangeBoundaryBase& aOther) const { return mParent == aOther.mParent && (mRef ? mRef == aOther.mRef : mOffset == aOther.mOffset); } template bool operator!=(const RangeBoundaryBase& aOther) const { return !(*this == aOther); } private: ParentType mParent; RefType mRef; mutable mozilla::Maybe mOffset; }; inline void ImplCycleCollectionUnlink(RangeBoundary& aField) { ImplCycleCollectionUnlink(aField.mParent); ImplCycleCollectionUnlink(aField.mRef); } inline void ImplCycleCollectionTraverse( nsCycleCollectionTraversalCallback& aCallback, RangeBoundary& aField, const char* aName, uint32_t aFlags) { ImplCycleCollectionTraverse(aCallback, aField.mParent, "mParent", 0); ImplCycleCollectionTraverse(aCallback, aField.mRef, "mRef", 0); } } // namespace mozilla #endif // defined(mozilla_RangeBoundary_h)