/**
* @param instanceFrame instance frame
* @return iterable over instance members of the frame, including those nested in namespaces
*/
public static Iterable<? extends INamedElement> instanceMembers(
final IInstanceFrame instanceFrame) {
final List<INamedElement> members = new ArrayList<>();
// Iterate over the member functions of the frame, including those nested in namespaces.
final Deque<INamedElement> queue = new LinkedList<>();
queue.addLast(instanceFrame);
while (!queue.isEmpty()) {
final INamedElement cur = queue.getFirst();
queue.removeFirst();
final INamedElementContainer contCur = (INamedElementContainer) cur;
for (final INamedElement member : contCur.members())
if (Ast.membership(member)
== (contCur == instanceFrame
? ScopeMembership.InstanceMember
: ScopeMembership.StaticMember)) {
members.add(member);
if (member instanceof INamedElementContainer) {
// Tail-recursively treat this nested namespace.
queue.addLast(member);
}
}
}
return members;
}
private void prune() {
// Remove all values that are too old
TimeInterval periodAllowed = cachedPeriod.before(buffer.getLast().getTimestamp());
while (!buffer.isEmpty() && !periodAllowed.contains(buffer.getFirst().getTimestamp())) {
// Discard value
buffer.removeFirst();
}
}
private void reloadGame() {
if (!isReload) return;
score = 0;
isReload = false;
isEnd = false;
feedCounter1 = 0;
feedCounter2 = 0;
List<Rectangle> rectangleList = new ArrayList<>(rectangles);
for (Rectangle r : rectangleList) group.getChildren().remove(r);
regimeRectangle.setX(-20);
Deque<Block> blocksTemp = new ArrayDeque<>();
Deque<Rectangle> rectanglesTemp = new ArrayDeque<>();
head = new Block(100, 150);
tale = new Block(90, 150);
if (inputDirection != 3) {
blocksTemp.push(tale);
blocksTemp.push(head);
rectanglesTemp.push(new Rectangle(tale.getX(), tale.getY(), 10, 10));
rectanglesTemp.push(new Rectangle(head.getX(), head.getY(), 10, 10));
} else {
blocksTemp.push(head);
blocksTemp.push(tale);
rectanglesTemp.push(new Rectangle(head.getX(), head.getY(), 10, 10));
rectanglesTemp.push(new Rectangle(tale.getX(), tale.getY(), 10, 10));
}
blocks = blocksTemp;
rectangles = rectanglesTemp;
group.getChildren().add(rectangles.getFirst());
group.getChildren().add(rectangles.getLast());
timer.cancel();
timer = null;
timer = new Timer();
timer.schedule(
new TimerTask() {
@Override
public void run() {
Platform.runLater(() -> play());
}
},
1,
100);
}
final synchronized double method2837(int i) {
anInt8868++;
if (anInt8888 < 1) return -1.0;
if (i != -21987) method2818();
Class348_Sub42_Sub4 class348_sub42_sub4 = (Class348_Sub42_Sub4) aClass262_8861.getFirst(4);
if (class348_sub42_sub4 == null) return -1.0;
return ((double)
-((float) (((Class348_Sub42_Sub4) class348_sub42_sub4).aShortArrayArray9518[0]).length
/ (float) Class22.anInt339)
+ ((Class348_Sub42_Sub4) class348_sub42_sub4).aDouble9512);
}
/**
* @param fn function
* @return eventual overrides of the function, unifying those differing only in generic derivation
*/
public static Iterable<? extends IFunction> eventualOverrides(final IFunction fn) {
// Iterate over the eventually overridden functions,
// unifying those differing only through generic derivation.
final Set<IFunction> processedEO = new LinkedHashSet<>();
final Deque<IFunction> queueEO = new LinkedList<>();
queueEO.addLast(fn);
while (!queueEO.isEmpty()) {
final IFunction fnEO = queueEO.getFirst();
queueEO.removeFirst();
if (!processedEO.contains(fnEO)) {
processedEO.add(fnEO);
// Tail-recurse on the function's direct overrides.
for (final ResolvedName directOverride : fnEO.directOverrides())
queueEO.addLast((IFunction) directOverride.namedElement());
}
}
return processedEO;
}
final void method1988(Deque class262_0_, byte i) {
if (i != -115) getFirst(-53);
method1989((((Node) ((Deque) this).parent).nodeParent), false, class262_0_);
anInt3340++;
}
private final synchronized Class348_Sub42_Sub4 method2828(int i) {
if (i != -23076) method2817(null, 71, 78);
anInt8872++;
return (Class348_Sub42_Sub4) aClass262_8861.getFirst(i + 23080);
}
