fixed CompactASetExtensions leaking deltas until next update

Author: luithefirst

src/Aardvark.Rendering/Resources/Adaptive/AdaptiveCompactBuffer.fs

@@ -25,7 +25,6 @@ module internal CompactBufferImplementation =
         let count = ASet.count input
         let compact = ASet.compact input
         let reader = compact.GetReader()
-        let removals = List()
 
         member inline private x.Transact =
             if x.ProcessDeltasInTransaction then transact
@@ -64,6 +63,8 @@ module internal CompactBufferImplementation =
             // Process deltas
             x.Transact (fun _ ->
 
+                let removals = List(ops.Count)
+
                 for o in ops do
                     match o with
                     | value, Set index ->
@@ -74,8 +75,7 @@ module internal CompactBufferImplementation =
 
                 // Process removals after sets to prevent potential reaquiring of resources
                 for r in removals do
-                    x.Remove r    
-                removals.Clear()
+                    x.Remove r
             )
 
             x.Update(t)

src/Aardvark.Rendering/Utilities/CompactSet.fs

@@ -18,18 +18,13 @@ module CompactASetExtensions =
             let mutable keys : 'T[] = Array.empty
 
             let reader = input.GetReader()
-            let added = List()
-            let removed = List()
-            let deltas = List<'T * ElementOperation<int>>()
-            let free = Queue<int>()
 
             AMap.custom (fun token indices ->
-                added.Clear()
-                removed.Clear()
-                deltas.Clear()
-
                 let ops = reader.GetChanges token
 
+                let added = List(ops.Count)
+                let removed = List(ops.Count)
+
                 for o in ops do
                     match o with
                     | Add(_, value) -> value |> added.Add |> ignore
@@ -42,6 +37,9 @@ module CompactASetExtensions =
                 // If we remove more values than we add, we have to move some elements from the end (potentially all of them).
                 let moving = HashSet([newCount .. newCount - (delta + 1)])
 
+                let free = Queue<int>(removed.Count)
+                let deltas = List<'T * ElementOperation<int>>(added.Count + removed.Count + moving.Count)
+
                 // Remove
                 for key in removed do
                     deltas.Add(key, Remove)