From 547b2f02358c4664dcd0bf30c07723ce9aa449be Mon Sep 17 00:00:00 2001 From: Michael Stevens Date: Thu, 14 Jul 2005 09:22:43 +0000 Subject: [PATCH] Removed duplicate files container.htm, wasreplaced by _concept.htm files --- doc/container.htm | 344 ---------------------------------------------- 1 file changed, 344 deletions(-) delete mode 100644 doc/container.htm diff --git a/doc/container.htm b/doc/container.htm deleted file mode 100644 index ca59ae4a..00000000 --- a/doc/container.htm +++ /dev/null @@ -1,344 +0,0 @@ - - - - - - -Container Concepts - - -

boost.png -Container Concepts

-

Vector

-

Description

-

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

-

Refinement of

-

Vector Expression -.

-

Associated types

-

-See Vector Expression -

-

Notation

- - - - - - - - - - - - - - - - - - - - - - - -
VA type that is a model of Vector
vObjects of type V
n, iObjects of a type convertible to size_type
tObject of a type convertible to value_type
pObject of a type convertible to bool
-

Definitions

-

Valid expressions

-

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

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
NameExpressionType requirementsReturn type
Sizing constructorV v (n) V
Insertv.insert (i, t)v is mutable.void
Erasev.erase (i)v is mutable.void
Clearv.clear ()v is mutable.void
Resizev.resize (n)
-v.resize (n, p)		v is mutable.void
-

Expression semantics

-

Semantics of an expression is defined only where it differs -from, or is not defined in Vector Expression .

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
NameExpressionPreconditionSemanticsPostcondition
Sizing constructorV v (n)n >= 0Allocates a vector of n elements.v.size () == n.
Insertv.insert (i, t)0 <= i < v.size () and
-v (i) is a copy of value_type ().		A copy of t is inserted in v.v (i) is a copy of t.
Erasev.erase (i)0 <= i < v.size ()Destroys the element v (i) and replaces it with -value_type ().v (i) is a copy of value_type -().
Clearv.clear () Equivalent to
-for (i = 0; i < v.size (); ++ i)
-  v.erase (i);		 
Resizev.resize (n) -
v.resize (n, p)		 Reallocates the vector so that it can hold n -elements.
-Erases or appends elements in order to bring the vector to the prescribed size. Appended elements copies ofvalue_type(). -
-When p == false then exisiting elements are not preserved and elements will not appended as normal. Instead the vector is in the same state as that after an equivilent sizing constructor.		v.size () == n.
-

Complexity guarantees

-

The run-time complexity of the sizing constructor is linear in -the vector's size.

-

The run-time complexity of insert and erase is specific for the -vector.

-

The run-time complexity of resize is linear in the vector's -size.

-

Invariants

-

Models

- -

Matrix

-

Description

-

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

-

Refinement of

-

Matrix Expression -.

-

Associated types

-

-See Matrix Expression -

-

Notation

- - - - - - - - - - - - - - - - - - - - - - - -
MA type that is a model of Matrix
mObjects of type M
n1, n2, i, jObjects of a type convertible to size_type
tObject of a type convertible to value_type
pObject of a type convertible to bool
-

Definitions

-

Valid expressions

-

In addition to the expressions defined in Matrix Expression the -following expressions must be valid.

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
NameExpressionType requirementsReturn type
Sizing constructorM m (n1, n2) M
Insertm.insert (i, j, t)m is mutable.void
Erasem.erase (i, j)m is mutable.void
Clearm.clear ()m is mutable.void
Resizem.resize (n1, n2)
-m.resize (n1, n2, p)		m is mutable.void
-

Expression semantics

-

Semantics of an expression is defined only where it differs -from, or is not defined in Matrix Expression .

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
NameExpressionPreconditionSemanticsPostcondition
Sizing constructorM m (n1, n2)n1 >= 0 and n2 >= 0Allocates a matrix of n1 rows and n2 -columns.m.size1 () == n1 and m.size2 () == -n2.
Insertm.insert (i, j, t)0 <= i < m.size1 (),
-0 <= j < m.size2 ()and
-m (i, j) is a copy of value_type ().		A copy of t is inserted in m.m (i, j) is a copy of t.
Erasem.erase (i, j)0 <= i < m.size1 ()and
-0 <= j < m.size2		Destroys the element m (i, j) and replaces it with -value_type ().m (i, j) is a copy of value_type -().
Clearm.clear () Equivalent to
-for (i = 0; i < m.size1 (); ++ i)
-  for (j = 0; j < m.size2 (); ++ j)
-    m.erase (i, j);		 
Resizem.resize (n1, n2) -
-m.resize (n1, n2, p) -		 Reallocate the matrix so that it can hold n1 rows -and n2 columns.
-Erases or appends elements in order to bring the matrix to the -prescribed size. Appended elements are value_type() -copies.
-When p == false then exisiting elements are not preserved and elements will not appended as normal. Instead the matrix is in the same state as that after an equivilent sizing constructor.		m.size1 () == n1 and m.size2 () == n2.
-

Complexity guarantees

-

The run-time complexity of the sizing constructor is quadratic -in the matrix's size.

-

The run-time complexity of insert and erase is specific for the -matrix.

-

The run-time complexity of resize is quadratic in the matrix's -size.

-

Invariants

-

Models

- -
-

Copyright (©) 2000-2002 Joerg Walter, Mathias Koch
-Permission to copy, use, modify, sell and distribute this document -is granted provided this copyright notice appears in all copies. -This document is provided ``as is'' without express or implied -warranty, and with no claim as to its suitability for any -purpose.

- -