percona/percona-toolkit
1
0
Fork 0
mirror of https://github.com/percona/percona-toolkit.git synced 2025-09-12 14:18:32 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix spellings errors.

Browse Source
This commit is contained in:
Daniel Nichter
2012-03-26 17:49:50 -06:00
parent f4c978c957
commit c2362b8367
7 changed files with 9 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
bin/pt-online-schema-change
View File

@@ -4871,7 +4871,7 @@ and the original table are renamed/swapped unless C<--no-rename-tables> is
specified. specified.
The default behavior, when this option is not specified and The default behavior, when this option is not specified and
C<--[no]create-tmp-tble> is true, is to create a temporary table named C<--[no]create-tmp-table> is true, is to create a temporary table named
C<__tmp_TABLE> where C<TABLE> is the original table specified by the DSN C<__tmp_TABLE> where C<TABLE> is the original table specified by the DSN
on the command line. on the command line.

2
bin/pt-query-advisor
View File

@@ -6677,7 +6677,7 @@ Analyze all queries in a slow log:
pt-query-advisor /path/to/slow-query.log pt-query-advisor /path/to/slow-query.log
Analyze all queires in a general log: Analyze all queries in a general log:
pt-query-advisor --type genlog mysql.log pt-query-advisor --type genlog mysql.log

2
bin/pt-sift
View File

@@ -632,7 +632,7 @@ Sets the action to just list the files in the sample.
=item * =item *
Sets the action to view all of the samples's files in the less program. Sets the action to view all of the sample's files in the less program.
=back =back

2
bin/pt-tcp-model
View File

@@ -2253,7 +2253,7 @@ Define how the arrival and completion timestamps of a query, and thus its
response time (elapsed time) are computed. Recall that there may be multiple response time (elapsed time) are computed. Recall that there may be multiple
inbound and outbound packets per request and response, and refer to the inbound and outbound packets per request and response, and refer to the
following ASCII diagram. Suppose that a client sends a series of three inbound following ASCII diagram. Suppose that a client sends a series of three inbound
(I) packets to the server, whch computes the result and then sends two outbound (I) packets to the server, which computes the result and then sends two outbound
(O) packets back: (O) packets back:
I I I ..................... O O I I I ..................... O O

4
bin/pt-upgrade
View File

@@ -11332,7 +11332,7 @@ See also L<"BUGS"> for more information on filing bugs and getting help.
=head1 DESCRIPTION =head1 DESCRIPTION
pt-upgrade executes queries from slowlogs on one or more MySQL server to find pt-upgrade executes queries from slowlogs on one or more MySQL server to find
differences in query time, warnings, results, and other aspects of the querys' differences in query time, warnings, results, and other aspects of the queries'
execution. This helps evaluate upgrades, migrations and configuration execution. This helps evaluate upgrades, migrations and configuration
changes. The comparisons specified by L<"--compare"> determine what changes. The comparisons specified by L<"--compare"> determine what
differences can be found. A report is printed which outlines all the differences can be found. A report is printed which outlines all the
@@ -11494,7 +11494,7 @@ Continue working even if there is an error.
Convert non-SELECT statements to SELECTs and compare. Convert non-SELECT statements to SELECTs and compare.
By default non-SELECT statements are not allowed. This option causes By default non-SELECT statements are not allowed. This option causes
non-SELECT statments (like UPDATE, INSERT and DELETE) to be converted non-SELECT statements (like UPDATE, INSERT and DELETE) to be converted
to SELECT statements, executed and compared. to SELECT statements, executed and compared.
For example, C<DELETE col FROM tbl WHERE id=1> is converted to For example, C<DELETE col FROM tbl WHERE id=1> is converted to

2
bin/pt-visual-explain
View File

@@ -2564,7 +2564,7 @@ If the results were in order 2-3-4, I think that would mean 3 is a subquery of
2, 4 is a subquery of 3. As it is, this means 4 is a subquery of the nearest 2, 4 is a subquery of 3. As it is, this means 4 is a subquery of the nearest
previous recent row with a smaller id, which is 1. Likewise for 3 and 2. previous recent row with a smaller id, which is 1. Likewise for 3 and 2.
This structure is hard to programatically build into a tree for the same reason This structure is hard to programmatically build into a tree for the same reason
it's hard to understand by inspection: there are both forward and backward it's hard to understand by inspection: there are both forward and backward
references. <derivedN> is a forward reference to selectN, while <unionM,N> is a references. <derivedN> is a forward reference to selectN, while <unionM,N> is a
backward reference to selectM and selectN. That makes recursion and other backward reference to selectM and selectN. That makes recursion and other

4
docs/percona-toolkit.pod
View File

@@ -464,7 +464,7 @@ see L<"ENVIRONMENT">.
=head1 AUTHORS =head1 AUTHORS
Percona Toolkit is primarily developed by Baron Schwartz and Daniel Nichter, Percona Toolkit is primarily developed by Baron Schwartz and Daniel Nichter,
both of whom are employed by Percona Inc. See each program's documenation both of whom are employed by Percona Inc. See each program's documentation
for details. for details.
=head1 COPYRIGHT, LICENSE, AND WARRANTY =head1 COPYRIGHT, LICENSE, AND WARRANTY
@@ -474,7 +474,7 @@ See each program's documentation for complete copyright notices.
THIS PROGRAM IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR IMPLIED THIS PROGRAM IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
This program is free software; you can redistribute it and/or modify it under This program is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free Software the terms of the GNU General Public License as published by the Free Software