Fix spelling errors

2026-05-20 18:51:35 +08:00 · 2020-01-26 22:39:18 -05:00
parent 4361f39fe2
commit a5efecea84
78 changed files with 95 additions and 95 deletions
@@ -93,7 +93,7 @@ This file was changed on July 4th, 2019.

   IN_GLIBCPP_V3
      If defined, this file defines only __cxa_demangle() and
-      __gcclibcxx_demangle_callback(), and no other publically visible
+      __gcclibcxx_demangle_callback(), and no other publicly visible
      functions or variables.

   STANDALONE_DEMANGLER
@@ -2651,7 +2651,7 @@ iterate_demangle_function (struct work_stuff *work, const char **mangled,
  /* Iterate over occurrences of __, allowing names and types to have a
     "__" sequence in them.  We must start with the first (not the last)
     occurrence, since "__" most often occur between independent mangled
-     parts, hence starting at the last occurence inside a signature
+     parts, hence starting at the last occurrence inside a signature
     might get us a "successful" demangling of the signature.  */

  while (scan[2])
@@ -97,7 +97,7 @@ public class CallAnotherScriptForAllPrograms extends GhidraScript {
 			runScript(SUBSCRIPT_NAME, newState);
 		}
 		catch (Exception e) {
-			printerr("ERROR! Exception occured while processing file: " +
+			printerr("ERROR! Exception occurred while processing file: " +
 				program.getDomainFile().getPathname());
 			printerr("       " + e.getMessage());
 			e.printStackTrace();
@@ -43,7 +43,7 @@ public class IterateFunctionsByAddressScript extends GhidraScript {
 	private void iterateForward() {
 		// Use the iterator, there is no easy way to use the function iterator on addresses
 		//   If the function begins at address zero, you won't get the function without
-		//   alot of extra more complicated code.
+		//   a lot of extra more complicated code.
 		FunctionIterator fiter = currentProgram.getFunctionManager().getFunctions(true);

 		int count = 0;
@@ -179,7 +179,7 @@
        CParserPlugin.out file produced in your home directory.<BR>
        </P>

-        <P>Use the Line numbers to determine where in the file the parse error occured.<BR>
+        <P>Use the Line numbers to determine where in the file the parse error occurred.<BR>
        </P>

        <P>The <SPAN style="font-style: italic; font-weight: bold;">last valid data parsed</SPAN>
@@ -147,7 +147,7 @@
                    <TD><I><B>Comment Prefix</B></I><BR>
                    </TD>

-                    <TD valign="top">the string to append on the begining of comments<BR>
+                    <TD valign="top">the string to append on the beginning of comments<BR>
                    </TD>
                  </TR>
                </TBODY>
@@ -295,7 +295,7 @@

            <TD valign="top">A memory address "label" identifying a memory reference destination
            which is located at an offcut address within a code unit. &nbsp;These labels only
-            appears within the listing to flag the existance of a hidden offcut label.
+            appears within the listing to flag the existence of a hidden offcut label.
            &nbsp;Double-clicking the corresponding offcut XRef will take you to the code unit
            which has the offcut reference,<BR>
            </TD>
@@ -1343,7 +1343,7 @@

    <P>A code unit selection from the CodeBrowser Listing may be dragged and dropped onto the
    <B><I>References Editor</I></B> panel to create <A href="#memRefs">Memory References</A> in bulk
-    for the current Source. &nbsp;This capability must be used carefully since a seperate reference
+    for the current Source. &nbsp;This capability must be used carefully since a separate reference
    will be created "to" every code unit contained within the selection. &nbsp;<BR>
    </P>

@@ -65,7 +65,7 @@ snapshot view.<br>
 <blockquote>
  <p>Snapshot views can be docked with normal views or they can live in
 their own windows.&nbsp; Global menu and toolbar actions have been
-changed to accomodate snapshot views.&nbsp; Global actions now operate
+changed to accommodate snapshot views.&nbsp; Global actions now operate
 on whatever component has focus (the component whose header bar is
 colored blue).&nbsp; For example, if you have the connected <span
 style="font-style: italic;">Listing View</span> and a snapshot <span
@@ -99,7 +99,7 @@ public class CreateStructureInStructureCmd extends AbstractCreateStructureCmd{
        }        
        Structure originalStructure = (Structure) parentDataType;        
        
-        // clear and initialize the orignal structure and then get the new
+        // clear and initialize the original structure and then get the new
        // data
        clearStruct(originalStructure, comp1.getParentOffset(), dataLength );
        originalStructure.replace(comp1.getComponentIndex(), 
@@ -231,7 +231,7 @@ public class AddressTable {
 		Address currentAddress = topAddress.addWrap(start * addrSize);

 		// make sure this pointer is in the data type manager
-		// since we are going to use it alot
+		// since we are going to use it a lot
 		DataType adt;

 		//TODO: Do I need to do something special for the 3 byte pointers or will it know
@@ -138,7 +138,7 @@ public class EntryPointAnalyzer extends AbstractAnalyzer {

 	/**
 	 * Process the items on the do later set.  If doing block analysis, then this is the initial
-	 * analysis of the program, so schedule the do later set after some analysis has occured.
+	 * analysis of the program, so schedule the do later set after some analysis has occurred.
 	 * 
 	 * @param program - this program
 	 * @param monitor - monitor
@@ -313,7 +313,7 @@ public class EntryPointAnalyzer extends AbstractAnalyzer {
 			}

 			//  It isn't smart enough to pick up
-			//    valid wierd code.  Need to look at things that are marked as an entry point
+			//    valid weird code.  Need to look at things that are marked as an entry point
 			//    to see if we should disassemble...
 			//  Save the bad ones to do last.
 			Symbol symbol = symbolTable.getPrimarySymbol(entry);
@@ -346,7 +346,7 @@ public final class LanguageProviderPlugin extends Plugin implements FrontEndable
 			catch (InvocationTargetException e) {
 				Throwable t = e.getCause();
 				Msg.showError(this, tool.getToolFrame(), "Tool Launch Failed",
-					"An error occured while attempting to launch your default tool!", t);
+					"An error occurred while attempting to launch your default tool!", t);
 			}
 		}
 	}
@@ -695,7 +695,7 @@ class SymbolTableModel extends AddressBasedTableModel<Symbol> {

 		@Override
 		public String getColumnDescription() {
-			return "The orignal (pre-demangled) import name (External Symbols Only)";
+			return "The original (pre-demangled) import name (External Symbols Only)";
 		}

 		@Override
@@ -216,7 +216,7 @@ public class GenerateOldLanguagePlugin extends Plugin implements FrontEndable {
 					}
 					catch (IOException e) {
 						Msg.showError(this, panel, "IO Error",
-							"Error occured while generating old language file:\n" + file, e);
+							"Error occurred while generating old language file:\n" + file, e);
 					}
 				}
 			});
@@ -317,7 +317,7 @@ public class GenerateOldLanguagePlugin extends Plugin implements FrontEndable {
 					}
 					catch (IOException e) {
 						Msg.showError(this, panel, "IO Error",
-							"Error occured while generating translator file:\n" + transFile, e);
+							"Error occurred while generating translator file:\n" + transFile, e);
 					}
 					close();
 				}
@@ -46,7 +46,7 @@ public interface ProgramDropProvider {
 	
 	/**
 	 * Adds the dropped data to this drop service.
-	 * @param contextObj The object where the drop occured
+	 * @param contextObj The object where the drop occurred
 	 * @param data The actual data dropped
 	 * @param flavor The selected data flavor
 	 */
@@ -156,7 +156,7 @@ public interface ElfLoadHelper {
 	 * Get the program image base offset adjustment.  The value returned reflects the
 	 * actual program image base minus the default image base (see {@link ElfHeader#getImageBase()}.
 	 * This will generally be zero (0), unless the program image base differs from the
-	 * default.  It may be neccessary to add this value to any pre-linked address values
+	 * default.  It may be necessary to add this value to any pre-linked address values
 	 * such as those contained with the dynamic table. (Applies to default address space only)
 	 * @return image base adjustment value
 	 */
@@ -1214,7 +1214,7 @@ public class HeadlessAnalyzer {
 			if (!readOnlyFile) { // can't change anything if read-only file

 				// Undo checkout of it is still checked-out and either the file is to be 
-				// deleted, or we just checked it out and file changes have been comitted
+				// deleted, or we just checked it out and file changes have been committed
 				if (domFile.isCheckedOut()) {
 					if (!keepFile ||
 						(terminateCheckoutWhenDone && !domFile.modifiedSinceCheckout())) {
@@ -162,7 +162,7 @@ class LibraryHints {
 			}
 		}
 		catch (Exception e) {
-			Msg.error(this, "Error occured while parsing hints file: " + hintsFile, e);
+			Msg.error(this, "Error occurred while parsing hints file: " + hintsFile, e);
 		}
 		finally {
 			if (is != null) {
@@ -273,7 +273,7 @@ public class FunctionSignatureParser {
 	}

 	// The following regex pattern attempts to isolate the parameter name from
-	// the begining of a parameter specification. Since the name is optional,
+	// the beginning of a parameter specification. Since the name is optional,
 	// additional steps must be taken in code to ensure that the trailing word of
 	// a multi-word type-specified is not treated as a name (e.g., unsigned long).
 	//
@@ -39,7 +39,7 @@ public class ErrorFieldMouseHandler implements FieldMouseHandlerExtension {
 		}
 		ErrorListingField errorField = (ErrorListingField) clickedObject;
 		String fieldName = errorField.getFieldFactory().getFieldName();
-		Msg.showError(this, null, "Listing Field Exception", "Exception occured while rendering '" +
+		Msg.showError(this, null, "Listing Field Exception", "Exception occurred while rendering '" +
 			fieldName + "' field", errorField.getThrowable());
 		return true;
 	}
@@ -1034,7 +1034,7 @@ public class FlatProgramAPI {
 	public final Function getFunctionBefore(Address address) {
 		FunctionIterator iterator = currentProgram.getListing().getFunctions(address, false);
 		// skip over this function.
-		// This is wierd, but if you have multiple overlay spaces or address spaces,
+		// This is weird, but if you have multiple overlay spaces or address spaces,
 		// you WILL miss functions by not using the iterator and doing address math yourself.
 		if (!iterator.hasNext()) {
 			return null;
@@ -1074,7 +1074,7 @@ public class FlatProgramAPI {
 	public final Function getFunctionAfter(Address address) {
 		FunctionIterator iterator = currentProgram.getListing().getFunctions(address, true);
 		// skip over this function.
-		// This is wierd, but if you have multiple overlay spaces or address spaces,
+		// This is weird, but if you have multiple overlay spaces or address spaces,
 		// you WILL miss functions by not using the iterator and doing address math yourself.
 		if (!iterator.hasNext()) {
 			return null;
@@ -1191,7 +1191,7 @@ public abstract class ProcessorEmulatorTestAdapter extends TestCase implements E

 			if (pass < 0 || fail < 0) {
 				failTest(testRunner,
-					"ERROR Invalid pass/fail counts - test may not have run properly or improper TestInfo structure updates occured: pass " +
+					"ERROR Invalid pass/fail counts - test may not have run properly or improper TestInfo structure updates occurred: pass " +
 						pass + " fail " + fail);
 			}

@@ -1243,8 +1243,8 @@ public abstract class ProcessorEmulatorTestAdapter extends TestCase implements E

 		}
 		catch (Exception e) {
-			log(testGroup, "Exception occured during test", e);
-			fail("Exception occured during test: " + e.getMessage());
+			log(testGroup, "Exception occurred during test", e);
+			fail("Exception occurred during test: " + e.getMessage());
 		}
 		finally {
 			if (testRunner != null) {
@@ -1390,7 +1390,7 @@ public abstract class ProcessorEmulatorTestAdapter extends TestCase implements E
 		catch (UsrException e) {
 			if (inDelaySlot) {
 				log(testRunner.getTestGroup(),
-					"Instruction parse error occured in delay-slot at: " +
+					"Instruction parse error occurred in delay-slot at: " +
 						memBuf.getAddress().toString(true));
 			}
 			// parse failed
@@ -654,7 +654,7 @@ public class AutoTableDisassemblerTest extends AbstractGhidraHeadedIntegrationTe
 		}

 		for (String addr : addrs) {
-			assertTrue("Table model does not contain address table adress: " + addr,
+			assertTrue("Table model does not contain address table address: " + addr,
 				modelAddresses.contains(addr));
 		}
 	}
@@ -417,7 +417,7 @@ public class ScalarSearchTest extends AbstractGhidraHeadedIntegrationTest {
 			Address codeUnitAddress = rowObject.getAddress();
 			if (codeUnitAddress.toString().equals(DATA_STRING_ADDRESS)) {
 				Data stringData = program.getListing().getDataAt(codeUnitAddress);
-				fail("Table not created correctly: found the occurence of data string " +
+				fail("Table not created correctly: found the occurrence of data string " +
 					stringData.getValue().toString() + " at address: " + codeUnitAddress);
 			}
 		}
@@ -98,7 +98,7 @@ public class TransactionLockingTaskMonitorTest extends AbstractGhidraHeadedInteg
 		// wait for all thread to terminate
 		coordinationEndLatch.await(2, TimeUnit.SECONDS);

-		assertNull("Error occured in transaction thread", throwable);
+		assertNull("Error occurred in transaction thread", throwable);

 	}

@@ -146,7 +146,7 @@ public class TransactionLockingTaskMonitorTest extends AbstractGhidraHeadedInteg
 		// wait for all thread to terminate
 		coordinationEndLatch.await(2, TimeUnit.SECONDS);

-		assertNull("Error occured in transaction thread", throwable);
+		assertNull("Error occurred in transaction thread", throwable);

 	}
 }
@@ -24,7 +24,7 @@ import java.util.HashSet;
 public class Face extends DittedBitSequence implements Comparable<Face> {
 	private int weight;					//Typically represents the number of data points this face contains.
 	private double dit_ratio;			// 1 / (2 to the number of dits)
-	private HashSet<Face> children;		//A set of faces this face contains. (Used in the heirarchy of ditted pattern finding.)
+	private HashSet<Face> children;		//A set of faces this face contains. (Used in the hierarchy of ditted pattern finding.)
 	public String strID;				//A unique string ID. Two faces with the same ID ought to be thought of as the same.
 	private Pair<Face, Face> joinOf;	//Keep track of what pair of faces made this face (if it was created as a join).

@@ -47,7 +47,7 @@ public class Face extends DittedBitSequence implements Comparable<Face> {
 			this.children = new HashSet<Face>();
 			this.joinOf = new Pair<Face, Face>(f1, f2);			//We'll need to know *how* this edge was made.

-			//Set up the children for tracking heirarchy.
+			//Set up the children for tracking hierarchy.
 			for (Face kid : patterns) {
 				DittedBitSequence temp = new DittedBitSequence(this, kid);
 				if (temp.getNumUncertainBits() == this.getNumUncertainBits()) {				//Check to see if kid is a subface of this.
@@ -35,7 +35,7 @@ struct SizePass {
 /// \brief Map object for keeping track of which address ranges have been heritaged
 ///
 /// We keep track of a fairly fine grained description of when each address range
-/// was entered in SSA form, refered to as \b heritaged or, for Varnode objects,
+/// was entered in SSA form, referred to as \b heritaged or, for Varnode objects,
 /// no longer \b free.  An address range is added using the add() method, which includes
 /// the particular pass when it was entered.  The map can be queried using findPass()
 /// that informs the caller whether the address has been heritaged and if so in which pass.
@@ -66,7 +66,7 @@ class Varnode {
 public:
  /// There are a large number of boolean attributes that can be placed on a Varnode.
  /// Some are calculated and maintained by the friend classes Funcdata and VarnodeBank, 
-  /// and others can be set and cleared publically by separate subsystems.
+  /// and others can be set and cleared publicly by separate subsystems.
  enum varnode_flags {
    mark = 0x01,	///< Prevents infinite loops
    constant = 0x02,	///< The varnode is constant
@@ -294,7 +294,7 @@ public class DecompilerParameterIdCmd extends BackgroundCommand {

 			// TODO: should unaff_ be checked?

-			// TODO: should wierd stack references be checked?
+			// TODO: should weird stack references be checked?
 		}

 		return false;
@@ -1055,7 +1055,7 @@ public class GnuDemanglerParser implements DemanglerParser {
 	}

 	private DemangledObject parseVariable(String demangled) {
-		// Are all of these neccessary? Many appear to be duplicated within doParse method
+		// Are all of these necessary? Many appear to be duplicated within doParse method
 		if (demangled.startsWith(TYPEINFO_NAME_FOR)) {
 			return parseTypeInfoName(demangled);
 		}
@@ -575,7 +575,7 @@ public class PdbParser {
 				}
 				throw new PdbException("PDB Execution failure of " + PDB_EXE + ".\n" +
 					"This was likely caused by severe execution failure which can occur if executed\n" +
-					"on an unsupported platform. It may be neccessary to rebuild the PDB executable\n" +
+					"on an unsupported platform. It may be necessary to rebuild the PDB executable\n" +
 					"for your platform (see Ghidra/Features/PDB/src).");
 			}
 			throw new PdbException("PDB parsing problem: " + e.getMessage());
@@ -114,7 +114,7 @@ class ApplyDiffCommand extends BackgroundCommand implements AnalysisWorker {
 					}
 				}
 				Msg.showError(this, plugin.getListingPanel(), "Error Applying Diff",
-					"An error occured while applying differences.\n"
+					"An error occurred while applying differences.\n"
 						+ "Only some of the differences may have been applied.",
 					(t != null) ? t : e);
 				applyMsg = message + diffControl.getApplyMessage();
@@ -570,7 +570,7 @@ public class FunctionNameMarkupItemTest extends AbstractVTMarkupItemTest {
 					assertEquals("Function name should have been applied", sourceName,
 						destinationFunction.getName());
 //					if (destinationFunction.isExternal()) {
-//						// orignal name may get set if symbol type was IMPORTED
+//						// original name may get set if symbol type was IMPORTED
 //					}
 				}
 			}
@@ -37,7 +37,7 @@ public class DBBuffer {
 	}

 	/**
-	 * Split this DBBuffer object into two seperate DBBuffers.  This DBBuffer remains
+	 * Split this DBBuffer object into two separate DBBuffers.  This DBBuffer remains
 	 * valid but its new size is equal offset.  The newly created DBBuffer is 
 	 * returned.
 	 * @param offset the split point.  The byte at this offset becomes the first
@@ -261,7 +261,7 @@ public abstract class Database {
 	protected void scanFiles(boolean repair) throws FileNotFoundException {
 		synchronized (syncObject) {

-// TODO: May need to make repair an option (may not have write priviledge)
+// TODO: May need to make repair an option (may not have write privilege)

 			ArrayList<String> bufFiles = new ArrayList<>();
 			ArrayList<String> verFiles = new ArrayList<>();
@@ -26,7 +26,7 @@ import db.buffers.DataBuffer;

 /**
 * The <code>NodeMgr</code> manages all database nodes associated with 
- * a table.  Each table should use a seperate instance of a NodeMgr.
+ * a table.  Each table should use a separate instance of a NodeMgr.
 * The NodeMgr is resposible for interacting with the BufferMgr performing 
 * buffer allocations, retrievals and releases as required.   The NodeMgr
 * also performs hard caching of all buffers until the releaseNodes
@@ -357,7 +357,7 @@ class VarKeyInteriorNode extends VarKeyNode {

 	/**
 	 * Update the child key associated with the specified key index.
-	 * Other entries are shifted as necessary to accomodate the new key length for 
+	 * Other entries are shifted as necessary to accommodate the new key length for 
 	 * the updated entry.
 	 * @param index child key index
 	 * @param updateKey updated child node key
@@ -741,7 +741,7 @@ class VarKeyInteriorNode extends VarKeyNode {
 	 * @param leftNode
 	 * @param rightNode
 	 * @param count
-	 * @return true if movement occured, else false
+	 * @return true if movement occurred, else false
 	 */
 	private static boolean moveKeysRight(VarKeyInteriorNode leftNode, VarKeyInteriorNode rightNode,
 			int count) {
@@ -28,7 +28,7 @@ import db.ChainedBuffer;
 /**
 * <code>ChangeMapFile</code> tracks which buffers within a LocalBufferFile 
 * have been modified between an older and newer version.  The older
- * file is also refered to as the target file.
+ * file is also referred to as the target file.
 */
 public class ChangeMapFile {

@@ -130,7 +130,7 @@ public class LocalManagedBufferFile extends LocalBufferFile implements ManagedBu
 	 * <code>saveChangeFile</code> is a buffer file which contains application
 	 * specific change-data associated with a new version of this file.
 	 * <code>saveChangeFile</code> is instantiated when the getSaveFile method
-	 * is successfully invoked.  This file is commited when the saveCompleted
+	 * is successfully invoked.  This file is committed when the saveCompleted
 	 * method is invoked.
 	 */
 	private LocalBufferFile saveChangeFile;
@@ -104,7 +104,7 @@ public class WindowActionManager {

 		placeHolderForScheduledActionUpdate = placeHolder;

-		// Buffer the events, as they tend to come in 3s.  That might not sound like alot, but 
+		// Buffer the events, as they tend to come in 3s.  That might not sound like a lot, but 
 		// when you have hundreds of actions, it adds up.
 		updateManager.updateLater();
 	}
@@ -76,7 +76,7 @@ public interface LayoutModel {
 	 * Returns an iterator that walks all the Layout items in this model, starting at the
 	 * specified index.
 	 * 
-	 * @param startIndex start index in the model to begining iterating
+	 * @param startIndex start index in the model to beginning iterating
 	 * @return new iterator
 	 */
 	public default LayoutModelIterator iterator(BigInteger startIndex) {
@@ -37,7 +37,7 @@ import mockit.Mock;
 import mockit.MockUp;

 /**
- * This test performs operations on swing components in the test thread.  I beleive this is ok
+ * This test performs operations on swing components in the test thread.  I believe this is ok
 * since in this test, the widgets are never realized and the swing thread in generally not
 * involved.  If this test has displays intermittent failures, then more work will be needed to
 * fix the threading when accessing swing components.
@@ -182,7 +182,7 @@ public class RepositoryServerAdapter {
 				cause = t;
 			}
 			Msg.showError(this, null, "Server Error",
-				"An error occured on the server (" + serverInfoStr + ").\n" + msg, e);
+				"An error occurred on the server (" + serverInfoStr + ").\n" + msg, e);
 		}
 		catch (IOException e) {
 			String err = e.getMessage();
@@ -191,7 +191,7 @@ public class RepositoryServerAdapter {
 			}
 			String msg = err != null ? err : e.toString();
 			Msg.showError(this, null, "Server Error",
-				"An error occured while connecting to the server (" + serverInfoStr + ").\n" + msg,
+				"An error occurred while connecting to the server (" + serverInfoStr + ").\n" + msg,
 				e);
 		}
 		throw new NotConnectedException("Not connected to repository server", cause);
@@ -283,7 +283,7 @@ public class RepositoryServerAdapter {
 //		serverHandle = null;
 //		fireStateChanged();
 //		if (error != null) {
-//			Err.show(null, "Server Error", "A server communications error occured!", error);
+//			Err.show(null, "Server Error", "A server communications error occurred!", error);
 //			error = null;
 //			throw new NotConnectedException("Not connected to repository server");
 //		}
@@ -129,7 +129,7 @@ class ServerConnectTask extends Task {
 				throw new IOException("User PKI Certificate not installed", e);
 			}
 			// assume user cancelled connect attempt when prompted for cert password
-			// or other cert error occured
+			// or other cert error occurred
 			return true;
 		}
 // TODO: Translate SSL exceptions to more meaningful errors
@@ -203,7 +203,7 @@ public interface FileSystem {
 	 * @param folderPath path of folder to be deleted
 	 * @throws FolderNotEmptyException Thrown if the folder is not empty.
 	 * @throws FileNotFoundException if there is no folder with the given path name.
-	 * @throws IOException if error occured during delete.
+	 * @throws IOException if error occurred during delete.
 	 */
 	public void deleteFolder(String folderPath) throws IOException;

@@ -39,7 +39,7 @@ public class FileSystemListenerList implements FileSystemListener {

 	/**
 	 * Construct FileSystemListenerList
-	 * @param enableAsynchronousDispatching if true a seperate dispatch thread will be used
+	 * @param enableAsynchronousDispatching if true a separate dispatch thread will be used
 	 * to notify listeners.  If false, blocking notification will be performed.
 	 */
 	public FileSystemListenerList(boolean enableAsynchronousDispatching) {
@@ -493,7 +493,7 @@ public abstract class LocalFolderItem implements FolderItem {
 //	 * If in-use files prevent renaming a FileInUseException will be thrown.
 //	 * @param name new name for this item
 //	 * @throws InvalidNameException invalid name was specified
-//	 * @throws IOException an error occured
+//	 * @throws IOException an error occurred
 //	 */
 //	void doSetName(String name) throws InvalidNameException, IOException {
 //		synchronized (fileSystem) {
@@ -156,7 +156,7 @@ public class ApplicationTrustManagerFactory {
 	}

 	/**
-	 * Get trust managers after performing any neccessary initialization.
+	 * Get trust managers after performing any necessary initialization.
 	 * @return trust managers
 	 */
 	static synchronized TrustManager[] getTrustManagers() {
@@ -21,7 +21,7 @@ import ghidra.util.exception.NoValueException;
 *     Class that implements a hashtable with int keys and int values.
 *     Because this class uses array of primitives
 *     to store the information, it serializes very fast.  This implementation uses
- *     seperate chaining to resolve collisions.
+ *     separate chaining to resolve collisions.
 *
 */
 public class IntIntHashtable {
@@ -24,7 +24,7 @@ import ghidra.util.exception.AssertException;
 * the smallest unused index is allocated and associated with that key.
 * Basically hashes the keys into linked lists using the IntListIndexer class,
 * where all values in a list have
- * the same hashcode.  Does most of the work in implementing a seperate chaining
+ * the same hashcode.  Does most of the work in implementing a separate chaining
 * version of a hashtable - the only thing missing is the values which are stored
 * in the individual implementations of the various hashtables.
 */
--- a/Show More
+++ b/Show More