2013-07-28 22:08:34 +00:00
|
|
|
//-----------------------------------------------------------------------------
|
|
|
|
// The user-visible undo/redo operation; whenever they change something, we
|
|
|
|
// record our state and push it on a stack, and we pop the stack when they
|
|
|
|
// select undo.
|
|
|
|
//
|
|
|
|
// Copyright 2008-2013 Jonathan Westhues.
|
|
|
|
//-----------------------------------------------------------------------------
|
2008-06-04 10:22:30 +00:00
|
|
|
#include "solvespace.h"
|
|
|
|
|
2016-05-05 05:54:05 +00:00
|
|
|
void SolveSpaceUI::UndoRemember() {
|
2008-06-30 09:09:17 +00:00
|
|
|
unsaved = true;
|
2008-06-04 10:22:30 +00:00
|
|
|
PushFromCurrentOnto(&undo);
|
|
|
|
UndoClearStack(&redo);
|
|
|
|
UndoEnableMenus();
|
|
|
|
}
|
|
|
|
|
2016-05-05 05:54:05 +00:00
|
|
|
void SolveSpaceUI::UndoUndo() {
|
2008-06-04 10:22:30 +00:00
|
|
|
if(undo.cnt <= 0) return;
|
|
|
|
|
|
|
|
PushFromCurrentOnto(&redo);
|
|
|
|
PopOntoCurrentFrom(&undo);
|
|
|
|
UndoEnableMenus();
|
|
|
|
}
|
|
|
|
|
2016-05-05 05:54:05 +00:00
|
|
|
void SolveSpaceUI::UndoRedo() {
|
2008-06-04 10:22:30 +00:00
|
|
|
if(redo.cnt <= 0) return;
|
|
|
|
|
|
|
|
PushFromCurrentOnto(&undo);
|
|
|
|
PopOntoCurrentFrom(&redo);
|
|
|
|
UndoEnableMenus();
|
|
|
|
}
|
|
|
|
|
2016-05-05 05:54:05 +00:00
|
|
|
void SolveSpaceUI::UndoEnableMenus() {
|
2008-06-04 10:22:30 +00:00
|
|
|
EnableMenuById(GraphicsWindow::MNU_UNDO, undo.cnt > 0);
|
|
|
|
EnableMenuById(GraphicsWindow::MNU_REDO, redo.cnt > 0);
|
|
|
|
}
|
|
|
|
|
2015-03-23 17:49:04 +00:00
|
|
|
void SolveSpaceUI::PushFromCurrentOnto(UndoStack *uk) {
|
2008-06-04 10:22:30 +00:00
|
|
|
int i;
|
|
|
|
|
|
|
|
if(uk->cnt == MAX_UNDO) {
|
|
|
|
UndoClearState(&(uk->d[uk->write]));
|
|
|
|
// And then write in to this one again
|
|
|
|
} else {
|
|
|
|
(uk->cnt)++;
|
|
|
|
}
|
|
|
|
|
|
|
|
UndoState *ut = &(uk->d[uk->write]);
|
2015-03-27 15:31:23 +00:00
|
|
|
*ut = {};
|
2009-04-19 05:53:16 +00:00
|
|
|
for(i = 0; i < SK.group.n; i++) {
|
|
|
|
Group *src = &(SK.group.elem[i]);
|
2008-06-04 10:22:30 +00:00
|
|
|
Group dest = *src;
|
|
|
|
// And then clean up all the stuff that needs to be a deep copy,
|
|
|
|
// and zero out all the dynamic stuff that will get regenerated.
|
|
|
|
dest.clean = false;
|
2015-03-27 15:31:23 +00:00
|
|
|
dest.solved = {};
|
|
|
|
dest.polyLoops = {};
|
|
|
|
dest.bezierLoops = {};
|
|
|
|
dest.bezierOpens = {};
|
|
|
|
dest.polyError = {};
|
|
|
|
dest.thisMesh = {};
|
|
|
|
dest.runningMesh = {};
|
|
|
|
dest.thisShell = {};
|
|
|
|
dest.runningShell = {};
|
|
|
|
dest.displayMesh = {};
|
|
|
|
dest.displayEdges = {};
|
2016-03-14 16:14:24 +00:00
|
|
|
dest.displayOutlines = {};
|
2015-03-27 15:31:23 +00:00
|
|
|
|
|
|
|
dest.remap = {};
|
2008-06-04 10:22:30 +00:00
|
|
|
src->remap.DeepCopyInto(&(dest.remap));
|
|
|
|
|
2015-03-27 15:31:23 +00:00
|
|
|
dest.impMesh = {};
|
|
|
|
dest.impShell = {};
|
|
|
|
dest.impEntity = {};
|
2008-06-04 10:22:30 +00:00
|
|
|
ut->group.Add(&dest);
|
|
|
|
}
|
2016-02-17 10:03:07 +00:00
|
|
|
for(i = 0; i < SK.groupOrder.n; i++) {
|
|
|
|
ut->groupOrder.Add(&(SK.groupOrder.elem[i]));
|
|
|
|
}
|
2009-04-19 05:53:16 +00:00
|
|
|
for(i = 0; i < SK.request.n; i++) {
|
|
|
|
ut->request.Add(&(SK.request.elem[i]));
|
2008-06-04 10:22:30 +00:00
|
|
|
}
|
2009-04-19 05:53:16 +00:00
|
|
|
for(i = 0; i < SK.constraint.n; i++) {
|
|
|
|
Constraint *src = &(SK.constraint.elem[i]);
|
2008-06-04 10:22:30 +00:00
|
|
|
Constraint dest = *src;
|
2015-03-27 15:31:23 +00:00
|
|
|
dest.dogd = {};
|
2008-06-04 10:22:30 +00:00
|
|
|
ut->constraint.Add(&dest);
|
|
|
|
}
|
2009-04-19 05:53:16 +00:00
|
|
|
for(i = 0; i < SK.param.n; i++) {
|
|
|
|
ut->param.Add(&(SK.param.elem[i]));
|
2008-06-04 10:22:30 +00:00
|
|
|
}
|
2009-09-17 07:32:36 +00:00
|
|
|
for(i = 0; i < SK.style.n; i++) {
|
|
|
|
ut->style.Add(&(SK.style.elem[i]));
|
|
|
|
}
|
2008-06-04 10:22:30 +00:00
|
|
|
ut->activeGroup = SS.GW.activeGroup;
|
|
|
|
|
|
|
|
uk->write = WRAP(uk->write + 1, MAX_UNDO);
|
|
|
|
}
|
|
|
|
|
2015-03-23 17:49:04 +00:00
|
|
|
void SolveSpaceUI::PopOntoCurrentFrom(UndoStack *uk) {
|
2016-02-17 10:03:07 +00:00
|
|
|
int i;
|
|
|
|
|
2016-05-18 22:51:36 +00:00
|
|
|
ssassert(uk->cnt > 0, "Cannot pop from empty undo stack");
|
2008-06-04 10:22:30 +00:00
|
|
|
(uk->cnt)--;
|
|
|
|
uk->write = WRAP(uk->write - 1, MAX_UNDO);
|
|
|
|
|
|
|
|
UndoState *ut = &(uk->d[uk->write]);
|
|
|
|
|
|
|
|
// Free everything in the main copy of the program before replacing it
|
2016-02-17 10:03:07 +00:00
|
|
|
for(i = 0; i < SK.groupOrder.n; i++) {
|
|
|
|
Group *g = SK.GetGroup(SK.groupOrder.elem[i]);
|
2010-02-28 19:23:01 +00:00
|
|
|
g->Clear();
|
2008-06-04 10:22:30 +00:00
|
|
|
}
|
2009-04-19 05:53:16 +00:00
|
|
|
SK.group.Clear();
|
2016-02-17 10:03:07 +00:00
|
|
|
SK.groupOrder.Clear();
|
2009-04-19 05:53:16 +00:00
|
|
|
SK.request.Clear();
|
|
|
|
SK.constraint.Clear();
|
|
|
|
SK.param.Clear();
|
2009-09-17 07:32:36 +00:00
|
|
|
SK.style.Clear();
|
2008-06-04 10:22:30 +00:00
|
|
|
|
|
|
|
// And then do a shallow copy of the state from the undo list
|
2009-04-19 05:53:16 +00:00
|
|
|
ut->group.MoveSelfInto(&(SK.group));
|
2016-02-17 10:03:07 +00:00
|
|
|
for(i = 0; i < ut->groupOrder.n; i++)
|
|
|
|
SK.groupOrder.Add(&ut->groupOrder.elem[i]);
|
2009-04-19 05:53:16 +00:00
|
|
|
ut->request.MoveSelfInto(&(SK.request));
|
|
|
|
ut->constraint.MoveSelfInto(&(SK.constraint));
|
|
|
|
ut->param.MoveSelfInto(&(SK.param));
|
2009-09-17 07:32:36 +00:00
|
|
|
ut->style.MoveSelfInto(&(SK.style));
|
2008-06-04 10:22:30 +00:00
|
|
|
SS.GW.activeGroup = ut->activeGroup;
|
|
|
|
|
|
|
|
// No need to free it, since a shallow copy was made above
|
2015-03-27 15:31:23 +00:00
|
|
|
*ut = {};
|
2008-06-04 10:22:30 +00:00
|
|
|
|
|
|
|
// And reset the state everywhere else in the program, since the
|
|
|
|
// sketch just changed a lot.
|
|
|
|
SS.GW.ClearSuper();
|
|
|
|
SS.TW.ClearSuper();
|
|
|
|
SS.ReloadAllImported();
|
2016-01-27 09:09:45 +00:00
|
|
|
SS.GenerateAll(SolveSpaceUI::GENERATE_ALL);
|
2015-03-18 17:02:11 +00:00
|
|
|
SS.ScheduleShowTW();
|
2015-11-01 16:26:55 +00:00
|
|
|
|
|
|
|
// Activate the group that was active before.
|
2016-02-17 10:03:07 +00:00
|
|
|
Group *activeGroup = SK.GetGroup(SS.GW.activeGroup);
|
2015-11-01 16:26:55 +00:00
|
|
|
activeGroup->Activate();
|
2008-06-04 10:22:30 +00:00
|
|
|
}
|
|
|
|
|
2015-03-23 17:49:04 +00:00
|
|
|
void SolveSpaceUI::UndoClearStack(UndoStack *uk) {
|
2008-06-04 10:22:30 +00:00
|
|
|
while(uk->cnt > 0) {
|
|
|
|
uk->write = WRAP(uk->write - 1, MAX_UNDO);
|
|
|
|
(uk->cnt)--;
|
|
|
|
UndoClearState(&(uk->d[uk->write]));
|
|
|
|
}
|
2015-03-27 15:31:23 +00:00
|
|
|
*uk = {}; // for good measure
|
2008-06-04 10:22:30 +00:00
|
|
|
}
|
|
|
|
|
2015-03-23 17:49:04 +00:00
|
|
|
void SolveSpaceUI::UndoClearState(UndoState *ut) {
|
2008-06-04 10:22:30 +00:00
|
|
|
int i;
|
|
|
|
for(i = 0; i < ut->group.n; i++) {
|
|
|
|
Group *g = &(ut->group.elem[i]);
|
|
|
|
|
|
|
|
g->remap.Clear();
|
|
|
|
}
|
|
|
|
ut->group.Clear();
|
|
|
|
ut->request.Clear();
|
|
|
|
ut->constraint.Clear();
|
|
|
|
ut->param.Clear();
|
2009-09-17 07:32:36 +00:00
|
|
|
ut->style.Clear();
|
2015-03-27 15:31:23 +00:00
|
|
|
*ut = {};
|
2008-06-04 10:22:30 +00:00
|
|
|
}
|
|
|
|
|