OpMoveBackwards Class Reference

This class represents the MoveBackwards operation. More...

#include <zordops.h>

Inheritance diagram for OpMoveBackwards:

List of all members.

Public Member Functions
	OpMoveBackwards ()
	OpMoveBackwards constructor.
void	Do (OpDescriptor *)
	Performs the MoveBackwards operation.
virtual BOOL	MayChangeNodeBounds () const
Static Public Member Functions
static BOOL	Init ()
	OpMoveBackwards initialiser method.

---

Detailed Description

This class represents the MoveBackwards operation.

Author:

Simon_Maneggio (Xara Group Ltd) <camelotdev@xara.com>

Date:

9/7/93

See also:

OpBringToFront

OpPutToBack

OpMoveForwards Documentation: specs.doc

Definition at line 220 of file zordops.h.

---

Constructor & Destructor Documentation

OpMoveBackwards::OpMoveBackwards (   )

OpMoveBackwards constructor. Author: Simon_Maneggio (Xara Group Ltd) <camelotdev@xara.com> Date: 29/9/93 Parameters: -  [INPUTS] -  [OUTPUTS] Returns: - Errors: - See also: - Definition at line 1630 of file zordops.cpp. : SelOperation() { }

---

Member Function Documentation

void OpMoveBackwards::Do (  OpDescriptor *   )  [virtual]

Performs the MoveBackwards operation. Author: Simon_Maneggio (Xara Group Ltd) <camelotdev@xara.com> (rewritten by Markn for WEBSTER - 2/2/97) Date: 16/8/93 Parameters: OpDescriptor  (unused) [INPUTS] -  [OUTPUTS] Returns: - See note at the top of file about WEBSTER z-order ops Returns: Errors: - See also: - Reimplemented from Operation. Definition at line 1691 of file zordops.cpp. { #ifdef WEBSTER SelRange* Sel = GetApplication()->FindSelection(); Node* pSelNode = Sel->FindFirst(); // If there are selected objects, record undo stuff about the selection if (pSelNode != NULL) { // Try to record the selection state , don't render the blobs though // the invalidate will take care of this. if (!DoStartSelOp(FALSE,FALSE)) goto EndOperation; // We need to invalidate the region if (!DoInvalidateNodesRegions(*Sel, TRUE)) goto EndOperation; } while (pSelNode != NULL) { Node* pContextNode = NULL; BOOL SelNodeFound = FALSE; Node* pNode = pSelNode; while (pNode != NULL && pContextNode == NULL && !SelNodeFound) { Node* pOldNode = pNode; // Remember this node if (pNode != NULL) pNode = pNode->FindPrevious(); // Get the node before this node // If the previous node is an unselected object, then we can move this object back if (pNode != NULL && pNode->IsAnObject() && !pNode->IsSelected()) pContextNode = pNode; SelNodeFound = (pNode != NULL && pNode->IsAnObject() && pNode->IsSelected()); if (pNode == NULL) { // Find the parent layer Layer* pLayer = (Layer*)pOldNode->FindParent(CC_RUNTIME_CLASS(Layer)); // Find the last object on the first editable layer we can find that preceeds this layer do { pLayer = pLayer->FindPrevLayer(TRUE); pNode = FindLastObject(pLayer); } while (pLayer != NULL && pNode == NULL); // If the previous node is an unselected object, then we can move this object back if (pNode != NULL && pNode->IsAnObject() && !pNode->IsSelected()) pContextNode = pNode; } } pNode = pSelNode; // Try the next selected node. pSelNode = Sel->FindNext(pSelNode); if (pContextNode != NULL && !SelNodeFound) { if (!DoMoveNode(pNode, pContextNode, PREV)) goto EndOperation; pNode->SetSelected(TRUE); } } EndOperation: End(); // End of operation #else // WEBSTER - markn 2/2/97 // Original code // Obtain the current selections Range Sel(*(GetApplication()->FindSelection())); // DMc RangeControl rg = Sel.GetRangeControlFlags(); rg.PromoteToParent = TRUE; Sel.Range::SetRangeControl(rg); // Find the first node which is selected Node* FirstSelectedNode = Sel.FindFirst(); // The first selected node should not ever be NULL ENSURE(FirstSelectedNode != NULL, "The OpPutToBack's GetState fn has not done a very good job"); // Make sure we are dealing with a NodeRenderable ENSURE (FirstSelectedNode->IsKindOf(CC_RUNTIME_CLASS(NodeRenderableBounded)), "Selected node not a NodeRenderableBounded"); // We can only do something if there are any selected nodes if (FirstSelectedNode != NULL) { if (!DoStartSelOp(FALSE,FALSE)) // Try to record the selection state , don't // render the blobs though, the invalidate // will take care of this. { goto EndOperation; } // We need to invalidate the region if (!DoInvalidateNodesRegions(Sel, TRUE, FALSE, FALSE, FALSE)) { goto EndOperation; } Node* CurrentNode; CurrentNode = FirstSelectedNode; // Find the spread that the selection lies on // Spread* pSpread = CurrentNode->FindParentSpread(); // RangeControl LyrCntrl = { TRUE, FALSE, FALSE }; // Selected + don't cross layers Range LayerRange; Node* PrevSelNode; Node* NextSelNode; Node* SrchNode; // Used for searching for nodes which overlap BOOL Intersects; // Flag which indicates if there is a node which intersects the // current node. BOOL PassedPrevSel; Node* LastSelectedOnLayer=NULL; // Loop for all layers while (CurrentNode != NULL) { // Create a range of the selected nodes on this layer Range temp(CurrentNode, NULL, RangeControl(TRUE,FALSE,FALSE,FALSE,FALSE,FALSE,FALSE,TRUE) ); LayerRange = temp; // LayerRange = Range(CurrentNode, // NULL, // RangeControl(TRUE,FALSE,FALSE,FALSE,FALSE,FALSE,FALSE,TRUE) ); PrevSelNode = NULL; // We never ever move a node further backward than the previously // processed node (This is to maintain the relative Z-Order of the // nodes). // loop until there are no more selected nodes on this layer while (CurrentNode != NULL) { // Make sure we are dealing with a NodeRenderableBounded ENSURE (CurrentNode->IsKindOf(CC_RUNTIME_CLASS(NodeRenderableBounded)), "Selected node not a NodeRenderableBounded"); // The current node will probably be moving very shortly, so lets find out the next node // which needs to be processed now. We could do this after the node has been moved but // this would be less than optimal. NextSelNode = LayerRange.FindNext(CurrentNode); // We first need to decide where the CurrentNode is to be moved to, if it is to be // moved at all. // ------------------------------------------------------------------------- // See if there is a node which is intersecting the current node Intersects = FALSE; PassedPrevSel = FALSE; DocRect CurrentsBounds = ((NodeRenderableBounded*)CurrentNode)->GetBoundingRect(); SrchNode = CurrentNode->FindPrevious(); while (SrchNode != NULL) { if (SrchNode->IsAnObject()) // Ignore Hidden/Insertion nodes { if (SrchNode == PrevSelNode) { PassedPrevSel = TRUE; // carry on searching } if (((NodeRenderableBounded*)SrchNode)->GetBoundingRect().IsIntersectedWith (CurrentsBounds)) { Intersects = TRUE; break; } } SrchNode = SrchNode->FindPrevious(); } // ------------------------------------------------------------------------- // If there is a node which intersects: Then either insert the node as previous // sibling of this node, or as a next sibling of the previously processed node // (whichever is higher). Node* ObjPrevCurrent = CurrentNode->FindPrevious(CC_RUNTIME_CLASS(NodeRenderableInk)); if (Intersects) { if (PassedPrevSel) // We cannot insert the node behind the node which // it overlaps. This would destroy the relative // Z order ! { if (PrevSelNode != ObjPrevCurrent) { // Insert the node as a next sibling of the previously processed node ((NodeRenderableBounded*)CurrentNode)->ReleaseCached(TRUE, FALSE, FALSE, TRUE); if (!DoMoveNode((NodeRenderableBounded*)CurrentNode, PrevSelNode, NEXT)) goto EndOperation; ((NodeRenderableBounded*)CurrentNode)->ReleaseCached(TRUE, FALSE, FALSE, TRUE); CurrentNode->SetSelected(TRUE); } // else the node is already in the correct position as a next sibling of the // previously processed node. } else { // Insert the node as a previous sibling of the node which it currently overlaps. ((NodeRenderableBounded*)CurrentNode)->ReleaseCached(TRUE, FALSE, FALSE, TRUE); if (!DoMoveNode((NodeRenderableBounded*)CurrentNode, SrchNode, PREV)) goto EndOperation; ((NodeRenderableBounded*)CurrentNode)->ReleaseCached(TRUE, FALSE, FALSE, TRUE); CurrentNode->SetSelected(TRUE); } } else // No node intersects with the current node { // There is no overlapping node, so move the node one position, or do not move it // at all if the prev node is the previously moved node, or if the node is // already at the tail of the list. if (PrevSelNode != ObjPrevCurrent) { ((NodeRenderableBounded*)CurrentNode)->ReleaseCached(TRUE, FALSE, FALSE, TRUE); if (!DoMoveNode((NodeRenderableBounded*)CurrentNode, ObjPrevCurrent, PREV)) goto EndOperation; ((NodeRenderableBounded*)CurrentNode)->ReleaseCached(TRUE, FALSE, FALSE, TRUE); CurrentNode->SetSelected(TRUE); } // else either // - Current node is the next selected sibling of PrevSelNode so don't move it. // - or current node is already at the tail of the list so don't move it } PrevSelNode = CurrentNode; LastSelectedOnLayer = CurrentNode; CurrentNode = NextSelNode; // Get next node } // Process the next layer ENSURE(LayerRange.FindNext(LastSelectedOnLayer) == NULL, "Current should be the last selected node on the layer"); CurrentNode = Sel.FindNext(LastSelectedOnLayer); } // We need to invalidate the region if (!DoInvalidateNodesRegions(*(GetApplication()->FindSelection()), TRUE, FALSE, FALSE, FALSE)) { goto EndOperation; } } EndOperation: GetApplication()->UpdateSelection(); End(); // End of operation #endif // WEBSTER }

BOOL OpMoveBackwards::Init (  void   )  [static]

OpMoveBackwards initialiser method. Author: Simon_Maneggio (Xara Group Ltd) <camelotdev@xara.com> Date: 28/9/93 Parameters: -  [INPUTS] -  [OUTPUTS] Returns: TRUE if the operation could be successfully initialised FALSE if no more memory could be allocated Errors: ERROR will be called if there was insufficient memory to allocate the operation. See also: - Reimplemented from SimpleCCObject. Definition at line 1652 of file zordops.cpp. { return (RegisterOpDescriptor(0, _R(IDS_MOVEBACKWARDSOP), CC_RUNTIME_CLASS(OpMoveBackwards), OPTOKEN_MOVEBACKWARDS, OpPutToBack::GetState, 0, /* help ID */ _R(IDBBL_MOVEBACKWARDSOP), 0, /* bitmap ID */ 0, SYSTEMBAR_ILLEGAL, // For now ! TRUE, // Receive messages FALSE, FALSE, 0, (GREY_WHEN_NO_CURRENT_DOC | GREY_WHEN_NO_SELECTION) )); }

virtual BOOL OpMoveBackwards::MayChangeNodeBounds (   )  const [inline, virtual]

Reimplemented from SelOperation. Definition at line 231 of file zordops.h. { return FALSE; }

---

The documentation for this class was generated from the following files:

• Kernel/zordops.h (r1785/r1282)
• Kernel/zordops.cpp (r1785/r1282)

---