A bunch of more typos like the ones in David's commit.

collects/db/private/sqlite3/connection.rkt

@@ -345,7 +345,7 @@
     [,SQLITE_EMPTY . "database is empty"]
     [,SQLITE_SCHEMA . "database schema changed"]
     [,SQLITE_TOOBIG . "too much data for one row of a table"]
-    [,SQLITE_CONSTRAINT . "abort due to contraint violation"]
+    [,SQLITE_CONSTRAINT . "abort due to constraint violation"]
     [,SQLITE_MISMATCH . "data type mismatch"]
     [,SQLITE_MISUSE . "library used incorrectly"]
     [,SQLITE_NOLFS . "uses OS features not supported on host"]

collects/db/private/sqlite3/ffi-constants.rkt

@@ -21,7 +21,7 @@
 (define SQLITE_EMPTY       16   ) ; Database is empty */
 (define SQLITE_SCHEMA      17   ) ; The database schema changed */
 (define SQLITE_TOOBIG      18   ) ; Too much data for one row of a table */
-(define SQLITE_CONSTRAINT  19   ) ; Abort due to contraint violation */
+(define SQLITE_CONSTRAINT  19   ) ; Abort due to constraint violation */
 (define SQLITE_MISMATCH    20   ) ; Data type mismatch */
 (define SQLITE_MISUSE      21   ) ; Library used incorrectly */
 (define SQLITE_NOLFS       22   ) ; Uses OS features not supported on host */

collects/drracket/private/multi-file-search.rkt

@@ -407,7 +407,7 @@
     (define searcher #f)
     
     ;; initialized to a regexp if the user wants to filter filenames,
-    ;; during the ok-button-callback, so errors can be signalled.
+    ;; during the ok-button-callback, so errors can be signaled.
     (define filter #f)
     
     ;; title for message box that signals error messages

collects/drracket/private/syncheck/traversals.rkt

@@ -864,15 +864,15 @@
     ;; trim-require-prefix : syntax -> syntax
     (define (trim-require-prefix require-spec)
       (syntax-case* require-spec (only prefix all-except prefix-all-except rename just-meta) symbolic-compare?
-        [(only module-name identifer ...)
+        [(only module-name identifier ...)
          (syntax module-name)]
-        [(prefix identifier module-name) 
+        [(prefix identifier module-name)
          (syntax module-name)]
-        [(all-except module-name identifer ...)
+        [(all-except module-name identifier ...)
          (syntax module-name)]
-        [(prefix-all-except module-name identifer ...)
+        [(prefix-all-except module-name identifier ...)
          (syntax module-name)]
-        [(rename module-name local-identifer exported-identifer)
+        [(rename module-name local-identifier exported-identifier)
          (syntax module-name)]
         [_ require-spec]))
     

collects/drracket/tool-lib.rkt

@@ -1562,7 +1562,7 @@ all of the names in the tools library, for use defining keybindings
     
     The @racket[init-code] argument is an s-expression representing
     the code for a module. This module is expected to provide
-    the identifer @racket[init-code], bound to a procedure of no
+    the identifier @racket[init-code], bound to a procedure of no
     arguments. That module is required and the @racket[init-code]
     procedure is executed to initialize language-specific
     settings before the code in @racket[program-filename] runs.

collects/handin-server/scribblings/checker.scrbl

@@ -378,7 +378,7 @@ code.}
 
 @defform[(!eval expr)]{
 
-  Evaluate an arbitrary expession in the submission context.  This is
+  Evaluate an arbitrary expression in the submission context.  This is
   a simple shorthand for @racket[((submission-eval) `expr)].}
 
 @defproc*[([(!all-covered) void?]

collects/htdp/docs.rkt

@@ -16,8 +16,8 @@
 (define-primitive end-annotation? end-annotation?/proc)
 (define-primitive write-file write-file/proc)
 
-;; mk-annotation : 
+;; mk-annotation :
-;;  (str number[str-lenght] -> bool) -> (any-value -> bool)
+;;  (str number[str-length] -> bool) -> (any-value -> bool)
 (define (mk-annotation test)
   (lambda (val)
     (and (symbol? val) 

collects/lang/private/beginner-funs.rkt

@@ -473,7 +473,7 @@
     ("Misc"
       (identity (any -> any)
 	"Returns the argument unchanged.")
-      ((beginner-error error) (any ... -> void) "signals an error, combining the given values into an error message.\n\nIf any of the values' printed representations is too long, it is truncated and ``...'' is put into the string. If the first value is a symbol, it is treated specially; it is suffixed with a colon and a space (the intention is that the symbol is the name of the function signalling the error).")
+      ((beginner-error error) (any ... -> void) "signals an error, combining the given values into an error message.\n\nIf any of the values' printed representations is too long, it is truncated and ``...'' is put into the string. If the first value is a symbol, it is treated specially; it is suffixed with a colon and a space (the intention is that the symbol is the name of the function signaling the error).")
       ((beginner-struct? struct?) (any -> boolean)
        "Determines whether some value is a structure.")
       ((beginner-equal? equal?) (any any -> boolean)

collects/macro-debugger/model/reductions-engine.rkt

@@ -573,7 +573,7 @@
     [id (identifier? #'id) (list #'id)]
     [() null]
     [(x . y) (append (flatten-identifiers #'x) (flatten-identifiers #'y))]
-    [else (error 'flatten-identifers "neither syntax list nor identifier: ~s"
+    [else (error 'flatten-identifiers "neither syntax list nor identifier: ~s"
                  (if (syntax? stx)
                      (syntax->datum stx)
                      stx))]))

collects/macro-debugger/syntax-browser/frame.rkt

@@ -71,7 +71,7 @@
 
     (define -identifier=-choices (identifier=-choices))
     (define -choice
-      (new choice% (label "identifer=?") (parent -control-panel)
+      (new choice% (label "identifier=?") (parent -control-panel)
            (choices (map car -identifier=-choices))
            (callback 
             (lambda (c e)

collects/meta/build/unix-installer/test-installer

@@ -20,7 +20,7 @@ exec racket "$0" "$@"
   (define path (or (find-executable-path name)
                    (err "no `~a' executable found" name)))
   (λ args (unless (apply system* path args)
-            (err "`~a' signalled an error" name))))
+            (err "`~a' signaled an error" name))))
 
 (define expect-exe (exe "expect"))
 (define sync-exe   (exe "sync"))

collects/plai/gc2/private/gc-core.rkt

@@ -59,7 +59,7 @@
 (define (location? v)
   (if (vector? (current-heap))
       (and (exact-nonnegative-integer? v) (< v (vector-length (current-heap))))
-      (error "Heap is unintialized")))
+      (error "Heap is uninitialized")))
 
 (provide/contract (init-heap! (exact-nonnegative-integer? . -> . void?)))
 (define (init-heap! size)

collects/plai/private/gc-core.rkt

@@ -59,7 +59,7 @@
 (define (location? v)
   (if (vector? (current-heap))
       (and (exact-nonnegative-integer? v) (< v (vector-length (current-heap))))
-      (error "Heap is unintialized")))
+      (error "Heap is uninitialized")))
 
 (provide/contract (init-heap! (exact-nonnegative-integer? . -> . void?)))
 (define (init-heap! size)

collects/redex/private/matcher.rkt

@@ -65,7 +65,7 @@ See match-a-pattern.rkt for more details
 
 ;; bindings = (make-bindings (listof rib))
 ;; rib = (make-bind sym sexp)
-;; if a rib has a pair, the first element of the pair should be treated as a prefix on the identifer
+;; if a rib has a pair, the first element of the pair should be treated as a prefix on the identifier
 ;; NOTE: the bindings may contain mismatch-ribs temporarily, but they are all removed
 ;;       by merge-multiples/remove, a helper function called from match-pattern
 (define-values (make-bindings bindings-table bindings? empty-bindings)

collects/srfi/25/arlib.scm

@@ -85,7 +85,7 @@
 			      (array-ref b ks)))))))))
 
 ;;; (shape-for-each shp proc [index-object])
-;;; passes each index in shape to proc in row-major orderd, using
+;;; passes each index in shape to proc in row-major ordered, using
 ;;; index-object if provided.
 
 (define (shape-for-each shp proc . o)

collects/syntax/scribblings/parse/ex-many-kws.scrbl

@@ -133,5 +133,5 @@ Note that there are other constraints that we have not represented in
 the pattern. For example, @racket[#:prefab] is also incompatible with
 both @racket[#:guard] and @racket[#:property]. Repetition constraints
 cannot express arbitrary incompatibility relations. The best way to
-handle such contraints is with a side condition using
+handle such constraints is with a side condition using
 @racket[#:fail-when].

collects/syntax/scribblings/parse/lib.scrbl

@@ -117,7 +117,7 @@ error message to describe the expression the contract is applied to.
 The @racket[context] argument is used, when necessary, to infer the
 macro name for the negative blame party and the contract error
 message. The @racket[context] should be either an identifier or a
-syntax pair with an identifer in operator position; in either case,
+syntax pair with an identifier in operator position; in either case,
 that identifier is taken as the macro ultimately requesting the
 contract wrapping.
 

collects/syntax/scribblings/parse/patterns.scrbl

@@ -773,7 +773,7 @@ Matches a sequence of one element, which must be a term matching
 
 An @deftech{@EHpattern} (abbreviated @svar[EH-pattern]) is pattern
 that describes some number of terms, like a @tech{@Hpattern}, but also
-places contraints on the number of times it occurs in a
+places constraints on the number of times it occurs in a
 repetition. They are useful for matching, for example, keyword
 arguments where the keywords may come in any order. Multiple
 alternatives are grouped together via @ref[~or eh].

collects/syntax/scribblings/parse/stxclasses.scrbl

@@ -298,7 +298,7 @@ object or a syntax list of the appropriate @tech{ellipsis
 depth}. Syntax-valued attributes can be used within @racket[syntax],
 @racket[quasisyntax], etc as part of a syntax template. If a
 non-syntax-valued attribute is used in a syntax template, a runtime
-error is signalled.
+error is signaled.
 
 @myexamples[
 (syntax-parse #'((a 1) (b 2) (c 3))

collects/syntax/struct.rkt

@@ -30,7 +30,7 @@
 	[(_ bad . rest)
 	   (raise-syntax-error
 	    #f
-	    "expected an identifer or parenthesized sequence of two identifiers"
+	    "expected an identifier or parenthesized sequence of two identifiers"
 	    orig-stx
 	    #'bad)]))
 

collects/tests/racket/sandbox.rktl

@@ -48,7 +48,7 @@
     ;; problems deleting an open file:
     (when old-port (close-input-port old-port) (set! old-port #f))
     (when (input-port? (car args)) (set! old-port (car args)))
-    ;; Create and install the evalautor:
+    ;; Create and install the evaluator:
     (set! ev (apply make-module-evaluator args #:allow-read allow)))
   (define (run thunk)
     (with-handlers ([void (lambda (e) (list 'exn: e))])

collects/tests/typed-racket/xfail/ann-map-funcs.rkt

@@ -2,7 +2,7 @@
 
 ;; This test is similar to unholy-terror.
 ;; Recent changes to the numeric tower makes this generate a ridiculous amount
-;; of inference contraints.
+;; of inference constraints.
 ;; Changes to the inference engine breaks inference on this test, but unlike
 ;; unholy terror, this one fails quite fast, so it's not as bad.
 ;; Reverting these changes would make inference work again, given enough time

collects/typed-racket/env/lexical-env.rkt

@@ -38,7 +38,7 @@
   (with-lexical-env (replace-props (extend/values is ts (lexical-env)) ps) . b))
 
 ;; find the type of identifier i, looking first in the lexical env, then in the top-level env
-;; identifer -> Type
+;; identifier -> Type
 (define (lookup-type/lexical i [env (lexical-env)] #:fail [fail #f])
   (lookup env i (λ (i) (lookup-type i (λ () ((or fail lookup-fail) i))))))
 

collects/typed-racket/private/type-annotation.rkt

@@ -113,7 +113,7 @@
       [else
        (tc-error "no type information on variable ~a" (syntax-e stx))])))
 
-;; Listof[identifer] #:default Type -> Listof[Type]
+;; Listof[identifier] #:default Type -> Listof[Type]
 (define (get-types stxs #:default [default #f])
   (map (lambda (e) (get-type e #:default default)) stxs))
 

collects/typed-racket/typecheck/tc-structs.rkt

@@ -144,7 +144,7 @@
 
 ;; generate names, and register the approriate types give field types and structure type
 ;; optionally wrap things
-;; identifier Type Listof[identifer] Listof[Type] Listof[Type] #:wrapper (Type -> Type) #:maker identifier
+;; identifier Type Listof[identifier] Listof[Type] Listof[Type] #:wrapper (Type -> Type) #:maker identifier
 (define/cond-contract (register-struct-types nm sty flds external-fld-types external-fld-types/no-parent setters?
                                              #:wrapper [wrapper values]
                                              #:struct-info [si #f]

collects/unstable/temp-c/scribblings/temp-c.scrbl

@@ -126,7 +126,7 @@ First, a few @racket[match] patterns are available to avoid specify all the deta
 @defform[(call n a ...)]{ A @racket[match] expander for call events to the labeled function @racket[n] with arguments @racket[a]. }
 @defform[(ret n a ...)]{ A @racket[match] expander for return events to the labeled function @racket[n] with return values @racket[a]. }
 
-@defform[(with-monitor contract-expr re-pat)]{ Defines a monitored contract where the structural portion of the contract is the @racket[contract-expr] (which may included embedded @racket[label] expressions) and where the temporal portion of the contract is the regular expression given by @racket[re-pat]. (Note: @racket[re-pat] is not a Racket expression that evaluates to a regular expression. It is a literal regular expession.)  An optional @racket[#:concurrent] may be added between the contract and the regular expression to ensure that the machine is safe against race-conditions.}
+@defform[(with-monitor contract-expr re-pat)]{ Defines a monitored contract where the structural portion of the contract is the @racket[contract-expr] (which may included embedded @racket[label] expressions) and where the temporal portion of the contract is the regular expression given by @racket[re-pat]. (Note: @racket[re-pat] is not a Racket expression that evaluates to a regular expression. It is a literal regular expression.)  An optional @racket[#:concurrent] may be added between the contract and the regular expression to ensure that the machine is safe against race-conditions.}
 
 @defform[(label id contract-expr)]{ Labels a portion of a structural contract inside of @racket[with-monitor] with the label @racket[id]. }
 

collects/web-server/scribblings/managers.scrbl

@@ -18,7 +18,7 @@ pluggable through the manager interface.
 @defmodule[web-server/managers/manager]{
 
 This module defines the manager interface. It is required by
-the users and implementers of managers.
+the users and implementors of managers.
 
 @defstruct[manager ([create-instance ((-> void) . -> . number?)]
                     [adjust-timeout! (number? number? . -> . void)]

collects/web-server/scribblings/templates.scrbl

@@ -185,7 +185,7 @@ The @at-reader-ref will read Racket identifiers, so it does not terminate identi
 }|
 will complain that the identifier @racket[place!</title></head>] is
 undefined. You can subvert this by explicitly delimiting the
-identifer:
+identifier:
 @verbatim[#:indent 2]|{
   <head><title>Fastest @thing in the @|place|!</title></head>
 }|

doc/release-notes/racket/HISTORY.txt

@@ -604,7 +604,7 @@ Strings and Unicode:
  Changed char-lower-case? and char-upper-case?
  Added string-upcase, string-downcase, string-titlecase,
   string-foldcase, and char-foldcase
- In case-insenstive mode, symbols are case-folded instead
+ In case-insensitive mode, symbols are case-folded instead
   of downcased (which is usually the same thing)
 Reader:
  Added #reader and readtables

doc/release-notes/racket/rename-super-fixup.rkt

@@ -7,7 +7,7 @@
 ;; The script is not particularly clever: it assumes that an S-exp of
 ;; the form `(rename [<id> <id>] ...)' is a use in `class', unless it
 ;; appears immediately a `unit/sig' S-exp. Furthermore, uses of the
-;; first identifer in the rename pair are converted to use `super'
+;; first identifier in the rename pair are converted to use `super'
 ;; only if that identifier's name starts with `super-'.
 
 ;; Provide files to convert on the command line:

src/README

@@ -364,6 +364,6 @@ Modifying Racket
 ----------------
 
 If you modify Racket and change any primitive syntax or the collection
-of built-in identifers, be sure to turn off USE_COMPILED_STARTUP in
+of built-in identifiers, be sure to turn off USE_COMPILED_STARTUP in
 "schminc.h".  Otherwise, Racket won't start.  See "schminc.h" for
 details.

src/mzcom/mzobj.cxx

@@ -230,7 +230,7 @@ static int do_evalLoop(Scheme_Env *env, int argc, char **_args)
 
       case WAIT_OBJECT_0 + 1:
 
-        // reset semaphore signalled
+        // reset semaphore signaled
 
         setupSchemeEnv(scheme_basic_env());
         ReleaseSemaphore(resetDoneSem,1,NULL);

src/racket/gc/doc/README.changes

@@ -2452,7 +2452,7 @@ Since gc7.0alpha4
    needed with the old implementation.  This included many (mostly no-op)
    versions of GC_is_fresh.
  - Don't use atomic_ops in gc_locks.h unless we need threads.
- - Fixed USE_MARK_BITS, which is once againthe default without PARALLEL_MARK.
+ - Fixed USE_MARK_BITS, which is once again the default without PARALLEL_MARK.
  - Removed Solaris GC_INIT hack.  It's a workaround for a long dead bug,
    and it seemed to be wrong anyway.
  - Changed win32_threads.c to require preprocessor-based interception

src/racket/include/scheme.h

@@ -901,7 +901,7 @@ typedef struct {
 #endif
 
 /* Like setjmp & longjmp, but you can jmp to a deeper stack position */
-/* Intialize a Scheme_Jumpup_Buf record before using it */
+/* Initialize a Scheme_Jumpup_Buf record before using it */
 typedef struct Scheme_Jumpup_Buf {
   void *stack_from, *stack_copy;
   intptr_t stack_size, stack_max_size;

src/racket/sconfig.h

@@ -1315,7 +1315,7 @@
     SunOS/Solaris, and HP/UX by explicit pre-checking the form of the 
     number and looking for values that are obviously +inf.0 or -inf.0 */
 
- /* POW_HANDLES_INF_CORRECTLY inidicates that thw pow() library procedure
+ /* POW_HANDLES_INF_CORRECTLY indicates that thw pow() library procedure
     handles +/-inf.0 correctly. Otherwise, code in inserted to specifically
     check for infinite arguments. */
     

src/racket/src/file.c

@@ -4368,7 +4368,7 @@ static Scheme_Object *do_simplify_path(Scheme_Object *path, Scheme_Object *cycle
   }
 
   /* Fast check; avoids split operations, if possible.
-     Also responsible for determing whether there's a
+     Also responsible for determining whether there's a
      redundant or missing trailing slash in the case that
      the path is just a root. */
   {

src/racket/src/jit.h

@@ -529,7 +529,7 @@ static void *top4;
    mostly improves code size, rather than speed. Functions that cause
    the register to be de-sync'd are marked as such. Functions that can
    accommodate a de-sync'd register on entry are marked as such. All
-   other fuctions can assume a sync'd regsiter and ensure a sync'd
+   other functions can assume a sync'd regsiter and ensure a sync'd
    register. Note that branches and calls normally require a sync'd
    register. */
 

src/racket/src/port.c

@@ -705,7 +705,7 @@ void scheme_init_port_places(void)
 
 #if defined(FILES_HAVE_FDS)
 # ifndef USE_OSKIT_CONSOLE
-  /* Set up a pipe for signalling external events: */
+  /* Set up a pipe for signaling external events: */
   {
     int fds[2];
     if (!pipe(fds)) {

src/racket/src/resolve.c

@@ -1403,7 +1403,7 @@ scheme_resolve_lets(Scheme_Object *form, Resolve_Info *info)
                  not-yet-closed functions.  If no one uses the result
                  via linfo, then the code was dead and it will get
                  GCed. */
-              clv->value = NULL; /* inidicates that there's nothing more to do with the expr */
+              clv->value = NULL; /* indicates that there's nothing more to do with the expr */
             } else {
               lift = resolve_closure_compilation(clv->value, val_linfo, 1, 1, 2, NULL);
               /* need to resolve one more time for the body of the lifted function */

src/racket/src/syntax.c

@@ -267,7 +267,7 @@ XFORM_NONGCING static int is_member(Scheme_Object *a, Scheme_Object *l)
    - A wrap-elem <hash-table> is a chain-specific cache; it maps
          identifiers to #t, and 0 to a deeper part of the chain; a
          resolution for an identifier can safely skip to the deeper
-         part if the identifer does not have a mapping; this skips
+         part if the identifier does not have a mapping; this skips
          simple lexical renames (not ribs) and marks, only, and it's
          inserted into a chain heuristically