             } 
         } 
 
-        //turns out that there are no neighbors of item in the filtered 
-        //list, so item is the 1st item 
+        // turns out that there are no neighbors of item in the filtered 
+        // list, so item is the 1st item 
         return 0; 
     }
     

        }

        var listIndex:int = index;
        //if we're sorted addItemAt is meaningless, just add to the end
        if (localIndex && sort)
        {
            listIndex = list.length;

     */
    private function getFilteredItemIndex(item:Object):int
    { 
        // loc is wrong 
        // the intent of this function is to find where this new item 
        // should be in the filtered list, by looking at the main list 
        // for it's neighbor that is also in this filtered list 
        // and trying to insert item after that neighbor in the insert locao filtered list 
    
        // 1st get the position in the original list 
        var loc:int = list.getItemIndex(item); 
		
		// something gone wrong and list is not filtered so just return loc to stop RTE
		if (filterFunction == null)
			return loc;
    
        // if it's 0 then item must be also the first in the filtered list 
        if (loc == 0) 
            return 0; 
    
