- A few Vulkan wrapper structs

- Framework for Vulkan context
 - Fixed a bug with dynarray where if `resize()` shrinks the array, destructors are not called.
 - Fixed grammar issues with the containers library and added property tables to existing data structures.

include/fennec/containers/deque.h

@@ -46,19 +46,19 @@ namespace fennec
 /// This behaves the similar to fennec::list, however it does not allow arbitrary access, insertion, or deletion.
 /// It is one of the few data structures in this library that is stable, i.e. pointers to elements do not change.
 ///
-/// | Property   | Value      |
-/// |:----------:|:----------:|
-/// | stable     |      ✅     |
-/// | dynamic    |      ✅     |
-/// | homogenous |      ✅     |
-/// | distinct   |      ⛔     |
-/// | ordered    |      ⛔     |
-/// | space      | \f$O(N)\f$ |
-/// | linear     |      ⛔     |
-/// | access     | \f$O(1)\f$ |
-/// | find       | \f$O(N)\f$ |
-/// | insertion  | \f$O(1)\f$ |
-/// | deletion   | \f$O(1)\f$ |
+/// | Property    | Value      |
+/// |:-----------:|:----------:|
+/// | stable      |     ✅     |
+/// | dynamic     |     ✅     |
+/// | homogeneous |     ✅     |
+/// | distinct    |     ⛔     |
+/// | ordered     |     ⛔     |
+/// | space       | \f$O(N)\f$ |
+/// | linear      |     ⛔     |
+/// | access      | \f$O(1)\f$ |
+/// | find        | \f$O(N)\f$ |
+/// | insertion   | \f$O(1)\f$ |
+/// | deletion    | \f$O(1)\f$ |
 ///
 /// \tparam TypeT value type
 template<typename TypeT, typename AllocT = allocator<TypeT>>
@@ -154,7 +154,7 @@ public:
 
 	///
 	/// \returns \f$true\f$ when the deque is empty, \f$false\f$ otherwise
-	constexpr bool empty() const {
+	constexpr bool is_empty() const {
 		return _size == 0;
 	}
 
@@ -175,28 +175,28 @@ public:
 	///
 	/// \returns a reference to the first element in the deque
 	value_t& front() {
-		assert(not empty(), "Attempted to access an empty deque.");
+		assert(not is_empty(), "Attempted to access an empty deque.");
 		return _first->value;
 	}
 
 	///
 	/// \returns a const-qualified reference to the first element in the deque
 	const value_t& front() const {
-		assert(not empty(), "Attempted to access an empty deque.");
+		assert(not is_empty(), "Attempted to access an empty deque.");
 		return _first->value;
 	}
 
 	///
 	/// \returns a reference to the last element in the deque
 	value_t& back() {
-		assert(not empty(), "Attempted to access an empty deque.");
+		assert(not is_empty(), "Attempted to access an empty deque.");
 		return _last->value;
 	}
 
 	///
 	/// \returns a const-qualified reference to the last element in the deque
 	const value_t& back() const {
-		assert(not empty(), "Attempted to access an empty deque.");
+		assert(not is_empty(), "Attempted to access an empty deque.");
 		return _last->value;
 	}