A. Stepanov and M. Lee, The Standard Template Library, Tech. Report HPL-95-11, HP Laboratories, Menlo Park, Calif., 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....the abstract interface between the optimisation algorithm and the primitives it uses. We provide a traits class implementation using the Cgal kernel [2] and, for ease of use, traits class adapters to user supplied point classes. The interface of the data structure is compliant with the STL [10, 9]. The presented code will be part of release 1.0 of Cgal, the Computational Geometry Algorithms Library [1] The rest of the document is organized as follows. The algorithm is described in Section 2. Section 3 contains the specifications as they appear in the CGAL Reference Manual [4] Section 4 ....

....assignment not allowed CGALMincircle2( const CGALMincircle2 Traits ) CGALMincircle2 Traits operator = const CGALMincircle2 Traits ) dividing line [68] Class implementation = public: Access functions and predicates Min circle 2 access functions number of . [10] Min circle 2 predicates is . 13] Min circle 2 access functions [11] Min circle 2 predicates [14] private: Private member functions Min circle 2 private member function compute circle [28] Min circle 2 private member function mc [29] public: ....

[Article contains additional citation context not shown here]

A. Stepanov and M. Lee. The Standard Template Library, Oct. 1995. URL http:// www.cs.rpi.edu/~musser/doc.ps.

....traditional string searching with small or large alphabets, and short or long patterns. These qualities make it a good candidate for abstraction to searching in sequences over an arbitrary type T , for inclusion in generic software libraries such as the C Standard Template Library (STL) [StepanovLee, MS96]. By some definitions of genericity, HAL is already a generic algorithm, since the hash function can be made a parameter and thus the algorithm can be adapted to work with any type T . In STL, however, another important issue bearing on the generality of operations on linear sequences is the kind ....

....very infrequently in practice. In the case of sequence search algorithms, the concrete algorithms considered for generalization to include in STL were various string search algorithms, including BM, KMP, and SF. Although KMP has the lowest worst case bound, it was stated in the original STL report [StepanovLee] that SF was superior in the average case. And although BM has excellent average time behavior, it was evidently ruled out as a generic algorithm because of its alphabet size dependency. Thus the generic search algorithm requirements were written with a O(mn) time bound, to allow its ....

A.A. Stepanov, M. Lee, The Standard Template Library, Tech. Report HPL94 -34, April 1994, revised October 31, 1995. 7, 7

....is one such library, distinguished from all others by its powerful type system: FC allows the programmer to define and fully manipulate parametrically polymorphic functions. The conventional C way of representing polymorphic functions is via function templates, as in the C Standard Library [7]. Nevertheless, function templates suffer severe limitations e.g. they cannot be passed as parameters to other functions or returned as results. FC polymorphic functions overcome these limitations, enabling FC to re implement straightforwardly many common FC web site: http: www. cc. ....

....functoid would be, for given arguments. To see how, consider the simple functoid apply, which applies a binary function to its arguments. That is, apply(f,x,y) behaves just as f(x,y) does. If f is monomorphic, it is easy to implement such a function in C using techniques from the STL [7]. However, suppose we want to use apply on a polymorphic function like mk pair how do we do it In FC , we just say: struct Apply template class F, class X, class Y typename F: template Sig X,Y : ResultType operator( F f,X x,Y y) const return f(x,y) template class F, class X, class ....

[Article contains additional citation context not shown here]

A. Stepahoy and M. Lee, "The Standard Template Library", 1995. Incorporated in ANSI/ISO Committee C++ Standard.

....paper sketches a silhouette of Iterators as a composition mechanism that supports code reuse without supporting reasoning reuse. Iterators are touted as a so called best practice in software engineering, both as a codified design pattern [5] and as part of the ANSI C Standard Template Library [8]. As such, Iterators are representative of mainstream currents of code reuse in presentday software practice. Section 2 presents a brief overview of iterators and their uses. In Section 3, we show how iterators can thwart compositional reasoning by breaking encapsuation. We present some desiderata ....

....a standard interface, which can be presupposed by various algorithms. In the C Standard Template Library, iterators are considered a generalization of pointers that can enable clients to traverse an arbitrary container component in the same way that they would traverse an ordinary C array [8]. As such, decoupling is e#ectively realized by the level of indirection introduced by pointers. As we shall illustrate, however, the exposure of external aliasing is also the root of breaking the encapsulation barriers of containers. Based on the observed usage of iterators in practice, the ....

A. A. Stepanov and M. Lee. The Standard Template Library. Technical Report X3J16/94-0095, WG21/N0482, 1994.

....a veritable pep rally for the knights errant of technology. Like most crusades, there was a motivating belief behind which the movers and shakers could unite. In the case of ACM1, that belief was in Moore s Law: the unparalleled doubling of storage, bandwidth, and computing power roughly every 18 months. The inevitably smaller, faster, and cheaper computing devices of tomorrow were depicted as a holy grail within our reach. Astrophysicists, oceanographers, biogcneticists, and computer scientists alike hopped Manuscript submitted to the Workshop on Component based Software Engineering at ....

....paper sketches a silhouette of Iteraters as a composition mechanism that supports code reuse without supporting reasoning reuse. Iteraters are touted as a so called best practice in software engineering, both as a codified design pattern [5] and as part of the ANSI Standard Template Library [8] As such, Iteraters are rep resentative of mainstream currents of code reuse in presentday set, ware practice. Section 2 presents a brief overview of itcrators aud their uses. In Scctiou 3, we show how iteraters can thwart compositional reasoning by breaking encapsuation. Ve present some ....

[Article contains additional citation context not shown here]

A. A. Stepahoy and M. Lee. The Standard Template Library. Technical Report X3J16/94-0095, WG21/N0482, 1994.

....scales to large instances of several classes of queries. Our implementation was written in C and compiled with gcc. All results were taken from a 1.7 GHz Intel Pentium 4 running Linux 2.4.7 with 1GB of main memory. Tables are represented using hash sets from the Standard Template Library [25], and joins are implemented as hash joins. Along with each table a count of the number of rows present is kept. This count is implemented using the arbitrary precision integers from the Gnu Multiple Precision Library [1] As we saw in the previous section, our naive evaluation method paired with ....

A. Stepanov and M. Lee. The standard template library. Technical Report HPL-94-34, HewlettPackard Laboratories, April 1994.

....within a set as long as that object is a member of the set. If the object is removed and then re inserted into the set then the index may change. The use of indices for data structures storing sets is in contrast to popular data structure libraries such as the Standard Template Library (STL) [74], Qt [75] and Borland s BIDS [76] which all implement the idea of a set cursor. A cursor is a special object that makes it possible to iterate through the elements stored in a data structure. For example the following code fragment, using the STL, constructs a vector of integers called int array ....

A. Stepanov and M. Lee, "The standard template library," HP Technical Report HPL-9434, Hewlett Packard, Feburary 1995.

....Thus, the implementation can be reused across a wide variety of grid representations, after an initial e#ort of creating a layer implementing the kernel interface. The actual realization of this approach uses the C template features and follows the lines of the C Standard Template Library [7, 9]. Therefore, the resulting code is quite e#cient and in some cases achieves performance equal to direct (non generic) implementations. Software is available at [2] The concepts presented have been successfully applied to parallelize applications for the solution of the instationary Euler ....

Lee, M. and Stepanov, A. A. The standard template library. Technical report, HewlettPackard Laboratories, Feb. 1995.

....of the resulting code. The key point here is that we must provide the compiler with sufficient information about the concrete types involved, so that the abstractions can be optimized away at least in principle, depending on the quality of the compiler. The Standard Template Library STL [8] from the C standard library is a good example for the paradigm just described and a source of inspiration for our work. Here the underlying data model is that of a linear sequence, represented by iterators. The algorithms of the STL, such as counting, searching and sorting, are based upon ....

Lee, M. and Stepanov, A. A. The Standard Template Library. Technical report, HewlettPackard Laboratories, 1995.

.... as a concept tries to build components that make as few assumptions as possible about their environment and thus can extensively be used and reused in changing software environments [MS89, MS94] The Standard Template Library (STL) shall serve as an example for a generic component catalog [LS95]. Created by Alexander Stepanov and Meng Lee, STL consists of a set of components divided into categories like containers, algorithms and iterators. Containers are used to store data items of arbitrary types, algorithms are provided that are designed in order to work on arbitrary containers using ....

....components. Components should be as efficient as possible since most applications are subject to certain efficiency constraints. Alexander Stepanov and Meng Lee contributed to the research area of component and especially generic programming by writing the Standard Template Library (STL) [LS95]. STL is a component catalog written in C which provides generic components that are divided into main groups of components which set up a basic concept. STL is described here because it is used in some versions of the state machine implementation (presented in chapter 4) and serves as model for ....

[Article contains additional citation context not shown here]

Stepanov A. and Lee M., "The Standard Template Library", HP Labaratories, 1501 Page Mill Road, Palo Alto, CA 94304, February 7, 1995

....is now illegal a most counterintuitive result. One may question whether the problem arises in a practical setting. Indeed, we encountered the problem when attempting to build a set of mixin components based on data structure classes from the Standard Template Library (STL) [27]. The equality operator for STL data structures (operator= in C ) is itself a function template of the same form as weird function, above. For instance, the equality operator for linked lists is defined as: template class T, class Alloc inline bool operator= const list T,Alloc x, const ....

A. Stepanov and M. Lee, "The Standard Template Library". Incorporated in ANSI/ISO Committee C++ Standard.

....54 12 678450 678037 413 30112 28290 6.44 work in more detail. Programming with concepts, first, is an old approach underlying libraries in several languages, most notably Ada [22] and, with the most success, C , where the Standard Template Library became part of the language specification [30, 20]. The demand for adaptable components, at the same time, describes a recent trend in software development, which comes in several varieties. Although we were mostly inspired by generic programming in the sense of STL and its successors, the methodologies of adaptive and aspect oriented programming ....

A. A. Stepanov and M. Lee. The Standard Template Library. Technical Report HP-94-93, Hewlett-Packard, 1995.

No context found.

A. Stepanov and M. Lee, The Standard Template Library, Tech. Report HPL-95-11, HP Laboratories, Menlo Park, Calif., 1995.

No context found.

A. Stepanov and M. Lee, "The Standard Template Library", 1995. Incorporated in ANSI/ISO Committee C++ Standard.

No context found.

A. Stepanov, M. Lee, and D. Musser. The C++ Standard Template Library. Prentice-Hall, 2000.

No context found.

A. A. Stepanov, M. Lee, The Standard Template Library, Tech. Rep. X3J16/94-0095, WG21/N0482, Silicon Graphics Inc. (1994).

No context found.

A. A. Stepanov and M. Lee. The Standard Template Library. Technical Report X3J16/94-0095, WG21/N0482, 1994.

No context found.

A. Stepanov and M. Lee. The Standard Template Library. Technical report, Hewlett-Packard Company, 1994.

No context found.

A. A. Stepanov, M. Lee, The Standard Template Library, Tech. Rep. X3J16/94-0095, WG21/N0482, Silicon Graphics Inc. (1994).

No context found.

A.A. Stepanov, M. Lee, The Standard Template Library, Tech. Report HPL94 -34, April 1994, revised October 31, 1995.

No context found.

A. Stepanov and M. Lee, The Standard Template Library, Rapport, Hewlett-Packard, 1994.

No context found.

A.A. Stepanov, M. Lee, The Standard Template Library, Tech. Report HPL94 -34, April 1994, revised October 31, 1995.

No context found.

A. Stepanov and M. Lee. The Standard Template Library. Technical report, Silicon Graphics Inc., October 1995.

No context found.

A. Stepanov, M. Lee, and D. Musser. The C++ Standard Template Library. Prentice-Hall, 2000.

No context found.

A. A. Stepanov and M. Lee. The standard template library. Technical Report HP-94-93, Hewlett-Packard, 1995.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC