: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...

  if (dequeue_op == nullptr) {
    status->status = tensorflow::errors::Internal(
        "Unable to find the dequeue node in the TF graph.");
    return nullptr;
  }

  VLOG(1) << "Running the dequeue op";
  TF_Output output{dequeue_op, 0};
  TF_Tensor* ret;
  TF_SessionRun(session, /*run_options*/ nullptr,
                // input related parameters

//
// `tensor` is still owned by the caller. This call will be blocked if the queue
// has reached its capacity, and will be unblocked when the queued tensors again
// drop below the capacity due to dequeuing.
//
// Tensors are dequeued via the corresponding TF dequeue op.
// TODO(hongm): Add support for `timeout_ms`.
TF_CAPI_EXPORT extern void TF_EnqueueNamedTensor(TF_Session* session,

            tokenizePartialBlock(nextStart, synonym.startOffset, afterSynonymProduced);

            // enqueue prev-synonym
            processPrevSynonym(synonym.startOffset, idx > 0 ? synonyms.get(idx - 1).endOffset : 0);

            if (expand) {
                queue.add(synonym);
            }

            // enqueue synonyms
            bytesReader.reset(synonym.output.bytes, synonym.output.offset, synonym.output.length);

Shinsuke Sugaya <******@****.***> 1730954650 +0900

        this.filterIndex = filterIndex;
    }

    /**
     * Returns the number of queue shards.
     * @return The number of queue shards.
     */
    public int getQueueShards() {
        return queueShards;
    }

    /**
     * Sets the number of queue shards.
     * @param queueShards The number of queue shards.
     */
    public void setQueueShards(final int queueShards) {

name: 'Requeue stale team-triage items'
on:
  schedule:
    # Execute every day at 00:05 to avoid conflicts with other workflows
    - cron: '5 0 * * *'

permissions: {}

jobs:
  requeue:
    permissions:
      issues: write
      pull-requests: write
    runs-on: ubuntu-latest
    steps:
      - uses: actions/stale@v10
        with:
          operations-per-run: 50
          remove-stale-when-updated: false

 * This class provides methods for managing a queue of URLs to be crawled,
 * including adding, deleting, and retrieving URLs from the queue.
 * It uses a {@link MemoryDataHelper} to store the URL queue data in memory.
 *
 * <p>
 * The class is responsible for:
 * </p>
 * <ul>
 *   <li>Updating session IDs for URL queues.</li>
 *   <li>Adding new URLs to the queue.</li>

        sessionMap.clear();
    }

    /**
     * Returns the URL queue for the specified session ID.
     * Creates a new queue if one doesn't exist.
     * @param sessionId the session ID
     * @return the URL queue for the session
     */
    public synchronized Queue<UrlQueueImpl<Long>> getUrlQueueList(final String sessionId) {
        Queue<UrlQueueImpl<Long>> urlQueueList = urlQueueMap.get(sessionId);

        return URL_QUEUE_THREAD_LOCAL.get();
    }

    /**
     * Sets the URL queue for the current thread. If the provided URL queue is null,
     * the URL queue for the current thread is removed.
     *
     * @param urlQueue the URL queue to be set for the current thread, or null to remove the URL queue
     */
    public static void setUrlQueue(final UrlQueue<?> urlQueue) {
        if (urlQueue == null) {