Add new resizable lrucache

Author: Fletterio

include/nbl/core/containers/LRUCache.h

@@ -389,9 +389,23 @@ class ResizableLRUCache : protected impl::LRUCacheBase<Key, Value, MapHash, MapE
 	*/
 	inline bool grow(uint32_t newCapacity)
 	{
+		m_shortcut_map.reserve(newCapacity);
 		return base_t::m_list.grow(newCapacity);
 	}
 
+	/**
+	* @brief Empties cache and resets its state
+	*/
+	inline void clear()
+	{
+		base_t::searchedKey = nullptr;
+		base_t::m_list.clear();
+
+		auto mapBegin = m_shortcut_map.begin();
+		auto mapEnd = m_shortcut_map.end();
+		m_shortcut_map.erase(mapBegin, mapEnd);
+	}
+
 protected:
 	unordered_set<uint32_t, WrapHash, WrapEquals> m_shortcut_map;
 };

include/nbl/core/containers/lists/common.h

@@ -67,6 +67,19 @@ class ContiguousMemoryLinkedListBase
 		insertAt(reserveAddress(), value_t(std::forward<Args>(args)...));
 	}
 
+	/**
+	* @brief Resets list to initial state.
+	*/
+	inline void clear()
+	{
+		disposeAll();
+
+		m_addressAllocator = std::unique_ptr<address_allocator_t>(new address_allocator_t(m_reservedSpace, 0u, 0u, 1u, m_cap, 1u));
+		m_back = invalid_iterator;
+		m_begin = invalid_iterator;
+
+	}
+
 	//remove the last element in the list
 	virtual void popBack() = 0;
 
@@ -117,17 +130,7 @@ class ContiguousMemoryLinkedListBase
 
 	~ContiguousMemoryLinkedListBase()
 	{
-		if (m_dispose_f && m_begin != invalid_iterator)
-		{
-			auto* begin = getBegin();
-			auto* back = getBack();
-			while(begin != back)
-			{
-				m_dispose_f(begin->data);
-				begin = get(begin->next);
-			}
-			m_dispose_f(back->data);
-		}
+		disposeAll();
 		_NBL_ALIGNED_FREE(m_reservedSpace);
 	}
 
@@ -148,6 +151,24 @@ class ContiguousMemoryLinkedListBase
 		return addr;
 	}
 
+	/**
+	* @brief Calls disposal function on all elements of the list.
+	*/
+	inline void disposeAll()
+	{
+		if (m_dispose_f && m_begin != invalid_iterator)
+		{
+			auto* begin = getBegin();
+			auto* back = getBack();
+			while (begin != back)
+			{
+				m_dispose_f(begin->data);
+				begin = get(begin->next);
+			}
+			m_dispose_f(back->data);
+		}
+	}
+
 	//create a new node which stores data at already allocated address, 
 	virtual void insertAt(uint32_t addr, value_t&& val) = 0;