Skip to content

Commit 100a741

Browse files
StefanKarpinskiStefanKarpinski
committed
whitespace: replace non-breaking space => space
1 parent e66bfa5 commit 100a741

25 files changed

+81
-81
lines changed

‎HISTORY.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -4102,7 +4102,7 @@ Library improvements
41024102
41034103
+ Using colons (`:`) to represent a collection of indices is deprecated. They now must be
41044104
explicitly converted to a specialized array of integers with the `to_indices` function.
4105-
   As a result, the type of `SubArray`s that represent views over colon indices has changed.
4105+
As a result, the type of `SubArray`s that represent views over colon indices has changed.
41064106
41074107
+ Logical indexing is now more efficient. Logical arrays are converted by `to_indices` to
41084108
a lazy, iterable collection of indices that doesn't support indexing. A deprecation

‎Makefile

+1-1
Original file line numberDiff line numberDiff line change
@@ -472,7 +472,7 @@ endif
472472

473473
# Include all git-tracked filenames
474474
git ls-files >> light-source-dist.tmp
475-
475+
476476
# Include documentation filenames
477477
find doc/_build/html >> light-source-dist.tmp
478478

‎base/abstractset.jl

+1-1
Original file line numberDiff line numberDiff line change
@@ -434,7 +434,7 @@ issetequal(a::AbstractSet, b) = issetequal(a, Set(b))
434434
function issetequal(a, b::AbstractSet)
435435
if haslength(a)
436436
# check b for too many unique elements
437-
length(a) < length(b) && return false
437+
length(a) < length(b) && return false
438438
end
439439
return issetequal(Set(a), b)
440440
end

‎base/array.jl

+1-1
Original file line numberDiff line numberDiff line change
@@ -452,7 +452,7 @@ the `value` that was passed; this means that if the `value` is itself modified,
452452
all elements of the `fill`ed array will reflect that modification because they're
453453
_still_ that very `value`. This is of no concern with `fill(1.0, (5,5))` as the
454454
`value` `1.0` is immutable and cannot itself be modified, but can be unexpected
455-
with mutable values like — most commonly — arrays. For example, `fill([], 3)`
455+
with mutable values like — most commonly — arrays. For example, `fill([], 3)`
456456
places _the very same_ empty array in all three locations of the returned vector:
457457
458458
```jldoctest

‎base/gmp.jl

+1-1
Original file line numberDiff line numberDiff line change
@@ -736,7 +736,7 @@ function digits!(a::AbstractVector{T}, n::BigInt; base::Integer = 10) where {T<:
736736
i, j = firstindex(a)-1, length(s)+1
737737
lasti = min(lastindex(a), firstindex(a) + length(s)-1 - isneg(n))
738738
while i < lasti
739-
# base ≤ 36: 0-9, plus a-z for 10-35
739+
# base ≤ 36: 0-9, plus a-z for 10-35
740740
# base > 36: 0-9, plus A-Z for 10-35 and a-z for 36..61
741741
x = s[j -= 1]
742742
a[i += 1] = base ≤ 36 ? (x>0x39 ? x-0x57 : x-0x30) : (x>0x39 ? (x>0x60 ? x-0x3d : x-0x37) : x-0x30)

‎base/indices.jl

+4-4
Original file line numberDiff line numberDiff line change
@@ -23,11 +23,11 @@ A linear indexing style uses one integer index to describe the position in the a
2323
(even if it's a multidimensional array) and column-major
2424
ordering is used to efficiently access the elements. This means that
2525
requesting [`eachindex`](@ref) from an array that is `IndexLinear` will return
26-
a simple one-dimensional range, even if it is multidimensional.
26+
a simple one-dimensional range, even if it is multidimensional.
2727
2828
A custom array that reports its `IndexStyle` as `IndexLinear` only needs
2929
to implement indexing (and indexed assignment) with a single `Int` index;
30-
all other indexing expressions — including multidimensional accesses — will
30+
all other indexing expressions — including multidimensional accesses — will
3131
be recomputed to the linear index. For example, if `A` were a `2×3` custom
3232
matrix with linear indexing, and we referenced `A[1, 3]`, this would be
3333
recomputed to the equivalent linear index and call `A[5]` since `2*1 + 3 = 5`.
@@ -50,13 +50,13 @@ a range of [`CartesianIndices`](@ref).
5050
5151
A `N`-dimensional custom array that reports its `IndexStyle` as `IndexCartesian` needs
5252
to implement indexing (and indexed assignment) with exactly `N` `Int` indices;
53-
all other indexing expressions — including linear indexing — will
53+
all other indexing expressions — including linear indexing — will
5454
be recomputed to the equivalent Cartesian location. For example, if `A` were a `2×3` custom
5555
matrix with cartesian indexing, and we referenced `A[5]`, this would be
5656
recomputed to the equivalent Cartesian index and call `A[1, 3]` since `5 = 2*1 + 3`.
5757
5858
It is significantly more expensive to compute Cartesian indices from a linear index than it is
59-
to go the other way. The former operation requires division — a very costly operation — whereas
59+
to go the other way. The former operation requires division — a very costly operation — whereas
6060
the latter only uses multiplication and addition and is essentially free. This asymmetry means it
6161
is far more costly to use linear indexing with an `IndexCartesian` array than it is to use
6262
Cartesian indexing with an `IndexLinear` array.

‎base/reflection.jl

+1-1
Original file line numberDiff line numberDiff line change
@@ -1545,7 +1545,7 @@ Alternatively, in isolation `m1` and `m2` might be ordered, but if a third
15451545
method cannot be sorted with them, they may cause an ambiguity together.
15461546
15471547
For parametric types, the `ambiguous_bottom` keyword argument controls whether
1548-
`Union{}` counts as an ambiguous intersection of type parameters – when `true`,
1548+
`Union{}` counts as an ambiguous intersection of type parameters – when `true`,
15491549
it is considered ambiguous, when `false` it is not.
15501550
15511551
# Examples

‎base/strings/basic.jl

+8-8
Original file line numberDiff line numberDiff line change
@@ -16,7 +16,7 @@ about strings:
1616
* Each `AbstractChar` in a string is encoded by one or more code units
1717
* Only the index of the first code unit of an `AbstractChar` is a valid index
1818
* The encoding of an `AbstractChar` is independent of what precedes or follows it
19-
* String encodings are [self-synchronizing] – i.e. `isvalid(s, i)` is O(1)
19+
* String encodings are [self-synchronizing] – i.e. `isvalid(s, i)` is O(1)
2020
2121
[self-synchronizing]: https://en.wikipedia.org/wiki/Self-synchronizing_code
2222
@@ -46,8 +46,8 @@ AbstractString
4646
ncodeunits(s::AbstractString) -> Int
4747
4848
Return the number of code units in a string. Indices that are in bounds to
49-
access this string must satisfy `1 ≤ i ≤ ncodeunits(s)`. Not all such indices
50-
are valid – they may not be the start of a character, but they will return a
49+
access this string must satisfy `1 ≤ i ≤ ncodeunits(s)`. Not all such indices
50+
are valid – they may not be the start of a character, but they will return a
5151
code unit value when calling `codeunit(s,i)`.
5252
5353
# Examples
@@ -389,7 +389,7 @@ length(s::AbstractString) = @inbounds return length(s, 1, ncodeunits(s)::Int)
389389
function length(s::AbstractString, i::Int, j::Int)
390390
@boundscheck begin
391391
0 < i ≤ ncodeunits(s)::Int+1 || throw(BoundsError(s, i))
392-
0 ≤ j < ncodeunits(s)::Int+1 || throw(BoundsError(s, j))
392+
0 ≤ j < ncodeunits(s)::Int+1 || throw(BoundsError(s, j))
393393
end
394394
n = 0
395395
for k = i:j
@@ -438,8 +438,8 @@ thisind(s::AbstractString, i::Integer) = thisind(s, Int(i))
438438
function thisind(s::AbstractString, i::Int)
439439
z = ncodeunits(s)::Int + 1
440440
i == z && return i
441-
@boundscheck 0 ≤ i ≤ z || throw(BoundsError(s, i))
442-
@inbounds while 1 < i && !(isvalid(s, i)::Bool)
441+
@boundscheck 0 ≤ i ≤ z || throw(BoundsError(s, i))
442+
@inbounds while 1 < i && !(isvalid(s, i)::Bool)
443443
i -= 1
444444
end
445445
return i
@@ -498,7 +498,7 @@ function prevind(s::AbstractString, i::Int, n::Int)
498498
z = ncodeunits(s) + 1
499499
@boundscheck 0 < i ≤ z || throw(BoundsError(s, i))
500500
n == 0 && return thisind(s, i) == i ? i : string_index_err(s, i)
501-
while n > 0 && 1 < i
501+
while n > 0 && 1 < i
502502
@inbounds n -= isvalid(s, i -= 1)
503503
end
504504
return i - n
@@ -557,7 +557,7 @@ function nextind(s::AbstractString, i::Int, n::Int)
557557
z = ncodeunits(s)
558558
@boundscheck 0 ≤ i ≤ z || throw(BoundsError(s, i))
559559
n == 0 && return thisind(s, i) == i ? i : string_index_err(s, i)
560-
while n > 0 && i < z
560+
while n > 0 && i < z
561561
@inbounds n -= isvalid(s, i += 1)
562562
end
563563
return i + n

‎base/strings/io.jl

+1-1
Original file line numberDiff line numberDiff line change
@@ -209,7 +209,7 @@ function show(
209209

210210
# early out for short strings
211211
len = ncodeunits(str)
212-
len ≤ limit - 2 && # quote chars
212+
len ≤ limit - 2 && # quote chars
213213
return show(io, str)
214214

215215
# these don't depend on string data

‎base/strings/string.jl

+6-6
Original file line numberDiff line numberDiff line change
@@ -247,7 +247,7 @@ function getindex_continued(s::String, i::Int, u::UInt32)
247247
end
248248
n = ncodeunits(s)
249249

250-
(i += 1) > n && @goto ret
250+
(i += 1) > n && @goto ret
251251
@inbounds b = codeunit(s, i) # cont byte 1
252252
b & 0xc0 == 0x80 || @goto ret
253253
u |= UInt32(b) << 16
@@ -287,7 +287,7 @@ length(s::String) = length_continued(s, 1, ncodeunits(s), ncodeunits(s))
287287
@inline function length(s::String, i::Int, j::Int)
288288
@boundscheck begin
289289
0 < i ≤ ncodeunits(s)+1 || throw(BoundsError(s, i))
290-
0 ≤ j < ncodeunits(s)+1 || throw(BoundsError(s, j))
290+
0 ≤ j < ncodeunits(s)+1 || throw(BoundsError(s, j))
291291
end
292292
j < i && return 0
293293
@inbounds i, k = thisind(s, i), i
@@ -300,21 +300,21 @@ end
300300
@inbounds b = codeunit(s, i)
301301
@inbounds while true
302302
while true
303-
(i += 1) ≤ n || return c
304-
0xc0 ≤ b ≤ 0xf7 && break
303+
(i += 1) ≤ n || return c
304+
0xc0 ≤ b ≤ 0xf7 && break
305305
b = codeunit(s, i)
306306
end
307307
l = b
308308
b = codeunit(s, i) # cont byte 1
309309
c -= (x = b & 0xc0 == 0x80)
310310
x & (l ≥ 0xe0) || continue
311311

312-
(i += 1) ≤ n || return c
312+
(i += 1) ≤ n || return c
313313
b = codeunit(s, i) # cont byte 2
314314
c -= (x = b & 0xc0 == 0x80)
315315
x & (l ≥ 0xf0) || continue
316316

317-
(i += 1) ≤ n || return c
317+
(i += 1) ≤ n || return c
318318
b = codeunit(s, i) # cont byte 3
319319
c -= (b & 0xc0 == 0x80)
320320
end

‎base/strings/substring.jl

+1-1
Original file line numberDiff line numberDiff line change
@@ -25,7 +25,7 @@ struct SubString{T<:AbstractString} <: AbstractString
2525
ncodeunits::Int
2626

2727
function SubString{T}(s::T, i::Int, j::Int) where T<:AbstractString
28-
i ≤ j || return new(s, 0, 0)
28+
i ≤ j || return new(s, 0, 0)
2929
@boundscheck begin
3030
checkbounds(s, i:j)
3131
@inbounds isvalid(s, i) || string_index_err(s, i)

‎doc/src/base/punctuation.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -30,7 +30,7 @@ Extended documentation for mathematical symbols & functions is [here](@ref math-
3030
| `a[]` | [array indexing](@ref man-array-indexing) (calling [`getindex`](@ref) or [`setindex!`](@ref)) |
3131
| `[,]` | [vector literal constructor](@ref man-array-literals) (calling [`vect`](@ref Base.vect)) |
3232
| `[;]` | [vertical concatenation](@ref man-array-concatenation) (calling [`vcat`](@ref) or [`hvcat`](@ref)) |
33-
| `[   ]` | with space-separated expressions, [horizontal concatenation](@ref man-concatenation) (calling [`hcat`](@ref) or [`hvcat`](@ref)) |
33+
| `[ ]` | with space-separated expressions, [horizontal concatenation](@ref man-concatenation) (calling [`hcat`](@ref) or [`hvcat`](@ref)) |
3434
| `T{ }` | curly braces following a type list that type's [parameters](@ref Parametric-Types) |
3535
| `{}` | curly braces can also be used to group multiple [`where`](@ref) expressions in function declarations |
3636
| `;` | semicolons separate statements, begin a list of keyword arguments in function declarations or calls, or are used to separate array literals for vertical concatenation |

‎doc/src/devdocs/init.md

+22-22
Original file line numberDiff line numberDiff line change
@@ -185,32 +185,32 @@ Hello World!
185185
| `jl_uv_write()` | `jl_uv.c` | called though [`ccall`](@ref) |
186186
| `julia_write_282942` | `stream.jl` | function `write!(s::IO, a::Array{T}) where T` |
187187
| `julia_print_284639` | `ascii.jl` | `print(io::IO, s::String) = (write(io, s); nothing)` |
188-
| `jlcall_print_284639` |   |   |
189-
| `jl_apply()` | `julia.h` |   |
190-
| `jl_trampoline()` | `builtins.c` |   |
191-
| `jl_apply()` | `julia.h` |   |
188+
| `jlcall_print_284639` | | |
189+
| `jl_apply()` | `julia.h` | |
190+
| `jl_trampoline()` | `builtins.c` | |
191+
| `jl_apply()` | `julia.h` | |
192192
| `jl_apply_generic()` | `gf.c` | `Base.print(Base.TTY, String)` |
193-
| `jl_apply()` | `julia.h` |   |
194-
| `jl_trampoline()` | `builtins.c` |   |
195-
| `jl_apply()` | `julia.h` |   |
193+
| `jl_apply()` | `julia.h` | |
194+
| `jl_trampoline()` | `builtins.c` | |
195+
| `jl_apply()` | `julia.h` | |
196196
| `jl_apply_generic()` | `gf.c` | `Base.print(Base.TTY, String, Char, Char...)` |
197-
| `jl_apply()` | `julia.h` |   |
198-
| `jl_f_apply()` | `builtins.c` |   |
199-
| `jl_apply()` | `julia.h` |   |
200-
| `jl_trampoline()` | `builtins.c` |   |
201-
| `jl_apply()` | `julia.h` |   |
197+
| `jl_apply()` | `julia.h` | |
198+
| `jl_f_apply()` | `builtins.c` | |
199+
| `jl_apply()` | `julia.h` | |
200+
| `jl_trampoline()` | `builtins.c` | |
201+
| `jl_apply()` | `julia.h` | |
202202
| `jl_apply_generic()` | `gf.c` | `Base.println(Base.TTY, String, String...)` |
203-
| `jl_apply()` | `julia.h` |   |
204-
| `jl_trampoline()` | `builtins.c` |   |
205-
| `jl_apply()` | `julia.h` |   |
203+
| `jl_apply()` | `julia.h` | |
204+
| `jl_trampoline()` | `builtins.c` | |
205+
| `jl_apply()` | `julia.h` | |
206206
| `jl_apply_generic()` | `gf.c` | `Base.println(String,)` |
207-
| `jl_apply()` | `julia.h` |   |
208-
| `do_call()` | `interpreter.c` |   |
209-
| `eval_body()` | `interpreter.c` |   |
210-
| `jl_interpret_toplevel_thunk` | `interpreter.c` |   |
211-
| `jl_toplevel_eval_flex` | `toplevel.c` |   |
212-
| `jl_toplevel_eval_in` | `toplevel.c` |   |
213-
| `Core.eval` | `boot.jl` |   |
207+
| `jl_apply()` | `julia.h` | |
208+
| `do_call()` | `interpreter.c` | |
209+
| `eval_body()` | `interpreter.c` | |
210+
| `jl_interpret_toplevel_thunk` | `interpreter.c` | |
211+
| `jl_toplevel_eval_flex` | `toplevel.c` | |
212+
| `jl_toplevel_eval_in` | `toplevel.c` | |
213+
| `Core.eval` | `boot.jl` | |
214214
215215
Since our example has just one function call, which has done its job of printing "Hello World!",
216216
the stack now rapidly unwinds back to `main()`.

‎doc/src/manual/faq.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -443,7 +443,7 @@ julia> sqrt(-2.0+0im)
443443
### How can I constrain or compute type parameters?
444444

445445
The parameters of a [parametric type](@ref Parametric-Types) can hold either
446-
types or bits values, and the type itself chooses how it makes use of these parameters.
446+
types or bits values, and the type itself chooses how it makes use of these parameters.
447447
For example, `Array{Float64, 2}` is parameterized by the type `Float64` to express its
448448
element type and the integer value `2` to express its number of dimensions. When
449449
defining your own parametric type, you can use subtype constraints to declare that a

‎doc/src/manual/integers-and-floating-point-numbers.md

+5-5
Original file line numberDiff line numberDiff line change
@@ -21,15 +21,15 @@ The following are Julia's primitive numeric types:
2121
| Type | Signed? | Number of bits | Smallest value | Largest value |
2222
|:----------------- |:------- |:-------------- |:-------------- |:------------- |
2323
| [`Int8`](@ref) | ✓ | 8 | -2^7 | 2^7 - 1 |
24-
| [`UInt8`](@ref) |   | 8 | 0 | 2^8 - 1 |
24+
| [`UInt8`](@ref) | | 8 | 0 | 2^8 - 1 |
2525
| [`Int16`](@ref) | ✓ | 16 | -2^15 | 2^15 - 1 |
26-
| [`UInt16`](@ref) |   | 16 | 0 | 2^16 - 1 |
26+
| [`UInt16`](@ref) | | 16 | 0 | 2^16 - 1 |
2727
| [`Int32`](@ref) | ✓ | 32 | -2^31 | 2^31 - 1 |
28-
| [`UInt32`](@ref) |   | 32 | 0 | 2^32 - 1 |
28+
| [`UInt32`](@ref) | | 32 | 0 | 2^32 - 1 |
2929
| [`Int64`](@ref) | ✓ | 64 | -2^63 | 2^63 - 1 |
30-
| [`UInt64`](@ref) |   | 64 | 0 | 2^64 - 1 |
30+
| [`UInt64`](@ref) | | 64 | 0 | 2^64 - 1 |
3131
| [`Int128`](@ref) | ✓ | 128 | -2^127 | 2^127 - 1 |
32-
| [`UInt128`](@ref) |   | 128 | 0 | 2^128 - 1 |
32+
| [`UInt128`](@ref) | | 128 | 0 | 2^128 - 1 |
3333
| [`Bool`](@ref) | N/A | 8 | `false` (0) | `true` (1) |
3434

3535
* **Floating-point types:**

0 commit comments

Comments
 (0)