Searched refs:enqueued (Results 1 – 6 of 6) sorted by relevance
132 vector<size_t> enqueued(ns, kNoKey); in Prune()142 enqueued[s] = heap.Insert(s); in Prune()149 enqueued[s] = kNoKey; in Prune()173 if (enqueued[arc.nextstate] == kNoKey) { in Prune()174 enqueued[arc.nextstate] = heap.Insert(arc.nextstate); in Prune()177 heap.Update(enqueued[arc.nextstate], arc.nextstate); in Prune()253 vector<size_t> enqueued; in Prune() local266 while (enqueued.size() <= s) { in Prune()267 enqueued.push_back(kNoKey); in Prune()270 enqueued[s] = heap.Insert(s); in Prune()[all …]
94 vector<bool> enqueued; in SingleShortestPath() local127 enqueued.push_back(false); in SingleShortestPath()135 enqueued.push_back(true); in SingleShortestPath()140 enqueued[s] = false; in SingleShortestPath()161 enqueued.push_back(false); in SingleShortestPath()176 if (!enqueued[arc.nextstate]) { in SingleShortestPath()178 enqueued[arc.nextstate] = true; in SingleShortestPath()
631 static char *enqueued = NULL; in histsave() local636 afree(enqueued, APERM); in histsave()637 enqueued = NULL; in histsave()642 if (!enqueued) in histsave()644 } else if (enqueued) { in histsave()645 c = enqueued; in histsave()646 enqueued = NULL; in histsave()680 if (!enqueued) { in histsave()682 enqueued = c; in histsave()688 nenq = strlen(enqueued); in histsave()[all …]
48 // Responses are returned in the same order that they are enqueued.
1732 the @code{MHD_Response} object is enqueued in a @code{MHD_Connection}:
1499 2. the 'MHD_Response' object is enqueued in a 'MHD_Connection':