| FazBrowse GitHub Viewer | Trending | | Home |
| Tools: [Download Repo ZIP] [Original HTTPS Page] |
1 parent f972bd8 commit f56ca30
23 files changed
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -47,7 +47,7 @@ statistics = ddply(dat, "name", function(subdat) { | |||
| 47 | 47 | ||
| 48 | 48 | p.value = NA; | |
| 49 | 49 | confidence = 'NA'; | |
| 50 | - # Check if there is enough data to calulate the calculate the p-value | ||
| 50 | + # Check if there is enough data to calculate the calculate the p-value | ||
| 51 | 51 | if (length(old.rate) > 1 && length(new.rate) > 1) { | |
| 52 | 52 | # Perform a statistics test to see of there actually is a difference in | |
| 53 | 53 | # performance. | |
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -9,7 +9,7 @@ const BenchmarkProgress = require('./_benchmark_progress.js'); | |||
| 9 | 9 | // Parse arguments | |
| 10 | 10 | // | |
| 11 | 11 | const cli = CLI(`usage: ./node compare.js [options] [--] <category> ... | |
| 12 | - Run each benchmark in the <category> directory many times using two diffrent | ||
| 12 | + Run each benchmark in the <category> directory many times using two different | ||
| 13 | 13 | node versions. More than one <category> directory can be specified. | |
| 14 | 14 | The output is formatted as csv, which can be processed using for | |
| 15 | 15 | example 'compare.R'. | |
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -503,7 +503,7 @@ def warn(msg): | |||
| 503 | 503 | prefix = '\033[1m\033[93mWARNING\033[0m' if os.isatty(1) else 'WARNING' | |
| 504 | 504 | print('%s: %s' % (prefix, msg)) | |
| 505 | 505 | ||
| 506 | - # track if warnings occured | ||
| 506 | + # track if warnings occurred | ||
| 507 | 507 | warn.warned = False | |
| 508 | 508 | ||
| 509 | 509 | def b(value): | |
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -26,7 +26,7 @@ function _dntEnabled(dnt, userAgent) { | |||
| 26 | 26 | var fxMatch = ua.match(/Firefox\/(\d+)/); | |
| 27 | 27 | var ieRegEx = /MSIE|Trident/i; | |
| 28 | 28 | var isIE = ieRegEx.test(ua); | |
| 29 | - // Matches from Windows up to the first occurance of ; un-greedily | ||
| 29 | + // Matches from Windows up to the first occurrence of ; un-greedily | ||
| 30 | 30 | // http://www.regexr.com/3c2el | |
| 31 | 31 | var platform = ua.match(/Windows.+?(?=;)/g); | |
| 32 | 32 | ||
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -3025,7 +3025,7 @@ https://github.com/nodejs/node/commit/311d7dee19034ff1c6bc9098c36973b8d687eaba | |||
| 3025 | 3025 | * After V8 heap is compact, don't use a timer every 2 seconds. | |
| 3026 | 3026 | ||
| 3027 | 3027 | * Improve nextTick implementation. | |
| 3028 | - * Add primative support for Upgrading HTTP connections. | ||
| 3028 | + * Add primitive support for Upgrading HTTP connections. | ||
| 3029 | 3029 | (See commit log for docs 760bba5) | |
| 3030 | 3030 | ||
| 3031 | 3031 | * Add timeout and maxBuffer options to child_process.exec | |
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -215,7 +215,7 @@ This is a security release. All Node.js users should consult the security releas | |||
| 215 | 215 | ### Notable changes | |
| 216 | 216 | ||
| 217 | 217 | **http**: | |
| 218 | - * Enclose IPv6 Host header in square brackets. This will enable proper separation of the host adress from any port reference (Mihai Potra) [#5314](https://github.com/nodejs/node/pull/5314) | ||
| 218 | + * Enclose IPv6 Host header in square brackets. This will enable proper separation of the host address from any port reference (Mihai Potra) [#5314](https://github.com/nodejs/node/pull/5314) | ||
| 219 | 219 | ||
| 220 | 220 | **path**: | |
| 221 | 221 | * Make win32.isAbsolute more consistent (Brian White) [#6028](https://github.com/nodejs/node/pull/6028) | |
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -182,7 +182,7 @@ void Agent::WorkerRun() { | |||
| 182 | 182 | CHECK_EQ(&child_loop_, env.event_loop()); | |
| 183 | 183 | uv_run(&child_loop_, UV_RUN_DEFAULT); | |
| 184 | 184 | ||
| 185 | - // Clean-up peristent | ||
| 185 | + // Clean-up persistent | ||
| 186 | 186 | api_.Reset(); | |
| 187 | 187 | } | |
| 188 | 188 | isolate->Dispose(); | |
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -3444,7 +3444,7 @@ void LoadEnvironment(Environment* env) { | |||
| 3444 | 3444 | // (FatalException(), break on uncaught exception in debugger) | |
| 3445 | 3445 | // | |
| 3446 | 3446 | // This is not strictly necessary since it's almost impossible | |
| 3447 | - // to attach the debugger fast enought to break on exception | ||
| 3447 | + // to attach the debugger fast enough to break on exception | ||
| 3448 | 3448 | // thrown during process startup. | |
| 3449 | 3449 | try_catch.SetVerbose(true); | |
| 3450 | 3450 | ||
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -913,7 +913,7 @@ void SecureContext::SetDHParam(const FunctionCallbackInfo<Value>& args) { | |||
| 913 | 913 | (void) &clear_error_on_return; // Silence compiler warning. | |
| 914 | 914 | ||
| 915 | 915 | // Auto DH is not supported in openssl 1.0.1, so dhparam needs | |
| 916 | - // to be specifed explicitly | ||
| 916 | + // to be specified explicitly | ||
| 917 | 917 | if (args.Length() != 1) | |
| 918 | 918 | return env->ThrowTypeError("DH argument is mandatory"); | |
| 919 | 919 | ||
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -238,7 +238,7 @@ inline const void* MemrchrFill(const void* haystack, uint8_t needle, | |||
| 238 | 238 | } | |
| 239 | 239 | ||
| 240 | 240 | ||
| 241 | - // Finds the first occurence of *two-byte* character pattern[0] in the string | ||
| 241 | + // Finds the first occurrence of *two-byte* character pattern[0] in the string | ||
| 242 | 242 | // `subject`. Does not check that the whole pattern matches. | |
| 243 | 243 | template <typename Char> | |
| 244 | 244 | inline size_t FindFirstCharacter(Vector<const Char> pattern, | |
@@ -284,7 +284,7 @@ inline size_t FindFirstCharacter(Vector<const Char> pattern, | |||
| 284 | 284 | } | |
| 285 | 285 | ||
| 286 | 286 | ||
| 287 | - // Finds the first occurance of the byte pattern[0] in string `subject`. | ||
| 287 | + // Finds the first occurrence of the byte pattern[0] in string `subject`. | ||
| 288 | 288 | // Does not verify that the whole pattern matches. | |
| 289 | 289 | template <> | |
| 290 | 290 | inline size_t FindFirstCharacter(Vector<const uint8_t> pattern, | |
@@ -373,7 +373,7 @@ size_t StringSearch<Char>::BoyerMooreSearch( | |||
| 373 | 373 | // Only preprocess at most kBMMaxShift last characters of pattern. | |
| 374 | 374 | size_t start = search->start_; | |
| 375 | 375 | ||
| 376 | - int* bad_char_occurence = search->bad_char_table(); | ||
| 376 | + int* bad_char_occurrence = search->bad_char_table(); | ||
| 377 | 377 | int* good_suffix_shift = search->good_suffix_shift_table(); | |
| 378 | 378 | ||
| 379 | 379 | Char last_char = pattern[pattern_length - 1]; | |
@@ -383,7 +383,7 @@ size_t StringSearch<Char>::BoyerMooreSearch( | |||
| 383 | 383 | size_t j = pattern_length - 1; | |
| 384 | 384 | int c; | |
| 385 | 385 | while (last_char != (c = subject[index + j])) { | |
| 386 | - int shift = j - CharOccurrence(bad_char_occurence, c); | ||
| 386 | + int shift = j - CharOccurrence(bad_char_occurrence, c); | ||
| 387 | 387 | index += shift; | |
| 388 | 388 | if (index > subject_length - pattern_length) { | |
| 389 | 389 | return subject.length(); | |
@@ -399,11 +399,11 @@ size_t StringSearch<Char>::BoyerMooreSearch( | |||
| 399 | 399 | // we have matched more than our tables allow us to be smart about. | |
| 400 | 400 | // Fall back on BMH shift. | |
| 401 | 401 | index += pattern_length - 1 - | |
| 402 | - CharOccurrence(bad_char_occurence, | ||
| 402 | + CharOccurrence(bad_char_occurrence, | ||
| 403 | 403 | static_cast<Char>(last_char)); | |
| 404 | 404 | } else { | |
| 405 | 405 | int gs_shift = good_suffix_shift[j + 1]; | |
| 406 | - int bc_occ = CharOccurrence(bad_char_occurence, c); | ||
| 406 | + int bc_occ = CharOccurrence(bad_char_occurrence, c); | ||
| 407 | 407 | int shift = j - bc_occ; | |
| 408 | 408 | if (gs_shift > shift) { | |
| 409 | 409 | shift = gs_shift; | |
| Back | FazBrowse Home | New Git URL |
0 commit comments