Spelling pkg

Closes #50921

GitOrigin-RevId: 6b1ca50
Change-Id: I74e4ff3c8e759c576036d6b791bd7734ebd215d8
Reviewed-on: https://dart-review.googlesource.com/c/sdk/+/278536
Reviewed-by: Alexander Thomas <athom@google.com>
Commit-Queue: Alexander Thomas <athom@google.com>

Author: jsoref

CHANGELOG.md

@@ -1058,7 +1058,7 @@ them, you must set the lower bound on the SDK constraint for your package to
   removed (they were previously deprecated).  Please use the corresponding
   `lowerCamelCase` constants instead.
 - **Breaking Change** [#48513](https://github.com/dart-lang/sdk/issues/48513):
-  Add a new `allowLegacyUnsafeRenegotiation` poperty to `SecurityContext`,
+  Add a new `allowLegacyUnsafeRenegotiation` property to `SecurityContext`,
   which allows TLS renegotiation for client secure sockets.
 - Add a optional `keyLog` parameter to `SecureSocket.connect` and
   `SecureSocket.startConnect`.

benchmarks/TypedDataPoly/dart/TypedDataPoly.dart

@@ -62,7 +62,7 @@ class Monomorphic extends Base {
       : data1 = Uint8List(n)..setToOnes(),
         super('TypedDataPoly.mono.array', n);
 
-  /// An identical [sum] method appears in each benchmark so the the compiler
+  /// An identical [sum] method appears in each benchmark so the compiler
   /// can specialize the method according to different sets of input
   /// implementation types.
   @pragma('vm:never-inline')
@@ -94,7 +94,7 @@ class Monomorphic extends Base {
 }
 
 /// [Baseline] is modelled after [Monomorphic], but does almost no work in
-/// `sum`.  This measures the the cost of benchmark code outside of `sum`.
+/// `sum`.  This measures the cost of benchmark code outside of `sum`.
 class Baseline extends Base {
   final Uint8List data1;
   Baseline(int n)

pkg/analysis_server/test/client/completion_driver_test.dart

@@ -199,7 +199,7 @@ name: test
           return false;
         }
         // Library URIs are not available in protocol v1 so skip the check to
-        // allow the the same test to verify for v2.
+        // allow the same test to verify for v2.
         if (!isProtocolVersion1 &&
             libraryUri != null &&
             s.libraryUri != libraryUri) {

pkg/analysis_server/tool/lsp_spec/meta_model.dart

@@ -120,7 +120,7 @@ class LiteralType extends TypeBase with LiteralValueMixin {
 /// A special class of Union types where the values are all literals of the same
 /// type.
 ///
-/// This allows the Dart field for this type to be the the common base type
+/// This allows the Dart field for this type to be the common base type
 /// rather than an EitherX<>.
 class LiteralUnionType extends UnionType {
   final List<LiteralType> literalTypes;

pkg/compiler/doc/pragmas.md

@@ -73,7 +73,7 @@ caller can create more opportunities for optimization, for example, it becomes
 possible to recognize and remove repeated operations.
 
 The compiler automatically makes a decision whether or not to inline a function
-or method based on heuristics. One heuristic is to inline if the the inlined
+or method based on heuristics. One heuristic is to inline if the inlined
 code is likely to be smaller that the call, as this results in a smaller _and_
 faster program. Another heuristic is to inline even if the code is likely to be
 slightly larger when the call is in a loop, as loops here is a chance that some

pkg/compiler/lib/src/deferred_load/entity_data_info.dart

@@ -107,7 +107,7 @@ class EntityDataInfoBuilder {
 
   /// Collects all direct dependencies of [element].
   ///
-  /// The collected dependent elements and constants are are added to
+  /// The collected dependent elements and constants are added to
   /// [elements] and [constants] respectively.
   void addDirectMemberDependencies(MemberEntity element) {
     // TODO(sigurdm): We want to be more specific about this - need a better

pkg/compiler/lib/src/js_backend/minify_namer.dart

@@ -229,7 +229,7 @@ class MinifyNamer extends Namer
     // Try other n-character names based on the hash.  We try one to three
     // character identifiers.  For each length we try around 10 different names
     // in a predictable order determined by the proposed name.  This is in order
-    // to make the renamer stable: small changes in the input should nornally
+    // to make the renamer stable: small changes in the input should normally
     // result in relatively small changes in the output.
     for (int n = 1; n <= 3; n++) {
       int h = hash;

pkg/compiler/lib/src/js_emitter/model.dart

@@ -470,7 +470,7 @@ class InstanceMethod extends DartMethod {
   /// `true` if the tear-off needs to access methods directly rather than rely
   /// on JavaScript prototype lookup. This happens when a tear-off getter is
   /// called via `super.method` and there is a shadowing definition of `method`
-  /// in some sublcass.
+  /// in some subclass.
   // TODO(sra): Consider instead having an alias per stub, creating tear-off
   // trampolines that target the stubs.
   final bool tearOffNeedsDirectAccess;

pkg/compiler/lib/src/ssa/optimize.dart

@@ -1523,7 +1523,7 @@ class SsaInstructionSimplifier extends HBaseVisitor<HInstruction>
       // We don't expect a non-integer first input to the fixed-size allocation,
       // but checking the input is an integer ensures we do not replace a
       // HGetlength with a reference to something with a type that will confuse
-      // bounds check eliminiation.
+      // bounds check elimination.
       if (lengthInput.isInteger(_abstractValueDomain).isDefinitelyTrue) {
         // TODO(sra). HGetLength may have a better type than [lengthInput] as
         // the allocation may throw on an out-of-range input. Typically the

pkg/compiler/test/end_to_end/modular_loader_test.dart

@@ -69,7 +69,7 @@ main() {
   });
 }
 
-/// Generate a component for a modular complation unit.
+/// Generate a component for a modular compilation unit.
 Future<List<int>> compileUnit(List<String> inputs, Map<String, dynamic> sources,
     {List<String> deps = const []}) async {
   var fs = MemoryFileSystem(_defaultDir);