2007-03-22 10:30:00 -07:00
|
|
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
|
|
|
/* ***** BEGIN LICENSE BLOCK *****
|
|
|
|
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
|
|
|
*
|
|
|
|
* The contents of this file are subject to the Mozilla Public License Version
|
|
|
|
* 1.1 (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.mozilla.org/MPL/
|
|
|
|
*
|
|
|
|
* Software distributed under the License is distributed on an "AS IS" basis,
|
|
|
|
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
|
|
|
|
* for the specific language governing rights and limitations under the
|
|
|
|
* License.
|
|
|
|
*
|
|
|
|
* The Original Code is mozilla.org code.
|
|
|
|
*
|
|
|
|
* The Initial Developer of the Original Code is
|
|
|
|
* Netscape Communications Corporation.
|
|
|
|
* Portions created by the Initial Developer are Copyright (C) 1998
|
|
|
|
* the Initial Developer. All Rights Reserved.
|
|
|
|
*
|
|
|
|
* Contributor(s):
|
|
|
|
*
|
|
|
|
* Alternatively, the contents of this file may be used under the terms of
|
|
|
|
* either of the GNU General Public License Version 2 or later (the "GPL"),
|
|
|
|
* or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
|
|
|
|
* in which case the provisions of the GPL or the LGPL are applicable instead
|
|
|
|
* of those above. If you wish to allow use of your version of this file only
|
|
|
|
* under the terms of either the GPL or the LGPL, and not to allow others to
|
|
|
|
* use your version of this file under the terms of the MPL, indicate your
|
|
|
|
* decision by deleting the provisions above and replace them with the notice
|
|
|
|
* and other provisions required by the GPL or the LGPL. If you do not delete
|
|
|
|
* the provisions above, a recipient may use your version of this file under
|
|
|
|
* the terms of any one of the MPL, the GPL or the LGPL.
|
|
|
|
*
|
|
|
|
* ***** END LICENSE BLOCK ***** */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Implementation of the DOM nsIDOMRange object.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef nsRange_h___
|
|
|
|
#define nsRange_h___
|
|
|
|
|
|
|
|
#include "nsIRange.h"
|
|
|
|
#include "nsIDOMRange.h"
|
|
|
|
#include "nsIRangeUtils.h"
|
|
|
|
#include "nsCOMPtr.h"
|
|
|
|
#include "nsIDOMDocumentFragment.h"
|
|
|
|
#include "nsIContent.h"
|
|
|
|
#include "nsIDOMNode.h"
|
|
|
|
#include "prmon.h"
|
|
|
|
#include "nsStubMutationObserver.h"
|
|
|
|
|
|
|
|
// -------------------------------------------------------------------------------
|
|
|
|
|
|
|
|
class nsRangeUtils : public nsIRangeUtils
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
NS_DECL_ISUPPORTS
|
|
|
|
|
|
|
|
// nsIRangeUtils interface
|
|
|
|
NS_IMETHOD_(PRInt32) ComparePoints(nsIDOMNode* aParent1, PRInt32 aOffset1,
|
|
|
|
nsIDOMNode* aParent2, PRInt32 aOffset2);
|
|
|
|
|
|
|
|
NS_IMETHOD CompareNodeToRange(nsIContent* aNode,
|
|
|
|
nsIDOMRange* aRange,
|
2011-09-28 23:19:26 -07:00
|
|
|
bool *outNodeBefore,
|
|
|
|
bool *outNodeAfter);
|
2007-03-22 10:30:00 -07:00
|
|
|
};
|
|
|
|
|
|
|
|
// -------------------------------------------------------------------------------
|
|
|
|
|
|
|
|
class nsRange : public nsIRange,
|
|
|
|
public nsStubMutationObserver
|
|
|
|
{
|
|
|
|
public:
|
2011-12-20 01:15:41 -08:00
|
|
|
nsRange(){}
|
2007-03-22 10:30:00 -07:00
|
|
|
virtual ~nsRange();
|
|
|
|
|
2008-12-03 02:03:10 -08:00
|
|
|
NS_DECL_CYCLE_COLLECTING_ISUPPORTS
|
|
|
|
NS_DECL_CYCLE_COLLECTION_CLASS_AMBIGUOUS(nsRange, nsIRange)
|
2007-03-22 10:30:00 -07:00
|
|
|
|
|
|
|
// nsIDOMRange interface
|
|
|
|
NS_DECL_NSIDOMRANGE
|
|
|
|
|
|
|
|
// nsIRange interface
|
2009-04-06 10:17:38 -07:00
|
|
|
virtual nsINode* GetCommonAncestor() const;
|
2007-03-22 10:30:00 -07:00
|
|
|
virtual void Reset();
|
2009-04-06 10:17:37 -07:00
|
|
|
virtual nsresult SetStart(nsINode* aParent, PRInt32 aOffset);
|
|
|
|
virtual nsresult SetEnd(nsINode* aParent, PRInt32 aOffset);
|
2009-04-06 10:17:38 -07:00
|
|
|
virtual nsresult CloneRange(nsIRange** aNewRange) const;
|
2010-07-21 15:05:17 -07:00
|
|
|
|
2011-11-03 22:32:09 -07:00
|
|
|
nsresult Set(nsINode* aStartParent, PRInt32 aStartOffset,
|
|
|
|
nsINode* aEndParent, PRInt32 aEndOffset)
|
|
|
|
{
|
|
|
|
// If this starts being hot, we may be able to optimize this a bit,
|
|
|
|
// but for now just set start and end separately.
|
|
|
|
nsresult rv = SetStart(aStartParent, aStartOffset);
|
|
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
|
|
|
|
|
|
return SetEnd(aEndParent, aEndOffset);
|
|
|
|
}
|
|
|
|
|
2011-06-15 23:31:36 -07:00
|
|
|
NS_IMETHOD GetUsedFontFaces(nsIDOMFontFaceList** aResult);
|
|
|
|
|
2007-03-22 10:30:00 -07:00
|
|
|
// nsIMutationObserver methods
|
2010-07-21 15:05:17 -07:00
|
|
|
NS_DECL_NSIMUTATIONOBSERVER_CHARACTERDATACHANGED
|
|
|
|
NS_DECL_NSIMUTATIONOBSERVER_CONTENTINSERTED
|
|
|
|
NS_DECL_NSIMUTATIONOBSERVER_CONTENTREMOVED
|
|
|
|
NS_DECL_NSIMUTATIONOBSERVER_PARENTCHAINCHANGED
|
2011-12-20 01:15:41 -08:00
|
|
|
NS_DECL_NSIMUTATIONOBSERVER_CONTENTAPPENDED
|
2007-03-22 10:30:00 -07:00
|
|
|
|
|
|
|
private:
|
|
|
|
// no copy's or assigns
|
|
|
|
nsRange(const nsRange&);
|
|
|
|
nsRange& operator=(const nsRange&);
|
2007-06-18 20:01:03 -07:00
|
|
|
|
2008-07-25 03:37:37 -07:00
|
|
|
/**
|
|
|
|
* Cut or delete the range's contents.
|
|
|
|
*
|
|
|
|
* @param aFragment nsIDOMDocumentFragment containing the nodes.
|
|
|
|
* May be null to indicate the caller doesn't want a fragment.
|
|
|
|
*/
|
|
|
|
nsresult CutContents(nsIDOMDocumentFragment** frag);
|
|
|
|
|
2009-04-06 10:17:37 -07:00
|
|
|
/**
|
|
|
|
* Guts of cloning a range. Addrefs the new range.
|
|
|
|
*/
|
2009-04-06 10:17:38 -07:00
|
|
|
nsresult DoCloneRange(nsIRange** aNewRange) const;
|
2009-04-06 10:17:37 -07:00
|
|
|
|
2008-10-11 12:46:05 -07:00
|
|
|
static nsresult CloneParentsBetween(nsIDOMNode *aAncestor,
|
|
|
|
nsIDOMNode *aNode,
|
|
|
|
nsIDOMNode **aClosestAncestor,
|
|
|
|
nsIDOMNode **aFarthestAncestor);
|
2008-07-25 03:37:37 -07:00
|
|
|
|
2007-03-22 10:30:00 -07:00
|
|
|
public:
|
|
|
|
/******************************************************************************
|
|
|
|
* Utility routine to detect if a content node starts before a range and/or
|
|
|
|
* ends after a range. If neither it is contained inside the range.
|
|
|
|
*
|
|
|
|
* XXX - callers responsibility to ensure node in same doc as range!
|
|
|
|
*
|
|
|
|
*****************************************************************************/
|
2008-10-15 02:40:28 -07:00
|
|
|
static nsresult CompareNodeToRange(nsINode* aNode, nsIDOMRange* aRange,
|
2011-09-28 23:19:26 -07:00
|
|
|
bool *outNodeBefore,
|
|
|
|
bool *outNodeAfter);
|
2008-10-15 02:40:28 -07:00
|
|
|
static nsresult CompareNodeToRange(nsINode* aNode, nsIRange* aRange,
|
2011-09-28 23:19:26 -07:00
|
|
|
bool *outNodeBefore,
|
|
|
|
bool *outNodeAfter);
|
2007-03-22 10:30:00 -07:00
|
|
|
|
2011-12-20 01:15:41 -08:00
|
|
|
static bool IsNodeSelected(nsINode* aNode, PRUint32 aStartOffset,
|
|
|
|
PRUint32 aEndOffset);
|
|
|
|
|
2007-03-22 10:30:00 -07:00
|
|
|
protected:
|
2011-12-20 01:15:41 -08:00
|
|
|
// CharacterDataChanged set aNotInsertedYet to true to disable an assertion
|
|
|
|
// and suppress re-registering a range common ancestor node since
|
|
|
|
// the new text node of a splitText hasn't been inserted yet.
|
|
|
|
// CharacterDataChanged does the re-registering when needed.
|
2007-03-22 10:30:00 -07:00
|
|
|
void DoSetRange(nsINode* aStartN, PRInt32 aStartOffset,
|
|
|
|
nsINode* aEndN, PRInt32 aEndOffset,
|
2011-12-20 01:15:41 -08:00
|
|
|
nsINode* aRoot, bool aNotInsertedYet = false);
|
2011-12-24 05:26:03 -08:00
|
|
|
|
|
|
|
/**
|
|
|
|
* For a range for which IsInSelection() is true, return the common
|
|
|
|
* ancestor for the range. This method uses the selection bits and
|
|
|
|
* nsGkAtoms::range property on the nodes to quickly find the ancestor.
|
|
|
|
* That is, it's a faster version of GetCommonAncestor that only works
|
|
|
|
* for ranges in a Selection. The method will assert and the behavior
|
|
|
|
* is undefined if called on a range where IsInSelection() is false.
|
|
|
|
*/
|
|
|
|
nsINode* GetRegisteredCommonAncestor();
|
|
|
|
|
|
|
|
struct NS_STACK_CLASS AutoInvalidateSelection
|
|
|
|
{
|
|
|
|
AutoInvalidateSelection(nsRange* aRange) : mRange(aRange)
|
|
|
|
{
|
|
|
|
#ifdef DEBUG
|
|
|
|
mWasInSelection = mRange->IsInSelection();
|
|
|
|
#endif
|
|
|
|
if (!mRange->IsInSelection() || mIsNested) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
mIsNested = true;
|
|
|
|
NS_ASSERTION(!mRange->IsDetached(), "detached range in selection");
|
|
|
|
mCommonAncestor = mRange->GetRegisteredCommonAncestor();
|
|
|
|
}
|
|
|
|
~AutoInvalidateSelection();
|
|
|
|
nsRange* mRange;
|
|
|
|
nsRefPtr<nsINode> mCommonAncestor;
|
|
|
|
#ifdef DEBUG
|
|
|
|
bool mWasInSelection;
|
|
|
|
#endif
|
|
|
|
static bool mIsNested;
|
|
|
|
};
|
|
|
|
|
2007-03-22 10:30:00 -07:00
|
|
|
};
|
|
|
|
|
|
|
|
// Make a new nsIDOMRange object
|
|
|
|
nsresult NS_NewRange(nsIDOMRange** aInstancePtrResult);
|
|
|
|
|
|
|
|
// Make a new nsIRangeUtils object
|
|
|
|
nsresult NS_NewRangeUtils(nsIRangeUtils** aInstancePtrResult);
|
|
|
|
|
|
|
|
#endif /* nsRange_h___ */
|