Skip to content

Commit

Permalink
Merging with old work
Browse files Browse the repository at this point in the history
  • Loading branch information
KZiemian committed Jul 9, 2024
2 parents d7609d8 + 12a086b commit 1ac564c
Show file tree
Hide file tree
Showing 2 changed files with 14 additions and 14 deletions.
26 changes: 13 additions & 13 deletions doc/src/manual/mathematical-operations.md
Original file line number Diff line number Diff line change
Expand Up @@ -524,19 +524,19 @@ See [Conversion and Promotion](@ref conversion-and-promotion) for how to define

### Division functions

| Function | Description |
|:-------------------------- |:--------------------------------------------------------------------------------------------------------- |
| [`div(x, y)`](@ref), `x÷y` | truncated division; quotient rounded towards zero |
| [`fld(x, y)`](@ref) | floored division; quotient rounded towards `-Inf` |
| [`cld(x, y)`](@ref) | ceiling division; quotient rounded towards `+Inf` |
| [`rem(x, y)`](@ref), `x%y` | remainder; satisfies `x == div(x, y)*y + rem(x, y)`; sign matches `x` |
| [`mod(x, y)`](@ref) | modulus; satisfies `x == fld(x, y)*y + mod(x, y)`; sign matches `y` |
| [`mod1(x, y)`](@ref) | `mod` with offset 1; returns `r∈(0, y]` for `y>0` or `r∈[y, 0)` for `y<0`, where `mod(r, y) == mod(x, y)` |
| [`mod2pi(x)`](@ref) | modulus with respect to 2pi; `0 <= mod2pi(x) < 2pi` |
| [`divrem(x, y)`](@ref) | returns `(div(x, y),rem(x, y))` |
| [`fldmod(x, y)`](@ref) | returns `(fld(x, y), mod(x, y))` |
| [`gcd(x, y...)`](@ref) | greatest positive common divisor of `x`, `y`,... |
| [`lcm(x, y...)`](@ref) | least positive common multiple of `x`, `y`,... |
| Function | Description |
|:------------------------- |:--------------------------------------------------------------------------------------------------------- |
| [`div(x,y)`](@ref), `x÷y` | truncated division; quotient rounded towards zero |
| [`fld(x,y)`](@ref) | floored division; quotient rounded towards `-Inf` |
| [`cld(x,y)`](@ref) | ceiling division; quotient rounded towards `+Inf` |
| [`rem(x,y)`](@ref), `x%y` | remainder; satisfies `x == div(x,y)*y + rem(x,y)`; sign matches `x` |
| [`mod(x,y)`](@ref) | modulus; satisfies `x == fld(x,y)*y + mod(x,y)`; sign matches `y` |
| [`mod1(x,y)`](@ref) | `mod` with offset 1; returns `r∈(0,y]` for `y>0` or `r∈[y,0)` for `y<0`, where `mod(r, y) == mod(x, y)` |
| [`mod2pi(x)`](@ref) | modulus with respect to 2pi; `0 <= mod2pi(x) < 2pi` |
| [`divrem(x,y)`](@ref) | returns `(div(x,y),rem(x,y))` |
| [`fldmod(x,y)`](@ref) | returns `(fld(x,y),mod(x,y))` |
| [`gcd(x,y...)`](@ref) | greatest positive common divisor of `x`, `y`,... |
| [`lcm(x,y...)`](@ref) | least positive common multiple of `x`, `y`,... |

### Sign and absolute value functions

Expand Down
2 changes: 1 addition & 1 deletion doc/src/manual/strings.md
Original file line number Diff line number Diff line change
Expand Up @@ -917,7 +917,7 @@ Captures can also be accessed by indexing the `RegexMatch` object with the numbe
capture group:

```jldoctest
julia> m=match(r"(?<hour>\d+):(?<minute>\d+)","12:45")
julia> m = match(r"(?<hour>\d+):(?<minute>\d+)","12:45")
RegexMatch("12:45", hour="12", minute="45")
julia> m[:minute]
Expand Down

0 comments on commit 1ac564c

Please sign in to comment.