mirror of
https://github.com/boostorg/utility.git
synced 2025-07-29 20:37:32 +02:00
added refs for LEDA and SGB
[SVN r10995]
This commit is contained in:
@ -328,8 +328,9 @@ permutation to a \stlconcept{RandomAccessIterator}, and a strided
|
||||
adaptor, which adapts a \stlconcept{RandomAccessIterator} by
|
||||
multiplying its unit of motion by a constant factor. In addition, the
|
||||
Boost Graph Library (BGL) uses iterator adaptors to adapt other graph
|
||||
libraries, such as LEDA and Stanford GraphBase, to the BGL interface
|
||||
(which requires C++ Standard compliant iterators).
|
||||
libraries, such as LEDA~\cite{mehlhorn99:_leda} and Stanford
|
||||
GraphBase~\cite{knu94:sgb}, to the BGL interface (which requires C++
|
||||
Standard compliant iterators).
|
||||
|
||||
\section{The Boost \iteratoradaptor\ Class Template}
|
||||
|
||||
@ -1220,10 +1221,10 @@ approach to containers and algebraic types.
|
||||
% LocalWords: RandomAccessIterator dereference interoperate Implementers tmpw
|
||||
% LocalWords: dereferencing adaptor's lvalues iterator's instantiation typedef
|
||||
% LocalWords: AdaptableUnaryFunction templated dereferenced lvalue val param
|
||||
% LocalWords: parameterization InputIterators TOC
|
||||
% LocalWords: parameterization InputIterators TOC BGL LEDA GraphBase
|
||||
% LocalWords: Convertibility interoperability rogramming tandard terator nsert
|
||||
% LocalWords: torage rogrammers BidirectionalIterator ter daptor Yikes strided
|
||||
% LocalWords: incrementable olicies BaseIterator ype emplate anguage enerator
|
||||
% LocalWords: Nackman nserter int raits VTL tandards rom hould ness bool ust
|
||||
% LocalWords: ForwardIterator OutputIterator aram rgument rguments rrow roxy
|
||||
% LocalWords: lways Boost's akes oes
|
||||
% LocalWords: lways Boost's akes oes onstructor unintuitive
|
||||
|
@ -101,3 +101,16 @@
|
||||
number = {N1297}
|
||||
}
|
||||
|
||||
@Book{mehlhorn99:_leda,
|
||||
author = {K. Mehlhorn and St. N\"aher},
|
||||
title = {The LEDA Platform of Combinatorial and Geometric Computing},
|
||||
publisher = {Cambridge University Press},
|
||||
year = 1999
|
||||
}
|
||||
|
||||
@Book{ knu94:sgb,
|
||||
author = {D. E. Knuth},
|
||||
title = {Stanford GraphBase: a platform for combinatorial computing},
|
||||
publisher = {ACM Press},
|
||||
year = {1994}
|
||||
}
|
||||
|
Reference in New Issue
Block a user