Unnamed: 0 int64 0 305k | body stringlengths 7 52.9k | name stringlengths 1 185 |
|---|---|---|
40,800 | void () { class StatementStackEntry { public final Statement statement; public final LinkedList<StackEntry> stackFinally; public final List<Exprent> tailExprents; public int statementIndex; public int edgeIndex; public List<StatEdge> succEdges; StatementStackEntry(Statement statement, LinkedList<StackEntry> stackFinall... | flattenStatement |
40,801 | void (DirectNode sourcenode, Statement destination, EdgeType edgetype, DirectNode finallyShortRangeSource, DirectNode finallyLongRangeSource, Statement finallyShortRangeEntry, Statement finallyLongRangeEntry, boolean isFinallyMonitorExceptionPath) { if (edgetype != EdgeType.FINALLY_EXIT) { listEdges.add(new Edge(source... | saveEdge |
40,802 | void () { for (Edge edge : listEdges) { String sourceid = edge.sourceid; Integer statid = edge.statid; DirectNode source = graph.nodes.getWithKey(sourceid); DirectNode dest = graph.nodes.getWithKey(mapDestinationNodes.get(statid)[edge.edgetype == EdgeType.CONTINUE ? 1 : 0]); if (!source.successors.contains(dest)) { sou... | setEdges |
40,803 | boolean (Object o) { if (o == this) return true; if (!(o instanceof FinallyPathWrapper fpw)) return false; return (source + ":" + destination + ":" + entry).equals(fpw.source + ":" + fpw.destination + ":" + fpw.entry); } | equals |
40,804 | int () { return (source + ":" + destination + ":" + entry).hashCode(); } | hashCode |
40,805 | String () { return source + "->(" + entry + ")->" + destination; } | toString |
40,806 | void () { LinkedList<DirectNode> res = new LinkedList<>(); addToReversePostOrderListIterative(first, res); nodes.clear(); for (DirectNode node : res) { nodes.addWithKey(node, node.id); } } | sortReversePostOrder |
40,807 | void (DirectNode root, List<? super DirectNode> lst) { LinkedList<DirectNode> stackNode = new LinkedList<>(); LinkedList<Integer> stackIndex = new LinkedList<>(); HashSet<DirectNode> setVisited = new HashSet<>(); stackNode.add(root); stackIndex.add(0); while (!stackNode.isEmpty()) { DirectNode node = stackNode.getLast(... | addToReversePostOrderListIterative |
40,808 | boolean (ExprentIterator iter) { CancellationManager cancellationManager = DecompilerContext.getCancellationManager(); LinkedList<DirectNode> stack = new LinkedList<>(); stack.add(first); HashSet<DirectNode> setVisited = new HashSet<>(); while (!stack.isEmpty()) { DirectNode node = stack.removeFirst(); if (setVisited.c... | iterateExprents |
40,809 | void () { calcIDoms(); } | initialize |
40,810 | void () { for (Statement stat : statement.getReversePostOrderList()) { colOrderedIDoms.addWithKey(null, stat.id); } } | orderStatements |
40,811 | Integer (Integer key1, Integer key2, VBStyleCollection<Integer, Integer> orderedIDoms) { if (key1 == null) { return key2; } else if (key2 == null) { return key1; } int index1 = orderedIDoms.getIndexByKey(key1); int index2 = orderedIDoms.getIndexByKey(key2); while (index1 != index2) { if (index1 > index2) { key1 = order... | getCommonIDom |
40,812 | void () { orderStatements(); colOrderedIDoms.putWithKey(statement.getFirst().id, statement.getFirst().id); // exclude first statement List<Integer> lstIds = colOrderedIDoms.getLstKeys().subList(1, colOrderedIDoms.getLstKeys().size()); while (true) { boolean changed = false; for (Integer id : lstIds) { Statement stat = ... | calcIDoms |
40,813 | boolean (Integer node, Integer dom) { while (!node.equals(dom)) { Integer idom = colOrderedIDoms.getWithKey(node); if (idom.equals(node)) { return false; // root node } else { node = idom; } } return true; } | isDominator |
40,814 | void () { calcIDoms(); } | initialize |
40,815 | void () { setRoots = graph.getRoots(); for (IGraphNode node : graph.getReversePostOrderList()) { colOrderedIDoms.addWithKey(null, node); } } | orderNodes |
40,816 | IGraphNode (IGraphNode node1, IGraphNode node2, VBStyleCollection<IGraphNode, IGraphNode> orderedIDoms) { IGraphNode nodeOld; if (node1 == null) { return node2; } else if (node2 == null) { return node1; } int index1 = orderedIDoms.getIndexByKey(node1); int index2 = orderedIDoms.getIndexByKey(node2); while (index1 != in... | getCommonIDom |
40,817 | void () { orderNodes(); List<IGraphNode> lstNodes = colOrderedIDoms.getLstKeys(); while (true) { boolean changed = false; for (IGraphNode node : lstNodes) { IGraphNode idom = null; if (!setRoots.contains(node)) { for (IGraphNode pred : node.getPredecessorNodes()) { if (colOrderedIDoms.getWithKey(pred) != null) { idom =... | calcIDoms |
40,818 | boolean (IGraphNode node, IGraphNode dom) { while (!node.equals(dom)) { IGraphNode idom = colOrderedIDoms.getWithKey(node); if (idom == node) { return false; // root node or merging point } else if (idom == null) { throw new RuntimeException("Inconsistent idom sequence discovered!"); } else { node = idom; } } return tr... | isDominator |
40,819 | void () { domEngine = new DominatorEngine(statement); domEngine.initialize(); buildDominatorTree(); buildExceptionRanges(); buildFilter(statement.getFirst().id); // free resources mapTreeBranches.clear(); mapExceptionRanges.clear(); } | initialize |
40,820 | boolean (Integer head, Integer exit) { Map<Integer, Integer> filter = mapExceptionRangeUniqueExit.get(head); for (Entry<Integer, Integer> entry : filter.entrySet()) { if (!head.equals(mapExceptionDoms.get(entry.getKey()))) { Integer filterExit = entry.getValue(); if (filterExit == -1 || !filterExit.equals(exit)) { retu... | acceptStatementPair |
40,821 | void () { VBStyleCollection<Integer, Integer> orderedIDoms = domEngine.getOrderedIDoms(); List<Integer> lstKeys = orderedIDoms.getLstKeys(); for (int index = lstKeys.size() - 1; index >= 0; index--) { Integer key = lstKeys.get(index); Integer idom = orderedIDoms.get(index); mapTreeBranches.computeIfAbsent(idom, k -> ne... | buildDominatorTree |
40,822 | void () { for (Statement stat : statement.getStats()) { List<Statement> lstPreds = stat.getNeighbours(EdgeType.EXCEPTION, EdgeDirection.BACKWARD); if (!lstPreds.isEmpty()) { Set<Integer> set = new HashSet<>(); for (Statement st : lstPreds) { set.add(st.id); } mapExceptionRanges.put(stat.id, set); } } mapExceptionDoms =... | buildExceptionRanges |
40,823 | void (Integer id) { Map<Integer, Integer> map = new HashMap<>(); Set<Integer> children = mapTreeBranches.get(id); if (children != null) { for (Integer childid : children) { buildFilter(childid); Map<Integer, Integer> mapChild = mapExceptionRangeUniqueExit.get(childid); for (Entry<Integer, Set<Integer>> entry : mapExcep... | buildFilter |
40,824 | DominatorEngine () { return domEngine; } | getDomEngine |
40,825 | void (DominatorTreeExceptionFilter filter) { DominatorEngine engine = filter.getDomEngine(); for (Integer head : new HashSet<>(mapExtPostdominators.keySet())) { FastFixedSet<Integer> setPostdoms = mapExtPostdominators.get(head); LinkedList<Statement> stack = new LinkedList<>(); LinkedList<FastFixedSet<Integer>> stackPa... | filterOnDominance |
40,826 | void (DominatorTreeExceptionFilter filter) { for (Integer head : new HashSet<>(mapExtPostdominators.keySet())) { FastFixedSet<Integer> set = mapExtPostdominators.get(head); for (Iterator<Integer> it = set.iterator(); it.hasNext(); ) { if (!filter.acceptStatementPair(head, it.next())) { it.remove(); } } if (set.isEmpty(... | filterOnExceptionRanges |
40,827 | void () { mapSupportPoints = new HashMap<>(); calcReachabilitySuppPoints(EdgeType.REGULAR); iterateReachability((node, mapSets) -> { Integer nodeid = node.id; FastFixedSet<Integer> setReachability = mapSets.get(nodeid); List<FastFixedSet<Integer>> lstPredSets = new ArrayList<>(); for (StatEdge prededge : node.getPredec... | removeErroneousNodes |
40,828 | void () { EdgeType edgetype = EdgeType.REGULAR.unite(EdgeType.EXCEPTION); calcReachabilitySuppPoints(edgetype); for (Statement stat : statement.getStats()) { mapExtPostdominators.put(stat.id, factory.spawnEmptySet()); } iterateReachability((node, mapSets) -> { Integer nodeid = node.id; FastFixedSet<Integer> setReachabi... | calcDefaultReachableSets |
40,829 | void (final EdgeType edgetype) { iterateReachability((node, mapSets) -> { // consider to be a support point for (StatEdge sucedge : node.getAllSuccessorEdges()) { if ((sucedge.getType().mask() & edgetype.mask()) != 0) { if (mapSets.containsKey(sucedge.getDestination().id)) { FastFixedSet<Integer> setReachability = mapS... | calcReachabilitySuppPoints |
40,830 | void (IReachabilityAction action, EdgeType edgetype) { while (true) { boolean iterate = false; HashMap<Integer, FastFixedSet<Integer>> mapSets = new HashMap<>(); for (Statement stat : lstReversePostOrderList) { FastFixedSet<Integer> set = factory.spawnEmptySet(); set.add(stat.id); for (StatEdge prededge : stat.getAllPr... | iterateReachability |
40,831 | TextBuffer (int indent, BytecodeMappingTracer tracer) { TextBuffer buf = new TextBuffer(); buf.append(ExprProcessor.listToJava(varDefinitions, indent, tracer)); if (isLabeled()) { buf.appendIndent(indent).append("label").append(Integer.toString(id)).append(":").appendLineSeparator(); tracer.incrementCurrentSourceLine()... | toJava |
40,832 | List<Object> () { List<Object> lst = new ArrayList<>(); switch (loopType) { case FOR: if (getInitExprent() != null) { lst.add(getInitExprent()); } case WHILE: lst.add(getConditionExprent()); } lst.add(first); switch (loopType) { case DO_WHILE -> lst.add(getConditionExprent()); case FOR -> lst.add(getIncExprent()); } re... | getSequentialObjects |
40,833 | void (Exprent oldExpr, Exprent newExpr) { if (initExprent.get(0) == oldExpr) { initExprent.set(0, newExpr); } if (conditionExprent.get(0) == oldExpr) { conditionExprent.set(0, newExpr); } if (incExprent.get(0) == oldExpr) { incExprent.set(0, newExpr); } } | replaceExprent |
40,834 | Statement () { return new DoStatement(); } | getSimpleCopy |
40,835 | List<Exprent> () { return initExprent; } | getInitExprentList |
40,836 | List<Exprent> () { return conditionExprent; } | getConditionExprentList |
40,837 | List<Exprent> () { return incExprent; } | getIncExprentList |
40,838 | void (Exprent conditionExprent) { this.conditionExprent.set(0, conditionExprent); } | setConditionExprent |
40,839 | void (Exprent incExprent) { this.incExprent.set(0, incExprent); } | setIncExprent |
40,840 | void (Exprent initExprent) { this.initExprent.set(0, initExprent); } | setInitExprent |
40,841 | LoopType () { return loopType; } | getLoopType |
40,842 | void (@NotNull LoopType loopType) { this.loopType = loopType; } | setLoopType |
40,843 | Statement (Statement head) { if (head.getLastBasicType() != StatementType.GENERAL) { return null; } Set<Statement> setHandlers = DecHelper.getUniquePredExceptions(head); if (!setHandlers.isEmpty()) { int hnextcount = 0; // either no statements with connection to next, or more than 1 Statement next = null; List<StatEdge... | isHead |
40,844 | TextBuffer (int indent, BytecodeMappingTracer tracer) { TextBuffer buf = new TextBuffer(); buf.append(ExprProcessor.listToJava(varDefinitions, indent, tracer)); if (isLabeled()) { buf.appendIndent(indent).append("label").append(Integer.toString(id)).append(":").appendLineSeparator(); tracer.incrementCurrentSourceLine()... | toJava |
40,845 | Statement () { CatchStatement cs = new CatchStatement(); for (List<String> exc : this.exctstrings) { cs.exctstrings.add(new ArrayList<>(exc)); cs.vars.add(new VarExprent(DecompilerContext.getCounterContainer().getCounterAndIncrement(CounterContainer.VAR_COUNTER), new VarType(CodeConstants.TYPE_OBJECT, 0, exc.get(0)), D... | getSimpleCopy |
40,846 | List<VarExprent> () { return vars; } | getVars |
40,847 | TextBuffer (int indent, BytecodeMappingTracer tracer) { TextBuffer buf = new TextBuffer(); buf.append(ExprProcessor.listToJava(varDefinitions, indent, tracer)); buf.append(first.toJava(indent, tracer)); if (isLabeled()) { buf.appendIndent(indent).append("label").append(Integer.toString(id)).append(":").appendLineSepara... | toJava |
40,848 | void (BytecodeMappingTracer tracer) { BasicBlock block = body.getBasichead().getBlock(); if (!block.getSeq().isEmpty() && block.getLastInstruction().opcode == CodeConstants.opc_monitorexit) { Integer offset = block.getOriginalOffset(block.size() - 1); if (offset > -1) tracer.addMapping(offset); } } | mapMonitorExitInstr |
40,849 | void () { headexprent.set(0, first.getExprents().remove(first.getExprents().size() - 1)); } | initExprents |
40,850 | List<Object> () { List<Object> lst = new ArrayList<>(stats); lst.add(1, headexprent.get(0)); return lst; } | getSequentialObjects |
40,851 | void (Exprent oldexpr, Exprent newexpr) { if (headexprent.get(0) == oldexpr) { headexprent.set(0, newexpr); } } | replaceExprent |
40,852 | void (Statement oldstat, Statement newstat) { if (body == oldstat) { body = newstat; } super.replaceStatement(oldstat, newstat); } | replaceStatement |
40,853 | void () { Statement exc = stats.get(2); SequenceHelper.destroyStatementContent(exc, true); stats.removeWithKey(exc.id); } | removeExc |
40,854 | Statement () { return new SynchronizedStatement(); } | getSimpleCopy |
40,855 | void () { first = stats.get(0); body = stats.get(1); } | initSimpleCopy |
40,856 | Statement () { return body; } | getBody |
40,857 | List<Exprent> () { return headexprent; } | getHeadexprentList |
40,858 | TextBuffer (int indent, BytecodeMappingTracer tracer) { TextBuffer buf = new TextBuffer(); if (isLabeled()) { buf.appendIndent(indent).append("label").append(Integer.toString(id)).append(":").appendLineSeparator(); } buf.appendIndent(indent).append("abstract statement {").appendLineSeparator(); for (Statement stat : st... | toJava |
40,859 | Statement (Statement stat) { if (stat.getExprents() != null) { return stat; } else if (stat.isLabeled()) { // FIXME: Why?? return null; } return switch (stat.type) { case SEQUENCE, IF, ROOT, SWITCH, SYNCHRONIZED -> findFirstData(stat.getFirst()); default -> null; }; } | findFirstData |
40,860 | boolean (InvocationExprent inv, MethodWrapper method, ClassWrapper wrapper, boolean withThis) { if (inv.getFuncType() == InvocationExprent.TYPE_INIT && inv.getInstance().type == Exprent.EXPRENT_VAR) { VarExprent instVar = (VarExprent)inv.getInstance(); VarVersionPair varPair = new VarVersionPair(instVar); String classN... | isInvocationInitConstructor |
40,861 | Statement (Statement head) { if (head.getLastBasicType() != StatementType.GENERAL) { return null; } // at most one outgoing edge StatEdge edge = null; List<StatEdge> lstSuccs = head.getSuccessorEdges(EdgeType.DIRECT_ALL); if (!lstSuccs.isEmpty()) { edge = lstSuccs.get(0); } if (edge != null && edge.getType() == EdgeTyp... | isHead2Block |
40,862 | TextBuffer (int indent, BytecodeMappingTracer tracer) { TextBuffer buf = new TextBuffer(); boolean isLabeled = isLabeled(); buf.append(ExprProcessor.listToJava(varDefinitions, indent, tracer)); if (isLabeled) { buf.appendIndent(indent++).append("label").append(Integer.toString(id)).append(": {").appendLineSeparator(); ... | toJava |
40,863 | Statement () { return new SequenceStatement(); } | getSimpleCopy |
40,864 | Statement (Statement head) { if (head.getLastBasicType() != StatementType.GENERAL) { return null; } Set<Statement> setHandlers = DecHelper.getUniquePredExceptions(head); if (setHandlers.size() != 1) { return null; } for (StatEdge edge : head.getSuccessorEdges(EdgeType.EXCEPTION)) { Statement exc = edge.getDestination()... | isHead |
40,865 | TextBuffer (int indent, BytecodeMappingTracer tracer) { String new_line_separator = DecompilerContext.getNewLineSeparator(); TextBuffer buf = new TextBuffer(); buf.append(ExprProcessor.listToJava(varDefinitions, indent, tracer)); boolean labeled = isLabeled(); if (labeled) { buf.appendIndent(indent).append("label").app... | toJava |
40,866 | void (Statement oldstat, Statement newstat) { if (handler == oldstat) { handler = newstat; } super.replaceStatement(oldstat, newstat); } | replaceStatement |
40,867 | Statement () { CatchAllStatement cas = new CatchAllStatement(); cas.isFinally = this.isFinally; if (this.monitor != null) { cas.monitor = new VarExprent(DecompilerContext.getCounterContainer().getCounterAndIncrement(CounterContainer.VAR_COUNTER), VarType.VARTYPE_INT, DecompilerContext.getVarProcessor()); } if (!this.va... | getSimpleCopy |
40,868 | void () { first = stats.get(0); handler = stats.get(1); } | initSimpleCopy |
40,869 | Statement () { return handler; } | getHandler |
40,870 | boolean () { return isFinally; } | isFinally |
40,871 | void (boolean isFinally) { this.isFinally = isFinally; } | setFinally |
40,872 | VarExprent () { return monitor; } | getMonitor |
40,873 | void (VarExprent monitor) { this.monitor = monitor; } | setMonitor |
40,874 | List<VarExprent> () { return vars; } | getVars |
40,875 | void () { post = null; continueSet = null; copied = false; // FIXME: used in FlattenStatementsHelper.flattenStatement()! check and remove //lastBasicType = LASTBASICTYPE_GENERAL; isMonitorEnter = false; containsMonitorExit = false; processMap(mapSuccEdges); processMap(mapPredEdges); processMap(mapSuccStates); processMa... | clearTempInformation |
40,876 | void (Statement stat) { cancellationManager.checkCanceled(); Statement head = stat.getFirst(); Statement post = stat.getPost(); VBStyleCollection<Statement, Integer> setNodes = stat.getStats(); // post edges if (post != null) { for (StatEdge edge : post.getEdges(EdgeType.DIRECT_ALL, EdgeDirection.BACKWARD)) { if (stat.... | collapseNodesToStatement |
40,877 | void () { for (Statement st : stats) { st.setParent(this); } } | setAllParent |
40,878 | void (StatEdge edge) { if (edge.closure != null) { edge.closure.getLabelEdges().remove(edge); } edge.closure = this; this.getLabelEdges().add(edge); } | addLabeledEdge |
40,879 | void (EdgeDirection direction, StatEdge edge, EdgeType edgetype) { Map<EdgeType, List<StatEdge>> mapEdges = direction == EdgeDirection.BACKWARD ? mapPredEdges : mapSuccEdges; Map<EdgeType, List<Statement>> mapStates = direction == EdgeDirection.BACKWARD ? mapPredStates : mapSuccStates; mapEdges.computeIfAbsent(edgetype... | addEdgeDirectInternal |
40,880 | void (EdgeDirection direction, StatEdge edge) { EdgeType type = edge.getType(); EdgeType[] arrtypes; if (type == EdgeType.EXCEPTION) { arrtypes = new EdgeType[]{EdgeType.ALL, EdgeType.EXCEPTION}; } else { arrtypes = new EdgeType[]{EdgeType.ALL, EdgeType.DIRECT_ALL, type}; } for (EdgeType edgetype : arrtypes) { addEdgeD... | addEdgeInternal |
40,881 | void (EdgeDirection direction, StatEdge edge, EdgeType edgetype) { Map<EdgeType, List<StatEdge>> mapEdges = direction == EdgeDirection.BACKWARD ? mapPredEdges : mapSuccEdges; Map<EdgeType, List<Statement>> mapStates = direction == EdgeDirection.BACKWARD ? mapPredStates : mapSuccStates; List<StatEdge> lst = mapEdges.get... | removeEdgeDirectInternal |
40,882 | void (EdgeDirection direction, StatEdge edge) { EdgeType type = edge.getType(); EdgeType[] arrtypes; if (type == EdgeType.EXCEPTION) { arrtypes = new EdgeType[]{EdgeType.ALL, EdgeType.EXCEPTION}; } else { arrtypes = new EdgeType[]{EdgeType.ALL, EdgeType.DIRECT_ALL, type}; } for (EdgeType edgetype : arrtypes) { removeEd... | removeEdgeInternal |
40,883 | void (StatEdge edge) { addEdgeInternal(EdgeDirection.BACKWARD, edge); } | addPredecessor |
40,884 | void (StatEdge edge) { if (edge == null) { // FIXME: redundant? return; } removeEdgeInternal(EdgeDirection.BACKWARD, edge); } | removePredecessor |
40,885 | void (StatEdge edge) { addEdgeInternal(EdgeDirection.FORWARD, edge); if (edge.closure != null) { edge.closure.getLabelEdges().add(edge); } edge.getDestination().addPredecessor(edge); } | addSuccessor |
40,886 | void (StatEdge edge) { if (edge == null) { return; } removeEdgeInternal(EdgeDirection.FORWARD, edge); if (edge.closure != null) { edge.closure.getLabelEdges().remove(edge); } if (edge.getDestination() != null) { // TODO: redundant? edge.getDestination().removePredecessor(edge); } } | removeSuccessor |
40,887 | void (Statement stat) { if (stat == null) { return; } for (StatEdge edge : getAllSuccessorEdges()) { if (edge.getDestination() == stat) { removeSuccessor(edge); } } } | removeAllSuccessors |
40,888 | HashSet<Statement> () { cancellationManager.checkCanceled(); continueSet.clear(); for (Statement st : stats) { continueSet.addAll(st.buildContinueSet()); if (st != first) { continueSet.remove(st.getBasichead()); } } for (StatEdge edge : getEdges(EdgeType.CONTINUE, EdgeDirection.FORWARD)) { continueSet.add(edge.getDesti... | buildContinueSet |
40,889 | void () { for (Statement st : stats) { st.buildMonitorFlags(); } switch (type) { case BASIC_BLOCK -> { BasicBlockStatement bblock = (BasicBlockStatement)this; InstructionSequence seq = bblock.getBlock().getSeq(); if (seq != null && !seq.isEmpty()) { for (int i = 0; i < seq.length(); i++) { if (seq.getInstr(i).opcode ==... | buildMonitorFlags |
40,890 | List<Statement> () { return getReversePostOrderList(first); } | getReversePostOrderList |
40,891 | List<Statement> (Statement stat) { cancellationManager.checkCanceled(); List<Statement> res = new ArrayList<>(); addToReversePostOrderListIterative(stat, res); return res; } | getReversePostOrderList |
40,892 | List<Statement> () { return getPostReversePostOrderList(null); } | getPostReversePostOrderList |
40,893 | List<Statement> (List<Statement> lstexits) { cancellationManager.checkCanceled(); List<Statement> res = new ArrayList<>(); if (lstexits == null) { lstexits = new StrongConnectivityHelper(this).getExitReps(); } HashSet<Statement> setVisited = new HashSet<>(); for (Statement exit : lstexits) { cancellationManager.checkCa... | getPostReversePostOrderList |
40,894 | boolean (Statement stat) { return this == stat || containsStatementStrict(stat); } | containsStatement |
40,895 | boolean (Statement stat) { cancellationManager.checkCanceled(); if (stats.contains(stat)) { return true; } for (Statement st : stats) { if (st.containsStatementStrict(stat)) { return true; } } return false; } | containsStatementStrict |
40,896 | TextBuffer (int indent, BytecodeMappingTracer tracer) { throw new RuntimeException("not implemented"); } | toJava |
40,897 | List<Object> () { return new ArrayList<>(stats); } | getSequentialObjects |
40,898 | void () { // do nothing } | initExprents |
40,899 | void (Exprent oldexpr, Exprent newexpr) { // do nothing } | replaceExprent |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.