mirror of
https://github.com/NationalSecurityAgency/ghidra.git
synced 2026-09-28 17:11:11 -09:00
Many typo's
These were found using the command below searching for duplicated words, and manually going through the results to remove the false positives and reword the true positives. Sometimes I removed the doubled word and sometimes I replaced the duplicated word. The grep command: grep -nIEr '\b([a-zA-Z]+)[[:space:]*]+\1\b' ./Ghidra
This commit is contained in:
@@ -14,7 +14,7 @@
|
||||
* limitations under the License.
|
||||
*/
|
||||
//Script that enables user to add an existing Version Tracking Session to version control. This
|
||||
//is meant to to be used when project is a shared project and when running in headless mode
|
||||
//is meant to be used when project is a shared project and when running in headless mode
|
||||
//since it is simple add a VTSession to version control from the project manager when running in
|
||||
//GUI mode.
|
||||
//@category Version Tracking
|
||||
|
||||
@@ -14,7 +14,7 @@
|
||||
* limitations under the License.
|
||||
*/
|
||||
// An example of how to create Version Tracking session, run some correlators to find matching
|
||||
// data and and then save the session.
|
||||
// data and then save the session.
|
||||
//@category Examples.Version Tracking
|
||||
|
||||
import java.util.Collection;
|
||||
|
||||
@@ -20,7 +20,7 @@
|
||||
Version Tracking refers to the process used by reverse engineers to identify matching code or data
|
||||
between different software binaries. One common use case is to version track two
|
||||
different versions of the same binary. Alternatively, version tracking techniques
|
||||
can be used to check for the presence of of a particular piece of code within a given
|
||||
can be used to check for the presence of a particular piece of code within a given
|
||||
binary of interest.
|
||||
</P>
|
||||
|
||||
|
||||
@@ -208,7 +208,7 @@
|
||||
|
||||
<TR>
|
||||
<TD valign="top">Votes</TD>
|
||||
<TD valign="top">The number of references from from previously accepted matches that would suggest
|
||||
<TD valign="top">The number of references from previously accepted matches that would suggest
|
||||
that this is a correct match.</TD>
|
||||
</TR>
|
||||
|
||||
|
||||
@@ -1132,7 +1132,7 @@ public abstract class AbstractVTMatchTableModel extends AddressBasedTableModel<V
|
||||
|
||||
@Override
|
||||
public String getColumnDescription() {
|
||||
return "Votes - The number of references from from previously accepted " +
|
||||
return "Votes - The number of references from previously accepted " +
|
||||
"matches that would suggest that this is a correct match";
|
||||
}
|
||||
|
||||
|
||||
@@ -183,7 +183,7 @@ public class VTMarkupItemResetTest extends VTBaseTestCase {
|
||||
public void testDBMarkupItemStorageResetDoesntHappen_ClearConsidered() {
|
||||
//
|
||||
// Test that the markup item storage is not removed the considered status is cleared, but
|
||||
// the the destination address is set by the user.
|
||||
// the destination address is set by the user.
|
||||
//
|
||||
VTMatchSet matchSet = db.createMatchSet(
|
||||
createProgramCorrelator(db.getSourceProgram(), db.getDestinationProgram()));
|
||||
|
||||
Reference in New Issue
Block a user