Searched refs:nodeQueue (Results 1 – 3 of 3) sorted by relevance
22 pq := nodeQueue(dependencyGraph(check.objMap))300 type nodeQueue []*graphNode type302 func (a nodeQueue) Len() int { return len(a) }304 func (a nodeQueue) Swap(i, j int) {310 func (a nodeQueue) Less(i, j int) bool {325 func (a *nodeQueue) Push(x any) {329 func (a *nodeQueue) Pop() any {
25 pq := nodeQueue(dependencyGraph(check.objMap))303 type nodeQueue []*graphNode type305 func (a nodeQueue) Len() int { return len(a) }307 func (a nodeQueue) Swap(i, j int) {313 func (a nodeQueue) Less(i, j int) bool {328 func (a *nodeQueue) Push(x any) {332 func (a *nodeQueue) Pop() any {
172 ArrayList<ISSABasicBlock> nodeQueue = new ArrayList<ISSABasicBlock>(); in computeDerefParamListUsingPDom() local173 nodeQueue.add(prunedCFG.exit()); in computeDerefParamListUsingPDom()175 while (!nodeQueue.isEmpty()) { in computeDerefParamListUsingPDom()176 ISSABasicBlock node = nodeQueue.get(0); in computeDerefParamListUsingPDom()177 nodeQueue.remove(node); in computeDerefParamListUsingPDom()181 nodeQueue.add(succ); in computeDerefParamListUsingPDom()