Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Replace most occurances of http with https when the https url is valid #52566

Merged
merged 4 commits into from
Jan 3, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion CONTRIBUTING.md
Original file line number Diff line number Diff line change
Expand Up @@ -347,7 +347,7 @@ please remove the `backport-X.Y` tag from the originating pull request for the c
### Git Recommendations For Pull Requests

- Avoid working from the `master` branch of your fork, creating a new branch will make it easier if Julia's `master` changes and you need to update your pull request.
- Try to [squash](http://gitready.com/advanced/2009/02/10/squashing-commits-with-rebase.html) together small commits that make repeated changes to the same section of code so your pull request is easier to review. A reasonable number of separate well-factored commits is fine, especially for larger changes.
- Try to [squash](https://gitready.com/advanced/2009/02/10/squashing-commits-with-rebase.html) together small commits that make repeated changes to the same section of code so your pull request is easier to review. A reasonable number of separate well-factored commits is fine, especially for larger changes.
- If any conflicts arise due to changes in Julia's `master`, prefer updating your pull request branch with `git rebase` versus `git merge` or `git pull`, since the latter will introduce merge commits that clutter the git history with noise that makes your changes more difficult to review.
- Descriptive commit messages are good.
- Using `git add -p` or `git add -i` can be useful to avoid accidentally committing unrelated changes.
Expand Down
4 changes: 2 additions & 2 deletions HISTORY.md
Original file line number Diff line number Diff line change
Expand Up @@ -5291,7 +5291,7 @@ Language tooling improvements
talk](https://www.youtube.com/watch?v=e6-hcOHO0tc&list=PLP8iPy9hna6SQPwZUDtAM59-wPzCPyD_S&index=5)
on Gallium shows off various features of the debugger.

* The [Juno IDE](http://junolab.org) has matured significantly, and now
* The [Juno IDE](https://junolab.org) has matured significantly, and now
also includes support for plotting and debugging.

* [Cxx.jl](https://github.com/Keno/Cxx.jl) provides a convenient FFI for
Expand Down Expand Up @@ -5689,7 +5689,7 @@ Library improvements

* Other improvements

* You can now tab-complete emoji via their [short names](http://www.emoji-cheat-sheet.com/), using `\:name:<tab>` ([#10709]).
* You can now tab-complete emoji via their [short names](https://www.emoji-cheat-sheet.com/), using `\:name:<tab>` ([#10709]).

* `gc_enable` subsumes `gc_disable`, and also returns the previous GC state.

Expand Down
4 changes: 2 additions & 2 deletions Make.inc
Original file line number Diff line number Diff line change
Expand Up @@ -571,10 +571,10 @@ CXX_BASE := ccache
FC_BASE := ccache
ifeq ($(USECLANG),1)
# ccache and Clang don't do well together
# http://petereisentraut.blogspot.be/2011/05/ccache-and-clang.html
# https://petereisentraut.blogspot.be/2011/05/ccache-and-clang.html
CC += -Qunused-arguments
CXX += -Qunused-arguments
# http://petereisentraut.blogspot.be/2011/09/ccache-and-clang-part-2.html
# https://petereisentraut.blogspot.be/2011/09/ccache-and-clang-part-2.html
export CCACHE_CPP2 := yes
endif
else #USECCACHE
Expand Down
2 changes: 1 addition & 1 deletion Makefile
Original file line number Diff line number Diff line change
Expand Up @@ -160,7 +160,7 @@ release-candidate: release testall
@echo 8. Replace github release tarball with tarballs created from make light-source-dist and make full-source-dist with USE_BINARYBUILDER=0
@echo 9. Check that 'make && make install && make test' succeed with unpacked tarballs even without Internet access.
@echo 10. Follow packaging instructions in doc/src/devdocs/build/distributing.md to create binary packages for all platforms
@echo 11. Upload to AWS, update https://julialang.org/downloads and http://status.julialang.org/stable links
@echo 11. Upload to AWS, update https://julialang.org/downloads and https://status.julialang.org/stable links
@echo 12. Update checksums on AWS for tarball and packaged binaries
@echo 13. Update versions.json. Wait at least 60 minutes before proceeding to step 14.
@echo 14. Push to Juliaup (https://github.com/JuliaLang/juliaup/wiki/Adding-a-Julia-version)
Expand Down
2 changes: 1 addition & 1 deletion base/compiler/sort.jl
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
# This file is a part of Julia. License is MIT: https://julialang.org/license

# reference on sorted binary search:
# http://www.tbray.org/ongoing/When/200x/2003/03/22/Binary
# https://www.tbray.org/ongoing/When/200x/2003/03/22/Binary

# index of the first value of vector a that is greater than or equal to x;
# returns lastindex(v)+1 if x is greater than all values in v.
Expand Down
6 changes: 3 additions & 3 deletions base/fastmath.jl
Original file line number Diff line number Diff line change
Expand Up @@ -6,7 +6,7 @@
# strict IEEE semantics.

# This allows the following transformations. For more information see
# http://llvm.org/docs/LangRef.html#fast-math-flags:
# https://llvm.org/docs/LangRef.html#fast-math-flags:
# nnan: No NaNs - Allow optimizations to assume the arguments and
# result are not NaN. Such optimizations are required to retain
# defined behavior over NaNs, but the value of the result is
Expand Down Expand Up @@ -136,7 +136,7 @@ may violate strict IEEE semantics. This allows the fastest possible operation,
but results are undefined -- be careful when doing this, as it may change numerical
results.

This sets the [LLVM Fast-Math flags](http://llvm.org/docs/LangRef.html#fast-math-flags),
This sets the [LLVM Fast-Math flags](https://llvm.org/docs/LangRef.html#fast-math-flags),
and corresponds to the `-ffast-math` option in clang. See [the notes on performance
annotations](@ref man-performance-annotations) for more details.

Expand Down Expand Up @@ -309,7 +309,7 @@ end
Complex{T}(c, s)
end

# See <http://en.cppreference.com/w/cpp/numeric/complex>
# See <https://en.cppreference.com/w/cpp/numeric/complex>
pow_fast(x::T, y::T) where {T<:ComplexTypes} = exp(y*log(x))
pow_fast(x::T, y::Complex{T}) where {T<:FloatTypes} = exp(y*log(x))
pow_fast(x::Complex{T}, y::T) where {T<:FloatTypes} = exp(y*log(x))
Expand Down
2 changes: 1 addition & 1 deletion base/math.jl
Original file line number Diff line number Diff line change
Expand Up @@ -1294,7 +1294,7 @@ end
function add22condh(xh::Float64, xl::Float64, yh::Float64, yl::Float64)
# This algorithm, due to Dekker, computes the sum of two
# double-double numbers and returns the high double. References:
# [1] http://www.digizeitschriften.de/en/dms/img/?PID=GDZPPN001170007
# [1] https://www.digizeitschriften.de/en/dms/img/?PID=GDZPPN001170007
# [2] https://doi.org/10.1007/BF01397083
r = xh+yh
s = (abs(xh) > abs(yh)) ? (xh-r+yh+yl+xl) : (yh-r+xh+xl+yl)
Expand Down
2 changes: 1 addition & 1 deletion base/sort.jl
Original file line number Diff line number Diff line change
Expand Up @@ -172,7 +172,7 @@ partialsort(v::AbstractVector, k::Union{Integer,OrdinalRange}; kws...) =
partialsort!(copymutable(v), k; kws...)

# reference on sorted binary search:
# http://www.tbray.org/ongoing/When/200x/2003/03/22/Binary
# https://www.tbray.org/ongoing/When/200x/2003/03/22/Binary

# index of the first value of vector a that is greater than or equivalent to x;
# returns lastindex(v)+1 if x is greater than all values in v.
Expand Down
2 changes: 1 addition & 1 deletion base/special/cbrt.jl
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
# This file is a part of Julia. License is MIT: https://julialang.org/license

# Float32/Float64 based on C implementations from FDLIBM (http://www.netlib.org/fdlibm/)
# Float32/Float64 based on C implementations from FDLIBM (https://www.netlib.org/fdlibm/)
# and FreeBSD:
#
## ====================================================
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -16,7 +16,7 @@ single FDE. I suspect this was just an Apple bug, compensated by Apple-
specific code in LLVM.

See lib/ExecutionEngine/RuntimeDyld/RTDyldMemoryManager.cpp and
http://lists.llvm.org/pipermail/llvm-dev/2013-April/061737.html
https://lists.llvm.org/pipermail/llvm-dev/2013-April/061737.html
for more detail.

This change is based on the LLVM RTDyldMemoryManager.cpp. It should
Expand Down
2 changes: 1 addition & 1 deletion doc/src/assets/cover.tex
Original file line number Diff line number Diff line change
Expand Up @@ -15,7 +15,7 @@
%% ---- reset page geometry for cover page
\newgeometry{left=2cm,right=2cm,bottom=3cm}
% ref: [email protected], P65, "4.1. Styling the titling"
% http://mirrors.ctan.org/macros/latex/contrib/memoir/memman.pdf
% https://mirrors.ctan.org/macros/latex/contrib/memoir/memman.pdf
\begin{titlingpage}
% set background image
\BgThispage
Expand Down
4 changes: 2 additions & 2 deletions doc/src/assets/custom.sty
Original file line number Diff line number Diff line change
Expand Up @@ -6,7 +6,7 @@
\usepackage{geometry}
% "some": use \BgThispage to change background
% ref: [email protected],# 2.1 Options, "pages="
% http://mirrors.ctan.org/macros/latex/contrib/background/background.pdf
% https://mirrors.ctan.org/macros/latex/contrib/background/background.pdf
\usepackage[pages=some]{background}

%% Color definitions for Julia
Expand All @@ -27,7 +27,7 @@ contents={
%% Place the background image `title-bg' in the right place via `tikz'.
% tikz option "remember picture", "overlay"
% ref: [email protected], #17.13.1 Referencing a Node in a Different Picture\
% http://mirrors.ctan.org/graphics/pgf/base/doc/pgfmanual.pdf
% https://mirrors.ctan.org/graphics/pgf/base/doc/pgfmanual.pdf
\begin{tikzpicture}[remember picture,overlay,draw=white]
\draw [path picture={
% ref: pgfmanual, 15.6, "Predefined node path picture bounding box"
Expand Down
2 changes: 1 addition & 1 deletion src/crc32c.c
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@
* Version 1.1 1 Aug 2013 Mark Adler, updates from Version 1.2 5 June 2021
*
* Code retrieved in August 2016 from August 2013 post by Mark Adler on
* http://stackoverflow.com/questions/17645167/implementing-sse-4-2s-crc32c-in-software
* https://stackoverflow.com/questions/17645167/implementing-sse-4-2s-crc32c-in-software
* Modified for use in libjulia:
* - exported function renamed to jl_crc32c, DLL exports added.
* - removed main() function
Expand Down
2 changes: 1 addition & 1 deletion src/debuginfo.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -1364,7 +1364,7 @@ enum DW_EH_PE : uint8_t {
// Parse the CIE and return the type of encoding used by FDE
static DW_EH_PE parseCIE(const uint8_t *Addr, const uint8_t *End)
{
// http://www.airs.com/blog/archives/460
// https://www.airs.com/blog/archives/460
// Length (4 bytes)
uint32_t cie_size = *(const uint32_t*)Addr;
const uint8_t *cie_addr = Addr + 4;
Expand Down
2 changes: 1 addition & 1 deletion src/disasm.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -16,7 +16,7 @@
//
// University of Illinois at Urbana-Champaign
//
// http://llvm.org
// https://llvm.org
//
// Permission is hereby granted, free of charge, to any person obtaining a copy of
// this software and associated documentation files (the "Software"), to deal with
Expand Down
2 changes: 1 addition & 1 deletion src/flisp/compiler.lsp
Original file line number Diff line number Diff line change
Expand Up @@ -864,7 +864,7 @@

(else #f)))))))

; From SRFI 89 by Marc Feeley (http://srfi.schemers.org/srfi-89/srfi-89.html)
; From SRFI 89 by Marc Feeley (https://srfi.schemers.org/srfi-89/srfi-89.html)
; Copyright (C) Marc Feeley 2006. All Rights Reserved.
;
; "alist" is a list of pairs of the form "(keyword . value)"
Expand Down
2 changes: 1 addition & 1 deletion src/mach_excServer.c
Original file line number Diff line number Diff line change
Expand Up @@ -20,7 +20,7 @@
* terms of an Apple operating system software license agreement.
*
* Please obtain a copy of the License at
* http://www.opensource.apple.com/apsl/ and read it before using this file.
* https://www.opensource.apple.com/apsl/ and read it before using this file.
*
* The Original Code and all software distributed under the License are
* distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
Expand Down
2 changes: 1 addition & 1 deletion src/signals-mach.c
Original file line number Diff line number Diff line change
Expand Up @@ -412,7 +412,7 @@ kern_return_t catch_mach_exception_raise_state_identity(
static void attach_exception_port(thread_port_t thread, int segv_only)
{
kern_return_t ret;
// http://www.opensource.apple.com/source/xnu/xnu-2782.1.97/osfmk/man/thread_set_exception_ports.html
// https://www.opensource.apple.com/source/xnu/xnu-2782.1.97/osfmk/man/thread_set_exception_ports.html
exception_mask_t mask = EXC_MASK_BAD_ACCESS;
if (!segv_only)
mask |= EXC_MASK_ARITHMETIC;
Expand Down
2 changes: 1 addition & 1 deletion src/support/platform.h
Original file line number Diff line number Diff line change
Expand Up @@ -8,7 +8,7 @@
* based of compiler-specific pre-defined macros. It is based on the
* information that can be found at the following address:
*
* http://sourceforge.net/p/predef/wiki/Home/
* https://sourceforge.net/p/predef/wiki/Home/
*
* Possible values include:
* Compiler:
Expand Down
4 changes: 2 additions & 2 deletions src/support/strptime.c
Original file line number Diff line number Diff line change
Expand Up @@ -134,7 +134,7 @@ static const char * const nadt[5] = {

/*
* Table to determine the ordinal date for the start of a month.
* Ref: http://en.wikipedia.org/wiki/ISO_week_date
* Ref: https://en.wikipedia.org/wiki/ISO_week_date
*/
static const int start_of_month[2][13] = {
/* non-leap year */
Expand All @@ -147,7 +147,7 @@ static const int start_of_month[2][13] = {
* Calculate the week day of the first day of a year. Valid for
* the Gregorian calendar, which began Sept 14, 1752 in the UK
* and its colonies. Ref:
* http://en.wikipedia.org/wiki/Determination_of_the_day_of_the_week
* https://en.wikipedia.org/wiki/Determination_of_the_day_of_the_week
*/

static int
Expand Down
2 changes: 1 addition & 1 deletion stdlib/Dates/docs/src/index.md
Original file line number Diff line number Diff line change
Expand Up @@ -18,7 +18,7 @@ represents a continuously increasing machine timeline based on the UT second [^1
[`DateTime`](@ref) type is not aware of time zones (*naive*, in Python parlance),
analogous to a *LocalDateTime* in Java 8. Additional time zone functionality
can be added through the [TimeZones.jl package](https://github.com/JuliaTime/TimeZones.jl/), which
compiles the [IANA time zone database](http://www.iana.org/time-zones). Both [`Date`](@ref) and
compiles the [IANA time zone database](https://www.iana.org/time-zones). Both [`Date`](@ref) and
[`DateTime`](@ref) are based on the [ISO 8601](https://en.wikipedia.org/wiki/ISO_8601) standard, which follows the proleptic Gregorian calendar.
One note is that the ISO 8601 standard is particular about BC/BCE dates. In general, the last
day of the BC/BCE era, 1-12-31 BC/BCE, was followed by 1-1-1 AD/CE, thus no year zero exists.
Expand Down
8 changes: 4 additions & 4 deletions stdlib/Dates/test/accessors.jl
Original file line number Diff line number Diff line change
Expand Up @@ -153,7 +153,7 @@ end
@test Dates.week(Dates.Date(2010, 1, 1)) == 53
@test Dates.week(Dates.Date(2010, 1, 2)) == 53
@test Dates.week(Dates.Date(2010, 1, 2)) == 53
# Tests from http://www.epochconverter.com/date-and-time/weeknumbers-by-year.php?year=1999
# Tests from https://www.epochconverter.com/date-and-time/weeknumbers-by-year.php?year=1999
dt = Dates.DateTime(1999, 12, 27)
dt1 = Dates.Date(1999, 12, 27)
check = (52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2)
Expand All @@ -163,7 +163,7 @@ end
dt = dt + Dates.Day(1)
dt1 = dt1 + Dates.Day(1)
end
# Tests from http://www.epochconverter.com/date-and-time/weeknumbers-by-year.php?year=2000
# Tests from https://www.epochconverter.com/date-and-time/weeknumbers-by-year.php?year=2000
dt = Dates.DateTime(2000, 12, 25)
dt1 = Dates.Date(2000, 12, 25)
for i = 1:21
Expand All @@ -172,7 +172,7 @@ end
dt = dt + Dates.Day(1)
dt1 = dt1 + Dates.Day(1)
end
# Test from http://www.epochconverter.com/date-and-time/weeknumbers-by-year.php?year=2030
# Test from https://www.epochconverter.com/date-and-time/weeknumbers-by-year.php?year=2030
dt = Dates.DateTime(2030, 12, 23)
dt1 = Dates.Date(2030, 12, 23)
for i = 1:21
Expand All @@ -181,7 +181,7 @@ end
dt = dt + Dates.Day(1)
dt1 = dt1 + Dates.Day(1)
end
# Tests from http://www.epochconverter.com/date-and-time/weeknumbers-by-year.php?year=2004
# Tests from https://www.epochconverter.com/date-and-time/weeknumbers-by-year.php?year=2004
dt = Dates.DateTime(2004, 12, 20)
dt1 = Dates.Date(2004, 12, 20)
check = (52, 52, 52, 52, 52, 52, 52, 53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1)
Expand Down
2 changes: 1 addition & 1 deletion stdlib/Dates/test/io.jl
Original file line number Diff line number Diff line change
Expand Up @@ -47,7 +47,7 @@ end
end

@testset "DateTime parsing" begin
# Useful reference for different locales: http://library.princeton.edu/departments/tsd/katmandu/reference/months.html
# Useful reference for different locales: https://library.princeton.edu/departments/tsd/katmandu/reference/months.html

# Allow parsing of strings which are not representable as a TimeType
str = "02/15/1996 25:00"
Expand Down
10 changes: 5 additions & 5 deletions stdlib/LinearAlgebra/docs/src/index.md
Original file line number Diff line number Diff line change
Expand Up @@ -157,7 +157,7 @@ sorts of systems of linear equations.

## Special matrices

[Matrices with special symmetries and structures](http://www2.imm.dtu.dk/pubdb/views/publication_details.php?id=3274)
[Matrices with special symmetries and structures](https://www2.imm.dtu.dk/pubdb/views/publication_details.php?id=3274)
arise often in linear algebra and are frequently associated with various matrix factorizations.
Julia features a rich collection of special matrix types, which allow for fast computation with
specialized routines that are specially developed for particular matrix types.
Expand Down Expand Up @@ -300,7 +300,7 @@ of the Linear Algebra documentation.
| `QRCompactWY` | Compact WY form of the QR factorization |
| `QRPivoted` | Pivoted [QR factorization](https://en.wikipedia.org/wiki/QR_decomposition) |
| `LQ` | [QR factorization](https://en.wikipedia.org/wiki/QR_decomposition) of `transpose(A)` |
| `Hessenberg` | [Hessenberg decomposition](http://mathworld.wolfram.com/HessenbergDecomposition.html) |
| `Hessenberg` | [Hessenberg decomposition](https://mathworld.wolfram.com/HessenbergDecomposition.html) |
| `Eigen` | [Spectral decomposition](https://en.wikipedia.org/wiki/Eigendecomposition_of_a_matrix) |
| `GeneralizedEigen` | [Generalized spectral decomposition](https://en.wikipedia.org/wiki/Eigendecomposition_of_a_matrix#Generalized_eigenvalue_problem) |
| `SVD` | [Singular value decomposition](https://en.wikipedia.org/wiki/Singular_value_decomposition) |
Expand Down Expand Up @@ -402,7 +402,7 @@ up front and cache it for future reuse.

## Standard functions

Linear algebra functions in Julia are largely implemented by calling functions from [LAPACK](http://www.netlib.org/lapack/).
Linear algebra functions in Julia are largely implemented by calling functions from [LAPACK](https://www.netlib.org/lapack/).
Sparse matrix factorizations call functions from [SuiteSparse](http://suitesparse.com).
Other sparse solvers are available as Julia packages.

Expand Down Expand Up @@ -586,8 +586,8 @@ LinearAlgebra.rdiv!
## BLAS functions

In Julia (as in much of scientific computation), dense linear-algebra operations are based on
the [LAPACK library](http://www.netlib.org/lapack/), which in turn is built on top of basic linear-algebra
building-blocks known as the [BLAS](http://www.netlib.org/blas/). There are highly optimized
the [LAPACK library](https://www.netlib.org/lapack/), which in turn is built on top of basic linear-algebra
building-blocks known as the [BLAS](https://www.netlib.org/blas/). There are highly optimized
implementations of BLAS available for every computer architecture, and sometimes in high-performance
linear algebra routines it is useful to call the BLAS functions directly.

Expand Down
2 changes: 1 addition & 1 deletion stdlib/LinearAlgebra/src/bitarray.jl
Original file line number Diff line number Diff line change
Expand Up @@ -186,7 +186,7 @@ function istril(A::BitMatrix)
end

# fast 8x8 bit transpose from Henry S. Warrens's "Hacker's Delight"
# http://www.hackersdelight.org/hdcodetxt/transpose8.c.txt
# https://www.hackersdelight.org/hdcodetxt/transpose8.c.txt
function transpose8x8(x::UInt64)
y = x
t = xor(y, y >>> 7) & 0x00aa00aa00aa00aa
Expand Down
4 changes: 2 additions & 2 deletions stdlib/LinearAlgebra/src/blas.jl
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,7 @@ using Base: require_one_based_indexing, USE_BLAS64

export
# Note: `xFUNC_NAME` is a placeholder for not exported BLAS functions
# ref: http://www.netlib.org/blas/blasqr.pdf
# ref: https://www.netlib.org/blas/blasqr.pdf
# Level 1
# xROTG
# xROTMG
Expand Down Expand Up @@ -1065,7 +1065,7 @@ sbmv(uplo, k, A, x)
Update vector `y` as `alpha*A*x + beta*y` where `A` is a symmetric band matrix of order
`size(A,2)` with `k` super-diagonals stored in the argument `A`. The storage layout for `A`
is described the reference BLAS module, level-2 BLAS at
<http://www.netlib.org/lapack/explore-html/>.
<https://www.netlib.org/lapack/explore-html/>.
Only the [`uplo`](@ref stdlib-blas-uplo) triangle of `A` is used.

Return the updated `y`.
Expand Down
4 changes: 2 additions & 2 deletions stdlib/LinearAlgebra/src/bunchkaufman.jl
Original file line number Diff line number Diff line change
Expand Up @@ -150,7 +150,7 @@ The following functions are available for `BunchKaufman` objects:
[`size`](@ref), `\\`, [`inv`](@ref), [`issymmetric`](@ref),
[`ishermitian`](@ref), [`getindex`](@ref).

[^Bunch1977]: J R Bunch and L Kaufman, Some stable methods for calculating inertia and solving symmetric linear systems, Mathematics of Computation 31:137 (1977), 163-179. [url](http://www.ams.org/journals/mcom/1977-31-137/S0025-5718-1977-0428694-0/).
[^Bunch1977]: J R Bunch and L Kaufman, Some stable methods for calculating inertia and solving symmetric linear systems, Mathematics of Computation 31:137 (1977), 163-179. [url](https://www.ams.org/journals/mcom/1977-31-137/S0025-5718-1977-0428694-0/).

# Examples
```jldoctest
Expand Down Expand Up @@ -429,7 +429,7 @@ end

## reconstruct the original matrix
## TODO: understand the procedure described at
## http://www.nag.com/numeric/FL/nagdoc_fl22/pdf/F07/f07mdf.pdf
## https://www.nag.com/numeric/FL/nagdoc_fl22/pdf/F07/f07mdf.pdf


##--------------------------------------------------------------------------
Expand Down
Loading