removed lots of "the the"s

svn: r14679
This commit is contained in:
Eli Barzilay 2009-05-01 21:02:51 +00:00
parent a3768d00eb
commit ff73a5395e
62 changed files with 75 additions and 75 deletions

View File

@ -2,7 +2,7 @@
;; (c) 1996-1997 Sebastian Good
;; (c) 1997-2001 PLT
;; Sets the the real annotation for zodiac:binding AST nodes,
;; Sets the real annotation for zodiac:binding AST nodes,
;; setting the known? and known-val fields as possible.
;; Known-value analysis is used for constant propagation, but

View File

@ -1,4 +1,4 @@
;; Representation choosing phase of the the compiler
;; Representation choosing phase of the compiler
;; (c) 1996-1997 Sebastian Good
;; (c) 1997-201 PLT

View File

@ -1254,8 +1254,8 @@ TODO
(thread
(λ ()
;; forward system events the the user's logger,
;; and record any events that happen on the user's logger to show in the GUI
;; forward system events the user's logger, and record any
;; events that happen on the user's logger to show in the GUI
(let ([sys-evt (make-log-receiver drscheme:init:system-logger 'debug)]
[user-evt (make-log-receiver user-logger 'debug)])
(let loop ()

View File

@ -93,8 +93,8 @@ Add the given alignment as a child after the existing child
> (send an-alignment-parent delete-child child) -> void
child : (is-a?/c alignment<%>)
Deletes a child from the the alignments
Deletes a child from the alignments
> (send an-alignment-parent is-shown?) -> boolean?
True if the alignment is being shown (accounting for its parent being shown)

View File

@ -74,7 +74,7 @@
(set! alignment child))))
#;((is-a?/c alignment<%>) . -> . void?)
;; Deletes a child from the the alignments
;; Deletes a child from the alignments
(define/public (delete-child child)
(if alignment
(if (eq? child alignment)

View File

@ -66,7 +66,7 @@
add-child
#;((is-a?/c alignment<%>) . -> . void?)
;; Deletes a child from the the alignments
;; Deletes a child from the alignments
delete-child
#;(-> boolean?)

View File

@ -137,7 +137,7 @@
(link (send tail prev) child tail))))
#;((is-a?/c alignment<%>) . -> . void?)
;; Deletes a child from the the alignments
;; Deletes a child from the alignments
(define/public (delete-child child)
(send child show/hide false)
(let ([p (send child prev)]

View File

@ -13,7 +13,7 @@ Add the given alignment as a child after the existing child.}
@defmethod[(delete-child [child (is-a?/c alignment<%>)]) void?]{
Deletes a child from the the alignments.}
Deletes a child from the alignments.}
@defmethod[(is-shown?) boolean?]{

View File

@ -1442,7 +1442,7 @@
;; make-symbol, make-number, and make-string are supported
;; alternates, but are deprecated.
;; the classname becomes the the name of token.
;; the classname becomes the name of token.
;; if multiple actions are possible, do the one that appears here
;; first. make-string is first, so literal strings trump identifiers.

View File

@ -1123,7 +1123,7 @@
(defmagick* MagickGetReleaseDate :
-> _string)
;; MagickGetResourceLimit returns the the specified resource in megabytes.
;; MagickGetResourceLimit returns the specified resource in megabytes.
(defmagick* MagickGetResourceLimit :
_ResourceType -> _ulong)

View File

@ -1428,7 +1428,7 @@
This function is not symmetric in red, green, and blue, so it is
important to pass red, green, and blue components of the colors in
the the proper order. The first three arguments are red, green and
the proper order. The first three arguments are red, green and
blue for the first color, respectively, and the second three
arguments are red green and blue for the second color,
respectively.})

View File

@ -382,7 +382,7 @@ WARNING: printf is rebound in the body of the unit to always
(and (string? color)
(send the-color-database find-color color)))
(error 'highlight-range
"expected a color or a string in the the-color-database for the third argument, got ~e" color))
"expected a color or a string in the-color-database for the third argument, got ~e" color))
(unless (memq style '(rectangle hollow-ellipse ellipse dot))
(error 'highlight-range
"expected one of 'rectangle, 'ellipse 'hollow-ellipse, or 'dot as the style, got ~e" style))

View File

@ -106,7 +106,7 @@
(build-list 12 create-number)))
;; Define the hour hand of the clock.
;; The hour hand is based on the the-hour and the-minute in order to
;; The hour hand is based on the-hour and the-minute in order to
;; make it move smoothly around the clock.
(define hour-hand
(make-line clock-center

View File

@ -200,7 +200,7 @@
(3loop (cons (car group) pre)
(list (cadr group) (caddr group) (car post))
(cdr post))))))])
;; Try the value-sorted list, the the suit-sorted list, then...
;; Try the value-sorted list, the suit-sorted list, then...
(max (find-set value-sorted)
(find-set suit-sorted)
;; the suit-sorted list with with Aces at the end instead of the

View File

@ -341,7 +341,7 @@ This directory contains the following files and sub-directories:
Multiple submissions for a particular user in different groups will
be rejected.
Inactive assignment directories are used by the the HTTPS status web
Inactive assignment directories are used by the HTTPS status web
server.}
@item{@filepath{<active-assignment>/checker.ss} (optional): a module

View File

@ -35,7 +35,7 @@
@scheme[make-evaluator], the @scheme[language] argument can be a
list that begins with @scheme['module]. In this case,
@scheme[make-module-language] is used to create an evaluator, and
the module code must be using the the specified language in its
the module code must be using the specified language in its
language position. In this case, the @scheme[requires-paths]
argument is used only for paths that are allowed to be accessed (the
@scheme[_allow-read] argument to @scheme[make-evaluator], since the

View File

@ -98,7 +98,7 @@ destination snip's bounding box where a straight line
between the centers of the snip would intersect.
The @scheme[arrow-point-ok?] function returns @scheme[#t]
when the point specified by its arguments is inside the the
when the point specified by its arguments is inside the
smallest rectangle that covers both the source and
destination snips, but is outside of both of the rectangles
that surround the source and destination snips themselves.

View File

@ -67,7 +67,7 @@ saying that there is no file name until the file is saved.}
@defmethod[(get-background-color) (or/c false/c (is-a/c color%) string?)]{
The result of this method is used for the background color
when redrawing the the name message. If it is @scheme[#f], the
when redrawing the name message. If it is @scheme[#f], the
OS's default panel background is used.
}

View File

@ -22,7 +22,7 @@ _MysterX_
Two Windows DLLs support low-level operations in MysterX:
"myspage.dll" and "myssink.dll". Both are installed in the registry
(using `REGSVR32 <name-of-DLL>') when Setup PLT runs the the MysterX
(using `REGSVR32 <name-of-DLL>') when Setup PLT runs the MysterX
post-installer. If you move the location of your PLT installation,
you may need to re-run Setup PLT to make MysterX work. Neither of
these DLLs is specific to a PLT Scheme version, so it's ok for one

View File

@ -13,7 +13,7 @@ Recent versions of Windows come with DCOM; DCOM packages for Windows
Two Windows DLLs support low-level operations in MysterX:
@filepath{myspage.dll} and @filepath{myssink.dll}. Both are installed
in the registry (using @exec{regsvr32.exe}) when Setup PLT runs the
the MysterX post-installer. If you move the location of your PLT
MysterX post-installer. If you move the location of your PLT
installation, you may need to re-run Setup PLT to make MysterX
work. Neither of these DLLs is specific to a PLT Scheme version, so
it's ok for one version of PLT Scheme to use the DLLs registered by

View File

@ -648,7 +648,7 @@
(lambda (len non-block? enable-break?)
(let ([out-blocked? (pump-output mzssl)])
(if (zero? len)
;; Flush request; all data is in the the SSL
;; Flush request; all data is in the SSL
;; stream, but make sure it's gone
;; through the ports:
(begin

View File

@ -272,7 +272,7 @@ error.}
@defparam[file-path source any/c]{
A parameter that the the lexer uses as the source location if it
A parameter that the lexer uses as the source location if it
raises a @scheme[exn:fail:rad] error. Setting this parameter allows
DrScheme, for example, to open the file containing the error.}

View File

@ -23,7 +23,7 @@
;; start at 0, since threads are likely to run before a sample is
;; collected.
;; - Finally, the <stack> part is a snapshot of the thread's stack, as
;; grabbed by `continuation-mark-set->context'. The the values in these
;; grabbed by `continuation-mark-set->context'. The values in these
;; snapshots are interned to reduce memory load.
;; The results are collected sequentially, so they're always sorted from the
;; newest to the oldest. Remember that these results should be considered

View File

@ -145,7 +145,7 @@ public final class Boolean implements Serializable
/**
* Returns the Boolean <code>TRUE</code> if and only if the given
* String is equal, ignoring case, to the the String "true", otherwise
* String is equal, ignoring case, to the String "true", otherwise
* it will return the Boolean <code>FALSE</code>.
*
* @param s the string to convert

View File

@ -540,7 +540,7 @@ c.
This form extends the reduction relation in its first
argument with the rules specified in <more>. They should
have the same shape as the the rules (including the `with'
have the same shape as the rules (including the `with'
clause) in an ordinary reduction-relation.
If the original reduction-relation has a rule with the same

View File

@ -778,7 +778,7 @@ where the @tt{==>} relation is defined by reducing in the context
This form extends the reduction relation in its first
argument with the rules specified in @scheme[more]. They should
have the same shape as the the rules (including the `with'
have the same shape as the rules (including the `with'
clause) in an ordinary @scheme[reduction-relation].
If the original reduction-relation has a rule with the same

View File

@ -110,7 +110,7 @@ which is the ancestor of SchemeUnit and the most widely used
frameworks in Java, .Net, Python, and Ruby, and many other
languages. That this is insufficient for all users is
apparent if one considers the proliferation of ``simpler''
testing frameworks in Scheme such as SRFI-78, or the the
testing frameworks in Scheme such as SRFI-78, or the
practice of beginner programmers. Unfortunately these
simpler methods are inadequate for testing larger
systems. To the best of my knowledge SchemeUnit is the only

View File

@ -213,13 +213,13 @@
;; sorts things out (remove prefix and suffix newlines, adds indentation if
;; needed)
(define (done-items xs)
;; a column marker is either a non-negative integer N (saying the the
;; following code came from at column N), or a negative integer -N (saying
;; that the following code came from column N but no need to add
;; indentation at this point because it is at the openning of a {...});
;; `get-lines*' is careful not to include column markers before a newline
;; or the end of the text, and a -N marker can only come from the beginning
;; of the text (and it's never there if the text began with a newline)
;; a column marker is either a non-negative integer N (saying the following
;; code came from at column N), or a negative integer -N (saying that the
;; following code came from column N but no need to add indentation at this
;; point because it is at the openning of a {...}); `get-lines*' is careful
;; not to include column markers before a newline or the end of the text,
;; and a -N marker can only come from the beginning of the text (and it's
;; never there if the text began with a newline)
(if (andmap eol-syntax? xs)
;; nothing to do
(reverse xs)

View File

@ -123,7 +123,7 @@ The preferences dialog consists of several panels.
window is below the definitions window.}
@item{@PrefItem{Always show the #lang line in the Module language} --
If checked, the module language always shows the the @hash-lang[]
If checked, the module language always shows the @hash-lang[]
line (even when it would ordinarily be scrolled off of the page), assuming
that the @hash-lang[] line is the first line in the file.
}

View File

@ -365,7 +365,7 @@ values: @itemize[
on to the original function, for example, have a binding for it.
Note that each function can hold onto one callback value (it is
stored in a weak hash table), so if you need to use a function in
multiple callbacks you will need to use one of the the last two
multiple callbacks you will need to use one of the last two
options below. (This is the default, as it is fine in most cases.)}
@item{@scheme[#f] means that the callback value is not held. This may

View File

@ -387,7 +387,7 @@
@method[text:searching<%> set-replace-start]) and the
closest search hit following @tt{replace-start} does not
collapse with an adjacent bubble,the result will include
that bubble. If the the closest search hit after
that bubble. If the closest search hit after
@tt{replace-start} is collpased with another bubble, then
the search hit is not reflected in the result.

View File

@ -135,7 +135,7 @@ check the fields of the data structure, but sometimes this
can have disastrous effects on the performance of a program
that does not, itself, inspect the entire data structure.
As an example, consider the the binary search tree
As an example, consider the binary search tree
search algorithm. A binary search tree is like a binary
tree, except that the numbers are organized in the tree to
make searching the tree fast. In particular, for each

View File

@ -376,7 +376,7 @@ scheme/base
(dynamic-require file 'plug-in%))))
]
The anchor bound by @scheme[namespace-attach-module] connects the the
The anchor bound by @scheme[namespace-attach-module] connects the
run time of a module with the namespace in which a module is loaded
(which might differ from the current namespace). In the above
example, since the enclosing module requires

View File

@ -532,7 +532,7 @@ is represented by @scheme[#f]
@tech{Submatch}es can be used in the insert string argument of the
procedures @scheme[regexp-replace] and @scheme[regexp-replace*]. The
insert string can use @litchar{\}@math{n} as a @deftech{backreference}
to refer back to the @math{n}th submatch, which is the the substring
to refer back to the @math{n}th submatch, which is the substring
that matched the @math{n}th subpattern. A @litchar{\0} refers to the
entire match, and it can also be specified as @litchar{\&}.

View File

@ -65,7 +65,7 @@ If you've used DrScheme before with something other than a program
that starts @hash-lang[], DrScheme will remember the last language
that you used, instead of inferring the language from the @hash-lang[]
line. In that case, use the @menuitem["Language" "Choose Language..."]
menu item. In the the dialog that appears, select the first item,
menu item. In the dialog that appears, select the first item,
which is @onscreen{Module}. Put the @hash-lang[] line above in the top
text area, still.

View File

@ -15,7 +15,7 @@ type's name. Instances of a structure type are created with
@cppi{scheme_struct_ref} and @cppi{scheme_struct_set} functions access
or modify a field of a structure.
The the structure procedure values and names generated by
The structure procedure values and names generated by
@cpp{scheme_make_struct_values} and @cpp{scheme_make_struct_names} can
be restricted by passing any combination of these flags:

View File

@ -598,7 +598,7 @@ Finds (or creates) the symbol matching the given nul-terminated, ASCII
[int len])]{
Creates or finds a symbol given the symbol's length in UTF-8-encoding
bytes. The the case of @var{name} is not normalized.}
bytes. The case of @var{name} is not normalized.}
@function[(Scheme_Object* scheme_intern_exact_char_symbol
[mzchar* name]
@ -625,7 +625,7 @@ Creates an uninterned symbol given the symbol's length in
[int len])]{
Creates or finds a keyword given the keywords length in UTF-8-encoding
bytes. The the case of @var{name} is not normalized, and it should
bytes. The case of @var{name} is not normalized, and it should
not include the leading hash and colon of the keyword's printed form.}
@function[(Scheme_Object* scheme_intern_exact_char_keyword

View File

@ -184,7 +184,7 @@ Analogous to @scheme[call-with-input-file], but passing @scheme[path],
[#:mode mode-flag (or/c 'binary 'text) 'binary])
any]{
Like @scheme[call-with-input-file], but the newly opened port is
closed whenever control escapes the the dynamic extent of the
closed whenever control escapes the dynamic extent of the
@scheme[call-with-input-file*] call, whether through @scheme[proc]'s
return, a continuation application, or a prompt-based abort.}
@ -195,7 +195,7 @@ return, a continuation application, or a prompt-based abort.}
'replace 'truncate 'truncate/replace) 'error])
any]{
Like @scheme[call-with-output-file], but the newly opened port is
closed whenever control escapes the the dynamic extent of the
closed whenever control escapes the dynamic extent of the
@scheme[call-with-output-file*] call, whether through @scheme[proc]'s
return, a continuation application, or a prompt-based abort.}

View File

@ -23,7 +23,7 @@ via @scheme[equal?], @scheme[eqv?], or @scheme[eq?], and keys are
retained either strongly or weakly (see @secref["weakbox"]). A hash
table is also either mutable or immutable. Immutable tables support
constant-time access and update, just like mutable hash tables; the
the constant on immutable operations is usually larger, but the
constant on immutable operations is usually larger, but the
functional nature of immutable hash tables can pay off in certain
algorithms.

View File

@ -63,7 +63,7 @@ Returns @scheme[#t] if @scheme[v] is a namespace-anchor value,
@defproc[(namespace-anchor->empty-namespace [a namespace-anchor?]) namespace?]{
Returns an empty namespace that shares a @tech{module registry} with
the source of the anchor, and whose @tech{base phase} the the
the source of the anchor, and whose @tech{base phase} the
@tech{phase} in which the anchor was created.
If the anchor is from a @scheme[define-namespace-anchor] form in a

View File

@ -566,7 +566,7 @@ is charged back to the sandbox, you should remove references to such
values when the code is done inspecting it.
This policy has an impact on how the sandbox memory limit interacts
with the the per-expression limit specified by
with the per-expression limit specified by
@scheme[sandbox-eval-limits]: values that are reachable from the
sandbox, as well as from the interaction will count against the
sandbox limit. For example, in the last interaction of this code,

View File

@ -77,7 +77,7 @@ shape and properties of the result:
]
The the expander attaches a new active certificate to a syntax object,
The expander attaches a new active certificate to a syntax object,
it also removes any @tech{inactive certificates} attached to any
@tech{syntax object} within the one where the certificate is attached,
and it re-attaches the formerly @tech{inactive certificates} as

View File

@ -10,7 +10,7 @@ and update of the vector slots, which are numbered from @scheme[0] to
one less than the number of slots in the vector.
Two vectors are @scheme[equal?] if they have the same length, and if
the values in corresponding slots of the the vectors are
the values in corresponding slots of the vectors are
@scheme[equal?].
A vector can be @defterm{mutable} or @defterm{immutable}. When an

View File

@ -276,7 +276,7 @@ part of the result or on any @litchar{\\?\REL\} or
@litchar{\\?\RED\} or @scheme[_sub-path]. If a
@litchar{\\?\REL\} or @litchar{\\?\RED\}
@scheme[_sub-path] is added to a non-@litchar{\\?\}
@scheme[_base-path], the the @scheme[_base-path] (with any additions up
@scheme[_base-path], the @scheme[_base-path] (with any additions up
to the @litchar{\\?\REL\} or @litchar{\\?\RED\}
@scheme[_sub-path]) is simplified and converted to a
@litchar{\\?\} path. In other cases, a @litchar{\} may be

View File

@ -61,7 +61,7 @@ Combines @scheme[schememod] and @scheme[interaction-eval].}
@defform*[[(def+int defn-datum expr-datum ...)
(def+int #:eval eval-expr defn-datum expr-datum ...)]]{
Like @scheme[interaction], except the the @scheme[defn-datum] is
Like @scheme[interaction], except the @scheme[defn-datum] is
typeset as for @scheme[schemeblock] (i.e., no prompt) and a line of
space is inserted before the @scheme[expr-datum]s.}

View File

@ -71,7 +71,7 @@
#`(lambda (x #,@slot-names)
(x #,@(datum->syntax stx names-or-exprs)))))]
[(cut proc slot-or-expr ... <...>)
;; Applying a wrong number of arguments to the the lamba generated by cut, will provoke an
;; Applying a wrong number of arguments to the lamba generated by cut, will provoke an
;; error caused by the application (proc ...). The quasisyntax/loc makes sure DrScheme
;; shows the cut-expression as the source of the error in stead of the showing an error in
;; the code implementing the macro i.e. in this code.

View File

@ -191,7 +191,7 @@
; (list-ec (:do ((x 0)) (<= x 5) ((+ x 1))) x)
; => '(0 1 2 3 4 5)
; If only the the termination test were done *after* and
; If only the termination test were done *after* and
; not before the loop payload ... This leads to the
; idea of an :do-until.

View File

@ -172,7 +172,7 @@ name, an ellipsis depth, and a set of nested attributes. When an
instance of the syntax class is parsed and bound to a pattern
variable, additional pattern variables are bound for each of the
syntax class's attributes. The name of these additional pattern
variables is the dotted concatenation of the the primary pattern
variables is the dotted concatenation of the primary pattern
variable with the name of the attribute.
For example, if pattern variable @scheme[p] is bound to an instance of

View File

@ -128,7 +128,7 @@ Move all scrolls to 1 step beyond the smallest setting.
Check "swap". Now, the top canvas is managed and the bottom canvas is
unmanaged. But the top canvas's area is so small that its scrollbars
are always disabled. (It may also be clipped to the tiny 10x10 box.)
The bottom canvas's scrollbars should now act the the top ones used
The bottom canvas's scrollbars should now act the top ones used
to: there are 20 steps in each direction and the `V:' and `H:' values
change as the scrolls are moved.

View File

@ -38,7 +38,7 @@ The drawing area should have the following features:
pattern; the third shape should be a semi-circle with no outline
on the bottom edge.
Further right (to the the right of the columns) should appear an
Further right (to the right of the columns) should appear an
X, a cross, and an narrow X tilted NW. Each should be drawn in
green (5 pixels wide) with a thin black line centered along each
green line. Scaling the picture should make the green line thicker,
@ -208,7 +208,7 @@ Clipping should slip the drawing to a particular shape:
wedge - pi/4 to 3pi/4 of circle
round rectangle - a rounded rect inscribed in the the blue box for
round rectangle - a rounded rect inscribed in the blue box for
testing stipples
unions, intersects, subtracts - hopefully obvious

View File

@ -1004,7 +1004,7 @@ Creates a balloon, much like `wrap-balloon' except that the balloon's
width is `w' and its height is `h'. The `corner-radius' argument
specifies the radius for the balloon's rounded corners; if the radius
is positive, the value is used as the radius of the rounded corner,
but if radius is negative, the absolute value is used as the the
but if radius is negative, the absolute value is used as the
proportion of the smallest dimension of the balloon.
> (make-balloon pict num num) -> balloon

View File

@ -467,7 +467,7 @@ Other improvements:
("robby" "redex.plt" 1 3)
- Fixed a bug in the the compatible closure function; otherwise the
- Fixed a bug in the compatible closure function; otherwise the
same as 1.1
("robby" "redex.plt" 1 2)

View File

@ -1274,7 +1274,7 @@ ftp://ftp.unicode.org/Public/UNIDATA/UnicodeData.html</a>
</div>
<p class=continue>
for further description of the file's format. Note in particular the
two-letter category specified in the the third field, which is referenced
two-letter category specified in the third field, which is referenced
frequently in the descriptions below.
<!--========================================================================-->

View File

@ -145,7 +145,7 @@ returns a condition of condition type <var>condition-type</var>
is a compound condition, <code>extract-condition</code>
extracts the field values from the subcondition belonging to <var>condition-type</var>
that appeared first in the call to <code>make-compound-condition</code>
that created the the condition. The returned condition may be newly created; it is possible for</p><pre>(let* ((&amp;c (make-condition-type 'c &amp;condition '()))
that created the condition. The returned condition may be newly created; it is possible for</p><pre>(let* ((&amp;c (make-condition-type 'c &amp;condition '()))
(c0 (make-condition &amp;c))
(c1 (make-compound-condition c0)))
(eq? c0 (extract-condition c1 &amp;c)))

View File

@ -389,7 +389,7 @@ You can access the discussion via <A HREF="http://srfi.schemers.org/srfi-43/mail
must satisfy the predicates <tt>integer?</tt> and
<tt>positive?</tt>. This indicates the index directly before
which traversal will stop &mdash; processing will occur until
the the index of the vector is <tt><i>end</i></tt>. It is the
the index of the vector is <tt><i>end</i></tt>. It is the
closed right side of a range.
<br>
<br>
@ -1815,7 +1815,7 @@ zot</pre>
<dd>
Like <tt><a href="#vector-to-list">vector-&gt;list</a></tt>,
but the resulting list contains the elements in reverse between
the the specified range.
the specified range.
<br>
<br>
</dd>

View File

@ -107,7 +107,7 @@ tables so that portable programs can be written that make efficient use
of common hash table functionality. The SRFI resolves discrepancies
that exist between the various hash table API's with respect to naming
and semantics of hash table operations. A lot of effort has been put
into making the the API consistent, simple and generic. The SRFI also
into making the API consistent, simple and generic. The SRFI also
defines some of the most common utility routines that would otherwise
need to be written and rewritten for various applications.

View File

@ -2,7 +2,7 @@
# This shell script handles all host based configuration for the garbage
# collector.
# It sets various shell variables based on the the host and the
# It sets various shell variables based on the host and the
# configuration options. You can modify this shell script without
# needing to rerun autoconf.

View File

@ -5289,7 +5289,7 @@ static Scheme_Object *read_compiled(Scheme_Object *port,
top->prefix->num_stxes,
top->prefix->num_lifts,
0);
/* If no exception, the the resulting code is ok. */
/* If no exception, the resulting code is ok. */
} else
scheme_ill_formed_code(rp);

View File

@ -44,7 +44,7 @@ char *wxGetUserHome(const char *user)
|| (ptr = getenv("LOGNAME")) != NULL) {
who = getpwnam(ptr);
}
// We now make sure the the user exists!
// We now make sure the user exists!
if (who == NULL)
who = getpwuid(getuid());
} else

View File

@ -132,7 +132,7 @@ Bool wxRadioBox::Create(wxPanel *panel, wxFunction func, char *label,
else
XtRealizeWidget(wgt);
X->frame = wgt;
// create group widget, which holds the the toggles
// create group widget, which holds the toggles
wgt = XtVaCreateManagedWidget("radiobox", xfwfGroupWidgetClass, X->frame,
XtNselectionStyle, (style & wxAT_MOST_ONE) ?
XfwfSingleSelection : XfwfOneSelection,
@ -263,7 +263,7 @@ Bool wxRadioBox::Create(wxPanel *panel, wxFunction func, char *label,
XtRealizeWidget(wgt);
X->frame = wgt;
// create group widget, which holds the the toggles
// create group widget, which holds the toggles
wgt = XtVaCreateManagedWidget("radiobox", xfwfGroupWidgetClass, X->frame,
XtNselectionStyle, (style & wxAT_MOST_ONE) ?
XfwfSingleSelection : XfwfOneSelection,

View File

@ -1019,7 +1019,7 @@ _XFUNCPROTOEND
// I've used the following way to intercept the incomming events:
// - first Xt calls the expose method of the widget
// - second it calls all event handlers installed by XtAddEventHandler
// - third it evaluates the the widget's translation table
// - third it evaluates the widget's translation table
// --> I forbid the evaluation of the translation table and call
// _XtTranslateEvent by myself.
//

View File

@ -28,7 +28,7 @@ is invoked {\em after} the CW is moved.
@var highlightThickness = 0
@ Decide, if the the scrolled window should be included in the
@ Decide, if the scrolled window should be included in the
keyboard traversal.
@var Boolean traverseToChild = TRUE