diff --git a/Source/Engine/Utilities/RectPack.h b/Source/Engine/Utilities/RectPack.h
index 1662b4fec..1811684ea 100644
--- a/Source/Engine/Utilities/RectPack.h
+++ b/Source/Engine/Utilities/RectPack.h
@@ -25,9 +25,6 @@ struct RectPack
     SizeType Width;
     SizeType Height;
 
-    // The remaining space amount inside this slot (updated on every insertion, initial it equal to width*height).
-    SizeType SpaceLeft;
-
     // True, if slot has been allocated, otherwise it's free.
     bool IsUsed;
 
@@ -45,7 +42,6 @@ struct RectPack
         , Y(y)
         , Width(width)
         , Height(height)
-        , SpaceLeft(width * height)
         , IsUsed(false)
     {
     }
@@ -73,16 +69,6 @@ struct RectPack
     NodeType* Insert(SizeType itemWidth, SizeType itemHeight, SizeType itemPadding, Args&&...args)
     {
         NodeType* result;
-        const SizeType paddedWidth = itemWidth + itemPadding;
-        const SizeType paddedHeight = itemHeight + itemPadding;
-        const SizeType paddedSize = paddedWidth * paddedHeight;
-
-        // Check if there is enough space to fix that item within this slot
-        if (SpaceLeft < paddedSize)
-        {
-            // Not enough space
-            return nullptr;
-        }
 
         // If there are left and right slots there are empty regions around this slot (it also means this slot is occupied)
         if (Left || Right)
@@ -91,25 +77,22 @@ struct RectPack
             {
                 result = Left->Insert(itemWidth, itemHeight, itemPadding, Forward<Args>(args)...);
                 if (result)
-                {
-                    SpaceLeft -= paddedSize;
                     return result;
-                }
             }
             if (Right)
             {
                 result = Right->Insert(itemWidth, itemHeight, itemPadding, Forward<Args>(args)...);
                 if (result)
-                {
-                    SpaceLeft -= paddedSize;
                     return result;
-                }
             }
 
             // Not enough space
             return nullptr;
         }
 
+        const SizeType paddedWidth = itemWidth + itemPadding;
+        const SizeType paddedHeight = itemHeight + itemPadding;
+
         // This slot can't fit or has been already occupied
         if (IsUsed || paddedWidth > Width || paddedHeight > Height)
         {
@@ -122,7 +105,6 @@ struct RectPack
         {
             // Insert into this slot
             IsUsed = true;
-            SpaceLeft -= paddedSize;
             result = (NodeType*)this;
             result->OnInsert(Forward<Args>(args)...);
             return result;
@@ -152,9 +134,20 @@ struct RectPack
 
         // Insert into this slot
         IsUsed = true;
-        SpaceLeft -= paddedSize;
         result = (NodeType*)this;
         result->OnInsert(Forward<Args>(args)...);
         return result;
     }
+
+    /// <summary>
+    /// Frees the node.
+    /// </summary>
+    /// <returns>The node that contains inserted an item or null if failed to find a free space.</returns>
+    template<class... Args>
+    void Free(Args&&...args)
+    {
+        ASSERT(IsUsed);
+        IsUsed = false;
+        ((NodeType*)this)->OnFree(Forward<Args>(args)...);
+    }
 };