OpMoveForwards Class Reference

This class represents the OpMoveForwards operation. More...

#include <zordops.h>

Inheritance diagram for OpMoveForwards:

List of all members.

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

---

Detailed Description

This class represents the OpMoveForwards operation.

Author:

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

Date:

9/7/93

See also:

OpBringToFront

OpPutToBack

OpMoveBackwards Documentation: specs.doc

Definition at line 190 of file zordops.h.

---

Constructor & Destructor Documentation

OpMoveForwards::OpMoveForwards (   )

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

---

Member Function Documentation

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

Performs the MoveForwards 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 1322 of file zordops.cpp. { #ifdef WEBSTER OpState OpSt; String_256 DisableReason; SelRange* Sel = GetApplication()->FindSelection(); Node* pSelNode = Sel->FindLast(); // 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->FindNext(); // Get the node after this node // If the next node is an unselected object, then we can move this object to the front 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 follows this layer do { pLayer = pLayer->FindNextLayer(TRUE); pNode = FindFirstObject(pLayer); } while (pLayer != NULL && pNode == NULL); // If the next node is an unselected object, then we can move this object to the front if (pNode != NULL && pNode->IsAnObject() && !pNode->IsSelected()) pContextNode = pNode; } } pNode = pSelNode; // Try the next selected node. pSelNode = Sel->FindPrev(pSelNode); if (pContextNode != NULL && !SelNodeFound) { if (!DoMoveNode(pNode, pContextNode, NEXT)) 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())); 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; } // Find the spread that the selection lies in // Spread* pSpread = FirstSelectedNode->FindParentSpread(); // RangeControl LyrCntrl = { TRUE, FALSE, FALSE }; // Selected + don't cross layers Range LayerRange; Node* NextLayerFirstSelectedNode; // Loop for all layers // FirstSelectedNode points to the first node in the range on the layer we are currently // processing while (FirstSelectedNode != NULL) { // Create a range of selected nodes on this layer Range temp(FirstSelectedNode, NULL, RangeControl(TRUE,FALSE,FALSE,FALSE,FALSE,FALSE,FALSE,TRUE) ); LayerRange = temp; // LayerRange = Range(FirstSelectedNode, // NULL, // RangeControl(TRUE,FALSE,FALSE,FALSE,FALSE,FALSE,FALSE,TRUE) ); // Find the last selected node on the layer Node* TempSelNode = FirstSelectedNode; Node* LastSelectedNode = NULL; while (TempSelNode != NULL) { LastSelectedNode = TempSelNode; // At end of loop will hold // the last node selected. TempSelNode = LayerRange.FindNext(TempSelNode); } // Obtain the first node in the range of the next layer, // store it away until it's required NextLayerFirstSelectedNode = Sel.FindNext(LastSelectedNode); // We are going to start at the tail of the list i.e. at the node with the highest // Z-order. Node* CurrentNode = LastSelectedNode; Node* PrevSelNode = NULL; // We never ever move a node further forward than the previously // processed node (This is to maintain the relative Z-Order of the // nodes). Node* NextSelNode; Node* SrchNode; // Used for searching for nodes which overlap BOOL Intersects; // Flag which indicates if there is a node which overlaps the // current node. BOOL PassedPrevSel; // loop until there are no more selected nodes while (CurrentNode != NULL) { // Make sure we are dealing with a NodeRenderableBounded ENSURE (CurrentNode->IsAnObject(), "Selected node not a NodeRenderableInk"); // 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.FindPrev (CurrentNode, FALSE); // 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 overlapping the current node Intersects = FALSE; PassedPrevSel = FALSE; SrchNode = CurrentNode->FindNext(); DocRect CurrentBounds = ((NodeRenderableBounded*)CurrentNode)->GetBoundingRect(); while (SrchNode != NULL) { if (SrchNode->IsAnObject()) // Ignore hidden nodes/ Insertion node etc. { if (SrchNode == PrevSelNode) { PassedPrevSel = TRUE; // carry on searching } if (((NodeRenderableBounded*)SrchNode)->GetBoundingRect().IsIntersectedWith (CurrentBounds)) { Intersects = TRUE; break; } } SrchNode = SrchNode->FindNext(); } // ------------------------------------------------------------------------- // If there is a node which overlaps: then either insert the node as a next sibling of this // node, or as a previous sibling of the previously processed node (whichever is lower). if (Intersects) { if (PassedPrevSel) // We cannot insert the node in front of the node which // overlaps it. This would destroy the relative // Z order ! { if (PrevSelNode->FindPrevious(CC_RUNTIME_CLASS(NodeRenderableInk)) != CurrentNode) { // Insert the node as a previous sibling of the previously processed node ((NodeRenderableBounded*)CurrentNode)->ReleaseCached(TRUE, FALSE, FALSE, TRUE); if (!DoMoveNode(CurrentNode, PrevSelNode, PREV)) goto EndOperation; ((NodeRenderableBounded*)CurrentNode)->ReleaseCached(TRUE, FALSE, FALSE, TRUE); CurrentNode->SetSelected(TRUE); } // else the node is already in the correct position behind the previously // processed node. } else { // Insert the node after the node which intersects it. ((NodeRenderableBounded*)CurrentNode)->ReleaseCached(TRUE, FALSE, FALSE, TRUE); if (!DoMoveNode(CurrentNode, SrchNode, NEXT)) 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 next node is the previously moved node, or if the node is // already at the front of the list. Node* NextObjAfterCurrent = CurrentNode->FindNext(CC_RUNTIME_CLASS(NodeRenderableInk)); if (NextObjAfterCurrent != PrevSelNode) { ((NodeRenderableBounded*)CurrentNode)->ReleaseCached(TRUE, FALSE, FALSE, TRUE); if (!DoMoveNode(CurrentNode,NextObjAfterCurrent, NEXT)) goto EndOperation; ((NodeRenderableBounded*)CurrentNode)->ReleaseCached(TRUE, FALSE, FALSE, TRUE); CurrentNode->SetSelected(TRUE); } // else either // -Current node is the previous selected sibling of PrevSelNode so don't move it. // -or the current node is already at the head of the list so don't move it } PrevSelNode = CurrentNode; CurrentNode = NextSelNode; // Get next node } // Process the next layer FirstSelectedNode = NextLayerFirstSelectedNode; } // 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 OpMoveForwards::Init (  void   )  [static]

OpMoveForwards 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 1281 of file zordops.cpp. { return(RegisterOpDescriptor( 0, _R(IDS_MOVEFORWARDSOP), CC_RUNTIME_CLASS(OpMoveForwards), OPTOKEN_MOVEFORWARDS, OpBringToFront::GetState, // MoveForwards uses the getstate // fn of OpBringToFront 0, /* help ID */ _R(IDBBL_MOVEFORWARDSOP), 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 OpMoveForwards::MayChangeNodeBounds (   )  const [inline, virtual]

Reimplemented from SelOperation. Definition at line 202 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)

---