Add /datum prefix to custom root types (#34294)

code/__DATASTRUCTURES/heap.dm

@@ -1,28 +1,28 @@
 
 //////////////////////
-//Heap object
+//datum/Heap object
 //////////////////////
 
-/Heap
+/datum/Heap
 	var/list/L
 	var/cmp
 
-/Heap/New(compare)
+/datum/Heap/New(compare)
 	L = new()
 	cmp = compare
 
-/Heap/proc/IsEmpty()
+/datum/Heap/proc/IsEmpty()
 	return !L.len
 
 //Insert and place at its position a new node in the heap
-/Heap/proc/Insert(atom/A)
+/datum/Heap/proc/Insert(atom/A)
 
 	L.Add(A)
 	Swim(L.len)
 
 //removes and returns the first element of the heap
 //(i.e the max or the min dependant on the comparison function)
-/Heap/proc/Pop()
+/datum/Heap/proc/Pop()
 	if(!L.len)
 		return 0
 	. = L[1]
@@ -33,7 +33,7 @@
 	Sink(1)
 
 //Get a node up to its right position in the heap
-/Heap/proc/Swim(var/index)
+/datum/Heap/proc/Swim(var/index)
 	var/parent = round(index * 0.5)
 
 	while(parent > 0 && (call(cmp)(L[index],L[parent]) > 0))
@@ -42,7 +42,7 @@
 		parent = round(index * 0.5)
 
 //Get a node down to its right position in the heap
-/Heap/proc/Sink(var/index)
+/datum/Heap/proc/Sink(var/index)
 	var/g_child = GetGreaterChild(index)
 
 	while(g_child > 0 && (call(cmp)(L[index],L[g_child]) < 0))
@@ -52,7 +52,7 @@
 
 //Returns the greater (relative to the comparison proc) of a node children
 //or 0 if there's no child
-/Heap/proc/GetGreaterChild(var/index)
+/datum/Heap/proc/GetGreaterChild(var/index)
 	if(index * 2 > L.len)
 		return 0
 
@@ -65,11 +65,11 @@
 		return index * 2
 
 //Replaces a given node so it verify the heap condition
-/Heap/proc/ReSort(atom/A)
+/datum/Heap/proc/ReSort(atom/A)
 	var/index = L.Find(A)
 
 	Swim(index)
 	Sink(index)
 
-/Heap/proc/List()
+/datum/Heap/proc/List()
 	. = L.Copy()