Refine search
private static boolean insertNestedClass(ClassNode root, ClassNode child) { Set<String> setEnclosing = child.enclosingClasses; LinkedList<ClassNode> stack = new LinkedList<>(); stack.add(root); while (!stack.isEmpty()) { ClassNode node = stack.removeFirst(); if (setEnclosing.contains(node.classStruct.qualifiedName)) { node.nested.add(child); child.parent = node; return true; } // note: ordered list stack.addAll(node.nested); } return false; }
private Iterator<TraversalBranch> gatherSourceIterator( TraversalContext metadata ) { LinkedList<TraversalBranch> queue = new LinkedList<>(); queue.add( current.next( expander, metadata ) ); while ( true ) { List<TraversalBranch> level = gatherOneLevel( queue, metadata ); if ( level.isEmpty() ) { break; } queue.addAll( 0, level ); } return queue.iterator(); }
int hash = 0; while (!stack.isEmpty()) { obj = stack.removeFirst(); if (obj == null || visited.contains(obj)) { stack.addAll(0, (Collection<?>) obj); continue; stack.addAll(0, ((Map<?, ?>) obj).keySet()); stack.addAll(0, ((Map<?, ?>) obj).values()); continue; stack.add(Math.round(((Number) obj).doubleValue())); continue;
daughterRegions.put(rsLocation, entry); daughterRegions.get(rsLocation).add(dr); while (!regionList.isEmpty()) { dr = regionList.pop(); daughterRegions.put(newRs, entry); daughterRegions.get(newRs).add(dr); dr = null; continue; if (regionList.isEmpty()) { daughterRegions.remove(rsLoc); LOG.debug("Wait for outstanding splits " + outstanding.size()); local_finished = splitScan(outstanding, connection, tableName, splitAlgo); if (local_finished.isEmpty()) { Thread.sleep(30 * 1000); } else { finished.addAll(local_finished); outstanding.removeAll(local_finished); LOG.debug(local_finished.size() + " outstanding splits finished"); finished.add(dr);
(tokI.tag().startsWith("D") && suffix != null) || (tokI.tag().startsWith("R") && suffix != null))) { body.add(i, be.get(0)); i += 1; if (suffix != null) { i += 1; body.add(i, suffix.get(0)); addedSuffix = true; body.add(prepNum.get(0)); body.add(WORD_IN); body.add(prepNum.get(1)); body.addAll(suffix); body.add(1, be.get(0)); } else { body.addAll(be); obj.set(UnknownTokenMarker.class, true); body.addAll(objType);
relationTokens.add(relNode); for (int i = prepChunk.size() - 1; i >=0; --i) { relationTokens.addFirst(prepChunk.get(i)); } } else { relationTokens.addAll(prepChunk); for (int i = prepChunk.size() - 1; i >=0; --i) { relationTokens.addFirst(prepChunk.get(i)); } } else { relationTokens.addAll(prepChunk);
public void addJobListener(JobListener jobListener, List<Matcher<JobKey>> matchers) { if (jobListener.getName() == null || jobListener.getName().length() == 0) { throw new IllegalArgumentException( "JobListener name cannot be empty."); } synchronized (globalJobListeners) { globalJobListeners.put(jobListener.getName(), jobListener); LinkedList<Matcher<JobKey>> matchersL = new LinkedList<Matcher<JobKey>>(); if(matchers != null && matchers.size() > 0) matchersL.addAll(matchers); else matchersL.add(EverythingMatcher.allJobs()); globalJobListenersMatchers.put(jobListener.getName(), matchersL); } }
int hash = 0; while (!stack.isEmpty()) { obj = stack.removeFirst(); if (obj == null || visited.contains(obj)) { stack.addAll(0, (Collection<?>) obj); continue; stack.addAll(0, ((Map<?, ?>) obj).keySet()); stack.addAll(0, ((Map<?, ?>) obj).values()); continue; stack.add(Math.round(((Number) obj).doubleValue())); continue;
private Iterator<Class<?>> getClassHierarchyIterator(final Class<?> classParam) { if (classParam == null) { return Collections.<Class<?>>emptyList().iterator(); } final ArrayList<Class<?>> classes = new ArrayList<>(); final LinkedList<Class<?>> unprocessed = new LinkedList<>(); // Object is special - needs to be always the furthest type. boolean objectFound = false; unprocessed.add(classParam); while (!unprocessed.isEmpty()) { final Class<?> clazz = unprocessed.removeFirst(); if (Object.class.equals(clazz)) { objectFound = true; } else { classes.add(clazz); } unprocessed.addAll(Arrays.asList(clazz.getInterfaces())); final Class<?> superclazz = clazz.getSuperclass(); if (superclazz != null) { unprocessed.add(superclazz); } } if (objectFound) { classes.add(Object.class); } return classes.iterator(); } }
public void addTriggerListener(TriggerListener triggerListener, List<Matcher<TriggerKey>> matchers) { if (triggerListener.getName() == null || triggerListener.getName().length() == 0) { throw new IllegalArgumentException( "TriggerListener name cannot be empty."); } synchronized (globalTriggerListeners) { globalTriggerListeners.put(triggerListener.getName(), triggerListener); LinkedList<Matcher<TriggerKey>> matchersL = new LinkedList<Matcher<TriggerKey>>(); if(matchers != null && matchers.size() > 0) matchersL.addAll(matchers); else matchersL.add(EverythingMatcher.allTriggers()); globalTriggerListenersMatchers.put(triggerListener.getName(), matchersL); } }
while (!preTerms.isEmpty() && isPunc(preTerms.getFirst())) { newChildren.add(preTerms.getFirst()); preTerms.removeFirst(); LinkedList<Tree> temp = new LinkedList<>(); if (newChild.children().length > 0) { newChildren.add(newChild); while (!preTerms.isEmpty() && isPunc(preTerms.getLast())) { temp.addFirst(preTerms.getLast()); preTerms.removeLast(); newChildren.addAll(temp); while (!newChildren.isEmpty() && isPunc(newChildren.getFirst())) { newChildren.removeFirst();
private void recordPhaseOpsInAllOtherPhases(int currPhase) { // apart from current phase, push new operations for every other phase in the master phase ops list for (int ph = Phases.INITIALIZATION; ph <= Phases.ALL; ph++) { if (ph != currPhase && !newPhaseOperations[ph].isEmpty()) { phaseOperations[ph].addAll(newPhaseOperations[ph]); newPhaseOperations[ph].clear(); } } }
private Iterator<Class<?>> getClassHierarchyIterator(final Class<?> classParam) { if (classParam == null) { return Collections.<Class<?>>emptyList().iterator(); } final ArrayList<Class<?>> classes = new ArrayList<>(); final LinkedList<Class<?>> unprocessed = new LinkedList<>(); // Object is special - needs to be always the furthest type. boolean objectFound = false; unprocessed.add(classParam); while (!unprocessed.isEmpty()) { final Class<?> clazz = unprocessed.removeFirst(); if (Object.class.equals(clazz)) { objectFound = true; } else { classes.add(clazz); } unprocessed.addAll(Arrays.asList(clazz.getInterfaces())); final Class<?> superclazz = clazz.getSuperclass(); if (superclazz != null) { unprocessed.add(superclazz); } } if (objectFound) { classes.add(Object.class); } return classes.iterator(); } }