From 562996a78a2ce2b866de68fd52f3ce0353bdef8f Mon Sep 17 00:00:00 2001 From: CromwellEnage <32967088+CromwellEnage@users.noreply.github.com> Date: Thu, 11 Oct 2018 12:09:56 -0400 Subject: [PATCH] Fix broken links in documentation. Some documentation links currently point to pages that HP retired along with the rest of the SGI STL website. These links now point to the Boost mirror site. --- doc/bounded_array.html | 52 +++++++++++++++++++------------------- doc/container_concept.html | 6 ++--- doc/index.html | 2 +- doc/storage_concept.html | 14 +++++----- doc/unbounded_array.html | 52 +++++++++++++++++++------------------- doc/vector.html | 8 +++--- 6 files changed, 67 insertions(+), 67 deletions(-) diff --git a/doc/bounded_array.html b/doc/bounded_array.html index fea0d7b53..55c0abf2f 100644 --- a/doc/bounded_array.html +++ b/doc/bounded_array.html @@ -81,17 +81,17 @@

Members

Where defined Description -value_typeContainer -pointerContainerDefined as value_type* -const_pointerContainerDefined as const value_type* -referenceContainerDefined as value_type& -const_referenceContainerDefined as const value_type& -size_typeContainerDefined as Alloc::size_type -difference_typeContainerDefined as Alloc::difference_type -iteratorContainerDefined as pointer -const_iteratorContainerDefined as const_pointer -revere_iteratorContainerDefined as std::reverse_iterator<iterator> -const_revere_iteratorContainerDefined as std::reverse_iterator<const_iterator> +value_typeContainer +pointerContainerDefined as value_type* +const_pointerContainerDefined as const value_type* +referenceContainerDefined as value_type& +const_referenceContainerDefined as const value_type& +size_typeContainerDefined as Alloc::size_type +difference_typeContainerDefined as Alloc::difference_type +iteratorContainerDefined as pointer +const_iteratorContainerDefined as const_pointer +revere_iteratorContainerDefined as std::reverse_iterator<iterator> +const_revere_iteratorContainerDefined as std::reverse_iterator<const_iterator> bounded_array () Storage @@ -109,12 +109,12 @@

Members

bounded_array (const bounded_array &c) -Container +Container The copy constructor. ~bounded_array () -Container +Container Deallocates the bounded_array itself. @@ -129,22 +129,22 @@

Members

size_type size () const -Container +Container Returns the size of the bounded_array. const_reference operator [] (size_type i) const -Container +Container Returns a const reference of the i -th element. reference operator [] (size_type i) -Container +Container Returns a reference of the i-th element. bounded_array &operator = (const bounded_array &a) -Container +Container The assignment operator. @@ -154,47 +154,47 @@

Members

void swap (bounded_array &a) -Container +Container Swaps the contents of the arrays. const_iterator begin () const -Container +Container Returns a const_iterator pointing to the beginning of the bounded_array. const_iterator end () const -Container +Container Returns a const_iterator pointing to the end of the bounded_array. iterator begin () -Container +Container Returns a iterator pointing to the beginning of the bounded_array. iterator end () -Container +Container Returns a iterator pointing to the end of the bounded_array. const_reverse_iterator rbegin () const -Reversible Container +Reversible Container Returns a const_reverse_iterator pointing to the beginning of the reversed bounded_array. const_reverse_iterator rend () const -Reversible Container +Reversible Container Returns a const_reverse_iterator pointing to the end of the reversed bounded_array. reverse_iterator rbegin () -Reversible Container +Reversible Container Returns a reverse_iterator pointing to the beginning of the reversed bounded_array. reverse_iterator rend () -Reversible Container +Reversible Container Returns a reverse_iterator pointing to the end of the reversed bounded_array. diff --git a/doc/container_concept.html b/doc/container_concept.html index 6c8346f80..51c4e09bf 100644 --- a/doc/container_concept.html +++ b/doc/container_concept.html @@ -20,7 +20,7 @@

Description

A Vector describes common aspects of dense, packed and sparse vectors.

Refinement of

-

DefaultConstructible, +

DefaultConstructible, Vector Expression [1].

Associated types

@@ -68,7 +68,7 @@

Notation

Definitions

Valid expressions

-

In addition to the expressions defined in DefaultConstructible, +

In addition to the expressions defined in DefaultConstructible, Vector Expression the following expressions must be valid.

@@ -216,7 +216,7 @@

Description

A Matrix describes common aspects of dense, packed and sparse matrices.

Refinement of

-

DefaultConstructible, +

DefaultConstructible, Matrix Expression [1] .

diff --git a/doc/index.html b/doc/index.html index 6a3a15dfd..d9fb9c578 100644 --- a/doc/index.html +++ b/doc/index.html @@ -24,7 +24,7 @@

Functionality

adaptor classes and indirect arrays. The library covers the usual basic linear algebra operations on vectors and matrices: reductions like different norms, addition and subtraction of vectors and matrices and multiplication with a scalar, inner and outer products of vectors, matrix vector and matrix matrix products and triangular solver. The glue between containers, views -and expression templated operations is a mostly STL conforming iterator interface.

+and expression templated operations is a mostly STL conforming iterator interface.

Documentation

diff --git a/doc/storage_concept.html b/doc/storage_concept.html index 2f30529e8..0aeae7186 100644 --- a/doc/storage_concept.html +++ b/doc/storage_concept.html @@ -22,12 +22,12 @@

Description

the Sequence concept however is that the Storage concept does not require default-initialisation of its elements.

Refinement of

-Random Access Container +Random Access Container and -Default Constructible +Default Constructible

Associated types

No additional types beyond those defined by -Random Access Container +Random Access Container

Notation

@@ -38,16 +38,16 @@

Notation

Definitions

Valid expressions

In addition to the expressions defined in -Random Access Container, +Random Access Container, and -Default Constructible +Default Constructible the following expressions must be valid:
XA type that is model of Storage
- + @@ -59,7 +59,7 @@

Valid expressions

- + diff --git a/doc/unbounded_array.html b/doc/unbounded_array.html index 3be073054..bcf9b2687 100644 --- a/doc/unbounded_array.html +++ b/doc/unbounded_array.html @@ -78,17 +78,17 @@

Members

- - - - - - - - - - - + + + + + + + + + + + @@ -107,12 +107,12 @@

Members

- + - + @@ -127,22 +127,22 @@

Members

- + - + - + - + @@ -152,51 +152,51 @@

Members

- + - + - + - + - + - + - + - + - + diff --git a/doc/vector.html b/doc/vector.html index 2f9569d35..72d1698e8 100644 --- a/doc/vector.html +++ b/doc/vector.html @@ -59,12 +59,12 @@

Template parameters

NameExpressionType requirementsReturn type
Size constructor X(n)T is DefaultConstructibleT is DefaultConstructible X
Range constructor X(i, j)i and j are Input Iterators whose value type is convertible to T i and j are Input Iterators whose value type is convertible to T X
Where defined Description
value_typeContainer
pointerContainerDefined as value_type*
const_pointerContainerDefined as const value_type*
referenceContainerDefined as value_type&
const_referenceContainerDefined as const value_type&
size_typeContainerDefined as Alloc::size_type
difference_typeContainerDefined as Alloc::difference_type
iteratorContainerDefined as pointer
const_iteratorContainerDefined as const_pointer
revere_iteratorContainerDefined as std::reverse_iterator<iterator>
const_revere_iteratorContainerDefined as std::reverse_iterator<const_iterator>
value_typeContainer
pointerContainerDefined as value_type*
const_pointerContainerDefined as const value_type*
referenceContainerDefined as value_type&
const_referenceContainerDefined as const value_type&
size_typeContainerDefined as Alloc::size_type
difference_typeContainerDefined as Alloc::difference_type
iteratorContainerDefined as pointer
const_iteratorContainerDefined as const_pointer
revere_iteratorContainerDefined as std::reverse_iterator<iterator>
const_revere_iteratorContainerDefined as std::reverse_iterator<const_iterator>
allocator_typeDefined as ALLOC
explicit unbounded_array (ALLOC &a = ALLOC())
unbounded_array (const unbounded_array &a)ContainerContainer The copy constructor.
~unbounded_array ()ContainerContainer Deallocates the unbounded_array itself.
size_type size () constContainerContainer Returns the size of the unbounded_array.
const_reference operator [] (size_type i) constContainerContainer Returns a const reference of the i -th element.
reference operator [] (size_type i)ContainerContainer Returns a reference of the i-th element.
unbounded_array &operator = (const unbounded_array &a)ContainerContainer The assignment operator.
void swap (unbounded_array &a)ContainerContainer Swaps the contents of the arrays.
const_iterator begin () constContainerContainer Returns a const_iterator pointing to the beginning of the unbounded_array.
const_iterator end () constContainerContainer Returns a const_iterator pointing to the end of the unbounded_array.
iterator begin ()ContainerContainer Returns a iterator pointing to the beginning of the unbounded_array.
iterator end ()ContainerContainer Returns a iterator pointing to the end of the unbounded_array.
const_reverse_iterator rbegin () constReversible ContainerReversible Container Returns a const_reverse_iterator pointing to the beginning of the reversed unbounded_array.
const_reverse_iterator rend () constReversible ContainerReversible Container Returns a const_reverse_iterator pointing to the end of the reversed unbounded_array.
reverse_iterator rbegin ()Reversible ContainerReversible Container Returns a reverse_iterator pointing to the beginning of the reversed unbounded_array.
reverse_iterator rend ()Reversible ContainerReversible Container Returns a reverse_iterator pointing to the end of the reversed unbounded_array.

Model of

Vector, -RandomAccessContainer +RandomAccessContainer

Type requirements

None, except for those imposed by the requirements of Vector -and RandomAccessContainer.

+and RandomAccessContainer.

Public base classes

vector_container<vector<T, A> >

Members

@@ -163,12 +163,12 @@

Members

size_type max_size () const -RandomAccessContainer +RandomAccessContainer Returns the upper bound on the size of the vector. bool empty () const -RandomAccessContainer +RandomAccessContainer Equivilent to size () == 0.