summaryrefslogtreecommitdiff
path: root/src/createcalls.cpp
diff options
context:
space:
mode:
authorFox Caminiti <fox@foxcam.net>2023-02-11 17:37:49 -0500
committerFox Caminiti <fox@foxcam.net>2023-02-11 17:37:49 -0500
commitbd25daeae033e4f905ae0145831a7d8fdd92e471 (patch)
tree7e602f31449d8eb58212a028e91e7eb32e4bbf84 /src/createcalls.cpp
parent52c6ad3f2686cb66a8954ca5dac7f3eba4676cc3 (diff)
v4.0
Diffstat (limited to 'src/createcalls.cpp')
-rw-r--r--src/createcalls.cpp4
1 files changed, 4 insertions, 0 deletions
diff --git a/src/createcalls.cpp b/src/createcalls.cpp
index fc50b6e..56cf4d8 100644
--- a/src/createcalls.cpp
+++ b/src/createcalls.cpp
@@ -690,6 +690,10 @@ Property_IsGraphSelected(memory *Memory, property_channel *Property, uint16 *Arr
return 0;
}
+// TODO(fox): It seems like duping many layers at once causes this to take up
+// exponentially more data on the undo tree than it should. Rewrite the loop to
+// change the offsets before duping, taking into account all dupes, like what
+// the sorting code does.
// TODO(fox): Add different modes (all dupes on top, each dupe above its layer, two for bottom)
static void
Sort_OffsetDupes(memory *Memory, sorted_layer_array *SortedLayerStart, block_layer *StartLayer,