static Entry tree(NodeRef left, NodeRef right, boolean accepted) { Entry e = new Entry(); e.left = left; e.right = right; e.accepted = accepted; return e; }
static Entry bucket(NodeRef leftParent, NodeRef rightParent, BucketIndex bucketIndex, Bucket left, Bucket right, boolean accepted) { Entry e = new Entry(); e.left = left; e.right = right; e.leftParent = leftParent; e.rightParent = rightParent; e.bucketIndex = bucketIndex; e.accepted = accepted; return e; }
static Entry tree(NodeRef left, NodeRef right, boolean accepted) { Entry e = new Entry(); e.left = left; e.right = right; e.accepted = accepted; return e; }
static Entry bucket(NodeRef leftParent, NodeRef rightParent, BucketIndex bucketIndex, Bucket left, Bucket right, boolean accepted) { Entry e = new Entry(); e.left = left; e.right = right; e.leftParent = leftParent; e.rightParent = rightParent; e.bucketIndex = bucketIndex; e.accepted = accepted; return e; }