JoaoJunior/formatted-java-code-APR · Datasets at Hugging Face

public ITypes getTypesService(){ return (ITypes) this.ctx.getBean("typesService"); }

public ITypes getTypesService(){ return getServiceByClass(ITypes.class); }

3,233,307

public IUpdate getUpdateService(){ return (IUpdate) this.ctx.getBean("updateService"); }

public IUpdate getUpdateService(){ return getServiceByClass(IUpdate.class); }

3,233,308

public String getSourceFileName() { String baseName; if (sourceFileName != null) baseName = sourceFileName; else { int firstDollarSign = getName().indexOf('$'); if (firstDollarSign == -1) baseName = getBaseName() + ".java"; else baseName = getBaseName().substring(0, firstDollarSign - 1) + ".java"; } String packageName = getPackageName(); if (packageName == null) return baseName; return getPackageName().replace('.', '/') + '/' + baseName; }

3,233,309

public String getSourceFileName() { String baseName; if (sourceFileName != null) baseName = sourceFileName; else { int firstDollarSign = getName().indexOf('$'); if (firstDollarSign == -1) baseName = getBaseName() + ".java"; else baseName = getBaseName().substring(0, firstDollarSign - 1) + ".java"; } String packageName = getPackageName(); if (packageName == null) return baseName; return getPackageName().replace('.', '/') + '/' + baseName; }

3,233,310

public ColouredButton(String text, Color color) { super(text); if (color == null) throw new IllegalArgumentException("No color."); setBackground(color); uiDelegate = new ColouredButtonUI(this, color); setUI(uiDelegate); setRolloverEnabled(false); }

public ColouredButton(String text, Color color) { super(text); if (color == null) throw new IllegalArgumentException("No color."); setBackground(color); uiDelegate = new ColouredButtonUI(this, color); setRolloverEnabled(false); }

3,233,312

public List childNodes() { return Collections.EMPTY_LIST; }

public List childNodes() { return EMPTY_LIST; }

3,233,313

void onStateChange(boolean b) { if (b) { tSelectionField.setEditable(model.getMaxT() != 0); tSelectionField.setEditable(model.getMaxZ() != 0); } else { tSelectionField.setEditable(b); zSelectionField.setEditable(b); } }

void onStateChange(boolean b) { if (b) { tSelectionField.setEditable(model.getMaxT() != 0); zSelectionField.setEditable(model.getMaxZ() != 0); } else { tSelectionField.setEditable(b); zSelectionField.setEditable(b); } }

3,233,314

public void setZoomFactor(double factor) { if (factor != -1) { if (factor > ZoomAction.MAX_ZOOM_FACTOR || factor < ZoomAction.MIN_ZOOM_FACTOR) throw new IllegalArgumentException("The zoom factor is value " + "between "+ZoomAction.MIN_ZOOM_FACTOR+" and "+ ZoomAction.MAX_ZOOM_FACTOR); } else { int width = model.getRenderedImage().getWidth(); int height = model.getRenderedImage().getHeight(); Dimension viewport = view.getCurrentViewport(); double zoomFactorX = viewport.getWidth()/width; double zoomFactorY = viewport.getHeight()/height; factor = Math.min(zoomFactorX, zoomFactorY); } model.setZoomFactor(factor); view.zoomImage(); }

3,233,315

public void setZoomFactor(double factor) { if (factor != -1) { if (factor > ZoomAction.MAX_ZOOM_FACTOR || factor < ZoomAction.MIN_ZOOM_FACTOR) throw new IllegalArgumentException("The zoom factor is value " + "between "+ZoomAction.MIN_ZOOM_FACTOR+" and "+ ZoomAction.MAX_ZOOM_FACTOR); } else { int width = model.getRenderedImage().getWidth(); int height = model.getRenderedImage().getHeight(); Dimension viewport = view.getCurrentViewport(); double zoomFactorX = viewport.getWidth()/width; double zoomFactorY = viewport.getHeight()/height; factor = Math.min(zoomFactorX, zoomFactorY); } model.setZoomFactor(factor); view.zoomImage(); }

3,233,316

public void setZoomFactor(double factor) { if (factor != -1) { if (factor > ZoomAction.MAX_ZOOM_FACTOR || factor < ZoomAction.MIN_ZOOM_FACTOR) throw new IllegalArgumentException("The zoom factor is value " + "between "+ZoomAction.MIN_ZOOM_FACTOR+" and "+ ZoomAction.MAX_ZOOM_FACTOR); } else { int width = model.getRenderedImage().getWidth(); int height = model.getRenderedImage().getHeight(); Dimension viewport = view.getCurrentViewport(); double zoomFactorX = viewport.getWidth()/width; double zoomFactorY = viewport.getHeight()/height; factor = Math.min(zoomFactorX, zoomFactorY); } model.setZoomFactor(factor); view.zoomImage(); }

3,233,317

private JPanel buildListPanel() { JPanel p = new JPanel(); JLabel label = new JLabel("Select channels "); GridBagLayout gridbag = new GridBagLayout(); GridBagConstraints c = new GridBagConstraints(); p.setLayout(gridbag); c.weightx = 0.5; c.gridx = 0; c.gridy = 0; c.anchor = GridBagConstraints.NORTHWEST; gridbag.setConstraints(label, c); p.add(label); JScrollPane scrollPane = new JScrollPane(listChannels); scrollPane.setPreferredSize(dimScroll); c.gridx = 1; gridbag.setConstraints(scrollPane, c); p.add(scrollPane); c.gridy = 1; Component box = Box.createRigidArea(VBOX); gridbag.setConstraints(box, c); p.add(box); label = new JLabel("Select ROIs "); c.gridx = 0; c.gridy = 2; gridbag.setConstraints(label, c); p.add(label); scrollPane = new JScrollPane(listROI); scrollPane.setPreferredSize(MIN_SCROLL); c.gridx = 1; gridbag.setConstraints(scrollPane, c); p.add(scrollPane); return UIUtilities.buildComponentPanel(p); }

private JPanel buildListPanel() { JPanel p = new JPanel(); JLabel label = new JLabel("Select channels "); GridBagLayout gridbag = new GridBagLayout(); GridBagConstraints c = new GridBagConstraints(); p.setLayout(gridbag); c.weightx = 0.5; c.gridx = 0; c.gridy = 0; c.anchor = GridBagConstraints.NORTHWEST; gridbag.setConstraints(label, c); p.add(label); JScrollPane scrollPane = new JScrollPane(listChannels); scrollPane.setPreferredSize(dimScroll); c.gridx = 1; gridbag.setConstraints(scrollPane, c); p.add(scrollPane); c.gridy = 1; Component box = Box.createRigidArea(VBOX); gridbag.setConstraints(box, c); p.add(box); label = new JLabel("Select ROIs "); c.gridx = 0; c.gridy = 2; gridbag.setConstraints(label, c); p.add(label); scrollPane = new JScrollPane(listROI); scrollPane.setPreferredSize(SCROLL_ROI); c.gridx = 1; gridbag.setConstraints(scrollPane, c); p.add(scrollPane); return UIUtilities.buildComponentPanel(p); }

3,233,318

public void test_HandlesExplicitPermissionReduction() throws Exception { login( uname, gname, "Test" ); p = new Project(); p.setName( "ticket:339" ); d = new Dataset(); d.setName( "ticket:339" ); p.linkDataset( d ); Permissions perms = Permissions.IMMUTABLE; // relatively common use-case p.getDetails().setPermissions( perms ); Project t = iUpdate.saveAndReturnObject( p ); }

public void test_HandlesExplicitPermissionReduction() throws Exception { login( uname, gname, "Test" ); p = new Project(); p.setName( "ticket:339" ); d = new Dataset(); d.setName( "ticket:339" ); p.linkDataset( d ); Permissions perms = Permissions.READ_ONLY; // relatively common use-case p.getDetails().setPermissions( perms ); Project t = iUpdate.saveAndReturnObject( p ); }

3,233,319

public static XmlBeanDefinitionReader createBeanDefinitionReader( SpringApplicationContext applicationContext, BeanDefinitionRegistry registry, List xmlPreprocessors) { String version = SpringVersion.getVersion(); String className = "org.apache.xbean.spring.context.v" + version.charAt(0) + ".XBeanXmlBeanDefinitionReader"; try { Class cl = Class.forName(className); Constructor cstr = cl.getConstructor(new Class[] { SpringApplicationContext.class, BeanDefinitionRegistry.class, List.class }); return (XmlBeanDefinitionReader) cstr.newInstance(new Object[] { applicationContext, registry, xmlPreprocessors }); } catch (Exception e) { throw new IllegalStateException("Could not find valid implementation for: " + version, e); } }

public static XmlBeanDefinitionReader createBeanDefinitionReader( SpringApplicationContext applicationContext, BeanDefinitionRegistry registry, List xmlPreprocessors) { String version = SpringVersion.getVersion(); String className = "org.apache.xbean.spring.context.v" + version.charAt(0) + ".XBeanXmlBeanDefinitionReader"; try { Class cl = Class.forName(className); Constructor cstr = cl.getConstructor(new Class[] { SpringApplicationContext.class, BeanDefinitionRegistry.class, List.class }); return (XmlBeanDefinitionReader) cstr.newInstance(new Object[] { applicationContext, registry, xmlPreprocessors }); } catch (Exception e) { throw (IllegalStateException) new IllegalStateException("Could not find valid implementation for: " + version).initCause(e); } }

3,233,320

public Object[] getValues() {// "Headline", "Published", "Author", "Status" List values = new ArrayList(); values.add(getHeadline()); values.add(getAuthor()); values.add(getSource()); values.add(getCreationDate()); values.add(getLocaleIdAsString()); values.add(getStatus()); return values.toArray(new Object[values.size()]); }

3,233,321

public MainMenuController(DisplayedDocument displayedDocument) { super(displayedDocument); }

3,233,322

public Node block_append(Node head, Node tail) { if (tail == null) { return head; } else if (head == null) { return tail; } Node end; if (head instanceof BlockNode) { end = ((BlockNode) head).getEndNode(); } else { end = nf.newBlock(head); // end.setEndNode(end); not needed anymore Benoit fixpos(end, head); head = end; } if (ruby.isVerbose()) { Node nd = end.getHeadNode(); while (true) { switch (nd.getType()) { case Constants.NODE_RETURN : case Constants.NODE_BREAK : case Constants.NODE_NEXT : case Constants.NODE_REDO : case Constants.NODE_RETRY : rb_warning("statement not reached"); break; case Constants.NODE_NEWLINE : nd = nd.getNextNode(); continue; default : break; } break; } } if (!(tail instanceof BlockNode)) { tail = nf.newBlock(tail); // tail.setEndNode(tail); not needed anymore Benoit } end.setNextNode(tail); head.setEndNode(tail.getEndNode()); return head; }

public Node block_append(Node head, Node tail) { if (tail == null) { return head; } else if (head == null) { return tail; } Node end; if (head instanceof BlockNode) { end = ((BlockNode) head).getEndNode(); } else { end = nf.newBlock(head); // end.setEndNode(end); not needed anymore Benoit end.setPosFrom(head); head = end; } if (ruby.isVerbose()) { Node nd = end.getHeadNode(); while (true) { switch (nd.getType()) { case Constants.NODE_RETURN : case Constants.NODE_BREAK : case Constants.NODE_NEXT : case Constants.NODE_REDO : case Constants.NODE_RETRY : rb_warning("statement not reached"); break; case Constants.NODE_NEWLINE : nd = nd.getNextNode(); continue; default : break; } break; } } if (!(tail instanceof BlockNode)) { tail = nf.newBlock(tail); // tail.setEndNode(tail); not needed anymore Benoit } end.setNextNode(tail); head.setEndNode(tail.getEndNode()); return head; }

3,233,324

public Node cond(Node node) { // return cond1(node, 0); if (node == null) { return null; } if (node.getType() == Constants.NODE_NEWLINE) { node.setNextNode(cond0(node.getNextNode()/*, logop*/)); return node; } return cond0(node/*, logop*/); }

public Node cond(Node node) {// return cond1(node, 0);if (node == null) {return null;}if (node.getType() == Constants.NODE_NEWLINE) {node.setNextNode(cond0(node.getNextNode()/*, logop*/));return node;}return cond0(node/*, logop*/);}

3,233,325

public Node cond(Node node) { // return cond1(node, 0); if (node == null) { return null; } if (node.getType() == Constants.NODE_NEWLINE) { node.setNextNode(cond0(node.getNextNode()/*, logop*/)); return node; } return cond0(node/*, logop*/); }

public Node cond(Node node) { // return cond1(node, 0); if (node == null) { return null; } if (node.getType() == Constants.NODE_NEWLINE) { node.setNextNode(cond0(node.getNextNode())); return node; } return cond0(node/*, logop*/); }

3,233,326

public Node cond(Node node) { // return cond1(node, 0); if (node == null) { return null; } if (node.getType() == Constants.NODE_NEWLINE) { node.setNextNode(cond0(node.getNextNode()/*, logop*/)); return node; } return cond0(node/*, logop*/); }

public Node cond(Node node) { // return cond1(node, 0); if (node == null) { return null; } if (node.getType() == Constants.NODE_NEWLINE) { node.setNextNode(cond0(node.getNextNode()/*, logop*/)); return node; } return cond0(node); }

3,233,327

private Node cond0(Node node /*, int logop*/) { int type = node.getType(); // enum node_type assign_in_cond(node); // DOT => FLIP boolean exclusive = true; switch (type) { /*case Constants.NODE_DSTR : case Constants.NODE_STR : if (logop != 0) { break; } rb_warn("string literal in condition"); break;*/ case Constants.NODE_DREGX : case Constants.NODE_DREGX_ONCE : // warning_unless_e_option("regex literal in condition"); getLocalIndex("_"); getLocalIndex("~"); return nf.newMatch2(node, nf.newGVar("$_")); case Constants.NODE_DOT2 : exclusive = false; case Constants.NODE_DOT3 : Node flipNode = new FlipNode(cond2(node.getBeginNode()/*, logop*/), cond2(node.getEndNode()/*, logop*/), exclusive); flipNode.setCount(registerLocal(null)); // warning_unless_e_option("range literal in condition"); return flipNode; case Constants.NODE_LIT : if (node.getLiteral() instanceof RubyRegexp) { getLocalIndex("_"); getLocalIndex("~"); return nf.newMatch(node); } else if (node.getLiteral() instanceof RubyString) { getLocalIndex("_"); getLocalIndex("~"); return nf.newMatch(nf.newLit(RubyRegexp.newRegexp(ruby, (RubyString)node.getLiteral(), 0))); } default: return node; } }

3,233,328

private Node cond0(Node node /*, int logop*/) { int type = node.getType(); // enum node_type assign_in_cond(node); // DOT => FLIP boolean exclusive = true; switch (type) { /*case Constants.NODE_DSTR : case Constants.NODE_STR : if (logop != 0) { break; } rb_warn("string literal in condition"); break;*/ case Constants.NODE_DREGX : case Constants.NODE_DREGX_ONCE : // warning_unless_e_option("regex literal in condition"); getLocalIndex("_"); getLocalIndex("~"); return nf.newMatch2(node, nf.newGVar("$_")); case Constants.NODE_DOT2 : exclusive = false; case Constants.NODE_DOT3 : Node flipNode = new FlipNode(cond2(node.getBeginNode()/*, logop*/), cond2(node.getEndNode()/*, logop*/), exclusive); flipNode.setCount(registerLocal(null)); // warning_unless_e_option("range literal in condition"); return flipNode; case Constants.NODE_LIT : if (node.getLiteral() instanceof RubyRegexp) { getLocalIndex("_"); getLocalIndex("~"); return nf.newMatch(node); } else if (node.getLiteral() instanceof RubyString) { getLocalIndex("_"); getLocalIndex("~"); return nf.newMatch(nf.newLit(RubyRegexp.newRegexp(ruby, (RubyString)node.getLiteral(), 0))); } default: return node; } }

3,233,329

private Node cond0(Node node /*, int logop*/) { int type = node.getType(); // enum node_type assign_in_cond(node); // DOT => FLIP boolean exclusive = true; switch (type) { /*case Constants.NODE_DSTR : case Constants.NODE_STR : if (logop != 0) { break; } rb_warn("string literal in condition"); break;*/ case Constants.NODE_DREGX : case Constants.NODE_DREGX_ONCE : // warning_unless_e_option("regex literal in condition"); getLocalIndex("_"); getLocalIndex("~"); return nf.newMatch2(node, nf.newGVar("$_")); case Constants.NODE_DOT2 : exclusive = false; case Constants.NODE_DOT3 : Node flipNode = new FlipNode(cond2(node.getBeginNode()/*, logop*/), cond2(node.getEndNode()/*, logop*/), exclusive); flipNode.setCount(registerLocal(null)); // warning_unless_e_option("range literal in condition"); return flipNode; case Constants.NODE_LIT : if (node.getLiteral() instanceof RubyRegexp) { getLocalIndex("_"); getLocalIndex("~"); return nf.newMatch(node); } else if (node.getLiteral() instanceof RubyString) { getLocalIndex("_"); getLocalIndex("~"); return nf.newMatch(nf.newLit(RubyRegexp.newRegexp(ruby, (RubyString)node.getLiteral(), 0))); } default: return node; } }

privateNodecond0(Nodenode/*,intlogop*/){inttype=node.getType();//enumnode_typeassign_in_cond(node);//DOT=>FLIPbooleanexclusive=true;switch(type){/*caseConstants.NODE_DSTR:caseConstants.NODE_STR:if(logop!=0){break;}rb_warn("stringliteralincondition");break;*/caseConstants.NODE_DREGX:caseConstants.NODE_DREGX_ONCE://warning_unless_e_option("regexliteralincondition");getLocalIndex("_");getLocalIndex("~");returnnf.newMatch2(node,nf.newGVar("$_"));caseConstants.NODE_DOT2: exclusive=false;caseConstants.NODE_DOT3: NodeflipNode=newFlipNode(cond2(node.getBeginNode()/*,logop*/),cond2(node.getEndNode()/*,logop*/),exclusive); flipNode.setCount(registerLocal(null));//warning_unless_e_option("rangeliteralincondition");returnflipNode;caseConstants.NODE_LIT:if(node.getLiteral()instanceofRubyRegexp){getLocalIndex("_");getLocalIndex("~");returnnf.newMatch(node);}elseif(node.getLiteral()instanceofRubyString){getLocalIndex("_");getLocalIndex("~");returnnf.newMatch(nf.newLit(RubyRegexp.newRegexp(ruby,(RubyString)node.getLiteral(),0)));}default: returnnode;}}

3,233,330

private Node cond0(Node node /*, int logop*/) { int type = node.getType(); // enum node_type assign_in_cond(node); // DOT => FLIP boolean exclusive = true; switch (type) { /*case Constants.NODE_DSTR : case Constants.NODE_STR : if (logop != 0) { break; } rb_warn("string literal in condition"); break;*/ case Constants.NODE_DREGX : case Constants.NODE_DREGX_ONCE : // warning_unless_e_option("regex literal in condition"); getLocalIndex("_"); getLocalIndex("~"); return nf.newMatch2(node, nf.newGVar("$_")); case Constants.NODE_DOT2 : exclusive = false; case Constants.NODE_DOT3 : Node flipNode = new FlipNode(cond2(node.getBeginNode()/*, logop*/), cond2(node.getEndNode()/*, logop*/), exclusive); flipNode.setCount(registerLocal(null)); // warning_unless_e_option("range literal in condition"); return flipNode; case Constants.NODE_LIT : if (node.getLiteral() instanceof RubyRegexp) { getLocalIndex("_"); getLocalIndex("~"); return nf.newMatch(node); } else if (node.getLiteral() instanceof RubyString) { getLocalIndex("_"); getLocalIndex("~"); return nf.newMatch(nf.newLit(RubyRegexp.newRegexp(ruby, (RubyString)node.getLiteral(), 0))); } default: return node; } }

private Node cond0(Node node /*, int logop*/) { int type = node.getType(); // enum node_type assign_in_cond(node); // DOT => FLIP boolean exclusive = true; switch (type) { /*case Constants.NODE_DSTR : case Constants.NODE_STR : if (logop != 0) { break; } rb_warn("string literal in condition"); break;*/ case Constants.NODE_DREGX : case Constants.NODE_DREGX_ONCE : // warning_unless_e_option("regex literal in condition"); getLocalIndex("_"); getLocalIndex("~"); return nf.newMatch2(node, nf.newGVar("$_")); case Constants.NODE_DOT2 : exclusive = false; case Constants.NODE_DOT3 : Node flipNode = new FlipNode(cond2(node.getBeginNode()), cond2(node.getEndNode()), exclusive); flipNode.setCount(registerLocal(null)); // warning_unless_e_option("range literal in condition"); return flipNode; case Constants.NODE_LIT : if (node.getLiteral() instanceof RubyRegexp) { getLocalIndex("_"); getLocalIndex("~"); return nf.newMatch(node); } else if (node.getLiteral() instanceof RubyString) { getLocalIndex("_"); getLocalIndex("~"); return nf.newMatch(nf.newLit(RubyRegexp.newRegexp(ruby, (RubyString)node.getLiteral(), 0))); } default: return node; } }

3,233,331

private Node cond0(Node node /*, int logop*/) { int type = node.getType(); // enum node_type assign_in_cond(node); // DOT => FLIP boolean exclusive = true; switch (type) { /*case Constants.NODE_DSTR : case Constants.NODE_STR : if (logop != 0) { break; } rb_warn("string literal in condition"); break;*/ case Constants.NODE_DREGX : case Constants.NODE_DREGX_ONCE : // warning_unless_e_option("regex literal in condition"); getLocalIndex("_"); getLocalIndex("~"); return nf.newMatch2(node, nf.newGVar("$_")); case Constants.NODE_DOT2 : exclusive = false; case Constants.NODE_DOT3 : Node flipNode = new FlipNode(cond2(node.getBeginNode()/*, logop*/), cond2(node.getEndNode()/*, logop*/), exclusive); flipNode.setCount(registerLocal(null)); // warning_unless_e_option("range literal in condition"); return flipNode; case Constants.NODE_LIT : if (node.getLiteral() instanceof RubyRegexp) { getLocalIndex("_"); getLocalIndex("~"); return nf.newMatch(node); } else if (node.getLiteral() instanceof RubyString) { getLocalIndex("_"); getLocalIndex("~"); return nf.newMatch(nf.newLit(RubyRegexp.newRegexp(ruby, (RubyString)node.getLiteral(), 0))); } default: return node; } }

privateNodecond0(Nodenode/*,intlogop*/){inttype=node.getType();//enumnode_typeassign_in_cond(node);//DOT=>FLIPbooleanexclusive=true;switch(type){/*caseConstants.NODE_DSTR:caseConstants.NODE_STR:if(logop!=0){break;}rb_warn("stringliteralincondition");break;*/caseConstants.NODE_DREGX:caseConstants.NODE_DREGX_ONCE://warning_unless_e_option("regexliteralincondition");getLocalIndex("_");getLocalIndex("~");returnnf.newMatch2(node,nf.newGVar("$_"));caseConstants.NODE_DOT2: exclusive=false;caseConstants.NODE_DOT3: NodeflipNode=newFlipNode(cond2(node.getBeginNode()/*,logop*/),cond2(node.getEndNode()/*,logop*/),exclusive); flipNode.setCount(registerLocal(null));//warning_unless_e_option("rangeliteralincondition");returnflipNode;caseConstants.NODE_LIT:if(node.getLiteral()instanceofRubyRegexp){getLocalIndex("_");getLocalIndex("~");returnnf.newMatch(node);}elseif(node.getLiteral()instanceofRubyString){getLocalIndex("_");getLocalIndex("~");returnnf.newMatch(nf.newLit(RubyRegexp.newRegexp(ruby,(RubyString)node.getLiteral(),0)));}default: returnnode;}}

3,233,332

public Node getAccessNode(String id) { id = id.intern(); if (id.charAt(0) == '#') { // Special variable or constant id = id.substring(1).intern(); if (id == "self") { return nf.newSelf(); } else if (id == "nil") { return nf.newNil(); } else if (id == "true") { return nf.newTrue(); } else if (id == "false") { return nf.newFalse(); } else if (id == "__FILE__") { return nf.newStr(RubyString.newString(ruby, ruby.getSourceFile())); } else if (id == "__LINE__") { return nf.newLit(RubyFixnum.newFixnum(ruby, ruby.getSourceLine())); } } else { if (IdUtil.isLocal(id)) { if (dyna_in_block() && RubyVarmap.isDefined(ruby, id)) { return nf.newDVar(id); } else if (isLocalRegistered(id)) { return nf.newLVar(id); } /* * method call without arguments */ return nf.newVCall(id); } else if (IdUtil.isGlobal(id)) { return nf.newGVar(id); } else if (IdUtil.isInstanceVariable(id)) { return nf.newIVar(id); } else if (IdUtil.isConstant(id)) { return nf.newConst(id); } else if (IdUtil.isClassVariable(id)) { if (isInSingle()) { return nf.newCVar2(id); } return nf.newCVar(id); } } rb_bug("Invalid id '" + id + "' for getAccessNode."); return null; }

public Node getAccessNode(String id) { id = id.intern(); /*if (id.charAt(0) == '#') { // Special variable or constant id = id.substring(1).intern(); if (id == "self") { return nf.newSelf(); } else if (id == "nil") { return nf.newNil(); } else if (id == "true") { return nf.newTrue(); } else if (id == "false") { return nf.newFalse(); } else if (id == "__FILE__") { return nf.newStr(RubyString.newString(ruby, ruby.getSourceFile())); } else if (id == "__LINE__") { return nf.newLit(RubyFixnum.newFixnum(ruby, ruby.getSourceLine())); } } else { if (IdUtil.isLocal(id)) { if (dyna_in_block() && RubyVarmap.isDefined(ruby, id)) { return nf.newDVar(id); } else if (isLocalRegistered(id)) { return nf.newLVar(id); } /* * method call without arguments */ return nf.newVCall(id); } else if (IdUtil.isGlobal(id)) { return nf.newGVar(id); } else if (IdUtil.isInstanceVariable(id)) { return nf.newIVar(id); } else if (IdUtil.isConstant(id)) { return nf.newConst(id); } else if (IdUtil.isClassVariable(id)) { if (isInSingle()) { return nf.newCVar2(id); } return nf.newCVar(id); } } rb_bug("Invalid id '" + id + "' for getAccessNode."); return null; }

3,233,333

public Node getAccessNode(String id) { id = id.intern(); if (id.charAt(0) == '#') { // Special variable or constant id = id.substring(1).intern(); if (id == "self") { return nf.newSelf(); } else if (id == "nil") { return nf.newNil(); } else if (id == "true") { return nf.newTrue(); } else if (id == "false") { return nf.newFalse(); } else if (id == "__FILE__") { return nf.newStr(RubyString.newString(ruby, ruby.getSourceFile())); } else if (id == "__LINE__") { return nf.newLit(RubyFixnum.newFixnum(ruby, ruby.getSourceLine())); } } else { if (IdUtil.isLocal(id)) { if (dyna_in_block() && RubyVarmap.isDefined(ruby, id)) { return nf.newDVar(id); } else if (isLocalRegistered(id)) { return nf.newLVar(id); } /* * method call without arguments */ return nf.newVCall(id); } else if (IdUtil.isGlobal(id)) { return nf.newGVar(id); } else if (IdUtil.isInstanceVariable(id)) { return nf.newIVar(id); } else if (IdUtil.isConstant(id)) { return nf.newConst(id); } else if (IdUtil.isClassVariable(id)) { if (isInSingle()) { return nf.newCVar2(id); } return nf.newCVar(id); } } rb_bug("Invalid id '" + id + "' for getAccessNode."); return null; }

public Node getAccessNode(String id) { id = id.intern(); if (id.charAt(0) == '#') { // Special variable or constant id = id.substring(1).intern(); if (id == "self") { return nf.newSelf(); } else if (id == "nil") { return nf.newNil(); } else if (id == "true") { return nf.newTrue(); } else if (id == "false") { return nf.newFalse(); } else if (id == "__FILE__") { return nf.newStr(RubyString.newString(ruby, ruby.getSourceFile())); } else if (id == "__LINE__") { return nf.newLit(RubyFixnum.newFixnum(ruby, ruby.getSourceLine())); } } else { */ if (IdUtil.isLocal(id)) { if (dyna_in_block() && RubyVarmap.isDefined(ruby, id)) { return nf.newDVar(id); } else if (isLocalRegistered(id)) { return nf.newLVar(id); } /* * method call without arguments */ return nf.newVCall(id); } else if (IdUtil.isGlobal(id)) { return nf.newGVar(id); } else if (IdUtil.isInstanceVariable(id)) { return nf.newIVar(id); } else if (IdUtil.isConstant(id)) { return nf.newConst(id); } else if (IdUtil.isClassVariable(id)) { if (isInSingle()) { return nf.newCVar2(id); } return nf.newCVar(id); } } rb_bug("Invalid id '" + id + "' for getAccessNode."); return null; }

3,233,334

public Node getAccessNode(String id) { id = id.intern(); if (id.charAt(0) == '#') { // Special variable or constant id = id.substring(1).intern(); if (id == "self") { return nf.newSelf(); } else if (id == "nil") { return nf.newNil(); } else if (id == "true") { return nf.newTrue(); } else if (id == "false") { return nf.newFalse(); } else if (id == "__FILE__") { return nf.newStr(RubyString.newString(ruby, ruby.getSourceFile())); } else if (id == "__LINE__") { return nf.newLit(RubyFixnum.newFixnum(ruby, ruby.getSourceLine())); } } else { if (IdUtil.isLocal(id)) { if (dyna_in_block() && RubyVarmap.isDefined(ruby, id)) { return nf.newDVar(id); } else if (isLocalRegistered(id)) { return nf.newLVar(id); } /* * method call without arguments */ return nf.newVCall(id); } else if (IdUtil.isGlobal(id)) { return nf.newGVar(id); } else if (IdUtil.isInstanceVariable(id)) { return nf.newIVar(id); } else if (IdUtil.isConstant(id)) { return nf.newConst(id); } else if (IdUtil.isClassVariable(id)) { if (isInSingle()) { return nf.newCVar2(id); } return nf.newCVar(id); } } rb_bug("Invalid id '" + id + "' for getAccessNode."); return null; }

public Node getAccessNode(String id) { id = id.intern(); if (id.charAt(0) == '#') { // Special variable or constant id = id.substring(1).intern(); if (id == "self") { return nf.newSelf(); else if (id == "nil") { return nf.newNil(); else if (id == "true") { return nf.newTrue(); else if (id == "false") { return nf.newFalse(); else if (id == "__FILE__") { return nf.newStr(RubyString.newString(ruby, ruby.getSourceFile())); else if (id == "__LINE__") { return nf.newLit(RubyFixnum.newFixnum(ruby, ruby.getSourceLine())); else { if (IdUtil.isLocal(id)) { if (dyna_in_block() && RubyVarmap.isDefined(ruby, id)) { return nf.newDVar(id); else if (isLocalRegistered(id)) { return nf.newLVar(id); /* * method call without arguments */ return nf.newVCall(id); else if (IdUtil.isGlobal(id)) { return nf.newGVar(id); else if (IdUtil.isInstanceVariable(id)) { return nf.newIVar(id); else if (IdUtil.isConstant(id)) { return nf.newConst(id); else if (IdUtil.isClassVariable(id)) { if (isInSingle()) { return nf.newCVar2(id); return nf.newCVar(id); rb_bug("Invalid id '" + id + "' for getAccessNode."); return null; }

3,233,335

public Node getAssignmentNode(String id, Node valueNode) { value_expr(valueNode); id = id.intern(); if (id.charAt(0) == '#') { // Special variable or constant. id = id.substring(1).intern(); if (id == "self") { yyerror("Can't change the value of self"); } else { // nil, true, false, __FILE__, __LINE__ yyerror("Can't assign to " + id); } } else { if (IdUtil.isLocal(id)) { if (RubyVarmap.isCurrent(ruby, id)) { return nf.newDAsgnCurr(id, valueNode); } else if (RubyVarmap.isDefined(ruby, id)) { return nf.newDAsgn(id, valueNode); } else if (isLocalRegistered(id) || !dyna_in_block()) { return nf.newLAsgn(id, valueNode); } else { RubyVarmap.push(ruby, id, ruby.getNil()); return nf.newDAsgnCurr(id, valueNode); } } else if (IdUtil.isGlobal(id)) { return nf.newGAsgn(id, valueNode); } else if (IdUtil.isInstanceVariable(id)) { return nf.newIAsgn(id, valueNode); } else if (IdUtil.isConstant(id)) { if (isInDef() || isInSingle()) { yyerror("dynamic constant assignment"); } return nf.newCDecl(id, valueNode); } else if (IdUtil.isClassVariable(id)) { if (isInSingle()) { return nf.newCVAsgn(id, valueNode); } return nf.newCVDecl(id, valueNode); } else { rb_bug("Id '" + id + "' not allowed for variable."); } } return null; }

public Node getAssignmentNode(String id, Node valueNode) { value_expr(valueNode); id = id.intern(); /*if (id.charAt(0) == '#') { // Special variable or constant. id = id.substring(1).intern(); if (id == "self") { yyerror("Can't change the value of self"); } else { // nil, true, false, __FILE__, __LINE__ yyerror("Can't assign to " + id); } } else { if (IdUtil.isLocal(id)) { if (RubyVarmap.isCurrent(ruby, id)) { return nf.newDAsgnCurr(id, valueNode); } else if (RubyVarmap.isDefined(ruby, id)) { return nf.newDAsgn(id, valueNode); } else if (isLocalRegistered(id) || !dyna_in_block()) { return nf.newLAsgn(id, valueNode); } else { RubyVarmap.push(ruby, id, ruby.getNil()); return nf.newDAsgnCurr(id, valueNode); } } else if (IdUtil.isGlobal(id)) { return nf.newGAsgn(id, valueNode); } else if (IdUtil.isInstanceVariable(id)) { return nf.newIAsgn(id, valueNode); } else if (IdUtil.isConstant(id)) { if (isInDef() || isInSingle()) { yyerror("dynamic constant assignment"); } return nf.newCDecl(id, valueNode); } else if (IdUtil.isClassVariable(id)) { if (isInSingle()) { return nf.newCVAsgn(id, valueNode); } return nf.newCVDecl(id, valueNode); } else { rb_bug("Id '" + id + "' not allowed for variable."); } } return null; }

3,233,336

public Node getAssignmentNode(String id, Node valueNode) { value_expr(valueNode); id = id.intern(); if (id.charAt(0) == '#') { // Special variable or constant. id = id.substring(1).intern(); if (id == "self") { yyerror("Can't change the value of self"); } else { // nil, true, false, __FILE__, __LINE__ yyerror("Can't assign to " + id); } } else { if (IdUtil.isLocal(id)) { if (RubyVarmap.isCurrent(ruby, id)) { return nf.newDAsgnCurr(id, valueNode); } else if (RubyVarmap.isDefined(ruby, id)) { return nf.newDAsgn(id, valueNode); } else if (isLocalRegistered(id) || !dyna_in_block()) { return nf.newLAsgn(id, valueNode); } else { RubyVarmap.push(ruby, id, ruby.getNil()); return nf.newDAsgnCurr(id, valueNode); } } else if (IdUtil.isGlobal(id)) { return nf.newGAsgn(id, valueNode); } else if (IdUtil.isInstanceVariable(id)) { return nf.newIAsgn(id, valueNode); } else if (IdUtil.isConstant(id)) { if (isInDef() || isInSingle()) { yyerror("dynamic constant assignment"); } return nf.newCDecl(id, valueNode); } else if (IdUtil.isClassVariable(id)) { if (isInSingle()) { return nf.newCVAsgn(id, valueNode); } return nf.newCVDecl(id, valueNode); } else { rb_bug("Id '" + id + "' not allowed for variable."); } } return null; }

public Node getAssignmentNode(String id, Node valueNode) { value_expr(valueNode); id = id.intern(); if (id.charAt(0) == '#') { // Special variable or constant. id = id.substring(1).intern(); if (id == "self") { yyerror("Can't change the value of self"); else { // nil, true, false, __FILE__, __LINE__ yyerror("Can't assign to " + id); else { if (IdUtil.isLocal(id)) { if (RubyVarmap.isCurrent(ruby, id)) { return nf.newDAsgnCurr(id, valueNode); else if (RubyVarmap.isDefined(ruby, id)) { return nf.newDAsgn(id, valueNode); else if (isLocalRegistered(id) || !dyna_in_block()) { return nf.newLAsgn(id, valueNode); else { RubyVarmap.push(ruby, id, ruby.getNil()); return nf.newDAsgnCurr(id, valueNode); else if (IdUtil.isGlobal(id)) { return nf.newGAsgn(id, valueNode); else if (IdUtil.isInstanceVariable(id)) { return nf.newIAsgn(id, valueNode); else if (IdUtil.isConstant(id)) { if (isInDef() || isInSingle()) { yyerror("dynamic constant assignment"); return nf.newCDecl(id, valueNode); else if (IdUtil.isClassVariable(id)) { if (isInSingle()) { return nf.newCVAsgn(id, valueNode); return nf.newCVDecl(id, valueNode); else { rb_bug("Id '" + id + "' not allowed for variable."); return null; }

3,233,337

public int getLine() { return _line; }

public int getLine() { return ruby.getSourceLine(); }

3,233,338

public Node newline_node(Node node) { NewlineNode nl = null; if (node != null) { nl = nf.newNewline(node); fixpos(nl, node); // nl.setNth(node.getLine()); not needed anymore Benoit } return nl; }

public Node newline_node(Node node) { NewlineNode nl = null; if (node != null) { nl = nf.newNewline(node); nl.setPosFrom(node); // nl.setNth(node.getLine()); not needed anymore Benoit } return nl; }

3,233,339

public Node node_assign(Node lhs, Node rhs) { if (lhs == null) { return null; } value_expr(rhs); switch (lhs.getType()) { case Constants.NODE_GASGN : case Constants.NODE_IASGN : case Constants.NODE_LASGN : case Constants.NODE_DASGN : case Constants.NODE_DASGN_CURR : case Constants.NODE_MASGN : case Constants.NODE_CDECL : case Constants.NODE_CVDECL : case Constants.NODE_CVASGN : lhs.setValueNode(rhs); break; case Constants.NODE_CALL : lhs.setArgsNode(arg_add(lhs.getArgsNode(), rhs)); break; default : /* * should not happen */ break; } if (rhs != null) { fixpos(lhs, rhs); } return lhs; }

3,233,340

public Node node_assign(Node lhs, Node rhs) { if (lhs == null) { return null; } value_expr(rhs); switch (lhs.getType()) { case Constants.NODE_GASGN : case Constants.NODE_IASGN : case Constants.NODE_LASGN : case Constants.NODE_DASGN : case Constants.NODE_DASGN_CURR : case Constants.NODE_MASGN : case Constants.NODE_CDECL : case Constants.NODE_CVDECL : case Constants.NODE_CVASGN : lhs.setValueNode(rhs); break; case Constants.NODE_CALL : lhs.setArgsNode(arg_add(lhs.getArgsNode(), rhs)); break; default : /* * should not happen */ break; } if (rhs != null) { fixpos(lhs, rhs); } return lhs; }

3,233,341

public void testAPITask() { final class T extends APITask { public T() { DefaultLogger logger = new DefaultLogger(); logger.setMessageOutputLevel(Project.MSG_DEBUG); logger.setErrorPrintStream(System.err); logger.setOutputPrintStream(System.out); setProject(new Project()); getProject().setBasedir( "/home/josh/code/omero/components/common/"); getProject().addBuildListener(logger); getProject().init(); setTaskName("api"); setTaskType("api"); setOwningTarget(new Target()); } } T task = new T(); FileSet fileSet = new FileSet(); fileSet.setDir(new File("/home/josh/code/omero/components/common/")); NameEntry entry = fileSet.createInclude(); entry.setName("**/api/*.java"); task.addFileset(fileSet); task.setDestdir(new File("/tmp")); task.execute(); }

3,233,342

public void testAPITask() { final class T extends APITask { public T() { DefaultLogger logger = new DefaultLogger(); logger.setMessageOutputLevel(Project.MSG_DEBUG); logger.setErrorPrintStream(System.err); logger.setOutputPrintStream(System.out); setProject(new Project()); getProject().setBasedir( "/home/josh/code/omero/components/common/"); getProject().addBuildListener(logger); getProject().init(); setTaskName("api"); setTaskType("api"); setOwningTarget(new Target()); } } T task = new T(); FileSet fileSet = new FileSet(); fileSet.setDir(new File("/home/josh/code/omero/components/common/")); NameEntry entry = fileSet.createInclude(); entry.setName("**/api/*.java"); task.addFileset(fileSet); task.setDestdir(new File("/tmp")); task.execute(); }

3,233,343

public void testAPITask() { final class T extends APITask { public T() { DefaultLogger logger = new DefaultLogger(); logger.setMessageOutputLevel(Project.MSG_DEBUG); logger.setErrorPrintStream(System.err); logger.setOutputPrintStream(System.out); setProject(new Project()); getProject().setBasedir( "/home/josh/code/omero/components/common/"); getProject().addBuildListener(logger); getProject().init(); setTaskName("api"); setTaskType("api"); setOwningTarget(new Target()); } } T task = new T(); FileSet fileSet = new FileSet(); fileSet.setDir(new File("/home/josh/code/omero/components/common/")); NameEntry entry = fileSet.createInclude(); entry.setName("**/api/*.java"); task.addFileset(fileSet); task.setDestdir(new File("/tmp")); task.execute(); }

public void testAPITask() { final class T extends APITask { public T() { DefaultLogger logger = new DefaultLogger(); logger.setMessageOutputLevel(Project.MSG_DEBUG); logger.setErrorPrintStream(System.err); logger.setOutputPrintStream(System.out); setProject(new Project()); getProject().setBasedir( "/home/josh/code/omero/components/common/"); getProject().addBuildListener(logger); getProject().init(); setTaskName("api"); setTaskType("api"); setOwningTarget(new Target()); } } T task = new T(); FileSet fileSet = new FileSet(); fileSet.setDir(commonDir); NameEntry entry = fileSet.createInclude(); entry.setName("**/api/*.java"); task.addFileset(fileSet); task.setDestdir(new File("/tmp")); task.execute(); }

3,233,344

public void testAPITask() { final class T extends APITask { public T() { DefaultLogger logger = new DefaultLogger(); logger.setMessageOutputLevel(Project.MSG_DEBUG); logger.setErrorPrintStream(System.err); logger.setOutputPrintStream(System.out); setProject(new Project()); getProject().setBasedir( "/home/josh/code/omero/components/common/"); getProject().addBuildListener(logger); getProject().init(); setTaskName("api"); setTaskType("api"); setOwningTarget(new Target()); } } T task = new T(); FileSet fileSet = new FileSet(); fileSet.setDir(new File("/home/josh/code/omero/components/common/")); NameEntry entry = fileSet.createInclude(); entry.setName("**/api/*.java"); task.addFileset(fileSet); task.setDestdir(new File("/tmp")); task.execute(); }

3,233,345

public T() { DefaultLogger logger = new DefaultLogger(); logger.setMessageOutputLevel(Project.MSG_DEBUG); logger.setErrorPrintStream(System.err); logger.setOutputPrintStream(System.out); setProject(new Project()); getProject().setBasedir( "/home/josh/code/omero/components/common/"); getProject().addBuildListener(logger); getProject().init(); setTaskName("api"); setTaskType("api"); setOwningTarget(new Target()); }

3,233,346

public IRubyObject createBacktrace(int level, boolean nativeException) { RubyArray backtrace = runtime.newArray(); int traceSize = frameIndex - level; if (traceSize <= 0) { return backtrace; } if (nativeException) { // assert level == 0; addBackTraceElement(backtrace, (Frame) frameStack[frameIndex], null); } for (int i = traceSize; i > 0; i--) { addBackTraceElement(backtrace, (Frame) frameStack[i], (Frame) frameStack[i-1]); } return backtrace; }

public IRubyObject createBacktrace(int level, boolean nativeException) { RubyArray backtrace = runtime.newArray(); int traceSize = frameIndex - level; if (traceSize <= 0) { return backtrace; } if (nativeException) { // assert level == 0; addBackTraceElement(backtrace, (Frame) frameStack[frameIndex], null); } for (int i = traceSize; i > currentBindingFrame(); i--) { addBackTraceElement(backtrace, (Frame) frameStack[i], (Frame) frameStack[i-1]); } return backtrace; }

3,233,347

public IRubyObject backtrace() { if (backtrace == null) { return getRuntime().getNil(); } return backtrace; }

3,233,351

public RubyException exception(IRubyObject[] args) { switch (args.length) { case 0 : return this; case 1 : if (args[0] == this) { return this; } return newInstance(getMetaClass(), args); default : throw getRuntime().newArgumentError("Wrong argument count"); } }

3,233,352

public RubyException exception(IRubyObject[] args) { switch (args.length) { case 0 : return this; case 1 : if (args[0] == this) { return this; } return newInstance(getMetaClass(), args); default : throw getRuntime().newArgumentError("Wrong argument count"); } }

publicRubyExceptionexception(IRubyObject[]args){switch(args.length){case0:returnthis;case1:if(args[0]==this){returnthis;}returnnewInstance(getMetaClass(),args);default:throwgetRuntime().newArgumentError("Wrongargumentcount");}}

3,233,353

public IRubyObject inspect() { RubyModule rubyClass = getMetaClass(); RubyString exception = RubyString.stringValue(this); if (exception.getValue().length() == 0) { return getRuntime().newString(rubyClass.getName()); } StringBuffer sb = new StringBuffer(); sb.append("#<"); sb.append(rubyClass.getName()); sb.append(": "); sb.append(exception.getValue()); sb.append(">"); return getRuntime().newString(sb.toString()); }

publicIRubyObjectinspect(){RubyModulerubyClass=getMetaClass();RubyStringexception=RubyString.stringValue(this);if(exception.getValue().length()==0){returngetRuntime().newString(rubyClass.getName());}StringBuffersb=newStringBuffer();sb.append("#<");sb.append(rubyClass.getName());sb.append(":");sb.append(exception.getValue());sb.append(">");returngetRuntime().newString(sb.toString());}

3,233,354

public IRubyObject inspect() { RubyModule rubyClass = getMetaClass(); RubyString exception = RubyString.stringValue(this); if (exception.getValue().length() == 0) { return getRuntime().newString(rubyClass.getName()); } StringBuffer sb = new StringBuffer(); sb.append("#<"); sb.append(rubyClass.getName()); sb.append(": "); sb.append(exception.getValue()); sb.append(">"); return getRuntime().newString(sb.toString()); }

3,233,355

public void printBacktrace(PrintStream errorStream) { IRubyObject[] elements = ((RubyArray) backtrace()).toJavaArray(); for (int i = 1; i < elements.length; i++) { IRubyObject stackTraceLine = elements[i]; if (stackTraceLine instanceof RubyString) { printStackTraceLine(errorStream, stackTraceLine); } if (i == RubyException.TRACE_HEAD && elements.length > RubyException.TRACE_MAX) { int hiddenLevels = elements.length - RubyException.TRACE_HEAD - RubyException.TRACE_TAIL; errorStream.print("\t ... " + hiddenLevels + " levels...\n"); i = elements.length - RubyException.TRACE_TAIL; } } }

3,233,356

public void printBacktrace(PrintStream errorStream) { IRubyObject[] elements = ((RubyArray) backtrace()).toJavaArray(); for (int i = 1; i < elements.length; i++) { IRubyObject stackTraceLine = elements[i]; if (stackTraceLine instanceof RubyString) { printStackTraceLine(errorStream, stackTraceLine); } if (i == RubyException.TRACE_HEAD && elements.length > RubyException.TRACE_MAX) { int hiddenLevels = elements.length - RubyException.TRACE_HEAD - RubyException.TRACE_TAIL; errorStream.print("\t ... " + hiddenLevels + " levels...\n"); i = elements.length - RubyException.TRACE_TAIL; } } }

3,233,357

public void printBacktrace(PrintStream errorStream) { IRubyObject[] elements = ((RubyArray) backtrace()).toJavaArray(); for (int i = 1; i < elements.length; i++) { IRubyObject stackTraceLine = elements[i]; if (stackTraceLine instanceof RubyString) { printStackTraceLine(errorStream, stackTraceLine); } if (i == RubyException.TRACE_HEAD && elements.length > RubyException.TRACE_MAX) { int hiddenLevels = elements.length - RubyException.TRACE_HEAD - RubyException.TRACE_TAIL; errorStream.print("\t ... " + hiddenLevels + " levels...\n"); i = elements.length - RubyException.TRACE_TAIL; } } }

3,233,358

public RubyArray set_backtrace(IRubyObject obj) { backtrace = obj.convertToArray(); return backtrace; }

3,233,359

private int sysread(StringBuffer buf, int length) throws IOException { if (buf == null) { throw new IOException("sysread2: Buf is null"); } int i = 0; for (;i < length; i++) { int c = sysread(); if (c == -1) { if (i <= 0) { return -1; } break; } buf.append((char) c); } return i; }

protected int sysread(StringBuffer buf, int length) throws IOException { if (buf == null) { throw new IOException("sysread2: Buf is null"); } int i = 0; for (;i < length; i++) { int c = sysread(); if (c == -1) { if (i <= 0) { return -1; } break; } buf.append((char) c); } return i; }

3,233,360

private void init() { env = BrowserEnvironment.getInstance(); progressListeners = new HashSet(); modelListeners = new HashSet(); selectedThumbnails = new HashSet(); attributeMap = new AttributeMap(); groupingMethod = new SingleGroupingMethod(); groupModels = Arrays.asList(groupingMethod.getGroups()); thumbnailSet = new HashSet(); imageIDMap = new HashMap(); annotationModel = new PaintMethodZOrder(); modeClassMap = new HashMap(); availableTypesList = new ArrayList(); panActionClass = new BrowserModeClass(PAN_MODE_NAME, new BrowserMode[] { BrowserMode.DEFAULT_MODE, BrowserMode.HAND_MODE}, BrowserMode.DEFAULT_MODE); majorUIModeClass = new BrowserModeClass(MAJOR_UI_MODE_NAME, new BrowserMode[] { BrowserMode.DEFAULT_MODE, BrowserMode.ANNOTATE_MODE, BrowserMode.CLASSIFY_MODE, BrowserMode.GRAPH_MODE}, BrowserMode.DEFAULT_MODE); selectModeClass = new BrowserModeClass(SELECT_MODE_NAME, new BrowserMode[] { BrowserMode.UNSELECTED_MODE, BrowserMode.SELECTING_MODE, BrowserMode.SELECTED_MODE}, BrowserMode.UNSELECTED_MODE); zoomModeClass = new BrowserModeClass(ZOOM_MODE_NAME, new BrowserMode[] { BrowserMode.ZOOM_TO_FIT_MODE, BrowserMode.ZOOM_50_MODE, BrowserMode.ZOOM_75_MODE, BrowserMode.ZOOM_ACTUAL_MODE, BrowserMode.ZOOM_200_MODE}, BrowserMode.ZOOM_TO_FIT_MODE); semanticModeClass = new BrowserModeClass(SEMANTIC_MODE_NAME, new BrowserMode[] { BrowserMode.IMAGE_NAME_MODE, BrowserMode.SEMANTIC_ZOOMING_MODE}, BrowserMode.SEMANTIC_ZOOMING_MODE); modeClassMap.put(PAN_MODE_NAME,panActionClass); modeClassMap.put(MAJOR_UI_MODE_NAME,majorUIModeClass); modeClassMap.put(SELECT_MODE_NAME,selectModeClass); modeClassMap.put(ZOOM_MODE_NAME,zoomModeClass); modeClassMap.put(SEMANTIC_MODE_NAME,semanticModeClass); }

private void init() { env = BrowserEnvironment.getInstance(); progressListeners = new HashSet(); modelListeners = new HashSet(); selectedThumbnails = new HashSet(); attributeMap = new AttributeMap(); groupingMethod = new SingleGroupingMethod(); groupModels = Arrays.asList(groupingMethod.getGroups()); thumbnailSet = new HashSet(); imageIDMap = new HashMap(); annotationModel = new PaintMethodZOrder(); modeClassMap = new HashMap(); availableTypesList = new ArrayList(); panActionClass = new BrowserModeClass(PAN_MODE_NAME, new BrowserMode[] { BrowserMode.DEFAULT_MODE, BrowserMode.HAND_MODE}, BrowserMode.DEFAULT_MODE); majorUIModeClass = new BrowserModeClass(MAJOR_UI_MODE_NAME, new BrowserMode[] { BrowserMode.DEFAULT_MODE, BrowserMode.ANNOTATE_MODE, BrowserMode.CLASSIFY_MODE, BrowserMode.GRAPH_MODE}, BrowserMode.DEFAULT_MODE); selectModeClass = new BrowserModeClass(SELECT_MODE_NAME, new BrowserMode[] { BrowserMode.UNSELECTED_MODE, BrowserMode.SELECTING_MODE, BrowserMode.SELECTED_MODE}, BrowserMode.UNSELECTED_MODE); zoomModeClass = new BrowserModeClass(ZOOM_MODE_NAME, new BrowserMode[] { BrowserMode.ZOOM_TO_FIT_MODE, BrowserMode.ZOOM_50_MODE, BrowserMode.ZOOM_75_MODE, BrowserMode.ZOOM_ACTUAL_MODE, BrowserMode.ZOOM_200_MODE}, BrowserMode.ZOOM_TO_FIT_MODE); semanticModeClass = new BrowserModeClass(SEMANTIC_MODE_NAME, new BrowserMode[] { BrowserMode.NOOP_MODE, BrowserMode.IMAGE_NAME_MODE, BrowserMode.SEMANTIC_ZOOMING_MODE}, BrowserMode.SEMANTIC_ZOOMING_MODE); modeClassMap.put(PAN_MODE_NAME,panActionClass); modeClassMap.put(MAJOR_UI_MODE_NAME,majorUIModeClass); modeClassMap.put(SELECT_MODE_NAME,selectModeClass); modeClassMap.put(ZOOM_MODE_NAME,zoomModeClass); modeClassMap.put(SEMANTIC_MODE_NAME,semanticModeClass); }

3,233,361

protected boolean managedPermissions(boolean locked, boolean privileged, IObject obj, Details previousDetails, Details currentDetails, Details newDetails) { // setup boolean altered = false; Permissions previousP = previousDetails == null ? null : previousDetails.getPermissions(); Permissions currentP = currentDetails == null ? null : currentDetails .getPermissions(); // ignore newDetails permissions. if ( ! isOwnerOrSupervisor(obj)) throw new SecurityViolation(String.format( "You are not authorized to change " + "the permissions for %s from %s to %s", obj, previousP, currentP)); // If the stored perms are null, then we can't validate anything if (previousP == null) { if (currentP == null) { newDetails.setPermissions(null); altered |= false; // don't need to update } else { newDetails.setPermissions(currentP); altered = true; } } // WORKAROUND for ticket:307 by checking for SOFT below // see https://trac.openmicroscopy.org.uk/omero/ticket/307 // see // http://opensource.atlassian.com/projects/hibernate/browse/HHH-2027 // Users did not enter permission (normal case) so is null OR // in the workaround permissions is SOFT, then // need to copy whole sale those from database. else if (currentP == null || currentP.isSet(Flag.SOFT)) { newDetails.setPermissions(previousP); altered = true; } // if the user has set the permissions (currentDetails), then we should // try to allow that. if it's identical to the current, then there // is no reason to hit the DB. else { // if we need to filter any permissions, do it here! newDetails.setPermissions(currentP); if (!currentP.identical(previousP)) { altered = true; } } // now we've calculated the desired permissions, throw // a security violation if this instance was locked AND // the read permissions have been lowered or if the lock // was removed. if (locked) { if (previousP == null) // if null it can't have been locked. throw new InternalException("Null permissions cannot be locked"); Permissions calculatedP = newDetails.getPermissions(); if (calculatedP != null) { // can't override if ( ! calculatedP.isSet( Flag.LOCKED )) { calculatedP.set(Flag.LOCKED); altered = true; } if ((previousP.isGranted(USER, READ) && !calculatedP.isGranted(USER, READ)) || (previousP.isGranted(GROUP, READ) && !calculatedP .isGranted(GROUP, READ)) || (previousP.isGranted(WORLD, READ) && !calculatedP .isGranted(WORLD, READ))) throw new SecurityViolation( "Cannot remove READ from locked entity:" + obj); } } // privileged plays no role since everyone can alter their permissions // (within bounds) return altered; }

3,233,362

protected boolean managedPermissions(boolean locked, boolean privileged, IObject obj, Details previousDetails, Details currentDetails, Details newDetails) { // setup boolean altered = false; Permissions previousP = previousDetails == null ? null : previousDetails.getPermissions(); Permissions currentP = currentDetails == null ? null : currentDetails .getPermissions(); // ignore newDetails permissions. if ( ! isOwnerOrSupervisor(obj)) throw new SecurityViolation(String.format( "You are not authorized to change " + "the permissions for %s from %s to %s", obj, previousP, currentP)); // If the stored perms are null, then we can't validate anything if (previousP == null) { if (currentP == null) { newDetails.setPermissions(null); altered |= false; // don't need to update } else { newDetails.setPermissions(currentP); altered = true; } } // WORKAROUND for ticket:307 by checking for SOFT below // see https://trac.openmicroscopy.org.uk/omero/ticket/307 // see // http://opensource.atlassian.com/projects/hibernate/browse/HHH-2027 // Users did not enter permission (normal case) so is null OR // in the workaround permissions is SOFT, then // need to copy whole sale those from database. else if (currentP == null || currentP.isSet(Flag.SOFT)) { newDetails.setPermissions(previousP); altered = true; } // if the user has set the permissions (currentDetails), then we should // try to allow that. if it's identical to the current, then there // is no reason to hit the DB. else { // if we need to filter any permissions, do it here! newDetails.setPermissions(currentP); if (!currentP.identical(previousP)) { altered = true; } } // now we've calculated the desired permissions, throw // a security violation if this instance was locked AND // the read permissions have been lowered or if the lock // was removed. if (locked) { if (previousP == null) // if null it can't have been locked. throw new InternalException("Null permissions cannot be locked"); Permissions calculatedP = newDetails.getPermissions(); if (calculatedP != null) { // can't override if ( ! calculatedP.isSet( Flag.LOCKED )) { calculatedP.set(Flag.LOCKED); altered = true; } if ((previousP.isGranted(USER, READ) && !calculatedP.isGranted(USER, READ)) || (previousP.isGranted(GROUP, READ) && !calculatedP .isGranted(GROUP, READ)) || (previousP.isGranted(WORLD, READ) && !calculatedP .isGranted(WORLD, READ))) throw new SecurityViolation( "Cannot remove READ from locked entity:" + obj); } } // privileged plays no role since everyone can alter their permissions // (within bounds) return altered; }

3,233,363

public static RubyClass createBignumClass(Ruby ruby) { RubyClass bignumClass = ruby.defineClass("Bignum", ruby.getClasses().getIntegerClass()); //rb_define_method(rb_cBignum, "-@", rb_big_uminus, 0); //rb_define_method(rb_cBignum, "divmod", rb_big_divmod, 1); //rb_define_method(rb_cBignum, "modulo", rb_big_modulo, 1); //rb_define_method(rb_cBignum, "remainder", rb_big_remainder, 1); //rb_define_method(rb_cBignum, "&", rb_big_and, 1); //rb_define_method(rb_cBignum, "|", rb_big_or, 1); //rb_define_method(rb_cBignum, "^", rb_big_xor, 1); // rb_define_method(rb_cBignum, "~", rb_big_neg, 0); // rb_define_method(rb_cBignum, "[]", rb_big_aref, 1); // //rb_define_method(rb_cBignum, "===", rb_big_eq, 1); // rb_define_method(rb_cBignum, "eql?", rb_big_eq, 1); // rb_define_method(rb_cBignum, "abs", rb_big_abs, 0); // rb_define_method(rb_cBignum, "size", rb_big_size, 0); // rb_define_method(rb_cBignum, "zero?", rb_big_zero_p, 0); bignumClass.defineMethod("-@", CallbackFactory.getMethod(RubyBignum.class, "op_uminus")); bignumClass.defineMethod("modulo", CallbackFactory.getMethod(RubyBignum.class, "op_mod", RubyObject.class)); bignumClass.defineMethod("remainder", CallbackFactory.getMethod(RubyBignum.class, "remainder", RubyObject.class)); bignumClass.defineMethod("to_s", CallbackFactory.getMethod(RubyBignum.class, "to_s")); bignumClass.defineMethod("coerce", CallbackFactory.getMethod(RubyBignum.class, "coerce", RubyObject.class)); bignumClass.defineMethod("hash", CallbackFactory.getMethod(RubyBignum.class, "hash")); bignumClass.defineMethod("to_f", CallbackFactory.getMethod(RubyBignum.class, "to_f")); bignumClass.defineMethod("+", CallbackFactory.getMethod(RubyBignum.class, "op_plus", RubyObject.class)); bignumClass.defineMethod("-", CallbackFactory.getMethod(RubyBignum.class, "op_minus", RubyObject.class)); bignumClass.defineMethod("*", CallbackFactory.getMethod(RubyBignum.class, "op_mul", RubyObject.class)); bignumClass.defineMethod("/", CallbackFactory.getMethod(RubyBignum.class, "op_div", RubyObject.class)); bignumClass.defineMethod("%", CallbackFactory.getMethod(RubyBignum.class, "op_mod", RubyObject.class)); bignumClass.defineMethod("&", CallbackFactory.getMethod(RubyBignum.class, "op_and", RubyObject.class)); bignumClass.defineMethod("**", CallbackFactory.getMethod(RubyBignum.class, "op_pow", RubyObject.class)); bignumClass.defineMethod("<<", CallbackFactory.getMethod(RubyBignum.class, "op_lshift", RubyObject.class)); bignumClass.defineMethod(">>", CallbackFactory.getMethod(RubyBignum.class, "op_rshift", RubyObject.class)); bignumClass.defineMethod("==", CallbackFactory.getMethod(RubyBignum.class, "op_equal", RubyObject.class)); bignumClass.defineMethod("<=>", CallbackFactory.getMethod(RubyBignum.class, "op_cmp", RubyObject.class)); bignumClass.defineMethod(">", CallbackFactory.getMethod(RubyBignum.class, "op_gt", RubyObject.class)); bignumClass.defineMethod(">=", CallbackFactory.getMethod(RubyBignum.class, "op_ge", RubyObject.class)); bignumClass.defineMethod("<", CallbackFactory.getMethod(RubyBignum.class, "op_lt", RubyObject.class)); bignumClass.defineMethod("<=", CallbackFactory.getMethod(RubyBignum.class, "op_le", RubyObject.class)); bignumClass.defineMethod("[]", CallbackFactory.getMethod(RubyBignum.class, "aref", RubyInteger.class)); return bignumClass; }

public static RubyClass createBignumClass(Ruby ruby) {RubyClass bignumClass = ruby.defineClass("Bignum", ruby.getClasses().getIntegerClass());//rb_define_method(rb_cBignum, "-@", rb_big_uminus, 0);//rb_define_method(rb_cBignum, "divmod", rb_big_divmod, 1);//rb_define_method(rb_cBignum, "modulo", rb_big_modulo, 1);//rb_define_method(rb_cBignum, "remainder", rb_big_remainder, 1);//rb_define_method(rb_cBignum, "&", rb_big_and, 1);//rb_define_method(rb_cBignum, "|", rb_big_or, 1);//rb_define_method(rb_cBignum, "^", rb_big_xor, 1);//rb_define_method(rb_cBignum, "~", rb_big_neg, 0);//rb_define_method(rb_cBignum, "[]", rb_big_aref, 1);////rb_define_method(rb_cBignum, "===", rb_big_eq, 1);//rb_define_method(rb_cBignum, "eql?", rb_big_eq, 1);//rb_define_method(rb_cBignum, "abs", rb_big_abs, 0);//rb_define_method(rb_cBignum, "size", rb_big_size, 0);//rb_define_method(rb_cBignum, "zero?", rb_big_zero_p, 0);bignumClass.defineMethod("-@", CallbackFactory.getMethod(RubyBignum.class, "op_uminus"));bignumClass.defineMethod("modulo", CallbackFactory.getMethod(RubyBignum.class, "op_mod", RubyObject.class));bignumClass.defineMethod("remainder", CallbackFactory.getMethod(RubyBignum.class, "remainder", RubyObject.class));bignumClass.defineMethod("to_s", CallbackFactory.getMethod(RubyBignum.class, "to_s"));bignumClass.defineMethod("coerce", CallbackFactory.getMethod(RubyBignum.class, "coerce", RubyObject.class));bignumClass.defineMethod("hash", CallbackFactory.getMethod(RubyBignum.class, "hash"));bignumClass.defineMethod("to_f", CallbackFactory.getMethod(RubyBignum.class, "to_f"));bignumClass.defineMethod("+", CallbackFactory.getMethod(RubyBignum.class, "op_plus", RubyObject.class));bignumClass.defineMethod("-", CallbackFactory.getMethod(RubyBignum.class, "op_minus", RubyObject.class));bignumClass.defineMethod("*", CallbackFactory.getMethod(RubyBignum.class, "op_mul", RubyObject.class));bignumClass.defineMethod("/", CallbackFactory.getMethod(RubyBignum.class, "op_div", RubyObject.class));bignumClass.defineMethod("%", CallbackFactory.getMethod(RubyBignum.class, "op_mod", RubyObject.class));bignumClass.defineMethod("&", CallbackFactory.getMethod(RubyBignum.class, "op_and", RubyObject.class));bignumClass.defineMethod("**", CallbackFactory.getMethod(RubyBignum.class, "op_pow", RubyObject.class));bignumClass.defineMethod("<<", CallbackFactory.getMethod(RubyBignum.class, "op_lshift", RubyObject.class));bignumClass.defineMethod(">>", CallbackFactory.getMethod(RubyBignum.class, "op_rshift", RubyObject.class));bignumClass.defineMethod("==", CallbackFactory.getMethod(RubyBignum.class, "op_equal", RubyObject.class));bignumClass.defineMethod("<=>", CallbackFactory.getMethod(RubyBignum.class, "op_cmp", RubyObject.class));bignumClass.defineMethod(">", CallbackFactory.getMethod(RubyBignum.class, "op_gt", RubyObject.class));bignumClass.defineMethod(">=", CallbackFactory.getMethod(RubyBignum.class, "op_ge", RubyObject.class));bignumClass.defineMethod("<", CallbackFactory.getMethod(RubyBignum.class, "op_lt", RubyObject.class));bignumClass.defineMethod("<=", CallbackFactory.getMethod(RubyBignum.class, "op_le", RubyObject.class));bignumClass.defineMethod("[]", CallbackFactory.getMethod(RubyBignum.class, "aref", RubyInteger.class));return bignumClass;}

3,233,365

public IRubyObject callIndexed(int index, IRubyObject[] args) { switch (index) { case ObjectDefinition.CLONE : return rbClone(); case ObjectDefinition.DUP : return dup(); case ObjectDefinition.EQUAL : return equal(args[0]); case ObjectDefinition.EXTEND : return extend(args); case ObjectDefinition.FREEZE : return freeze(); case ObjectDefinition.FROZEN : return frozen(); case ObjectDefinition.HASH : return hash(); case ObjectDefinition.ID : return id(); case ObjectDefinition.INSPECT : return inspect(); case ObjectDefinition.INSTANCE_EVAL : return instance_eval(args); case ObjectDefinition.INSTANCE_OF : return instance_of(args[0]); case ObjectDefinition.INSTANCE_VARIABLES : return instance_variables(); case ObjectDefinition.KIND_OF : return kind_of(args[0]); case ObjectDefinition.MATCH : return runtime.getFalse(); case ObjectDefinition.METHOD : return method(args[0]); case ObjectDefinition.METHOD_MISSING : return method_missing(args); case ObjectDefinition.METHODS : return methods(); case ObjectDefinition.NIL : return runtime.getFalse(); case ObjectDefinition.PRIVATE_METHODS : return private_methods(); case ObjectDefinition.PROTECTED_METHODS : return protected_methods(); case ObjectDefinition.RESPOND_TO : return respond_to(args); case ObjectDefinition.SEND : return send(args); case ObjectDefinition.SINGLETON_METHODS : return singleton_methods(); case ObjectDefinition.TAINT : return taint(); case ObjectDefinition.TAINTED : return tainted(); case ObjectDefinition.TO_A : return to_a(); case ObjectDefinition.TO_S : return to_s(); case ObjectDefinition.TYPE : return type(); case ObjectDefinition.UNTAINT : return untaint(); } Asserts.notReached("invalid index '" + index + "'."); return null; }

public IRubyObject callIndexed(int index, IRubyObject[] args) { switch (index) { case ObjectDefinition.RBCLONE : return rbClone(); case ObjectDefinition.DUP : return dup(); case ObjectDefinition.EQUAL : return equal(args[0]); case ObjectDefinition.EXTEND : return extend(args); case ObjectDefinition.FREEZE : return freeze(); case ObjectDefinition.FROZEN : return frozen(); case ObjectDefinition.HASH : return hash(); case ObjectDefinition.ID : return id(); case ObjectDefinition.INSPECT : return inspect(); case ObjectDefinition.INSTANCE_EVAL : return instance_eval(args); case ObjectDefinition.INSTANCE_OF : return instance_of(args[0]); case ObjectDefinition.INSTANCE_VARIABLES : return instance_variables(); case ObjectDefinition.KIND_OF : return kind_of(args[0]); case ObjectDefinition.MATCH : return runtime.getFalse(); case ObjectDefinition.METHOD : return method(args[0]); case ObjectDefinition.METHOD_MISSING : return method_missing(args); case ObjectDefinition.METHODS : return methods(); case ObjectDefinition.NIL : return runtime.getFalse(); case ObjectDefinition.PRIVATE_METHODS : return private_methods(); case ObjectDefinition.PROTECTED_METHODS : return protected_methods(); case ObjectDefinition.RESPOND_TO : return respond_to(args); case ObjectDefinition.SEND : return send(args); case ObjectDefinition.SINGLETON_METHODS : return singleton_methods(); case ObjectDefinition.TAINT : return taint(); case ObjectDefinition.TAINTED : return tainted(); case ObjectDefinition.TO_A : return to_a(); case ObjectDefinition.TO_S : return to_s(); case ObjectDefinition.TYPE : return type(); case ObjectDefinition.UNTAINT : return untaint(); } Asserts.notReached("invalid index '" + index + "'."); return null; }

3,233,367

public IRubyObject callIndexed(int index, IRubyObject[] args) { switch (index) { case ObjectDefinition.CLONE : return rbClone(); case ObjectDefinition.DUP : return dup(); case ObjectDefinition.EQUAL : return equal(args[0]); case ObjectDefinition.EXTEND : return extend(args); case ObjectDefinition.FREEZE : return freeze(); case ObjectDefinition.FROZEN : return frozen(); case ObjectDefinition.HASH : return hash(); case ObjectDefinition.ID : return id(); case ObjectDefinition.INSPECT : return inspect(); case ObjectDefinition.INSTANCE_EVAL : return instance_eval(args); case ObjectDefinition.INSTANCE_OF : return instance_of(args[0]); case ObjectDefinition.INSTANCE_VARIABLES : return instance_variables(); case ObjectDefinition.KIND_OF : return kind_of(args[0]); case ObjectDefinition.MATCH : return runtime.getFalse(); case ObjectDefinition.METHOD : return method(args[0]); case ObjectDefinition.METHOD_MISSING : return method_missing(args); case ObjectDefinition.METHODS : return methods(); case ObjectDefinition.NIL : return runtime.getFalse(); case ObjectDefinition.PRIVATE_METHODS : return private_methods(); case ObjectDefinition.PROTECTED_METHODS : return protected_methods(); case ObjectDefinition.RESPOND_TO : return respond_to(args); case ObjectDefinition.SEND : return send(args); case ObjectDefinition.SINGLETON_METHODS : return singleton_methods(); case ObjectDefinition.TAINT : return taint(); case ObjectDefinition.TAINTED : return tainted(); case ObjectDefinition.TO_A : return to_a(); case ObjectDefinition.TO_S : return to_s(); case ObjectDefinition.TYPE : return type(); case ObjectDefinition.UNTAINT : return untaint(); } Asserts.notReached("invalid index '" + index + "'."); return null; }

public IRubyObject callIndexed(int index, IRubyObject[] args) { switch (index) { case ObjectDefinition.CLONE : return rbClone(); case ObjectDefinition.DUP : return dup(); case ObjectDefinition.EQUAL : return equal(args[0]); case ObjectDefinition.EXTEND : return extend(args); case ObjectDefinition.FREEZE : return freeze(); case ObjectDefinition.FROZEN_P : return frozen(); case ObjectDefinition.HASH : return hash(); case ObjectDefinition.ID : return id(); case ObjectDefinition.INSPECT : return inspect(); case ObjectDefinition.INSTANCE_EVAL : return instance_eval(args); case ObjectDefinition.INSTANCE_OF : return instance_of(args[0]); case ObjectDefinition.INSTANCE_VARIABLES : return instance_variables(); case ObjectDefinition.KIND_OF : return kind_of(args[0]); case ObjectDefinition.MATCH : return runtime.getFalse(); case ObjectDefinition.METHOD : return method(args[0]); case ObjectDefinition.METHOD_MISSING : return method_missing(args); case ObjectDefinition.METHODS : return methods(); case ObjectDefinition.NIL : return runtime.getFalse(); case ObjectDefinition.PRIVATE_METHODS : return private_methods(); case ObjectDefinition.PROTECTED_METHODS : return protected_methods(); case ObjectDefinition.RESPOND_TO : return respond_to(args); case ObjectDefinition.SEND : return send(args); case ObjectDefinition.SINGLETON_METHODS : return singleton_methods(); case ObjectDefinition.TAINT : return taint(); case ObjectDefinition.TAINTED : return tainted(); case ObjectDefinition.TO_A : return to_a(); case ObjectDefinition.TO_S : return to_s(); case ObjectDefinition.TYPE : return type(); case ObjectDefinition.UNTAINT : return untaint(); } Asserts.notReached("invalid index '" + index + "'."); return null; }

3,233,368

public void testUnallowedPasswordChange() throws Exception { loginRoot(); // create a new user for the test Experimenter e = new Experimenter(); e.setFirstName("user admin setters"); e.setLastName("test"); e.setOmeName(UUID.randomUUID().toString()); iAdmin.createUser(e); loginUser(e.getOmeName()); try { iAdmin.changeUserPassword("root", "THIS SHOULD NOT BE VISIBLE."); fail("secvio!"); } catch (Exception ex) { // ok. } }

3,233,369

protected void onSetUp() throws Exception { super.onSetUp(); //ome.security.Utils.setUserAuth(); pix = (IPixels) applicationContext.getBean("pixelsService"); }

protected void onSetUp() throws Exception { super.onSetUp(); //ome.security.Utils.setUserAuth(); pix = factory.getPixelsService(); }

3,233,370

public RubyFixnum hash() { return newFixnum((int) value ^ (int) (value >> 32)); }

public RubyFixnum hash() { return newFixnum(hashCode()); }

3,233,371

protected boolean managedPermissions(boolean locked, boolean privileged, IObject obj, Details previousDetails, Details currentDetails, Details newDetails) { // setup boolean altered = false; Permissions previousP = previousDetails == null ? null : previousDetails.getPermissions(); Permissions currentP = currentDetails == null ? null : currentDetails .getPermissions(); // ignore newDetails permissions. // If the stored perms are null, then we can't validate anything // TODO : is this alright. Should only happen for system types. // Then can silently ignore ?? if (previousP == null) { if (currentP == null) { newDetails.setPermissions(null); altered |= false; // don't need to update } else { newDetails.setPermissions(currentP); altered = true; } } // WORKAROUND for ticket:307 by checking for SOFT below // see https://trac.openmicroscopy.org.uk/omero/ticket/307 // see // http://opensource.atlassian.com/projects/hibernate/browse/HHH-2027 // Users did not enter permission (normal case) so is null OR // in the workaround permissions is SOFT, then // need to copy whole sale those from database. else if (currentP == null || currentP.isSet(Flag.SOFT)) { newDetails.setPermissions(previousP); altered = true; } // if the user has set the permissions (currentDetails), then we should // try to allow that. if it's identical to the current, then there // is no reason to hit the DB. else { // if we need to filter any permissions, do it here! newDetails.setPermissions(currentP); if (!currentP.identical(previousP)) { if ( ! isOwnerOrSupervisor(obj)) throw new SecurityViolation(String.format( "You are not authorized to change " + "the permissions for %s from %s to %s", obj, previousP, currentP)); altered = true; } } // now we've calculated the desired permissions, throw // a security violation if this instance was locked AND // the read permissions have been lowered or if the lock // was removed. if (locked) { if (previousP == null) // if null it can't have been locked. throw new InternalException("Null permissions cannot be locked"); Permissions calculatedP = newDetails.getPermissions(); if (calculatedP != null) { // can't override if ( ! calculatedP.isSet( Flag.LOCKED )) { calculatedP.set(Flag.LOCKED); altered = true; } if ((previousP.isGranted(USER, READ) && !calculatedP.isGranted(USER, READ)) || (previousP.isGranted(GROUP, READ) && !calculatedP .isGranted(GROUP, READ)) || (previousP.isGranted(WORLD, READ) && !calculatedP .isGranted(WORLD, READ))) throw new SecurityViolation( "Cannot remove READ from locked entity:" + obj); } } // privileged plays no role since everyone can alter their permissions // (within bounds) return altered; }

3,233,373

public void runAsAdmin(AdminAction action) { Assert.notNull(action); disable(MergeEventListener.MERGE_EVENT); cd.setAdmin(true); try { action.runAsAdmin(); } finally { cd.setAdmin(false); enable(MergeEventListener.MERGE_EVENT); } }

3,233,374

public Main(String[] args) { LongOpt[] longOpts = new LongOpt[2]; longOpts[0] = new LongOpt("instrumentation", LongOpt.REQUIRED_ARGUMENT, null, 'i'); longOpts[1] = new LongOpt("output", LongOpt.REQUIRED_ARGUMENT, null, 'o'); Getopt g = new Getopt(getClass().getName(), args, ":i:o:", longOpts); int c; File destDir = new File(System.getProperty("user.dir")); while ((c = g.getopt()) != -1) { switch (c) { case 'i': System.out.println("cobertura loading: " + g.getOptarg()); try { merge(loadInstrumentation(new FileInputStream(g .getOptarg()))); } catch (FileNotFoundException ex) { logger.warn(ex); } break; case 'o': destDir = new File(g.getOptarg()); destDir.mkdirs(); break; } } saveInstrumentation(destDir); }

3,233,375

public Main(String[] args) { LongOpt[] longOpts = new LongOpt[2]; longOpts[0] = new LongOpt("instrumentation", LongOpt.REQUIRED_ARGUMENT, null, 'i'); longOpts[1] = new LongOpt("output", LongOpt.REQUIRED_ARGUMENT, null, 'o'); Getopt g = new Getopt(getClass().getName(), args, ":i:o:", longOpts); int c; File destDir = new File(System.getProperty("user.dir")); while ((c = g.getopt()) != -1) { switch (c) { case 'i': System.out.println("cobertura loading: " + g.getOptarg()); try { merge(loadInstrumentation(new FileInputStream(g .getOptarg()))); } catch (FileNotFoundException ex) { logger.warn(ex); } break; case 'o': destDir = new File(g.getOptarg()); destDir.mkdirs(); break; } } saveInstrumentation(destDir); }

3,233,376

public Main(String[] args) { LongOpt[] longOpts = new LongOpt[2]; longOpts[0] = new LongOpt("instrumentation", LongOpt.REQUIRED_ARGUMENT, null, 'i'); longOpts[1] = new LongOpt("output", LongOpt.REQUIRED_ARGUMENT, null, 'o'); Getopt g = new Getopt(getClass().getName(), args, ":i:o:", longOpts); int c; File destDir = new File(System.getProperty("user.dir")); while ((c = g.getopt()) != -1) { switch (c) { case 'i': System.out.println("cobertura loading: " + g.getOptarg()); try { merge(loadInstrumentation(new FileInputStream(g .getOptarg()))); } catch (FileNotFoundException ex) { logger.warn(ex); } break; case 'o': destDir = new File(g.getOptarg()); destDir.mkdirs(); break; } } saveInstrumentation(destDir); }

3,233,377

public static void main(String[] args) { Copyright.print(System.out); System.out.println("Cobertura instrumentation merge tool"); boolean hasCommandsFile = false; String commandsFileName = null; for (int i = 0; i < args.length; i++) { if (args[i].equals("-commandsfile")) { hasCommandsFile = true; commandsFileName = args[++i]; } } if (hasCommandsFile) { List arglist = new ArrayList(); BufferedReader bufreader = null; try { bufreader = new BufferedReader(new FileReader( commandsFileName)); String line; while ((line = bufreader.readLine()) != null) { arglist.add(line); } } catch (IOException e) { logger.fatal("Unable to read temporary commands file " + commandsFileName + "."); logger.info(e); } finally { if (bufreader != null) { try { bufreader.close(); } catch (IOException e) { } } } args = (String[])arglist.toArray(new String[arglist.size()]); } new Main(args); }

3,233,378

private void synch(int v) { curZ = v; view.getZSlider().setValue(v); view.getZField().setText(""+v); manager.onZChange(curZ); }

private void synch(int v) { curZ = v; view.getZSlider().setValue(v); view.getZField().setText(""+v); view.repaint(); manager.onZChange(curZ); }

3,233,379

public void copy(IObject model, ModelMapper mapper) { if (model instanceof Experimenter) { Experimenter exp = (Experimenter) model; super.copy(model,mapper); // Fields this.setFirstName(exp.getFirstName()); this.setLastName(exp.getLastName()); this.setEmail(exp.getEmail()); this.setInstitution(exp.getInstitution()); // Collections MapperBlock block = new MapperBlock( mapper ); setGroups( new HashSet( exp.collectFromExperimenterGroupLinks( block ))); } else { throw new IllegalArgumentException( "ExperimenterData can only copy from Experimenter"); } }

3,233,380

public HTMLReport(ProjectData projectData, File outputDir, File sourceDir) throws Exception { this.destinationDir = outputDir; this.sourceDir = sourceDir; this.projectData = projectData; CopyFiles.copy(outputDir); generatePackageList(); generateSourceFileLists(); generateOverviews(); generateSourceFiles(); }

3,233,381

public HTMLReport(ProjectData projectData, File outputDir, File sourceDir) throws Exception { this.destinationDir = outputDir; this.sourceDir = sourceDir; this.projectData = projectData; CopyFiles.copy(outputDir); generatePackageList(); generateSourceFileLists(); generateOverviews(); generateSourceFiles(); }

3,233,382

private void generateSourceFile(SourceFileData sourceFileData) throws IOException { if (!sourceFileData.containsInstrumentationInfo()) { logger.info("Data file does not contain instrumentation " + "information for the file " + sourceFileData.getName() + ". Ensure this class was instrumented, and this " + "data file contains the instrumentation information."); } String filename = sourceFileData.getNormalizedName() + ".html"; File file = new File(destinationDir, filename); PrintStream out = null; try { out = new PrintStream(new FileOutputStream(file)); out.println("<html>"); out.println("<head>"); out.println("<title>Coverage Report</title>"); out .println("<link title=\"Style\" type=\"text/css\" rel=\"stylesheet\" href=\"css/main.css\" />"); out .println("<script type=\"text/javascript\" src=\"js/popup.js\"></script>"); out.println("</head>"); out.println("<body>"); out.print("<h5>Coverage Report - "); String classPackageName = sourceFileData.getPackageName(); if ((classPackageName != null) && classPackageName.length() > 0) { out.print(sourceFileData.getPackageName() + "."); } out.print(sourceFileData.getBaseName()); out.println("</h5>"); // Output the coverage summary for this class out.println("<p>"); out.println("<table class=\"report\">"); out.println(generateTableHeader("Classes in this File", false)); // TODO: Change this to actually show multiple classes. out.println(generateTableRowForSourceFile(sourceFileData)); out.println("</table>"); out.println("</p>"); // Output this class's source code with syntax and coverage highlighting out.println("<p>"); out .println("<table cellspacing=\"0\" cellpadding=\"0\" class=\"src\">"); BufferedReader br = null; try { File sourceFile = new File(sourceDir, sourceFileData .getName()); br = new BufferedReader(new FileReader(sourceFile)); String lineStr; JavaToHtml javaToHtml = new JavaToHtml(); int lineNumber = 1; while ((lineStr = br.readLine()) != null) { out.println("<tr>"); if (sourceFileData.isValidSourceLineNumber(lineNumber)) { long numberOfHits = sourceFileData .getHitCount(lineNumber); out.println(" <td class=\"numLineCover\"> " + lineNumber + "</td>"); if (numberOfHits > 0) { out .println(" <td class=\"nbHitsCovered\"> " + numberOfHits + "</td>"); out .println(" <td class=\"src\"><pre class=\"src\"> " + javaToHtml.process(lineStr) + "</pre></td>"); } else { out .println(" <td class=\"nbHitsUncovered\"> " + numberOfHits + "</td>"); out .println(" <td class=\"src\"><pre class=\"src\"><span class=\"srcUncovered\"> " + javaToHtml.process(lineStr) + "</span></pre></td>"); } } else { out.println(" <td class=\"numLine\"> " + lineNumber + "</td>"); out.println(" <td class=\"nbHits\"> </td>"); out .println(" <td class=\"src\"><pre class=\"src\"> " + javaToHtml.process(lineStr) + "</pre></td>"); } out.println("</tr>"); lineNumber++; } } finally { if (br != null) { br.close(); } } out.println("</table>"); out.println("</p>"); out.println("<div class=\"footer\">"); out .println("Reports generated by <a href=\"http://cobertura.sourceforge.net/\" target=\"_top\">Cobertura</a>."); out.println("</div>"); out.println("</body>"); out.println("</html>"); } finally { if (out != null) { out.close(); } } }

3,233,383

private String generateTableRowForPackage(PackageData packageData) { StringBuffer ret = new StringBuffer(); String url1 = "frame-summary-" + packageData.getName() + ".html"; String url2 = "frame-sourcefiles-" + packageData.getName() + ".html"; double lineCoverage = -1; double branchCoverage = -1; double ccn = Util.getCCN(new File(sourceDir, packageData .getSourceFileName()), false); if (packageData.getNumberOfValidLines() > 0) lineCoverage = packageData.getLineCoverageRate(); if (packageData.getNumberOfValidBranches() > 0) branchCoverage = packageData.getBranchCoverageRate(); ret.append(" <tr>"); ret.append("<td class=\"text\"><a href=\"" + url1 + "\" onClick='parent.sourceFileList.location.href=\"" + url2 + "\"'>" + generatePackageName(packageData) + "</a></td>"); ret.append("<td class=\"value\">" + packageData.getNumberOfChildren() + "</td>"); ret.append(generateTableColumnsFromData(lineCoverage, branchCoverage, ccn)); ret.append("</tr>"); return ret.toString(); }

3,233,384

private String generateTableRowForSourceFile(SourceFileData sourceFileData) { StringBuffer ret = new StringBuffer(); double lineCoverage = -1; double branchCoverage = -1; double ccn = Util.getCCN( new File(sourceDir, sourceFileData.getName()), false); if (sourceFileData.getNumberOfValidLines() > 0) lineCoverage = sourceFileData.getLineCoverageRate(); if (sourceFileData.getNumberOfValidBranches() > 0) branchCoverage = sourceFileData.getBranchCoverageRate(); ret.append(" <tr>"); ret.append("<td class=\"text\"><a href=\"" + sourceFileData.getNormalizedName() + ".html\">" + sourceFileData.getBaseName() + "</a></td>"); ret.append(generateTableColumnsFromData(lineCoverage, branchCoverage, ccn)); ret.append("</tr>"); return ret.toString(); }

3,233,385

private String generateTableRowForTotal() { StringBuffer ret = new StringBuffer(); double lineCoverage = -1; double branchCoverage = -1; double ccn = Util.getCCN(sourceDir, true); if (projectData.getNumberOfValidLines() > 0) lineCoverage = projectData.getLineCoverageRate(); if (projectData.getNumberOfValidBranches() > 0) branchCoverage = projectData.getBranchCoverageRate(); ret.append(" <tr>"); ret.append("<td class=\"text\"><b>All Packages</b></td>"); ret.append("<td class=\"value\">" + projectData.getNumberOfSourceFiles() + "</td>"); ret.append(generateTableColumnsFromData(lineCoverage, branchCoverage, ccn)); ret.append("</tr>"); return ret.toString(); }

3,233,386

private String generateTableRowForTotal() { StringBuffer ret = new StringBuffer(); double lineCoverage = -1; double branchCoverage = -1; double ccn = Util.getCCN(sourceDir, true); if (projectData.getNumberOfValidLines() > 0) lineCoverage = projectData.getLineCoverageRate(); if (projectData.getNumberOfValidBranches() > 0) branchCoverage = projectData.getBranchCoverageRate(); ret.append(" <tr>"); ret.append("<td class=\"text\"><b>All Packages</b></td>"); ret.append("<td class=\"value\">" + projectData.getNumberOfSourceFiles() + "</td>"); ret.append(generateTableColumnsFromData(lineCoverage, branchCoverage, ccn)); ret.append("</tr>"); return ret.toString(); }

3,233,387

public RubyObject[] getArray(Ruby ruby, RubyObject self) { ArrayList ary = new ArrayList(getALength()); for (Node node = this; node != null ; node = node.getNextNode()) { ary.add(node.getHeadNode().eval(ruby, self)); } return (RubyObject[])ary.toArray(new RubyObject[ary.size()]); }

3,233,388

public void testAddBundel() throws Exception { Project project; Bundle bundle; BundleClassLoader bundleClassLoader; Class clazz = null; project = mavenBundleManager.loadProject("springframework", "spring", "1.2.4"); bundle = mavenBundleManager.installBundle(project); bundleClassLoader = new BundleClassLoader(bundle); clazz = bundle.loadClass("org.springframework.beans.factory.xml.DefaultXmlBeanDefinitionParser"); assertNotNull(clazz); clazz = bundleClassLoader.loadClass("org.springframework.beans.factory.xml.DefaultXmlBeanDefinitionParser"); assertNotNull(clazz); assertSame(bundle, mavenBundleManager.installBundle(project)); project = new Project("org.xbean", "xbean-spring", "2.1-SNAPSHOT", "jar", Collections.singleton(new Dependency("springframework", "spring", "1.2.4", "jar"))); bundle = mavenBundleManager.installBundle(project); bundleClassLoader = new BundleClassLoader(bundle); clazz = bundle.loadClass("org.springframework.beans.factory.xml.DefaultXmlBeanDefinitionParser"); assertNotNull(clazz); clazz = bundleClassLoader.loadClass("org.springframework.beans.factory.xml.DefaultXmlBeanDefinitionParser"); assertNotNull(clazz); clazz = bundle.loadClass("org.xbean.spring.context.impl.XBeanXmlBeanDefinitionParser"); assertNotNull(clazz); clazz = bundleClassLoader.loadClass("org.xbean.spring.context.impl.XBeanXmlBeanDefinitionParser"); assertNotNull(clazz); assertSame(bundle, mavenBundleManager.installBundle(project)); }

3,233,390

Set getPercentOfCollection(final Set ids, double percent) { if (ids.size() == 0) { throw new IllegalArgumentException(emptyColl); } List ordered = new ArrayList(ids); Set result = new HashSet(); while (result.size() < ids.size() * percent) { int choice = randomChoice(ordered.size()); result.add(ordered.remove(choice)); } return result; }

Set getPercentOfCollection(final Set ids, double percent) { if (ids.size() == 0) { throw new IllegalArgumentException(emptyColl); } List ordered = new ArrayList(ids); Set result = new HashSet(); while (ordered.size() >0 && result.size() < ids.size() * percent) { int choice = randomChoice(ordered.size()); result.add(ordered.remove(choice)); } return result; }

3,233,391

public static void main(final String[] args) { /*EnhancedDebuggerWindow.PERSISTED_DEBUGGER = true; EnhancedDebuggerWindow.MAX_TABLE_ROWS = 10; XMPPConnection.DEBUG_ENABLED = true; */ String current = System.getProperty("java.library.path"); String classPath = System.getProperty("java.class.path"); // Set UIManager properties for JTree System.setProperty("apple.laf.useScreenMenuBar", "true"); /** Update Library Path **/ StringBuffer buf = new StringBuffer(); buf.append(current); buf.append(";"); final String workingDirectory = System.getProperty("appdir"); if (workingDirectory == null) { RESOURCE_DIRECTORY = new File(USER_HOME, "/Spark/resources").getAbsoluteFile(); BIN_DIRECTORY = new File(USER_HOME, "/Spark/bin").getAbsoluteFile(); LOG_DIRECTORY = new File(USER_HOME, "/Spark/logs").getAbsoluteFile(); RESOURCE_DIRECTORY.mkdirs(); LOG_DIRECTORY.mkdirs(); if (!RESOURCE_DIRECTORY.exists() || !LOG_DIRECTORY.exists()) { JOptionPane.showMessageDialog(new JFrame(), "Unable to create directories necessary for runtime.", "Spark Error", JOptionPane.ERROR_MESSAGE); System.exit(1); } } // This is the Spark.exe or Spark.dmg installed executable. else { // This is the installed executable. File workingDir = new File(workingDirectory); RESOURCE_DIRECTORY = new File(workingDir, "resources").getAbsoluteFile(); BIN_DIRECTORY = new File(workingDir, "bin").getAbsoluteFile(); LOG_DIRECTORY = new File(workingDir, "logs").getAbsoluteFile(); LOG_DIRECTORY.mkdirs(); try { buf.append(RESOURCE_DIRECTORY.getCanonicalPath()).append(";"); } catch (IOException e) { e.printStackTrace(); } } buf.append(classPath); // Update System Properties System.setProperty("java.library.path", buf.toString()); System.setProperty("sun.java2d.noddraw", "true"); SwingUtilities.invokeLater(new Runnable() { public void run() { // Start Application new Spark(); } }); // Handle arguments if (args.length > 0) { argument = args[0]; } }

3,233,393

public RubyString to_s() { return getRuntime().newString(String.valueOf(getLongValue())); }

3,233,394

public long length() { return list.size(); }

public int length() { return list.size(); }

3,233,397

public RubyString m_inspect() { // HACK +++ StringBuffer sb = new StringBuffer(100); sb.append("["); for (int i = 0; i < length(); i++) { if (i > 0) { sb.append(", "); } sb.append(((RubyString)entry(i).funcall(getRuby().intern("inspect"))).getValue()); } sb.append("]"); return RubyString.m_newString(getRuby(), sb.toString()); // HACK --- }

public RubyString m_inspect() { // HACK +++ StringBuffer sb = new StringBuffer(100); sb.append("["); int length = length(); for (int i = 0; i < length; i++) { if (i > 0) { sb.append(", "); } sb.append(((RubyString)entry(i).funcall(getRuby().intern("inspect"))).getValue()); } sb.append("]"); return RubyString.m_newString(getRuby(), sb.toString()); // HACK --- }

3,233,398

public RubyArray m_push(RubyObject[] items) { if (items.length == 0) { throw new RubyArgumentException("wrong # of arguments(at least 1)"); } modify(); for (int i = 0; i < items.length; i++) { list.add(items[i]); } return this; }

public RubyArray m_push(RubyObject[] items) { if (items.length == 0) { throw new RubyArgumentException("wrong # of arguments(at least 1)"); } modify(); for (int i = 0; i < length; i++) { list.add(items[i]); } return this; }

3,233,399

public void write(org.webmacro.FastWriter out, org.webmacro.Context context) throws org.webmacro.PropertyException, java.io.IOException { try { String s = null; Context c = null; Macro macro = (Macro)_evalTarget.getValue(context); if (_mapExpr == null) { // no map specified, use current context s = (String)macro.evaluate(context); } else { Object o = _mapExpr; if (o instanceof Macro) { o = ((Macro)o).evaluate(context); } if (!(o instanceof java.util.Map)) { throw new PropertyException("The supplied expression did not evaluate to a java.util.Map instance."); } // check for max recursion int recursionDepth = 0; if (context.containsKey("EvalDepth")) { // check the value try { recursionDepth = ((Integer)context.get("EvalDepth")).intValue(); recursionDepth++; if (recursionDepth > MAX_RECURSION_DEPTH) { throw new PropertyException( "ERROR: A recursive call to #eval exceeded the maximum depth of " + MAX_RECURSION_DEPTH); } } catch (Exception e){ // something bad happend, leave depth at default } } java.util.Map outerVars = null; if (context.containsKey("OuterVars")) { // check the value try { outerVars = (java.util.Map)context.get("OuterVars"); } catch (Exception e){ // something bad happend, use vars from calling context } } if (outerVars == null) outerVars = context.getMap(); c = new Context(context.getBroker()); // replace _variables map with supplied map c.setMap((java.util.Map)o); // put current depth into the new context c.put("EvalDepth", recursionDepth); // add a reference to parent context variables c.put("OuterVars", outerVars); // add a reference to this macro c.put("Self", macro); s = (String)macro.evaluate(c); } out.write(s); } catch (Exception e) { if (e instanceof PropertyException) throw e; throw new PropertyException("#eval: Unable to evaluate macro.", e); } }

public void write(org.webmacro.FastWriter out, org.webmacro.Context context) throws org.webmacro.PropertyException, java.io.IOException { try { String s = null; Context c = null; Macro macro = (Macro)_evalTarget.getValue(context); if (_mapExpr == null) { // no map specified, use current context s = (String)macro.evaluate(context); } else { Object o = _mapExpr; if (o instanceof Macro) { o = ((Macro)o).evaluate(context); } if (!(o instanceof java.util.Map)) { throw new PropertyException("The supplied expression did not evaluate to a java.util.Map instance."); } // check for max recursion int recursionDepth = 0; if (context.containsKey("EvalDepth")) { // check the value try { recursionDepth = ((Integer)context.get("EvalDepth")).intValue(); recursionDepth++; if (recursionDepth > MAX_RECURSION_DEPTH) { throw new PropertyException( "ERROR: A recursive call to #eval exceeded the maximum depth of " + MAX_RECURSION_DEPTH); } } catch (Exception e){ // something bad happend, leave depth at default } } java.util.Map outerVars = null; if (context.containsKey("OuterVars")) { // check the value try { outerVars = (java.util.Map)context.get("OuterVars"); } catch (Exception e){ // something bad happend, use vars from calling context } } if (outerVars == null) outerVars = context.getMap(); c = new Context(context.getBroker()); // replace _variables map with supplied map c.setMap((java.util.Map)o); // put current depth into the new context c.put("EvalDepth", recursionDepth); // add a reference to parent context variables c.put("OuterVars", outerVars); // add a reference to this macro c.put("Self", macro); s = (String)macro.evaluate(c); } out.write(s); } catch (Exception e) { if (e instanceof PropertyException) throw (PropertyException)e; throw new PropertyException("#eval: Unable to evaluate macro.", e); } }

3,233,402

final protected void execute (Template tmpl, WebContext c) { FastWriter fw = null; boolean timing = Flags.PROFILE && c.isTiming (); try { if (timing) c.startTiming ("Template.write", tmpl); try { HttpServletResponse resp= c.getResponse (); Locale locale = (Locale) tmpl.getParam ( WMConstants.TEMPLATE_LOCALE); if (_log.loggingDebug ()) _log.debug ("TemplateLocale="+locale); if (locale != null) { setLocale (resp, locale); } String encoding = (String) tmpl.getParam ( WMConstants.TEMPLATE_OUTPUT_ENCODING); if (encoding==null) { encoding = resp.getCharacterEncoding (); } if (_log.loggingDebug ()) _log.debug ("Using output encoding "+encoding); // get a fastwriter with no output stream, forcing // fastwriter to buffer the output internally. // this is necessary to be compatible with JSDK 2.3 // where you can't call setContentType() after getOutputStream(), // which could be happening during the template evaluation fw = FastWriter.getInstance (_broker, encoding); tmpl.write (fw, c); // now write the FW buffer to the response output stream fw.writeTo (c.getResponse().getOutputStream ()); } finally { if (timing) c.stopTiming (); } if (timing) c.startTiming ("FastWriter.close()"); try { fw.close (); fw = null; } finally { if (timing) c.stopTiming (); } } catch (IOException e) { // ignore disconnect } catch (Exception e) { String error = "WebMacro encountered an error while executing a template:\n" + ((tmpl != null) ? (tmpl + ": " + e + "\n") : ("The template failed to load; double check the " + "TemplatePath in your webmacro.properties file.")); _log.warning (error,e); try { Template errorTemplate = error (c, "WebMacro encountered an error while executing a template:\n" + ((tmpl != null) ? (tmpl + ": ") : ("The template failed to load; double check the " + "TemplatePath in your webmacro.properties file.")) + "\n<pre>" + e + "</pre>\n"); fw.reset (fw.getOutputStream ()); errorTemplate.write (fw, c); } catch (Exception ignore) { // ignored } } finally { try { if (fw != null) { fw.flush (); fw.close (); fw = null; } } catch (Exception e3) { // ignore disconnect } } }

3,233,403

public Quantization_8_16_bit(QuantumDef qd, PixelsType type) { super(qd,type); }

3,233,404

private void buildLUT() { if (LUT == null) initLUT(); // Comparable assumed to be Integer //domain double dStart = getWindowStart(), dEnd = getWindowEnd(); double k = getCurveCoefficient(); double a1 = (qDef.getCdEnd().intValue()-qDef.getCdStart().intValue())/ qDef.getBitResolution().intValue(); int x = min; QuantumMap normalize = new PolynomialMap(); double ysNorm = valueMapper.transform(0, k); double yeNorm = valueMapper.transform(255, k); double aNorm = qDef.getBitResolution().intValue()/(yeNorm-ysNorm); double v = 0, extra = 0; double c0, denum = (dEnd-dStart), num = 255; double S1 = dStart; double decile = (max-min)/SUB_INT; double Q1 = min, Q9 = max; int cdStart = qDef.getCdStart().intValue(), cdEnd = qDef.getCdStart().intValue(); if (getNoiseReduction()) { v = EXTRA; extra = EXTRA; Q1 = min+decile; Q9 = max-decile; S1 = Q1; num = 255-2*EXTRA; denum = Q9-Q1; if (dStart >= Q1 && dEnd > Q9) { denum = (Q9-dStart); S1 = dStart; } else if (dStart >= Q1 && dEnd <= Q9) { denum = dEnd-dStart; S1 = dStart; } else if (dStart < Q1 && dEnd <= Q9) denum = dEnd-Q1; if (qDef.getCdStart().intValue() < EXTRA) cdStart = EXTRA; if (qDef.getCdEnd().intValue() > 255-EXTRA) cdEnd = 255-EXTRA; } c0 = num/denum; for(; x < dStart; ++x) LUT[x-min] = (byte) cdStart; for(; x < dEnd; ++x) { if (x > Q1) { if (x <= Q9) v = c0*(normalize.transform(x, 1)-S1)+extra; else v = cdEnd; } else v = cdStart; v = Approximation.nearestInteger( aNorm*(valueMapper.transform(v, k)-ysNorm)); v = Approximation.nearestInteger(a1*v+qDef.getCdStart().intValue()); LUT[x-min] = (byte) v; } for(; x <= max; ++x) LUT[x-min] = (byte) cdEnd; /* if (LUT == null) initLUT(); // Comparable assumed to be Integer //domain double dStart = getWindowStart(), dEnd = getWindowEnd(); double k = getCurveCoefficient(); double a1 = (qDef.getCdEnd().intValue()-qDef.getCdStart().intValue())/qDef.getBitResolution().doubleValue(); //Initializes the normalized map. initNormalizedMap(k); //Initializes the decile map. initDecileMap(dStart, dEnd); QuantumMap normalize = new PolynomialMap(); int x = min; double v; //Build the LUT for(; x < dStart; ++x) LUT[x-min] = (byte) qDef.getCdStart().intValue(); for(; x < dEnd; ++x) { if (x > Q1) { if (x <= Q9) { v = aDecile*(normalize.transform(x, 1)-bDecile); v = aNormalized*(valueMapper.transform(v, k)-ysNormalized); v = Approximation.nearestInteger(v); v = Approximation.nearestInteger(a1*v+qDef.getCdStart().intValue()); } else v = qDef.getCdEnd().intValue(); } else v = qDef.getCdStart().intValue(); LUT[x-min] = (byte) v; } for(; x <= max; ++x) LUT[x-min] = (byte) qDef.getCdEnd().intValue(); for (int i = 0; i < LUT.length; i++) { log.info(i + " maps to " + LUT[i]); } */ }

3,233,405

private void buildLUT() { if (LUT == null) initLUT(); // Comparable assumed to be Integer //domain double dStart = getWindowStart(), dEnd = getWindowEnd(); double k = getCurveCoefficient(); double a1 = (qDef.getCdEnd().intValue()-qDef.getCdStart().intValue())/ qDef.getBitResolution().intValue(); int x = min; QuantumMap normalize = new PolynomialMap(); double ysNorm = valueMapper.transform(0, k); double yeNorm = valueMapper.transform(255, k); double aNorm = qDef.getBitResolution().intValue()/(yeNorm-ysNorm); double v = 0, extra = 0; double c0, denum = (dEnd-dStart), num = 255; double S1 = dStart; double decile = (max-min)/SUB_INT; double Q1 = min, Q9 = max; int cdStart = qDef.getCdStart().intValue(), cdEnd = qDef.getCdStart().intValue(); if (getNoiseReduction()) { v = EXTRA; extra = EXTRA; Q1 = min+decile; Q9 = max-decile; S1 = Q1; num = 255-2*EXTRA; denum = Q9-Q1; if (dStart >= Q1 && dEnd > Q9) { denum = (Q9-dStart); S1 = dStart; } else if (dStart >= Q1 && dEnd <= Q9) { denum = dEnd-dStart; S1 = dStart; } else if (dStart < Q1 && dEnd <= Q9) denum = dEnd-Q1; if (qDef.getCdStart().intValue() < EXTRA) cdStart = EXTRA; if (qDef.getCdEnd().intValue() > 255-EXTRA) cdEnd = 255-EXTRA; } c0 = num/denum; for(; x < dStart; ++x) LUT[x-min] = (byte) cdStart; for(; x < dEnd; ++x) { if (x > Q1) { if (x <= Q9) v = c0*(normalize.transform(x, 1)-S1)+extra; else v = cdEnd; } else v = cdStart; v = Approximation.nearestInteger( aNorm*(valueMapper.transform(v, k)-ysNorm)); v = Approximation.nearestInteger(a1*v+qDef.getCdStart().intValue()); LUT[x-min] = (byte) v; } for(; x <= max; ++x) LUT[x-min] = (byte) cdEnd; /* if (LUT == null) initLUT(); // Comparable assumed to be Integer //domain double dStart = getWindowStart(), dEnd = getWindowEnd(); double k = getCurveCoefficient(); double a1 = (qDef.getCdEnd().intValue()-qDef.getCdStart().intValue())/qDef.getBitResolution().doubleValue(); //Initializes the normalized map. initNormalizedMap(k); //Initializes the decile map. initDecileMap(dStart, dEnd); QuantumMap normalize = new PolynomialMap(); int x = min; double v; //Build the LUT for(; x < dStart; ++x) LUT[x-min] = (byte) qDef.getCdStart().intValue(); for(; x < dEnd; ++x) { if (x > Q1) { if (x <= Q9) { v = aDecile*(normalize.transform(x, 1)-bDecile); v = aNormalized*(valueMapper.transform(v, k)-ysNormalized); v = Approximation.nearestInteger(v); v = Approximation.nearestInteger(a1*v+qDef.getCdStart().intValue()); } else v = qDef.getCdEnd().intValue(); } else v = qDef.getCdStart().intValue(); LUT[x-min] = (byte) v; } for(; x <= max; ++x) LUT[x-min] = (byte) qDef.getCdEnd().intValue(); for (int i = 0; i < LUT.length; i++) { log.info(i + " maps to " + LUT[i]); } */ }

private void buildLUT() { if (LUT == null) initLUT(); // Comparable assumed to be Integer //domain double dStart = getWindowStart(), dEnd = getWindowEnd(); double k = getCurveCoefficient(); double a1 = (qDef.getCdEnd().intValue()-qDef.getCdStart().intValue())/ qDef.getBitResolution().intValue(); int x = min; QuantumMap normalize = new PolynomialMap(); double ysNorm = valueMapper.transform(0, k); double yeNorm = valueMapper.transform(255, k); double aNorm = qDef.getBitResolution().intValue()/(yeNorm-ysNorm); double v = 0, extra = 0; double c0, denum = (dEnd-dStart), num = 255; double S1 = dStart; double decile = (max-min)/SUB_INT; double Q1 = min, Q9 = max; int cdStart = qDef.getCdStart().intValue(), cdEnd = qDef.getCdStart().intValue(); if (getNoiseReduction()) { v = EXTRA; extra = EXTRA; Q1 = min+decile; Q9 = max-decile; S1 = Q1; num = 255-2*EXTRA; denum = Q9-Q1; if (dStart >= Q1 && dEnd > Q9) { denum = (Q9-dStart); S1 = dStart; } else if (dStart >= Q1 && dEnd <= Q9) { denum = dEnd-dStart; S1 = dStart; } else if (dStart < Q1 && dEnd <= Q9) denum = dEnd-Q1; if (qDef.getCdStart().intValue() < EXTRA) cdStart = EXTRA; if (qDef.getCdEnd().intValue() > 255-EXTRA) cdEnd = 255-EXTRA; } c0 = num/denum; for(; x < dStart; ++x) LUT[x-min] = (byte) cdStart; for(; x < dEnd; ++x) { if (x > Q1) { if (x <= Q9) v = c0*(normalize.transform(x, 1)-S1)+extra; else v = cdEnd; } else v = cdStart; v = Approximation.nearestInteger( aNorm*(valueMapper.transform(v, k)-ysNorm)); v = Approximation.nearestInteger(a1*v+qDef.getCdStart().intValue()); LUT[x-min] = (byte) v; } for(; x <= max; ++x) LUT[x-min] = (byte) cdEnd; /* if (LUT == null) initLUT(); // Comparable assumed to be Integer //domain double dStart = getWindowStart(), dEnd = getWindowEnd(); double k = getCurveCoefficient(); double a1 = (qDef.getCdEnd().intValue()-qDef.getCdStart().intValue())/ qDef.getBitResolution().doubleValue(); //Initializes the normalized map. initNormalizedMap(k); //Initializes the decile map. initDecileMap(dStart, dEnd); QuantumMap normalize = new PolynomialMap(); int x = min; double v; //Build the LUT for(; x < dStart; ++x) LUT[x-min] = (byte) qDef.getCdStart().intValue(); for(; x < dEnd; ++x) { if (x > Q1) { if (x <= Q9) { v = aDecile*(normalize.transform(x, 1)-bDecile); v = aNormalized*(valueMapper.transform(v, k)-ysNormalized); v = Approximation.nearestInteger(v); v = Approximation.nearestInteger(a1*v+qDef.getCdStart().intValue()); } else v = qDef.getCdEnd().intValue(); } else v = qDef.getCdStart().intValue(); LUT[x-min] = (byte) v; } for(; x <= max; ++x) LUT[x-min] = (byte) qDef.getCdEnd().intValue(); for (int i = 0; i < LUT.length; i++) { log.info(i + " maps to " + LUT[i]); } */ }

3,233,406

private void buildLUT() { if (LUT == null) initLUT(); // Comparable assumed to be Integer //domain double dStart = getWindowStart(), dEnd = getWindowEnd(); double k = getCurveCoefficient(); double a1 = (qDef.getCdEnd().intValue()-qDef.getCdStart().intValue())/ qDef.getBitResolution().intValue(); int x = min; QuantumMap normalize = new PolynomialMap(); double ysNorm = valueMapper.transform(0, k); double yeNorm = valueMapper.transform(255, k); double aNorm = qDef.getBitResolution().intValue()/(yeNorm-ysNorm); double v = 0, extra = 0; double c0, denum = (dEnd-dStart), num = 255; double S1 = dStart; double decile = (max-min)/SUB_INT; double Q1 = min, Q9 = max; int cdStart = qDef.getCdStart().intValue(), cdEnd = qDef.getCdStart().intValue(); if (getNoiseReduction()) { v = EXTRA; extra = EXTRA; Q1 = min+decile; Q9 = max-decile; S1 = Q1; num = 255-2*EXTRA; denum = Q9-Q1; if (dStart >= Q1 && dEnd > Q9) { denum = (Q9-dStart); S1 = dStart; } else if (dStart >= Q1 && dEnd <= Q9) { denum = dEnd-dStart; S1 = dStart; } else if (dStart < Q1 && dEnd <= Q9) denum = dEnd-Q1; if (qDef.getCdStart().intValue() < EXTRA) cdStart = EXTRA; if (qDef.getCdEnd().intValue() > 255-EXTRA) cdEnd = 255-EXTRA; } c0 = num/denum; for(; x < dStart; ++x) LUT[x-min] = (byte) cdStart; for(; x < dEnd; ++x) { if (x > Q1) { if (x <= Q9) v = c0*(normalize.transform(x, 1)-S1)+extra; else v = cdEnd; } else v = cdStart; v = Approximation.nearestInteger( aNorm*(valueMapper.transform(v, k)-ysNorm)); v = Approximation.nearestInteger(a1*v+qDef.getCdStart().intValue()); LUT[x-min] = (byte) v; } for(; x <= max; ++x) LUT[x-min] = (byte) cdEnd; /* if (LUT == null) initLUT(); // Comparable assumed to be Integer //domain double dStart = getWindowStart(), dEnd = getWindowEnd(); double k = getCurveCoefficient(); double a1 = (qDef.getCdEnd().intValue()-qDef.getCdStart().intValue())/qDef.getBitResolution().doubleValue(); //Initializes the normalized map. initNormalizedMap(k); //Initializes the decile map. initDecileMap(dStart, dEnd); QuantumMap normalize = new PolynomialMap(); int x = min; double v; //Build the LUT for(; x < dStart; ++x) LUT[x-min] = (byte) qDef.getCdStart().intValue(); for(; x < dEnd; ++x) { if (x > Q1) { if (x <= Q9) { v = aDecile*(normalize.transform(x, 1)-bDecile); v = aNormalized*(valueMapper.transform(v, k)-ysNormalized); v = Approximation.nearestInteger(v); v = Approximation.nearestInteger(a1*v+qDef.getCdStart().intValue()); } else v = qDef.getCdEnd().intValue(); } else v = qDef.getCdStart().intValue(); LUT[x-min] = (byte) v; } for(; x <= max; ++x) LUT[x-min] = (byte) qDef.getCdEnd().intValue(); for (int i = 0; i < LUT.length; i++) { log.info(i + " maps to " + LUT[i]); } */ }

private void buildLUT() { if (LUT == null) initLUT(); // Comparable assumed to be Integer //domain double dStart = getWindowStart(), dEnd = getWindowEnd(); double k = getCurveCoefficient(); double a1 = (qDef.getCdEnd().intValue()-qDef.getCdStart().intValue())/ qDef.getBitResolution().intValue(); int x = min; QuantumMap normalize = new PolynomialMap(); double ysNorm = valueMapper.transform(0, k); double yeNorm = valueMapper.transform(255, k); double aNorm = qDef.getBitResolution().intValue()/(yeNorm-ysNorm); double v = 0, extra = 0; double c0, denum = (dEnd-dStart), num = 255; double S1 = dStart; double decile = (max-min)/SUB_INT; double Q1 = min, Q9 = max; int cdStart = qDef.getCdStart().intValue(), cdEnd = qDef.getCdStart().intValue(); if (getNoiseReduction()) { v = EXTRA; extra = EXTRA; Q1 = min+decile; Q9 = max-decile; S1 = Q1; num = 255-2*EXTRA; denum = Q9-Q1; if (dStart >= Q1 && dEnd > Q9) { denum = (Q9-dStart); S1 = dStart; } else if (dStart >= Q1 && dEnd <= Q9) { denum = dEnd-dStart; S1 = dStart; } else if (dStart < Q1 && dEnd <= Q9) denum = dEnd-Q1; if (qDef.getCdStart().intValue() < EXTRA) cdStart = EXTRA; if (qDef.getCdEnd().intValue() > 255-EXTRA) cdEnd = 255-EXTRA; } c0 = num/denum; for(; x < dStart; ++x) LUT[x-min] = (byte) cdStart; for(; x < dEnd; ++x) { if (x > Q1) { if (x <= Q9) v = c0*(normalize.transform(x, 1)-S1)+extra; else v = cdEnd; } else v = cdStart; v = Approximation.nearestInteger( aNorm*(valueMapper.transform(v, k)-ysNorm)); v = Approximation.nearestInteger(a1*v+qDef.getCdStart().intValue()); LUT[x-min] = (byte) v; } for(; x <= max; ++x) LUT[x-min] = (byte) cdEnd; /* if (LUT == null) initLUT(); // Comparable assumed to be Integer //domain double dStart = getWindowStart(), dEnd = getWindowEnd(); double k = getCurveCoefficient(); double a1 = (qDef.getCdEnd().intValue()-qDef.getCdStart().intValue())/qDef.getBitResolution().doubleValue(); //Initializes the normalized map. initNormalizedMap(k); //Initializes the decile map. double v = initDecileMap(dStart, dEnd); QuantumMap normalize = new PolynomialMap(); int x = min; double v; //Build the LUT for(; x < dStart; ++x) LUT[x-min] = (byte) qDef.getCdStart().intValue(); for(; x < dEnd; ++x) { if (x > Q1) { if (x <= Q9) { v = aDecile*(normalize.transform(x, 1)-bDecile); v = aNormalized*(valueMapper.transform(v, k)-ysNormalized); v = Approximation.nearestInteger(v); v = Approximation.nearestInteger(a1*v+qDef.getCdStart().intValue()); } else v = qDef.getCdEnd().intValue(); } else v = qDef.getCdStart().intValue(); LUT[x-min] = (byte) v; } for(; x <= max; ++x) LUT[x-min] = (byte) qDef.getCdEnd().intValue(); for (int i = 0; i < LUT.length; i++) { log.info(i + " maps to " + LUT[i]); } */ }

3,233,407

private void buildLUT() { if (LUT == null) initLUT(); // Comparable assumed to be Integer //domain double dStart = getWindowStart(), dEnd = getWindowEnd(); double k = getCurveCoefficient(); double a1 = (qDef.getCdEnd().intValue()-qDef.getCdStart().intValue())/ qDef.getBitResolution().intValue(); int x = min; QuantumMap normalize = new PolynomialMap(); double ysNorm = valueMapper.transform(0, k); double yeNorm = valueMapper.transform(255, k); double aNorm = qDef.getBitResolution().intValue()/(yeNorm-ysNorm); double v = 0, extra = 0; double c0, denum = (dEnd-dStart), num = 255; double S1 = dStart; double decile = (max-min)/SUB_INT; double Q1 = min, Q9 = max; int cdStart = qDef.getCdStart().intValue(), cdEnd = qDef.getCdStart().intValue(); if (getNoiseReduction()) { v = EXTRA; extra = EXTRA; Q1 = min+decile; Q9 = max-decile; S1 = Q1; num = 255-2*EXTRA; denum = Q9-Q1; if (dStart >= Q1 && dEnd > Q9) { denum = (Q9-dStart); S1 = dStart; } else if (dStart >= Q1 && dEnd <= Q9) { denum = dEnd-dStart; S1 = dStart; } else if (dStart < Q1 && dEnd <= Q9) denum = dEnd-Q1; if (qDef.getCdStart().intValue() < EXTRA) cdStart = EXTRA; if (qDef.getCdEnd().intValue() > 255-EXTRA) cdEnd = 255-EXTRA; } c0 = num/denum; for(; x < dStart; ++x) LUT[x-min] = (byte) cdStart; for(; x < dEnd; ++x) { if (x > Q1) { if (x <= Q9) v = c0*(normalize.transform(x, 1)-S1)+extra; else v = cdEnd; } else v = cdStart; v = Approximation.nearestInteger( aNorm*(valueMapper.transform(v, k)-ysNorm)); v = Approximation.nearestInteger(a1*v+qDef.getCdStart().intValue()); LUT[x-min] = (byte) v; } for(; x <= max; ++x) LUT[x-min] = (byte) cdEnd; /* if (LUT == null) initLUT(); // Comparable assumed to be Integer //domain double dStart = getWindowStart(), dEnd = getWindowEnd(); double k = getCurveCoefficient(); double a1 = (qDef.getCdEnd().intValue()-qDef.getCdStart().intValue())/qDef.getBitResolution().doubleValue(); //Initializes the normalized map. initNormalizedMap(k); //Initializes the decile map. initDecileMap(dStart, dEnd); QuantumMap normalize = new PolynomialMap(); int x = min; double v; //Build the LUT for(; x < dStart; ++x) LUT[x-min] = (byte) qDef.getCdStart().intValue(); for(; x < dEnd; ++x) { if (x > Q1) { if (x <= Q9) { v = aDecile*(normalize.transform(x, 1)-bDecile); v = aNormalized*(valueMapper.transform(v, k)-ysNormalized); v = Approximation.nearestInteger(v); v = Approximation.nearestInteger(a1*v+qDef.getCdStart().intValue()); } else v = qDef.getCdEnd().intValue(); } else v = qDef.getCdStart().intValue(); LUT[x-min] = (byte) v; } for(; x <= max; ++x) LUT[x-min] = (byte) qDef.getCdEnd().intValue(); for (int i = 0; i < LUT.length; i++) { log.info(i + " maps to " + LUT[i]); } */ }

private void buildLUT() { if (LUT == null) initLUT(); // Comparable assumed to be Integer //domain double dStart = getWindowStart(), dEnd = getWindowEnd(); double k = getCurveCoefficient(); double a1 = (qDef.getCdEnd().intValue()-qDef.getCdStart().intValue())/ qDef.getBitResolution().intValue(); int x = min; QuantumMap normalize = new PolynomialMap(); double ysNorm = valueMapper.transform(0, k); double yeNorm = valueMapper.transform(255, k); double aNorm = qDef.getBitResolution().intValue()/(yeNorm-ysNorm); double v = 0, extra = 0; double c0, denum = (dEnd-dStart), num = 255; double S1 = dStart; double decile = (max-min)/SUB_INT; double Q1 = min, Q9 = max; int cdStart = qDef.getCdStart().intValue(), cdEnd = qDef.getCdStart().intValue(); if (getNoiseReduction()) { v = EXTRA; extra = EXTRA; Q1 = min+decile; Q9 = max-decile; S1 = Q1; num = 255-2*EXTRA; denum = Q9-Q1; if (dStart >= Q1 && dEnd > Q9) { denum = (Q9-dStart); S1 = dStart; } else if (dStart >= Q1 && dEnd <= Q9) { denum = dEnd-dStart; S1 = dStart; } else if (dStart < Q1 && dEnd <= Q9) denum = dEnd-Q1; if (qDef.getCdStart().intValue() < EXTRA) cdStart = EXTRA; if (qDef.getCdEnd().intValue() > 255-EXTRA) cdEnd = 255-EXTRA; } c0 = num/denum; for(; x < dStart; ++x) LUT[x-min] = (byte) cdStart; for(; x < dEnd; ++x) { if (x > Q1) { if (x <= Q9) v = c0*(normalize.transform(x, 1)-S1)+extra; else v = cdEnd; } else v = cdStart; v = Approximation.nearestInteger( aNorm*(valueMapper.transform(v, k)-ysNorm)); v = Approximation.nearestInteger(a1*v+qDef.getCdStart().intValue()); LUT[x-min] = (byte) v; } for(; x <= max; ++x) LUT[x-min] = (byte) cdEnd; /* if (LUT == null) initLUT(); // Comparable assumed to be Integer //domain double dStart = getWindowStart(), dEnd = getWindowEnd(); double k = getCurveCoefficient(); double a1 = (qDef.getCdEnd().intValue()-qDef.getCdStart().intValue())/qDef.getBitResolution().doubleValue(); //Initializes the normalized map. initNormalizedMap(k); //Initializes the decile map. initDecileMap(dStart, dEnd); QuantumMap normalize = new PolynomialMap(); int x = min; //Build the LUT for(; x < dStart; ++x) LUT[x-min] = (byte) qDef.getCdStart().intValue(); for(; x < dEnd; ++x) { if (x > Q1) { if (x <= Q9) { v = aDecile*(normalize.transform(x, 1)-bDecile); v = aNormalized*(valueMapper.transform(v, k)-ysNormalized); v = Approximation.nearestInteger(v); v = Approximation.nearestInteger(a1*v+qDef.getCdStart().intValue()); } else v = qDef.getCdEnd().intValue(); } else v = qDef.getCdStart().intValue(); LUT[x-min] = (byte) v; } for(; x <= max; ++x) LUT[x-min] = (byte) qDef.getCdEnd().intValue(); for (int i = 0; i < LUT.length; i++) { log.info(i + " maps to " + LUT[i]); } */ }

3,233,408

private void buildLUT() { if (LUT == null) initLUT(); // Comparable assumed to be Integer //domain double dStart = getWindowStart(), dEnd = getWindowEnd(); double k = getCurveCoefficient(); double a1 = (qDef.getCdEnd().intValue()-qDef.getCdStart().intValue())/ qDef.getBitResolution().intValue(); int x = min; QuantumMap normalize = new PolynomialMap(); double ysNorm = valueMapper.transform(0, k); double yeNorm = valueMapper.transform(255, k); double aNorm = qDef.getBitResolution().intValue()/(yeNorm-ysNorm); double v = 0, extra = 0; double c0, denum = (dEnd-dStart), num = 255; double S1 = dStart; double decile = (max-min)/SUB_INT; double Q1 = min, Q9 = max; int cdStart = qDef.getCdStart().intValue(), cdEnd = qDef.getCdStart().intValue(); if (getNoiseReduction()) { v = EXTRA; extra = EXTRA; Q1 = min+decile; Q9 = max-decile; S1 = Q1; num = 255-2*EXTRA; denum = Q9-Q1; if (dStart >= Q1 && dEnd > Q9) { denum = (Q9-dStart); S1 = dStart; } else if (dStart >= Q1 && dEnd <= Q9) { denum = dEnd-dStart; S1 = dStart; } else if (dStart < Q1 && dEnd <= Q9) denum = dEnd-Q1; if (qDef.getCdStart().intValue() < EXTRA) cdStart = EXTRA; if (qDef.getCdEnd().intValue() > 255-EXTRA) cdEnd = 255-EXTRA; } c0 = num/denum; for(; x < dStart; ++x) LUT[x-min] = (byte) cdStart; for(; x < dEnd; ++x) { if (x > Q1) { if (x <= Q9) v = c0*(normalize.transform(x, 1)-S1)+extra; else v = cdEnd; } else v = cdStart; v = Approximation.nearestInteger( aNorm*(valueMapper.transform(v, k)-ysNorm)); v = Approximation.nearestInteger(a1*v+qDef.getCdStart().intValue()); LUT[x-min] = (byte) v; } for(; x <= max; ++x) LUT[x-min] = (byte) cdEnd; /* if (LUT == null) initLUT(); // Comparable assumed to be Integer //domain double dStart = getWindowStart(), dEnd = getWindowEnd(); double k = getCurveCoefficient(); double a1 = (qDef.getCdEnd().intValue()-qDef.getCdStart().intValue())/qDef.getBitResolution().doubleValue(); //Initializes the normalized map. initNormalizedMap(k); //Initializes the decile map. initDecileMap(dStart, dEnd); QuantumMap normalize = new PolynomialMap(); int x = min; double v; //Build the LUT for(; x < dStart; ++x) LUT[x-min] = (byte) qDef.getCdStart().intValue(); for(; x < dEnd; ++x) { if (x > Q1) { if (x <= Q9) { v = aDecile*(normalize.transform(x, 1)-bDecile); v = aNormalized*(valueMapper.transform(v, k)-ysNormalized); v = Approximation.nearestInteger(v); v = Approximation.nearestInteger(a1*v+qDef.getCdStart().intValue()); } else v = qDef.getCdEnd().intValue(); } else v = qDef.getCdStart().intValue(); LUT[x-min] = (byte) v; } for(; x <= max; ++x) LUT[x-min] = (byte) qDef.getCdEnd().intValue(); for (int i = 0; i < LUT.length; i++) { log.info(i + " maps to " + LUT[i]); } */ }

3,233,409

private void buildLUT() { if (LUT == null) initLUT(); // Comparable assumed to be Integer //domain double dStart = getWindowStart(), dEnd = getWindowEnd(); double k = getCurveCoefficient(); double a1 = (qDef.getCdEnd().intValue()-qDef.getCdStart().intValue())/ qDef.getBitResolution().intValue(); int x = min; QuantumMap normalize = new PolynomialMap(); double ysNorm = valueMapper.transform(0, k); double yeNorm = valueMapper.transform(255, k); double aNorm = qDef.getBitResolution().intValue()/(yeNorm-ysNorm); double v = 0, extra = 0; double c0, denum = (dEnd-dStart), num = 255; double S1 = dStart; double decile = (max-min)/SUB_INT; double Q1 = min, Q9 = max; int cdStart = qDef.getCdStart().intValue(), cdEnd = qDef.getCdStart().intValue(); if (getNoiseReduction()) { v = EXTRA; extra = EXTRA; Q1 = min+decile; Q9 = max-decile; S1 = Q1; num = 255-2*EXTRA; denum = Q9-Q1; if (dStart >= Q1 && dEnd > Q9) { denum = (Q9-dStart); S1 = dStart; } else if (dStart >= Q1 && dEnd <= Q9) { denum = dEnd-dStart; S1 = dStart; } else if (dStart < Q1 && dEnd <= Q9) denum = dEnd-Q1; if (qDef.getCdStart().intValue() < EXTRA) cdStart = EXTRA; if (qDef.getCdEnd().intValue() > 255-EXTRA) cdEnd = 255-EXTRA; } c0 = num/denum; for(; x < dStart; ++x) LUT[x-min] = (byte) cdStart; for(; x < dEnd; ++x) { if (x > Q1) { if (x <= Q9) v = c0*(normalize.transform(x, 1)-S1)+extra; else v = cdEnd; } else v = cdStart; v = Approximation.nearestInteger( aNorm*(valueMapper.transform(v, k)-ysNorm)); v = Approximation.nearestInteger(a1*v+qDef.getCdStart().intValue()); LUT[x-min] = (byte) v; } for(; x <= max; ++x) LUT[x-min] = (byte) cdEnd; /* if (LUT == null) initLUT(); // Comparable assumed to be Integer //domain double dStart = getWindowStart(), dEnd = getWindowEnd(); double k = getCurveCoefficient(); double a1 = (qDef.getCdEnd().intValue()-qDef.getCdStart().intValue())/qDef.getBitResolution().doubleValue(); //Initializes the normalized map. initNormalizedMap(k); //Initializes the decile map. initDecileMap(dStart, dEnd); QuantumMap normalize = new PolynomialMap(); int x = min; double v; //Build the LUT for(; x < dStart; ++x) LUT[x-min] = (byte) qDef.getCdStart().intValue(); for(; x < dEnd; ++x) { if (x > Q1) { if (x <= Q9) { v = aDecile*(normalize.transform(x, 1)-bDecile); v = aNormalized*(valueMapper.transform(v, k)-ysNormalized); v = Approximation.nearestInteger(v); v = Approximation.nearestInteger(a1*v+qDef.getCdStart().intValue()); } else v = qDef.getCdEnd().intValue(); } else v = qDef.getCdStart().intValue(); LUT[x-min] = (byte) v; } for(; x <= max; ++x) LUT[x-min] = (byte) qDef.getCdEnd().intValue(); for (int i = 0; i < LUT.length; i++) { log.info(i + " maps to " + LUT[i]); } */ }

3,233,410

private void buildLUT() { if (LUT == null) initLUT(); // Comparable assumed to be Integer //domain double dStart = getWindowStart(), dEnd = getWindowEnd(); double k = getCurveCoefficient(); double a1 = (qDef.getCdEnd().intValue()-qDef.getCdStart().intValue())/ qDef.getBitResolution().intValue(); int x = min; QuantumMap normalize = new PolynomialMap(); double ysNorm = valueMapper.transform(0, k); double yeNorm = valueMapper.transform(255, k); double aNorm = qDef.getBitResolution().intValue()/(yeNorm-ysNorm); double v = 0, extra = 0; double c0, denum = (dEnd-dStart), num = 255; double S1 = dStart; double decile = (max-min)/SUB_INT; double Q1 = min, Q9 = max; int cdStart = qDef.getCdStart().intValue(), cdEnd = qDef.getCdStart().intValue(); if (getNoiseReduction()) { v = EXTRA; extra = EXTRA; Q1 = min+decile; Q9 = max-decile; S1 = Q1; num = 255-2*EXTRA; denum = Q9-Q1; if (dStart >= Q1 && dEnd > Q9) { denum = (Q9-dStart); S1 = dStart; } else if (dStart >= Q1 && dEnd <= Q9) { denum = dEnd-dStart; S1 = dStart; } else if (dStart < Q1 && dEnd <= Q9) denum = dEnd-Q1; if (qDef.getCdStart().intValue() < EXTRA) cdStart = EXTRA; if (qDef.getCdEnd().intValue() > 255-EXTRA) cdEnd = 255-EXTRA; } c0 = num/denum; for(; x < dStart; ++x) LUT[x-min] = (byte) cdStart; for(; x < dEnd; ++x) { if (x > Q1) { if (x <= Q9) v = c0*(normalize.transform(x, 1)-S1)+extra; else v = cdEnd; } else v = cdStart; v = Approximation.nearestInteger( aNorm*(valueMapper.transform(v, k)-ysNorm)); v = Approximation.nearestInteger(a1*v+qDef.getCdStart().intValue()); LUT[x-min] = (byte) v; } for(; x <= max; ++x) LUT[x-min] = (byte) cdEnd; /* if (LUT == null) initLUT(); // Comparable assumed to be Integer //domain double dStart = getWindowStart(), dEnd = getWindowEnd(); double k = getCurveCoefficient(); double a1 = (qDef.getCdEnd().intValue()-qDef.getCdStart().intValue())/qDef.getBitResolution().doubleValue(); //Initializes the normalized map. initNormalizedMap(k); //Initializes the decile map. initDecileMap(dStart, dEnd); QuantumMap normalize = new PolynomialMap(); int x = min; double v; //Build the LUT for(; x < dStart; ++x) LUT[x-min] = (byte) qDef.getCdStart().intValue(); for(; x < dEnd; ++x) { if (x > Q1) { if (x <= Q9) { v = aDecile*(normalize.transform(x, 1)-bDecile); v = aNormalized*(valueMapper.transform(v, k)-ysNormalized); v = Approximation.nearestInteger(v); v = Approximation.nearestInteger(a1*v+qDef.getCdStart().intValue()); } else v = qDef.getCdEnd().intValue(); } else v = qDef.getCdStart().intValue(); LUT[x-min] = (byte) v; } for(; x <= max; ++x) LUT[x-min] = (byte) qDef.getCdEnd().intValue(); for (int i = 0; i < LUT.length; i++) { log.info(i + " maps to " + LUT[i]); } */ }

3,233,411

private void initDecileMap(double dStart, double dEnd) { double denum = (dEnd-dStart), num = MAX; double decile = ((double) (max-min))/DECILE; Q1 = min; Q9 = max; bDecile = dStart; if (getNoiseReduction()) { Q1 = min+decile; Q9 = max-decile; denum = Q9-Q1; if (dStart >= Q1 && dEnd > Q9) { denum = (Q9-dStart); bDecile = dStart; } else if (dStart >= Q1 && dEnd <= Q9) { denum = dEnd-dStart; bDecile = dStart; } else if (dStart < Q1 && dEnd <= Q9) { denum = dEnd-Q1; bDecile = Q1; } } aDecile = num/denum; }

private double initDecileMap(double dStart, double dEnd) { double denum = (dEnd-dStart), num = MAX; double decile = ((double) (max-min))/DECILE; Q1 = min; Q9 = max; bDecile = dStart; if (getNoiseReduction()) { Q1 = min+decile; Q9 = max-decile; denum = Q9-Q1; if (dStart >= Q1 && dEnd > Q9) { denum = (Q9-dStart); bDecile = dStart; } else if (dStart >= Q1 && dEnd <= Q9) { denum = dEnd-dStart; bDecile = dStart; } else if (dStart < Q1 && dEnd <= Q9) { denum = dEnd-Q1; bDecile = Q1; } } aDecile = num/denum; }

3,233,412

private void initDecileMap(double dStart, double dEnd) { double denum = (dEnd-dStart), num = MAX; double decile = ((double) (max-min))/DECILE; Q1 = min; Q9 = max; bDecile = dStart; if (getNoiseReduction()) { Q1 = min+decile; Q9 = max-decile; denum = Q9-Q1; if (dStart >= Q1 && dEnd > Q9) { denum = (Q9-dStart); bDecile = dStart; } else if (dStart >= Q1 && dEnd <= Q9) { denum = dEnd-dStart; bDecile = dStart; } else if (dStart < Q1 && dEnd <= Q9) { denum = dEnd-Q1; bDecile = Q1; } } aDecile = num/denum; }

private void initDecileMap(double dStart, double dEnd) { double denum = (dEnd-dStart), num = MAX; double decile = ((double) (max-min))/DECILE; Q1 = min; Q9 = max; if (getNoiseReduction()) { Q1 = min+decile; Q9 = max-decile; denum = Q9-Q1; if (dStart >= Q1 && dEnd > Q9) { denum = (Q9-dStart); } else if (dStart >= Q1 && dEnd <= Q9) { denum = dEnd-dStart; } else if (dStart < Q1 && dEnd <= Q9) { denum = dEnd-Q1; bDecile = Q1; } } aDecile = num/denum; }

3,233,413

private void initDecileMap(double dStart, double dEnd) { double denum = (dEnd-dStart), num = MAX; double decile = ((double) (max-min))/DECILE; Q1 = min; Q9 = max; bDecile = dStart; if (getNoiseReduction()) { Q1 = min+decile; Q9 = max-decile; denum = Q9-Q1; if (dStart >= Q1 && dEnd > Q9) { denum = (Q9-dStart); bDecile = dStart; } else if (dStart >= Q1 && dEnd <= Q9) { denum = dEnd-dStart; bDecile = dStart; } else if (dStart < Q1 && dEnd <= Q9) { denum = dEnd-Q1; bDecile = Q1; } } aDecile = num/denum; }

private void initDecileMap(double dStart, double dEnd) { double denum = (dEnd-dStart), num = MAX; double decile = ((double) (max-min))/DECILE; Q1 = min; Q9 = max; b = dStart; if (getNoiseReduction()) { Q1 = min+decile; Q9 = max-decile; denum = Q9-Q1; if (dStart >= Q1 && dEnd > Q9) { denum = (Q9-dStart); b = dStart; } else if (dStart >= Q1 && dEnd <= Q9) { denum = dEnd-dStart; b = dStart; } else if (dStart < Q1 && dEnd <= Q9) { denum = dEnd-Q1; bDecile = Q1; } } aDecile = num/denum; }

3,233,414

private void initDecileMap(double dStart, double dEnd) { double denum = (dEnd-dStart), num = MAX; double decile = ((double) (max-min))/DECILE; Q1 = min; Q9 = max; bDecile = dStart; if (getNoiseReduction()) { Q1 = min+decile; Q9 = max-decile; denum = Q9-Q1; if (dStart >= Q1 && dEnd > Q9) { denum = (Q9-dStart); bDecile = dStart; } else if (dStart >= Q1 && dEnd <= Q9) { denum = dEnd-dStart; bDecile = dStart; } else if (dStart < Q1 && dEnd <= Q9) { denum = dEnd-Q1; bDecile = Q1; } } aDecile = num/denum; }

private void initDecileMap(double dStart, double dEnd) { double denum = (dEnd-dStart), num = MAX; double decile = ((double) (max-min))/DECILE; Q1 = min; Q9 = max; b = dStart; if (getNoiseReduction()) { Q1 = min+decile; Q9 = max-decile; denum = Q9-Q1; if (dStart >= Q1 && dEnd > Q9) { denum = (Q9-dStart); b = dStart; } else if (dStart >= Q1 && dEnd <= Q9) { denum = dEnd-dStart; b = dStart; } else if (dStart < Q1 && dEnd <= Q9) { denum = dEnd-Q1; bDecile = Q1; } } aDecile = num/denum; }

3,233,415

private void initDecileMap(double dStart, double dEnd) { double denum = (dEnd-dStart), num = MAX; double decile = ((double) (max-min))/DECILE; Q1 = min; Q9 = max; bDecile = dStart; if (getNoiseReduction()) { Q1 = min+decile; Q9 = max-decile; denum = Q9-Q1; if (dStart >= Q1 && dEnd > Q9) { denum = (Q9-dStart); bDecile = dStart; } else if (dStart >= Q1 && dEnd <= Q9) { denum = dEnd-dStart; bDecile = dStart; } else if (dStart < Q1 && dEnd <= Q9) { denum = dEnd-Q1; bDecile = Q1; } } aDecile = num/denum; }

private void initDecileMap(double dStart, double dEnd) { double denum = (dEnd-dStart), num = MAX; double decile = ((double) (max-min))/DECILE; Q1 = min; Q9 = max; bDecile = dStart; if (getNoiseReduction()) { Q1 = min+decile; Q9 = max-decile; denum = Q9-Q1; if (dStart >= Q1 && dEnd > Q9) { denum = (Q9-dStart); bDecile = dStart; } else if (dStart >= Q1 && dEnd <= Q9) { denum = dEnd-dStart; bDecile = dStart; } else if (dStart < Q1 && dEnd <= Q9) { denum = dEnd-Q1; } } aDecile = num/denum; }

3,233,416

private void initNormalizedMap(double k) { ysNormalized = valueMapper.transform(MIN, k); yeNormalized = valueMapper.transform(MAX, k); aNormalized = qDef.getBitResolution().floatValue()/(yeNormalized-ysNormalized); }

private void initNormalizedMap(double k) { ysNormalized = valueMapper.transform(MIN, k); yeNormalized = valueMapper.transform(MAX, k); aNormalized = qDef.getBitResolution().intValue()/ (yeNormalized-ysNormalized); }

3,233,418

public static RubyClass createStringClass(Ruby ruby) { RubyClass stringClass = ruby.defineClass("String", ruby.getObjectClass()); stringClass.includeModule(ruby.getRubyClass("Comparable")); // stringClass.includeModule(ruby.getModules().getEnumerable()); stringClass.defineSingletonMethod("new", getSingletonMethod("m_new", true)); stringClass.defineMethod("initialize", getMethod("m_replace", RubyString.class));/* rb_define_method(rb_cString, "clone", rb_str_clone, 0); rb_define_method(rb_cString, "dup", rb_str_dup, 0);*/ stringClass.defineMethod("<=>", getMethod("op_cmp", RubyObject.class)); stringClass.defineMethod("==", getMethod("m_equal", RubyObject.class)); stringClass.defineMethod("===", getMethod("m_equal", RubyObject.class)); stringClass.defineMethod("eql?", getMethod("m_equal", RubyObject.class)); /*rb_define_method(rb_cString, "hash", rb_str_hash_m, 0); rb_define_method(rb_cString, "+", rb_str_plus, 1); rb_define_method(rb_cString, "*", rb_str_times, 1); rb_define_method(rb_cString, "%", rb_str_format, 1); */ stringClass.defineMethod("[]", getMethod("m_slice", true)); /*rb_define_method(rb_cString, "[]=", rb_str_aset_m, -1); rb_define_method(rb_cString, "length", rb_str_length, 0); rb_define_method(rb_cString, "size", rb_str_length, 0); rb_define_method(rb_cString, "empty?", rb_str_empty, 0); rb_define_method(rb_cString, "=~", rb_str_match, 1); rb_define_method(rb_cString, "~", rb_str_match2, 0); rb_define_method(rb_cString, "succ", rb_str_succ, 0); rb_define_method(rb_cString, "succ!", rb_str_succ_bang, 0); rb_define_method(rb_cString, "next", rb_str_succ, 0); rb_define_method(rb_cString, "next!", rb_str_succ_bang, 0); rb_define_method(rb_cString, "upto", rb_str_upto_m, 1); rb_define_method(rb_cString, "index", rb_str_index_m, -1); rb_define_method(rb_cString, "rindex", rb_str_rindex, -1); rb_define_method(rb_cString, "replace", rb_str_replace_m, 1); rb_define_method(rb_cString, "to_i", rb_str_to_i, 0); */ stringClass.defineMethod("to_s", getMethod("m_to_s", false)); stringClass.defineMethod("to_str", getMethod("m_to_s", false)); /* rb_define_method(rb_cString, "inspect", rb_str_inspect, 0); rb_define_method(rb_cString, "dump", rb_str_dump, 0); rb_define_method(rb_cString, "upcase", rb_str_upcase, 0); rb_define_method(rb_cString, "downcase", rb_str_downcase, 0); rb_define_method(rb_cString, "capitalize", rb_str_capitalize, 0); rb_define_method(rb_cString, "swapcase", rb_str_swapcase, 0); rb_define_method(rb_cString, "upcase!", rb_str_upcase_bang, 0); rb_define_method(rb_cString, "downcase!", rb_str_downcase_bang, 0); rb_define_method(rb_cString, "capitalize!", rb_str_capitalize_bang, 0); rb_define_method(rb_cString, "swapcase!", rb_str_swapcase_bang, 0); rb_define_method(rb_cString, "hex", rb_str_hex, 0); rb_define_method(rb_cString, "oct", rb_str_oct, 0); rb_define_method(rb_cString, "split", rb_str_split_m, -1);*/ stringClass.defineMethod("reverse", getMethod("m_reverse", false)); /*rb_define_method(rb_cString, "reverse!", rb_str_reverse_bang, 0); rb_define_method(rb_cString, "concat", rb_str_concat, 1); rb_define_method(rb_cString, "<<", rb_str_concat, 1); rb_define_method(rb_cString, "crypt", rb_str_crypt, 1); rb_define_method(rb_cString, "intern", rb_str_intern, 0); rb_define_method(rb_cString, "include?", rb_str_include, 1); rb_define_method(rb_cString, "scan", rb_str_scan, 1); rb_define_method(rb_cString, "ljust", rb_str_ljust, 1); rb_define_method(rb_cString, "rjust", rb_str_rjust, 1); rb_define_method(rb_cString, "center", rb_str_center, 1); rb_define_method(rb_cString, "sub", rb_str_sub, -1); rb_define_method(rb_cString, "gsub", rb_str_gsub, -1); rb_define_method(rb_cString, "chop", rb_str_chop, 0); rb_define_method(rb_cString, "chomp", rb_str_chomp, -1); rb_define_method(rb_cString, "strip", rb_str_strip, 0); rb_define_method(rb_cString, "sub!", rb_str_sub_bang, -1); rb_define_method(rb_cString, "gsub!", rb_str_gsub_bang, -1); rb_define_method(rb_cString, "strip!", rb_str_strip_bang, 0); rb_define_method(rb_cString, "chop!", rb_str_chop_bang, 0); rb_define_method(rb_cString, "chomp!", rb_str_chomp_bang, -1); rb_define_method(rb_cString, "tr", rb_str_tr, 2); rb_define_method(rb_cString, "tr_s", rb_str_tr_s, 2); rb_define_method(rb_cString, "delete", rb_str_delete, -1); rb_define_method(rb_cString, "squeeze", rb_str_squeeze, -1); rb_define_method(rb_cString, "count", rb_str_count, -1); rb_define_method(rb_cString, "tr!", rb_str_tr_bang, 2); rb_define_method(rb_cString, "tr_s!", rb_str_tr_s_bang, 2); rb_define_method(rb_cString, "delete!", rb_str_delete_bang, -1); rb_define_method(rb_cString, "squeeze!", rb_str_squeeze_bang, -1); rb_define_method(rb_cString, "each_line", rb_str_each_line, -1); rb_define_method(rb_cString, "each", rb_str_each_line, -1); rb_define_method(rb_cString, "each_byte", rb_str_each_byte, 0); rb_define_method(rb_cString, "sum", rb_str_sum, -1); rb_define_global_function("sub", rb_f_sub, -1); rb_define_global_function("gsub", rb_f_gsub, -1); rb_define_global_function("sub!", rb_f_sub_bang, -1); rb_define_global_function("gsub!", rb_f_gsub_bang, -1); rb_define_global_function("chop", rb_f_chop, 0); rb_define_global_function("chop!", rb_f_chop_bang, 0); rb_define_global_function("chomp", rb_f_chomp, -1); rb_define_global_function("chomp!", rb_f_chomp_bang, -1); rb_define_global_function("split", rb_f_split, -1); rb_define_global_function("scan", rb_f_scan, 1);*/ stringClass.defineMethod("slice", getMethod("m_slice", true)); /*rb_define_method(rb_cString, "slice!", rb_str_slice_bang, -1); id_to_s = rb_intern("to_s"); rb_fs = Qnil; rb_define_hooked_variable("$;", &rb_fs, 0, rb_str_setter); rb_define_hooked_variable("$-F", &rb_fs, 0, rb_str_setter);*/ return stringClass; }

3,233,419

public static RubyClass createStringClass(Ruby ruby) { RubyClass stringClass = ruby.defineClass("String", ruby.getObjectClass()); stringClass.includeModule(ruby.getRubyClass("Comparable")); // stringClass.includeModule(ruby.getModules().getEnumerable()); stringClass.defineSingletonMethod("new", getSingletonMethod("m_new", true)); stringClass.defineMethod("initialize", getMethod("m_replace", RubyString.class));/* rb_define_method(rb_cString, "clone", rb_str_clone, 0); rb_define_method(rb_cString, "dup", rb_str_dup, 0);*/ stringClass.defineMethod("<=>", getMethod("op_cmp", RubyObject.class)); stringClass.defineMethod("==", getMethod("m_equal", RubyObject.class)); stringClass.defineMethod("===", getMethod("m_equal", RubyObject.class)); stringClass.defineMethod("eql?", getMethod("m_equal", RubyObject.class)); /*rb_define_method(rb_cString, "hash", rb_str_hash_m, 0); rb_define_method(rb_cString, "+", rb_str_plus, 1); rb_define_method(rb_cString, "*", rb_str_times, 1); rb_define_method(rb_cString, "%", rb_str_format, 1); */ stringClass.defineMethod("[]", getMethod("m_slice", true)); /*rb_define_method(rb_cString, "[]=", rb_str_aset_m, -1); rb_define_method(rb_cString, "length", rb_str_length, 0); rb_define_method(rb_cString, "size", rb_str_length, 0); rb_define_method(rb_cString, "empty?", rb_str_empty, 0); rb_define_method(rb_cString, "=~", rb_str_match, 1); rb_define_method(rb_cString, "~", rb_str_match2, 0); rb_define_method(rb_cString, "succ", rb_str_succ, 0); rb_define_method(rb_cString, "succ!", rb_str_succ_bang, 0); rb_define_method(rb_cString, "next", rb_str_succ, 0); rb_define_method(rb_cString, "next!", rb_str_succ_bang, 0); rb_define_method(rb_cString, "upto", rb_str_upto_m, 1); rb_define_method(rb_cString, "index", rb_str_index_m, -1); rb_define_method(rb_cString, "rindex", rb_str_rindex, -1); rb_define_method(rb_cString, "replace", rb_str_replace_m, 1); rb_define_method(rb_cString, "to_i", rb_str_to_i, 0); */ stringClass.defineMethod("to_s", getMethod("m_to_s", false)); stringClass.defineMethod("to_str", getMethod("m_to_s", false)); /* rb_define_method(rb_cString, "inspect", rb_str_inspect, 0); rb_define_method(rb_cString, "dump", rb_str_dump, 0); rb_define_method(rb_cString, "upcase", rb_str_upcase, 0); rb_define_method(rb_cString, "downcase", rb_str_downcase, 0); rb_define_method(rb_cString, "capitalize", rb_str_capitalize, 0); rb_define_method(rb_cString, "swapcase", rb_str_swapcase, 0); rb_define_method(rb_cString, "upcase!", rb_str_upcase_bang, 0); rb_define_method(rb_cString, "downcase!", rb_str_downcase_bang, 0); rb_define_method(rb_cString, "capitalize!", rb_str_capitalize_bang, 0); rb_define_method(rb_cString, "swapcase!", rb_str_swapcase_bang, 0); rb_define_method(rb_cString, "hex", rb_str_hex, 0); rb_define_method(rb_cString, "oct", rb_str_oct, 0); rb_define_method(rb_cString, "split", rb_str_split_m, -1);*/ stringClass.defineMethod("reverse", getMethod("m_reverse", false)); /*rb_define_method(rb_cString, "reverse!", rb_str_reverse_bang, 0); rb_define_method(rb_cString, "concat", rb_str_concat, 1); rb_define_method(rb_cString, "<<", rb_str_concat, 1); rb_define_method(rb_cString, "crypt", rb_str_crypt, 1); rb_define_method(rb_cString, "intern", rb_str_intern, 0); rb_define_method(rb_cString, "include?", rb_str_include, 1); rb_define_method(rb_cString, "scan", rb_str_scan, 1); rb_define_method(rb_cString, "ljust", rb_str_ljust, 1); rb_define_method(rb_cString, "rjust", rb_str_rjust, 1); rb_define_method(rb_cString, "center", rb_str_center, 1); rb_define_method(rb_cString, "sub", rb_str_sub, -1); rb_define_method(rb_cString, "gsub", rb_str_gsub, -1); rb_define_method(rb_cString, "chop", rb_str_chop, 0); rb_define_method(rb_cString, "chomp", rb_str_chomp, -1); rb_define_method(rb_cString, "strip", rb_str_strip, 0); rb_define_method(rb_cString, "sub!", rb_str_sub_bang, -1); rb_define_method(rb_cString, "gsub!", rb_str_gsub_bang, -1); rb_define_method(rb_cString, "strip!", rb_str_strip_bang, 0); rb_define_method(rb_cString, "chop!", rb_str_chop_bang, 0); rb_define_method(rb_cString, "chomp!", rb_str_chomp_bang, -1); rb_define_method(rb_cString, "tr", rb_str_tr, 2); rb_define_method(rb_cString, "tr_s", rb_str_tr_s, 2); rb_define_method(rb_cString, "delete", rb_str_delete, -1); rb_define_method(rb_cString, "squeeze", rb_str_squeeze, -1); rb_define_method(rb_cString, "count", rb_str_count, -1); rb_define_method(rb_cString, "tr!", rb_str_tr_bang, 2); rb_define_method(rb_cString, "tr_s!", rb_str_tr_s_bang, 2); rb_define_method(rb_cString, "delete!", rb_str_delete_bang, -1); rb_define_method(rb_cString, "squeeze!", rb_str_squeeze_bang, -1); rb_define_method(rb_cString, "each_line", rb_str_each_line, -1); rb_define_method(rb_cString, "each", rb_str_each_line, -1); rb_define_method(rb_cString, "each_byte", rb_str_each_byte, 0); rb_define_method(rb_cString, "sum", rb_str_sum, -1); rb_define_global_function("sub", rb_f_sub, -1); rb_define_global_function("gsub", rb_f_gsub, -1); rb_define_global_function("sub!", rb_f_sub_bang, -1); rb_define_global_function("gsub!", rb_f_gsub_bang, -1); rb_define_global_function("chop", rb_f_chop, 0); rb_define_global_function("chop!", rb_f_chop_bang, 0); rb_define_global_function("chomp", rb_f_chomp, -1); rb_define_global_function("chomp!", rb_f_chomp_bang, -1); rb_define_global_function("split", rb_f_split, -1); rb_define_global_function("scan", rb_f_scan, 1);*/ stringClass.defineMethod("slice", getMethod("m_slice", true)); /*rb_define_method(rb_cString, "slice!", rb_str_slice_bang, -1); id_to_s = rb_intern("to_s"); rb_fs = Qnil; rb_define_hooked_variable("$;", &rb_fs, 0, rb_str_setter); rb_define_hooked_variable("$-F", &rb_fs, 0, rb_str_setter);*/ return stringClass; }

3,233,420

public MetaClass(IRuby runtime, RubyClass superClass, RubyModule parentModule) { super(runtime, runtime.getClass("Class"), superClass, parentModule, null); }

3,233,421