function enqueue(elem, index, elemqueue) {
      var action = (args ?
            (function() { callback.apply($(elem), args); }) :
            (function() { callback.call($(elem), index, elem); })),
          lastanim = elemqueue.length && elemqueue[elemqueue.length - 1],
          animation = (function() {
          var saved = $.queue(this, qname),
              subst = [], inserted;
          if (saved[0] === 'inprogress') {
            subst.unshift(saved.shift());
          }
          $.queue(elem, qname, subst);
          action();
          // The Array.prototype.push is faster.
          // $.merge($.queue(elem, qname), saved);
          Array.prototype.push.apply($.queue(elem, qname), saved);
          if (global_plan_counter++ % 64) {
            $.dequeue(elem, qname);
          } else {
            // Insert a timeout after executing a batch of plans,
            // to avoid deep recursion.
            setTimeout(function() { $.dequeue(elem, qname); }, 0);
          }
        });
      animation.finish = action;
      $.queue(elem, qname, animation);
    }
// just as an ordinary function call expands into its subcalls.
just as an ordinary function call expands into its subcalls.
just as an ordinary function call expands into its subcalls .
function enqueue(elem, index, elemqueue) {
      var action = (args ?
            (function() { callback.apply($(elem), args); }) :
            (function() { callback.call($(elem), index, elem); })),
          lastanim = elemqueue.length && elemqueue[elemqueue.length - 1],
          animation = (function() {
          var saved = $.queue(this, qname),
              subst = [], inserted;
          if (saved[0] === 'inprogress') {
            subst.unshift(saved.shift());
          }
          $.queue(elem, qname, subst);
          action();
          Array.prototype.push.apply($.queue(elem, qname), saved);
          if (global_plan_counter++ % 64) {
            $.dequeue(elem, qname);
          } else {
            setTimeout(function() { $.dequeue(elem, qname); }, 0);
          }
        });
      animation.finish = action;
      $.queue(elem, qname, animation);
    }
function enqueue ( elem , index , elemqueue ) { var action = ( args ? ( function ( ) { callback . apply ( $ ( elem ) , args ) ; } ) : ( function ( ) { callback . call ( $ ( elem ) , index , elem ) ; } ) ) , lastanim = elemqueue . length && elemqueue [ elemqueue . length - 1 ] , animation = ( function ( ) { var saved = $ . queue ( this , qname ) , subst = [ ] , inserted ; if ( saved [ 0 ] === 'inprogress' ) { subst . unshift ( saved . shift ( ) ) ; } $ . queue ( elem , qname , subst ) ; action ( ) ; Array . prototype . push . apply ( $ . queue ( elem , qname ) , saved ) ; if ( global_plan_counter ++ % 64 ) { $ . dequeue ( elem , qname ) ; } else { setTimeout ( function ( ) { $ . dequeue ( elem , qname ) ; } , 0 ) ; } } ) ; animation . finish = action ; $ . queue ( elem , qname , animation ) ; }
just as an ordinary function call expands into its subcalls.
just as an ordinary function call expands into its subcalls .
// The Array.prototype.push is faster. // $.merge($.queue(elem, qname), saved); // Insert a timeout after executing a batch of plans, // to avoid deep recursion.