FilesExpand file tree

 single-window

/

undoredo.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

168 lines (144 loc) · 4.62 KB

 single-window

/

undoredo.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

168 lines (144 loc) · 4.62 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91

92

93

94

95

96

97

98

99

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

//-----------------------------------------------------------------------------

// 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.

//-----------------------------------------------------------------------------

#include "solvespace.h"

void SolveSpaceUI::UndoRemember() {

unsaved = true;

PushFromCurrentOnto(&undo);

UndoClearStack(&redo);

UndoEnableMenus();

}

void SolveSpaceUI::UndoUndo() {

if(undo.cnt <= 0) return;

PushFromCurrentOnto(&redo);

PopOntoCurrentFrom(&undo);

UndoEnableMenus();

}

void SolveSpaceUI::UndoRedo() {

if(redo.cnt <= 0) return;

PushFromCurrentOnto(&undo);

PopOntoCurrentFrom(&redo);

UndoEnableMenus();

}

void SolveSpaceUI::UndoEnableMenus() {

EnableMenuByCmd(Command::UNDO, undo.cnt > 0);

EnableMenuByCmd(Command::REDO, redo.cnt > 0);

}

void SolveSpaceUI::PushFromCurrentOnto(UndoStack *uk) {

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]);

*ut = {};

for(i = 0; i < SK.group.n; i++) {

Group *src = &(SK.group.elem[i]);

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;

dest.solved = {};

dest.polyLoops = {};

dest.bezierLoops = {};

dest.bezierOpens = {};

dest.polyError = {};

dest.thisMesh = {};

dest.runningMesh = {};

dest.thisShell = {};

dest.runningShell = {};

dest.displayMesh = {};

dest.displayOutlines = {};

dest.remap = {};

src->remap.DeepCopyInto(&(dest.remap));

dest.impMesh = {};

dest.impShell = {};

dest.impEntity = {};

ut->group.Add(&dest);

}

for(i = 0; i < SK.groupOrder.n; i++) {

ut->groupOrder.Add(&(SK.groupOrder.elem[i]));

}

for(i = 0; i < SK.request.n; i++) {

ut->request.Add(&(SK.request.elem[i]));

}

for(i = 0; i < SK.constraint.n; i++) {

Constraint *src = &(SK.constraint.elem[i]);

Constraint dest = *src;

ut->constraint.Add(&dest);

}

for(i = 0; i < SK.param.n; i++) {

ut->param.Add(&(SK.param.elem[i]));

}

for(i = 0; i < SK.style.n; i++) {

ut->style.Add(&(SK.style.elem[i]));

}

ut->activeGroup = SS.GW.activeGroup;

uk->write = WRAP(uk->write + 1, MAX_UNDO);

}

void SolveSpaceUI::PopOntoCurrentFrom(UndoStack *uk) {

int i;

ssassert(uk->cnt > 0, "Cannot pop from empty undo stack");

(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

for(i = 0; i < SK.groupOrder.n; i++) {

Group *g = SK.GetGroup(SK.groupOrder.elem[i]);

g->Clear();

}

SK.group.Clear();

SK.groupOrder.Clear();

SK.request.Clear();

SK.constraint.Clear();

SK.param.Clear();

SK.style.Clear();

// And then do a shallow copy of the state from the undo list

ut->group.MoveSelfInto(&(SK.group));

for(i = 0; i < ut->groupOrder.n; i++)

SK.groupOrder.Add(&ut->groupOrder.elem[i]);

ut->request.MoveSelfInto(&(SK.request));

ut->constraint.MoveSelfInto(&(SK.constraint));

ut->param.MoveSelfInto(&(SK.param));

ut->style.MoveSelfInto(&(SK.style));

SS.GW.activeGroup = ut->activeGroup;

// No need to free it, since a shallow copy was made above

*ut = {};

// And reset the state everywhere else in the program, since the

// sketch just changed a lot.

SS.GW.ClearSuper();

SS.TW.ClearSuper();

SS.ReloadAllImported();

SS.GenerateAll(SolveSpaceUI::Generate::ALL);

SS.ScheduleShowTW();

// Activate the group that was active before.

Group *activeGroup = SK.GetGroup(SS.GW.activeGroup);

activeGroup->Activate();

}

void SolveSpaceUI::UndoClearStack(UndoStack *uk) {

while(uk->cnt > 0) {

uk->write = WRAP(uk->write - 1, MAX_UNDO);

(uk->cnt)--;

UndoClearState(&(uk->d[uk->write]));

}

*uk = {}; // for good measure

}

void SolveSpaceUI::UndoClearState(UndoState *ut) {

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();

ut->style.Clear();

*ut = {};

}