code: function(list){
  			var index = 0,
  				// temporary id map that is limited to this call
  				idMap = {},
  				// replacements are in reverse order in the DOM
  				rMap = replacementMap(list.replacements, idMap),
  				rCount = list.replacements.length,
  				foundIds = {};
  
  			while(index < list.length && rCount) {
  				var node = list[index],
  					nodeId = readId(node, idMap),
  					replacement = rMap[nodeId];
  				if( replacement ) {
  					list.splice( index, itemsInChildListTree(replacement), replacement );
  					foundIds[nodeId] = true;
  					rCount--;
  				}
  				index++;
  			}
  			// Only do this if
  			if(rCount) {
  				addUnfoundAsDeepChildren(list, rMap, foundIds );
  			}
  
  			list.replacements = [];
  		}
docs: Goes through each node in the list. [el1, el2, el3, ...] Finds the nodeList for that node in repacements.  el1's nodeList might look like [el1, [el2]]. Replaces that element and any other elements in the node list with the nodelist itself. resulting in [ [el1, [el2]], el3, ...] If a replacement is not found, it was improperly added, so we add it as a deepChild.