mirror of
https://github.com/ClickHouse/ClickHouse.git
synced 2024-09-20 00:30:49 +00:00
More spelling fixes
This commit is contained in:
parent
06e1293909
commit
81e943c7f8
@ -52,7 +52,7 @@ class Data_API SQLChannel: public Poco::Channel
|
||||
/// Other than DateTime filed name used for optiona time-based archiving purposes, currently the
|
||||
/// field names are not mandated. However, it is recommended to use names as specified above.
|
||||
///
|
||||
/// To provide as non-intrusive operation as possbile, the log entries are cached and
|
||||
/// To provide as non-intrusive operation as possible, the log entries are cached and
|
||||
/// inserted into the target database asynchronously by default . The blocking, however, will occur
|
||||
/// before the next entry insertion with default timeout of 1 second. The default settings can be
|
||||
/// overridden (see async, timeout and throw properties for details).
|
||||
|
@ -201,7 +201,7 @@ public:
|
||||
Any& swap(Any& other)
|
||||
/// Swaps the content of the two Anys.
|
||||
///
|
||||
/// When small object optimizaton is enabled, swap only
|
||||
/// When small object optimization is enabled, swap only
|
||||
/// has no-throw guarantee when both (*this and other)
|
||||
/// objects are allocated on the heap.
|
||||
{
|
||||
|
@ -5,7 +5,7 @@
|
||||
// Package: Filesystem
|
||||
// Module: RecursiveDirectoryIterator
|
||||
//
|
||||
// Definitions of the RecursiveDirectoryIterator stategy classes.
|
||||
// Definitions of the RecursiveDirectoryIterator strategy classes.
|
||||
//
|
||||
// Copyright (c) 2012, Applied Informatics Software Engineering GmbH.
|
||||
// and Contributors.
|
||||
|
@ -35,7 +35,7 @@ class LinearHashTable
|
||||
/// This class implements a linear hash table.
|
||||
///
|
||||
/// In a linear hash table, the available address space
|
||||
/// grows or shrinks dynamically. A linar hash table thus
|
||||
/// grows or shrinks dynamically. A linear hash table thus
|
||||
/// supports any number of insertions or deletions without
|
||||
/// lookup or insertion performance deterioration.
|
||||
///
|
||||
|
@ -134,7 +134,7 @@ private:
|
||||
void parsePattern();
|
||||
/// Will parse the _pattern string into the vector of PatternActions,
|
||||
/// which contains the message key, any text that needs to be written first
|
||||
/// a proprety in case of %[] and required length.
|
||||
/// a property in case of %[] and required length.
|
||||
|
||||
std::vector<PatternAction> _patternActions;
|
||||
bool _localTime;
|
||||
|
@ -51,7 +51,7 @@ class RecursiveDirectoryIterator
|
||||
/// The class can follow different traversal strategies:
|
||||
/// * depth-first strategy;
|
||||
/// * siblings-first strategy.
|
||||
/// The stategies are set by template parameter.
|
||||
/// The strategies are set by template parameter.
|
||||
/// There are two corresponding typedefs:
|
||||
/// * SimpleRecursiveDirectoryIterator;
|
||||
/// * SiblingsFirstRecursiveDirectoryIterator.
|
||||
|
@ -85,7 +85,7 @@ public:
|
||||
/// If study is true, the pattern is analyzed and optimized. This
|
||||
/// is mainly useful if the pattern is used more than once.
|
||||
/// For a description of the options, please see the PCRE documentation.
|
||||
/// Throws a RegularExpressionException if the patter cannot be compiled.
|
||||
/// Throws a RegularExpressionException if the pattern cannot be compiled.
|
||||
|
||||
~RegularExpression();
|
||||
/// Destroys the regular expression.
|
||||
|
@ -120,7 +120,7 @@ class TaskCustomNotification: public TaskNotification
|
||||
/// This is a template for "custom" notification.
|
||||
/// Unlike other notifications, this notification
|
||||
/// is instantiated and posted by the task itself.
|
||||
/// The purpose is to provide generic notifiation
|
||||
/// The purpose is to provide generic notification
|
||||
/// mechanism between the task and its observer(s).
|
||||
{
|
||||
public:
|
||||
|
@ -565,7 +565,7 @@ static bool Grisu3(double v,
|
||||
// the difference between w and boundary_minus/plus (a power of 2) and to
|
||||
// compute scaled_boundary_minus/plus by subtracting/adding from
|
||||
// scaled_w. However the code becomes much less readable and the speed
|
||||
// enhancements are not terriffic.
|
||||
// enhancements are not terrific.
|
||||
DiyFp scaled_boundary_minus = DiyFp::Times(boundary_minus, ten_mk);
|
||||
DiyFp scaled_boundary_plus = DiyFp::Times(boundary_plus, ten_mk);
|
||||
|
||||
|
@ -322,7 +322,7 @@ sure both macros are undefined; an emulation function will then be used. */
|
||||
contain the relevant magic. If you do not define this macro, a suitable
|
||||
__declspec value is used for Windows systems; in other environments
|
||||
"extern" is used for a C compiler and "extern C" for a C++ compiler.
|
||||
This macro apears at the start of every exported function that is part
|
||||
This macro appears at the start of every exported function that is part
|
||||
of the external API. It does not appear on functions that are "external"
|
||||
in the C sense, but which are internal to the library. */
|
||||
/* #undef PCRE_EXP_DEFN */
|
||||
|
@ -147,7 +147,7 @@ Saved stack frames:
|
||||
|
||||
Atomic blocks and asserts require reloading the values of private data
|
||||
when the backtrack mechanism performed. Because of OP_RECURSE, the data
|
||||
are not necessarly known in compile time, thus we need a dynamic restore
|
||||
are not necessarily known in compile time, thus we need a dynamic restore
|
||||
mechanism.
|
||||
|
||||
The stack frames are stored in a chain list, and have the following format:
|
||||
@ -7923,8 +7923,8 @@ return stacksize;
|
||||
M - Any values pushed by the current alternative. Can be empty, or anything.
|
||||
C - Push the previous OVECTOR(i), OVECTOR(i+1) and OVECTOR_PRIV(i) to the stack.
|
||||
L - Push the previous local (pointed by localptr) to the stack
|
||||
() - opional values stored on the stack
|
||||
()* - optonal, can be stored multiple times
|
||||
() - optional values stored on the stack
|
||||
()* - optional, can be stored multiple times
|
||||
|
||||
The following list shows the regular expression templates, their PCRE byte codes
|
||||
and stack layout supported by pcre-sljit.
|
||||
|
@ -529,7 +529,7 @@ float Strtof(Vector<const char> buffer, int exponent) {
|
||||
(f1 == f2 && f2 != f3 && f3 == f4) ||
|
||||
(f1 == f2 && f2 == f3 && f3 != f4));
|
||||
|
||||
// guess and next are the two possible canditates (in the same way that
|
||||
// guess and next are the two possible candidates (in the same way that
|
||||
// double_guess was the lower candidate for a double-precision guess).
|
||||
float guess = f1;
|
||||
float next = f4;
|
||||
|
@ -28,7 +28,7 @@ namespace MongoDB {
|
||||
|
||||
|
||||
class MongoDB_API DeleteRequest: public RequestMessage
|
||||
/// A DeleteRequest is used to delete one ore more documents from a database.
|
||||
/// A DeleteRequest is used to delete one or more documents from a database.
|
||||
///
|
||||
/// Specific flags for this request
|
||||
/// - DELETE_DEFAULT: default delete operation
|
||||
|
@ -19,6 +19,7 @@ ist
|
||||
ower
|
||||
onces
|
||||
upto
|
||||
clen
|
||||
ot
|
||||
te
|
||||
fo
|
||||
|
Loading…
Reference in New Issue
Block a user