@Override public boolean equals(Object other) { return other instanceof FrozenString && bytelist.equals(((FrozenString) other).bytelist) && coderange == ((FrozenString) other).coderange; }
@Override public boolean equals(Object other) { return other instanceof FrozenString && bytelist.equals(((FrozenString) other).bytelist) && coderange == ((FrozenString) other).coderange; }
private static boolean isSymbolMatch(ByteList bytes, int hash, SymbolEntry entry) { return hash == entry.hash && bytes.equals(entry.bytes); }
private static boolean isSymbolMatch(ByteList bytes, int hash, SymbolEntry entry) { return hash == entry.hash && bytes.equals(entry.bytes); }
public boolean isOr() { return CommonByteLists.OR_OR.equals(operator.getBytes()); }
public boolean isOr() { return CommonByteLists.OR_OR.equals(operatorName.getBytes()); }
public IRFor(IRManager manager, IRScope lexicalParent, int lineNumber, StaticScope staticScope, Signature signature, ByteList labelPrefix) { super(manager, lexicalParent, lineNumber, StaticScopeFactory.newIRBlockScope(staticScope), signature, labelPrefix, labelPrefix.equals(_BEGIN_)); }
public boolean isOr() { return CommonByteLists.OR_OR.equals(operatorName.getBytes()); }
public boolean isAnd() { return CommonByteLists.AMPERSAND_AMPERSAND.equals(operatorName.getBytes()); }
public boolean isAnd() { return CommonByteLists.AMPERSAND_AMPERSAND.equals(operatorName.getBytes()); }
public boolean isOr() { return CommonByteLists.OR_OR.equals(operator.getBytes()); }
public boolean isAnd() { return CommonByteLists.AMPERSAND_AMPERSAND.equals(operator.getBytes()); }
public boolean isOr() { return CommonByteLists.OR_OR.equals(operatorName.getBytes()); }
public boolean isAnd() { return CommonByteLists.AMPERSAND_AMPERSAND.equals(operatorName.getBytes()); }
private void determineIfProcNew(Node receiverNode, RubySymbol name, CallInstr callInstr) { // This is to support the ugly Proc.new with no block, which must see caller's frame if (CommonByteLists.NEW_METHOD.equals(name.getBytes()) && receiverNode instanceof ConstNode && ((ConstNode)receiverNode).getName().idString().equals("Proc")) { callInstr.setProcNew(true); } }
private void determineIfProcNew(Node receiverNode, RubySymbol name, CallInstr callInstr) { // This is to support the ugly Proc.new with no block, which must see caller's frame if (CommonByteLists.NEW_METHOD.equals(name.getBytes()) && receiverNode instanceof ConstNode && ((ConstNode)receiverNode).getName().idString().equals("Proc")) { callInstr.setProcNew(true); } }
private void determineIfMaybeUsingMethod(RubySymbol methodName, Operand[] args) { IRScope outerScope = scope.getNearestTopLocalVariableScope(); // 'using single_mod_arg' possible nearly everywhere but method scopes. if (CommonByteLists.USING_METHOD.equals(methodName.getBytes()) && !(outerScope instanceof IRMethod) && args.length == 1) { scope.setIsMaybeUsingRefinements(); } }
private void determineIfMaybeUsingMethod(RubySymbol methodName, Operand[] args) { IRScope outerScope = scope.getNearestTopLocalVariableScope(); // 'using single_mod_arg' possible nearly everywhere but method scopes. if (CommonByteLists.USING_METHOD.equals(methodName.getBytes()) && !(outerScope instanceof IRMethod) && args.length == 1) { scope.setIsMaybeUsingRefinements(); } }
public Node declareIdentifier(ByteList name) { if (name.equals(lexer.getCurrentArg())) { warn(ID.AMBIGUOUS_ARGUMENT, lexer.getPosition(), "circular argument reference - " + name); } return currentScope.declare(lexer.tokline, symbolID(name)); }
public Node declareIdentifier(ByteList name) { if (name.equals(lexer.getCurrentArg())) { warn(ID.AMBIGUOUS_ARGUMENT, lexer.getPosition(), "circular argument reference - " + name); } return currentScope.declare(lexer.tokline, symbolID(name)); }