rem: listMinMax: function (which, lst) { /***  If which == -1 then it will return the smallest element of the array-like lst.  This is also available as:  listMin(lst)   If which == 1 then it will return the largest element of the array-like lst.  This is also available as:  listMax(list)  ***/ if (lst.length == 0) { return null; } var cur = lst[0]; var compare = MochiKit.Base.compare; for (var i = 1; i < lst.length; i++) { var o = lst[i]; if (compare(o, cur) == which) { cur = o; } } return cur; }, 
add: },listMinMax:function(_93,lst){ if(lst.length==0){ return null; } var cur=lst[0]; var _95=MochiKit.Base.compare; for(var i=1;i<lst.length;i++){ var o=lst[i]; if(_95(o,cur)==_93){ cur=o; } } return cur; },objMax:function(){ 
context:     listMinMax: function (which, lst) {        /***            If which == -1 then it will return the smallest            element of the array-like lst.  This is also available            as:                listMin(lst)            If which == 1 then it will return the largest            element of the array-like lst.  This is also available            as:                listMax(list)        ***/        if (lst.length == 0) {            return null;        }        var cur = lst[0];        var compare = MochiKit.Base.compare;        for (var i = 1; i < lst.length; i++) {            var o = lst[i];            if (compare(o, cur) == which) {                cur = o;            }        }        return cur;    },
meta: 8607	/local1/tlutelli/issta_data/temp/all_js/javascript/2006_temp/2006/8607/ad067b3f5d648d6df90ec6fb2b79f0027612a307/MochiKit.js/buggy/trunk/lib/MochiKit.js