Index: libcfa/src/heap.cfa
===================================================================
--- libcfa/src/heap.cfa	(revision d99a7168a496bfc355c644d298212bbfcfd3ef37)
+++ libcfa/src/heap.cfa	(revision 3d4b7cc7d7335dbf198cf0bebd3b6da3970768f0)
@@ -10,6 +10,6 @@
 // Created On       : Tue Dec 19 21:58:35 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Wed Dec 28 12:37:38 2022
-// Update Count     : 1597
+// Last Modified On : Fri Dec 30 08:37:37 2022
+// Update Count     : 1605
 //
 
@@ -805,5 +805,5 @@
 
 	ptrdiff_t rem = heapRemaining - size;
-	if ( unlikely( rem < 0 ) ) {
+	if ( unlikely( rem < 0 ) ) {						// negative ?
 		// If the size requested is bigger than the current remaining storage, increase the size of the heap.
 
@@ -841,5 +841,5 @@
 	ptrdiff_t rem = heapReserve - size;
 
-	if ( unlikely( rem < 0 ) ) {						// negative
+	if ( unlikely( rem < 0 ) ) {						// negative ?
 		// If the size requested is bigger than the current remaining reserve, use the current reserve to populate
 		// smaller freeLists, and increase the reserve.
@@ -847,5 +847,5 @@
 		rem = heapReserve;								// positive
 
-		if ( rem >= bucketSizes[0] ) {					// minimal size ? otherwise ignore
+		if ( (unsigned int)rem >= bucketSizes[0] ) {	// minimal size ? otherwise ignore
 			size_t bucket;
 			#ifdef FASTLOOKUP
@@ -856,5 +856,5 @@
 			Heap.FreeHeader * freeHead = &(freeLists[bucket]);
 
-			// The remaining storage many not be bucket size, whereas all other allocations are. Round down to previous
+			// The remaining storage may not be bucket size, whereas all other allocations are. Round down to previous
 			// bucket size in this case.
 			if ( unlikely( freeHead->blockSize > (size_t)rem ) ) freeHead -= 1;