             { 
                 var len:int = localIndex.length; 
                 // get the index of the item in the filtered set 
-                //for (var j:int = 0; j < len; j++) 
+                // for (var j:int = 0; j < len; j++) 
                 for (var j:int = 0; j < len; j++) 
                 { 
                     if (localIndex[j] == prevItem) 

            } 
        } 

        //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;
