From 27bf571d6413c3cc6a5d664b5bddd38d21d7b1cd Mon Sep 17 00:00:00 2001 From: EVE Date: Mon, 13 Mar 2017 16:42:21 -0400 Subject: Formatting --- .../bjc/utils/data/TopDownTransformIterator.java | 165 +++++++++++---------- 1 file changed, 83 insertions(+), 82 deletions(-) (limited to 'BJC-Utils2/src/main/java/bjc/utils/data/TopDownTransformIterator.java') diff --git a/BJC-Utils2/src/main/java/bjc/utils/data/TopDownTransformIterator.java b/BJC-Utils2/src/main/java/bjc/utils/data/TopDownTransformIterator.java index d37123f..8a24512 100644 --- a/BJC-Utils2/src/main/java/bjc/utils/data/TopDownTransformIterator.java +++ b/BJC-Utils2/src/main/java/bjc/utils/data/TopDownTransformIterator.java @@ -12,13 +12,11 @@ import static bjc.utils.data.TopDownTransformResult.*; public class TopDownTransformIterator implements Iterator> { private Function picker; - private BiFunction, - Consumer>>, - ITree> transform; + private BiFunction, Consumer>>, ITree> transform; private ITree preParent; private ITree postParent; - + private Deque> preChildren; private Deque> postChildren; @@ -28,29 +26,29 @@ public class TopDownTransformIterator implements Iterator>> toYield; - private Iterator> curYield; + private Iterator> curYield; - public TopDownTransformIterator(Function pickr, + public TopDownTransformIterator(Function pickr, BiFunction, Consumer>>, ITree> transfrm, ITree tree) { preParent = tree; - preChildren = new LinkedList<>(); + preChildren = new LinkedList<>(); postChildren = new LinkedList<>(); - toYield = new LinkedList<>(); + toYield = new LinkedList<>(); - picker = pickr; + picker = pickr; transform = transfrm; - done = false; + done = false; initial = true; } public void addYield(Iterator> src) { - if(curYield != null) { + if (curYield != null) { toYield.push(curYield); } - + curYield = src; } @@ -59,17 +57,17 @@ public class TopDownTransformIterator implements Iterator flushYields(ITree val) { - if(curYield != null) { + if (curYield != null) { toYield.add(new SingleIterator<>(val)); - if(curYield.hasNext()) { + if (curYield.hasNext()) { return curYield.next(); } else { - while(toYield.size() != 0 && !curYield.hasNext()) { + while (toYield.size() != 0 && !curYield.hasNext()) { curYield = toYield.pop(); } - if(toYield.size() == 0 && !curYield.hasNext()) { + if (toYield.size() == 0 && !curYield.hasNext()) { curYield = null; return val; } else { @@ -82,17 +80,18 @@ public class TopDownTransformIterator implements Iterator next() { - if(done) throw new NoSuchElementException(); + if (done) + throw new NoSuchElementException(); - if(curYield != null) { - if(curYield.hasNext()) { + if (curYield != null) { + if (curYield.hasNext()) { return curYield.next(); } else { - while(toYield.size() != 0 && !curYield.hasNext()) { + while (toYield.size() != 0 && !curYield.hasNext()) { curYield = toYield.pop(); } - if(toYield.size() == 0 && !curYield.hasNext()) { + if (toYield.size() == 0 && !curYield.hasNext()) { curYield = null; } else { return curYield.next(); @@ -100,73 +99,74 @@ public class TopDownTransformIterator implements Iterator(preParent.getHead()); - - if(preParent.getChildrenCount() != 0) { - for(int i = 0; i < preParent.getChildrenCount(); i++) { - preChildren.add(preParent.getChild(i)); - } - - // Return whatever the first child is - break; - } else { - done = true; - return flushYields(postParent); + switch (res) { + case PASSTHROUGH: + postParent = new Tree<>(preParent.getHead()); + + if (preParent.getChildrenCount() != 0) { + for (int i = 0; i < preParent.getChildrenCount(); i++) { + preChildren.add(preParent.getChild(i)); } - case SKIP: - done = true; - return flushYields(preParent); - case TRANSFORM: + + // Return whatever the first child is + break; + } else { done = true; - return flushYields(transform.apply(preParent, this::addYield)); - case RTRANSFORM: - preParent = transform.apply(preParent, this::addYield); - return flushYields(preParent); - case PUSHDOWN: - if(preParent.getChildrenCount() != 0) { - for(int i = 0; i < preParent.getChildrenCount(); i++) { - preChildren.add(preParent.getChild(i)); - } - - // Return whatever the first child is - break; - } else { - done = true; - return flushYields(transform.apply(new Tree<>(preParent.getHead()), this::addYield)); + return flushYields(postParent); + } + case SKIP: + done = true; + return flushYields(preParent); + case TRANSFORM: + done = true; + return flushYields(transform.apply(preParent, this::addYield)); + case RTRANSFORM: + preParent = transform.apply(preParent, this::addYield); + return flushYields(preParent); + case PUSHDOWN: + if (preParent.getChildrenCount() != 0) { + for (int i = 0; i < preParent.getChildrenCount(); i++) { + preChildren.add(preParent.getChild(i)); } - case PULLUP: - ITree intRes = transform.apply(preParent, this::addYield); - - postParent = new Tree<>(intRes.getHead()); - - if(intRes.getChildrenCount() != 0) { - for(int i = 0; i < intRes.getChildrenCount(); i++) { - preChildren.add(intRes.getChild(i)); - } - - // Return whatever the first child is - break; - } else { - done = true; - return flushYields(postParent); + + // Return whatever the first child is + break; + } else { + done = true; + return flushYields(transform.apply(new Tree<>(preParent.getHead()), + this::addYield)); + } + case PULLUP: + ITree intRes = transform.apply(preParent, this::addYield); + + postParent = new Tree<>(intRes.getHead()); + + if (intRes.getChildrenCount() != 0) { + for (int i = 0; i < intRes.getChildrenCount(); i++) { + preChildren.add(intRes.getChild(i)); } - default: - throw new IllegalArgumentException("Unknown result type " + res); + + // Return whatever the first child is + break; + } else { + done = true; + return flushYields(postParent); + } + default: + throw new IllegalArgumentException("Unknown result type " + res); } - if(res != RTRANSFORM) initial = false; + if (res != RTRANSFORM) + initial = false; } - - if(curChild == null || !curChild.hasNext()) { - if(preChildren.size() != 0) { + if (curChild == null || !curChild.hasNext()) { + if (preChildren.size() != 0) { curChild = new TopDownTransformIterator<>(picker, transform, preChildren.pop()); - + ITree res = curChild.next(); System.out.println("\t\tTRACE: adding node " + res + " to children"); postChildren.add(res); @@ -175,21 +175,22 @@ public class TopDownTransformIterator implements Iterator res = null; - if(postParent == null) { + if (postParent == null) { res = new Tree<>(preParent.getHead()); System.out.println("\t\tTRACE: adding nodes " + postChildren + " to " + res); - for(ITree child : postChildren) { + for (ITree child : postChildren) { res.addChild(child); } - - // res = transform.apply(res, this::addYield); + + // res = transform.apply(res, + // this::addYield); } else { res = postParent; System.out.println("\t\tTRACE: adding nodes " + postChildren + " to " + res); - for(ITree child : postChildren) { + for (ITree child : postChildren) { res.addChild(child); } } -- cgit v1.2.3