/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */ /* 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/. */ #include "SplitNodeTransaction.h" #include "mozilla/EditorBase.h" // for EditorBase #include "mozilla/dom/Selection.h" #include "nsAString.h" #include "nsDebug.h" // for NS_ASSERTION, etc. #include "nsError.h" // for NS_ERROR_NOT_INITIALIZED, etc. #include "nsIContent.h" // for nsIContent namespace mozilla { using namespace dom; SplitNodeTransaction::SplitNodeTransaction(EditorBase& aEditorBase, nsIContent& aNode, int32_t aOffset) : mEditorBase(&aEditorBase) , mExistingRightNode(&aNode) , mOffset(aOffset) { } SplitNodeTransaction::~SplitNodeTransaction() { } NS_IMPL_CYCLE_COLLECTION_INHERITED(SplitNodeTransaction, EditTransactionBase, mEditorBase, mParent, mNewLeftNode) NS_IMPL_ADDREF_INHERITED(SplitNodeTransaction, EditTransactionBase) NS_IMPL_RELEASE_INHERITED(SplitNodeTransaction, EditTransactionBase) NS_INTERFACE_MAP_BEGIN_CYCLE_COLLECTION(SplitNodeTransaction) NS_INTERFACE_MAP_END_INHERITING(EditTransactionBase) NS_IMETHODIMP SplitNodeTransaction::DoTransaction() { if (NS_WARN_IF(!mEditorBase)) { return NS_ERROR_NOT_INITIALIZED; } // Create a new node ErrorResult rv; // Don't use .downcast directly because AsContent has an assertion we want nsCOMPtr clone = mExistingRightNode->CloneNode(false, rv); NS_ASSERTION(!rv.Failed() && clone, "Could not create clone"); NS_ENSURE_TRUE(!rv.Failed() && clone, rv.StealNSResult()); mNewLeftNode = dont_AddRef(clone.forget().take()->AsContent()); mEditorBase->MarkNodeDirty(mExistingRightNode->AsDOMNode()); // Get the parent node mParent = mExistingRightNode->GetParentNode(); NS_ENSURE_TRUE(mParent, NS_ERROR_NULL_POINTER); // Insert the new node rv = mEditorBase->SplitNodeImpl(*mExistingRightNode, mOffset, *mNewLeftNode); if (mEditorBase->GetShouldTxnSetSelection()) { RefPtr selection = mEditorBase->GetSelection(); NS_ENSURE_TRUE(selection, NS_ERROR_NULL_POINTER); rv = selection->Collapse(mNewLeftNode, mOffset); } return rv.StealNSResult(); } NS_IMETHODIMP SplitNodeTransaction::UndoTransaction() { if (NS_WARN_IF(!mEditorBase) || NS_WARN_IF(!mNewLeftNode) || NS_WARN_IF(!mParent)) { return NS_ERROR_NOT_INITIALIZED; } // This assumes Do inserted the new node in front of the prior existing node return mEditorBase->JoinNodesImpl(mExistingRightNode, mNewLeftNode, mParent); } /* Redo cannot simply resplit the right node, because subsequent transactions * on the redo stack may depend on the left node existing in its previous * state. */ NS_IMETHODIMP SplitNodeTransaction::RedoTransaction() { if (NS_WARN_IF(!mNewLeftNode) || NS_WARN_IF(!mParent)) { return NS_ERROR_NOT_INITIALIZED; } ErrorResult rv; // First, massage the existing node so it is in its post-split state if (mExistingRightNode->GetAsText()) { rv = mExistingRightNode->GetAsText()->DeleteData(0, mOffset); NS_ENSURE_TRUE(!rv.Failed(), rv.StealNSResult()); } else { nsCOMPtr child = mExistingRightNode->GetFirstChild(); nsCOMPtr nextSibling; for (int32_t i=0; i < mOffset; i++) { if (rv.Failed()) { return rv.StealNSResult(); } if (!child) { return NS_ERROR_NULL_POINTER; } nextSibling = child->GetNextSibling(); mExistingRightNode->RemoveChild(*child, rv); if (!rv.Failed()) { mNewLeftNode->AppendChild(*child, rv); } child = nextSibling; } } // Second, re-insert the left node into the tree nsCOMPtr refNode = mExistingRightNode; mParent->InsertBefore(*mNewLeftNode, refNode, rv); return rv.StealNSResult(); } NS_IMETHODIMP SplitNodeTransaction::GetTxnDescription(nsAString& aString) { aString.AssignLiteral("SplitNodeTransaction"); return NS_OK; } nsIContent* SplitNodeTransaction::GetNewNode() { return mNewLeftNode; } } // namespace mozilla