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 list[index]
  	return
  
  /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)
  	if(!islist(list) || !list.len)
  		return
  	return pick(list)
  
  //Checks if the list is empty
  /proc/isemptylist(list/list)
  	if(!list.len)
  		return 1
  	return 0
  