From e476e1900a20d9474fb261b41e0ea5b0979435bb Mon Sep 17 00:00:00 2001 From: Orgad Shaneh Date: Wed, 3 May 2017 10:18:25 +0300 Subject: [PATCH] Fix broken link in overview --- doc/concepts.qbk | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/doc/concepts.qbk b/doc/concepts.qbk index f379e18..e0b5f41 100644 --- a/doc/concepts.qbk +++ b/doc/concepts.qbk @@ -7,7 +7,7 @@ [section Overview] -A Range is a [*/concept/] similar to the STL [@http://www.sgi.com/Technology/STL/Container.html Container] concept. A Range provides iterators for accessing a half-open range `[first,one_past_last)` of elements and provides information about the number of elements in the Range. However, a Range has fewer requirements than a Container. +A Range is a [*/concept/] similar to the STL [@http://www.sgi.com/tech/stl/Container.html Container] concept. A Range provides iterators for accessing a half-open range `[first,one_past_last)` of elements and provides information about the number of elements in the Range. However, a Range has fewer requirements than a Container. The motivation for the Range concept is that there are many useful Container-like types that do not meet the full requirements of Container, and many algorithms that can be written with this reduced set of requirements. In particular, a Range does not necessarily