- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 27 for Dequeue (0.2 sec)
-
src/main/webapp/js/admin/adminlte.min.js.map
ide) {\n $('html').addClass(ClassName.CONTROL_SIDEBAR_ANIMATE)\n $(Selector.CONTROL_SIDEBAR).show().delay(10).queue(function(){\n $('body').addClass(ClassName.CONTROL_SIDEBAR_SLIDE).delay(300).queue(function(){\n $('html').removeClass(ClassName.CONTROL_SIDEBAR_ANIMATE)\n $(this).dequeue()\n })\n $(this).dequeue()\n })\n } else {\n $('body').addClass(ClassName.CONTROL_SIDEBAR_OPEN)\n }\n\n const expandedEvent...
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Wed Feb 12 07:55:41 UTC 2020 - 77K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/graph/builder/NodeState.java
} // the enqueue and dequeue methods are used for performance reasons // in order to avoid tracking the set of enqueued nodes boolean enqueue() { if (queued) { return false; } queued = true; return true; } NodeState dequeue() { queued = false; return this; }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Jun 07 14:19:34 UTC 2024 - 58.9K bytes - Viewed (0) -
src/main/webapp/js/jquery-3.6.3.min.js
:E.Callbacks("once memory").add(function(){Y.remove(e,[t+"queue",n])})})}}),E.fn.extend({queue:function(t,n){var e=2;return"string"!=typeof t&&(n=t,t="fx",e--),arguments.length<e?E.queue(this[0],t):void 0===n?this:this.each(function(){var e=E.queue(this,t,n);E._queueHooks(this,t),"fx"===t&&"inprogress"!==e[0]&&E.dequeue(this,t)})},dequeue:function(e){return this.each(function(){E.dequeue(this,e)})},clearQueue:function(e){return this.queue(e||"fx",[])},promise:function(e,t){var n,r=1,i=E.Deferred...
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Fri Feb 17 12:13:41 UTC 2023 - 87.8K bytes - Viewed (0) -
src/main/webapp/js/admin/jquery-3.6.3.min.js
:E.Callbacks("once memory").add(function(){Y.remove(e,[t+"queue",n])})})}}),E.fn.extend({queue:function(t,n){var e=2;return"string"!=typeof t&&(n=t,t="fx",e--),arguments.length<e?E.queue(this[0],t):void 0===n?this:this.each(function(){var e=E.queue(this,t,n);E._queueHooks(this,t),"fx"===t&&"inprogress"!==e[0]&&E.dequeue(this,t)})},dequeue:function(e){return this.each(function(){E.dequeue(this,e)})},clearQueue:function(e){return this.queue(e||"fx",[])},promise:function(e,t){var n,r=1,i=E.Deferred...
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Fri Feb 17 12:13:41 UTC 2023 - 87.8K bytes - Viewed (0) -
fess-crawler/src/test/resources/ajax/js/jquery-2.1.1.min.js
:n.Callbacks("once memory").add(function(){L.remove(a,[b+"queue",c])})})}}),n.fn.extend({queue:function(a,b){var c=2;return"string"!=typeof a&&(b=a,a="fx",c--),arguments.length<c?n.queue(this[0],a):void 0===b?this:this.each(function(){var c=n.queue(this,a,b);n._queueHooks(this,a),"fx"===a&&"inprogress"!==c[0]&&n.dequeue(this,a)})},dequeue:function(a){return this.each(function(){n.dequeue(this,a)})},clearQueue:function(a){return this.queue(a||"fx",[])},promise:function(a,b){var c,d=1,e=n.Deferred...
Registered: Wed Jun 12 15:17:51 UTC 2024 - Last Modified: Sun Oct 11 02:16:55 UTC 2015 - 82.3K bytes - Viewed (0) -
pkg/ctrlz/assets/static/js/jquery-3.2.1.slim.min.js
:r.Callbacks("once memory").add(function(){W.remove(a,[b+"queue",c])})})}}),r.fn.extend({queue:function(a,b){var c=2;return"string"!=typeof a&&(b=a,a="fx",c--),arguments.length<c?r.queue(this[0],a):void 0===b?this:this.each(function(){var c=r.queue(this,a,b);r._queueHooks(this,a),"fx"===a&&"inprogress"!==c[0]&&r.dequeue(this,a)})},dequeue:function(a){return this.each(function(){r.dequeue(this,a)})},clearQueue:function(a){return this.queue(a||"fx",[])},promise:function(a,b){var c,d=1,e=r.Deferred...
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue May 23 17:08:31 UTC 2023 - 68K bytes - Viewed (0) -
tensorflow/compiler/jit/deadness_analysis.cc
if (IsNextIteration(e->src())) { ++num_ready_inputs[node->id()]; } } } } // dequeue is used to ensure that the nodes are first-in-first-out. This // order guarantees that the exits in the ready queue are visited before // nodes that will become ready in the future. std::deque<Node*> ready; ready.push_back(src_node);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 60.4K bytes - Viewed (0) -
okhttp/src/test/java/okhttp3/internal/http2/HttpOverHttp2Test.kt
) { setUp(protocol, mockWebServer) server.enqueue( MockResponse.Builder() .body(Buffer().write(ByteArray(Http2Connection.OKHTTP_CLIENT_WINDOW_SIZE + 1))) .build(), ) server.enqueue( MockResponse(body = "abc"), ) // Enqueue an additional response that show if we burnt a good prior response. server.enqueue( MockResponse(body = "XXX"), )
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Thu Apr 11 22:09:35 UTC 2024 - 75.3K bytes - Viewed (0) -
okhttp/src/test/java/okhttp3/EventListenerTest.kt
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Sat Jan 20 10:30:28 UTC 2024 - 56.9K bytes - Viewed (0) -
pkg/scheduler/internal/queue/scheduling_queue.go
// // If any of pInfo.PendingPlugins return Queue, // the scheduling queue is supposed to enqueue this Pod to activeQ, skipping backoffQ. // If any of pInfo.unschedulablePlugins return Queue, // the scheduling queue is supposed to enqueue this Pod to activeQ/backoffQ depending on the remaining backoff time of the Pod. // If all QueueingHintFns returns Skip, the scheduling queue enqueues the Pod back to unschedulable Pod pool
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 12 13:26:09 UTC 2024 - 61.4K bytes - Viewed (0)