anchor.diff:  			return list[index]
   	return
   
  -proc/islist(list/list)
  +/proc/islist(list/list)
   	if(istype(list))
   		return 1
   	return 0
   
   //Return either pick(list) or null if list is not of type /list or is empty
  -proc/safepick(list/list)
  +/proc/safepick(list/list)
   	if(!islist(list) || !list.len)
   		return
   	return pick(list)
   
   //Checks if the list is empty
  -proc/isemptylist(list/list)
  +/proc/isemptylist(list/list)
   	if(!list.len)
   		return 1
   	return 0
  
positive.code: 	return sorted_list
  */
  
  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,
  
negative.code: 	return 0
  
  //Empties the list by setting the length to 0. Hopefully the elements get garbage collected
  /proc/clearlist(list/list)
  	if(istype(list))
  		list.len = 0
  	return
  
  //Removes any null entries from the list
  /proc/listclearnulls(list/list)
  	if(istype(list))
  		while(null in list)
  			list -= null
  