anchor.diff:  	return sorted_list
   */
   
  -proc/dd_sortedtextlist(list/incoming, case_sensitive = 0)
  +/proc/dd_sortedtextlist(list/incoming, case_sensitive = 0)
   	// Returns a new list with the text values sorted.
   	// Use binary search to order by sortValue.
   	// This works by going to the half-point of the list, seeing if the node in question is higher or lower cost,
  
positive.code: 		return "[output][and_text][input[index]]"
  
  //Returns list element or null. Should prevent "index out of bounds" error.
  proc/listgetindex(var/list/list,index)
  	if(istype(list) && list.len)
  		if(isnum(index))
  			if(InRange(index,1,list.len))
  
negative.code: 	return sorted_text
  
  
  /proc/dd_sortedTextList(list/incoming)
  	var/case_sensitive = 1
  	return dd_sortedtextlist(incoming, case_sensitive)
  
  /proc/subtypesof(var/path) //Returns a list containing all subtypes of the given path, but not the given path itself.
  	if(!path || !ispath(path))
  		return
  	return (typesof(path) - path)
  
  /datum/proc/dd_SortValue()
  	return "[src]"
  
  /obj/machinery/dd_SortValue()
  	return "[sanitize(name)]"
  
  /obj/machinery/camera/dd_SortValue()
  	return "[c_tag]"
  