/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- * * The contents of this file are subject to the Netscape Public License * Version 1.0 (the "NPL"); you may not use this file except in * compliance with the NPL. You may obtain a copy of the NPL at * http://www.mozilla.org/NPL/ * * Software distributed under the NPL is distributed on an "AS IS" basis, * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL * for the specific language governing rights and limitations under the * NPL. * * The Initial Developer of this code under the NPL is Netscape * Communications Corporation. Portions created by Netscape are * Copyright (C) 1998 Netscape Communications Corporation. All Rights * Reserved. */ #include "SplitElementTxn.h" #include "nsEditor.h" #include "nsIDOMNode.h" #include "nsIDOMSelection.h" #include "nsIDOMCharacterData.h" #ifdef NS_DEBUG static PRBool gNoisy = PR_FALSE; #else static const PRBool gNoisy = PR_FALSE; #endif // note that aEditor is not refcounted SplitElementTxn::SplitElementTxn() : EditTxn() { } NS_IMETHODIMP SplitElementTxn::Init(nsIEditor *aEditor, nsIDOMNode *aNode, PRInt32 aOffset) { mEditor = do_QueryInterface(aEditor); mExistingRightNode = do_QueryInterface(aNode); mOffset = aOffset; return NS_OK; } SplitElementTxn::~SplitElementTxn() { } NS_IMETHODIMP SplitElementTxn::Do(void) { if (gNoisy) { printf("%p Do Split of node %p offset %d\n", this, mExistingRightNode.get(), mOffset); } NS_ASSERTION(mExistingRightNode, "bad state"); if (!mExistingRightNode) { return NS_ERROR_NOT_INITIALIZED; } // create a new node nsresult result = mExistingRightNode->CloneNode(PR_FALSE, getter_AddRefs(mNewLeftNode)); NS_ASSERTION(((NS_SUCCEEDED(result)) && (mNewLeftNode)), "could not create element."); if ((NS_SUCCEEDED(result)) && (mNewLeftNode)) { if (gNoisy) { printf(" created left node = %p\n", mNewLeftNode.get()); } // get the parent node result = mExistingRightNode->GetParentNode(getter_AddRefs(mParent)); // insert the new node if ((NS_SUCCEEDED(result)) && (mParent)) { result = nsEditor::SplitNodeImpl(mExistingRightNode, mOffset, mNewLeftNode, mParent); if (NS_SUCCEEDED(result) && mNewLeftNode) { nsCOMPtrselection; mEditor->GetSelection(getter_AddRefs(selection)); if (selection) { selection->Collapse(mNewLeftNode, mOffset); } } else { result = NS_ERROR_NOT_IMPLEMENTED; } } } return result; } NS_IMETHODIMP SplitElementTxn::Undo(void) { if (gNoisy) { printf("%p Undo Split of existing node %p and new node %p offset %d\n", this, mExistingRightNode.get(), mNewLeftNode.get(), mOffset); } NS_ASSERTION(mExistingRightNode && mNewLeftNode && mParent, "bad state"); if (!mExistingRightNode || !mNewLeftNode || !mParent) { return NS_ERROR_NOT_INITIALIZED; } // this assumes Do inserted the new node in front of the prior existing node nsresult result; result = nsEditor::JoinNodesImpl(mExistingRightNode, mNewLeftNode, mParent, PR_FALSE); if (gNoisy) { printf("** after join left child node %p into right node %p\n", mNewLeftNode.get(), mExistingRightNode.get()); if (gNoisy) {mEditor->DebugDumpContent(); } // DEBUG } if (NS_SUCCEEDED(result)) { if (gNoisy) { printf(" left node = %p removed\n", mNewLeftNode.get()); } nsCOMPtrselection; mEditor->GetSelection(getter_AddRefs(selection)); if (selection) { selection->Collapse(mExistingRightNode, mOffset); } } else { result = NS_ERROR_NOT_IMPLEMENTED; } return result; } /* 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 SplitElementTxn::Redo(void) { NS_ASSERTION(mExistingRightNode && mNewLeftNode && mParent, "bad state"); if (!mExistingRightNode || !mNewLeftNode || !mParent) { return NS_ERROR_NOT_INITIALIZED; } if (gNoisy) { printf("%p Redo Split of existing node %p and new node %p offset %d\n", this, mExistingRightNode.get(), mNewLeftNode.get(), mOffset); if (gNoisy) {mEditor->DebugDumpContent(); } // DEBUG } nsresult result; nsCOMPtrresultNode; // first, massage the existing node so it is in its post-split state nsCOMPtrrightNodeAsText; rightNodeAsText = do_QueryInterface(mExistingRightNode); if (rightNodeAsText) { result = rightNodeAsText->DeleteData(0, mOffset); if (gNoisy) { printf("** after delete of text in right text node %p offset %d\n", rightNodeAsText.get(), mOffset); if (gNoisy) {mEditor->DebugDumpContent(); } // DEBUG } } else { nsCOMPtrchild; nsCOMPtrnextSibling; result = mExistingRightNode->GetFirstChild(getter_AddRefs(child)); PRInt32 i; for (i=0; iGetNextSibling(getter_AddRefs(nextSibling)); result = mExistingRightNode->RemoveChild(child, getter_AddRefs(resultNode)); if (NS_SUCCEEDED(result)) { result = mNewLeftNode->AppendChild(child, getter_AddRefs(resultNode)); if (gNoisy) { printf("** move child node %p from right node %p to left node %p\n", child.get(), mExistingRightNode.get(), mNewLeftNode.get()); if (gNoisy) {mEditor->DebugDumpContent(); } // DEBUG } } child = do_QueryInterface(nextSibling); } } // second, re-insert the left node into the tree result = mParent->InsertBefore(mNewLeftNode, mExistingRightNode, getter_AddRefs(resultNode)); if (gNoisy) { printf("** reinsert left child node %p before right node %p\n", mNewLeftNode.get(), mExistingRightNode.get()); if (gNoisy) {mEditor->DebugDumpContent(); } // DEBUG } return result; } NS_IMETHODIMP SplitElementTxn::Merge(PRBool *aDidMerge, nsITransaction *aTransaction) { if (nsnull!=aDidMerge) *aDidMerge=PR_FALSE; return NS_OK; } NS_IMETHODIMP SplitElementTxn::Write(nsIOutputStream *aOutputStream) { return NS_OK; } NS_IMETHODIMP SplitElementTxn::GetUndoString(nsString *aString) { if (nsnull!=aString) { *aString="Join Element"; } return NS_OK; } NS_IMETHODIMP SplitElementTxn::GetRedoString(nsString *aString) { if (nsnull!=aString) { *aString="Split Element"; } return NS_OK; } NS_IMETHODIMP SplitElementTxn::GetNewNode(nsIDOMNode **aNewNode) { if (!aNewNode) return NS_ERROR_NULL_POINTER; if (!mNewLeftNode) return NS_ERROR_NOT_INITIALIZED; *aNewNode = mNewLeftNode; NS_ADDREF(*aNewNode); return NS_OK; }