mirror of
https://github.com/NationalSecurityAgency/ghidra.git
synced 2026-09-28 17:11:11 -09:00
GP-6790 - Function Signature Editor - Added support for changing the namespace
This commit is contained in:
@@ -145,8 +145,8 @@ public class FcgLevel implements Comparable<FcgLevel> {
|
||||
/**
|
||||
* Returns the child level of this level. The child of a level has the same direction
|
||||
* as this level, with a distance of one more than this level.
|
||||
*
|
||||
* @param the direction of the child
|
||||
*
|
||||
* @param newDirection the direction of the child
|
||||
* @return returns the child level of this level
|
||||
* @throws IllegalArgumentException if this is the source level, which is row 1
|
||||
*/
|
||||
|
||||
@@ -38,7 +38,7 @@ import ghidra.util.Msg;
|
||||
*
|
||||
* <P>This class is handed a group of edges to processes. In this group there are vertices that
|
||||
* do not need to be arranged, referred to as the {@code existing} vertices. This
|
||||
* classes uses {@link VertexCollection} to find and store the new vertices that need
|
||||
* classes uses {@link FcgExpandingVertexCollection} to find and store the new vertices that need
|
||||
* to be arranged.
|
||||
*/
|
||||
public class BowTieExpandVerticesJob extends AbstractGraphTransitionJob<FcgVertex, FcgEdge> {
|
||||
|
||||
@@ -4,9 +4,9 @@
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
@@ -31,7 +31,7 @@ import util.CollectionUtils;
|
||||
* A container to house all newly added vertices (those being arranged) and the sources, or
|
||||
* 'from' vertices, of the new vertices.
|
||||
*
|
||||
* <P>This offers exiting vertices and new vertices pre-sorted by position in the graph in
|
||||
* <P>This offers existing vertices and new vertices pre-sorted by position in the graph in
|
||||
* order to minimize edge crossings. Specifically, the new vertices will be sorted
|
||||
* by the level of the parent and then the x-value of the parent so that the
|
||||
* immediate parent level will be preferred, with the x-value dictating where to place
|
||||
|
||||
Reference in New Issue
Block a user