Generic Programming and the STL: Using and Extending the C++ Standard Template Library (Paperback)
Matthew H. Austern
- 出版商: Addison Wesley
- 出版日期: 1998-10-13
- 售價: $2,100
- 貴賓價: 9.5 折 $1,995
- 語言: 英文
- 頁數: 548
- 裝訂: Paperback
- ISBN: 0201309564
- ISBN-13: 9780201309560
-
相關分類:
C++ 程式語言
立即出貨(限量) (庫存=1)
買這商品的人也買了...
-
Design Patterns: Elements of Reusable Object-Oriented Software (Hardcover)$2,500$2,375 -
資訊系統分析、設計與製作$490$417 -
Modern Information Retrieval$1,150$1,127 -
SQL Server 2000 設計實務$650$553 -
Modern C++ Design: Generic Programming and Design Patterns Applied (Paperback)$2,480$2,356 -
$1,782STL Tutorial and Reference Guide: C++ Programming with the Standard, 2/e(Hardcover) -
C++ Primer, 3/e 中文版$980$774 -
C++ 程式語言經典增訂版 (The C++ Programming Language Special Edition)$1,100$1,045 -
Digital Image Processing, 2/e(IE)(美國版ISBN:0201180758)$1,150$1,127 -
C++ 標準程式庫 (The C++ Standard Library: A Tutorial and Reference)$860$679 -
Visual C#.NET 程式設計經典$650$553 -
Understanding the Linux Kernel, 2/e (Paperback)$1,860$1,767 -
$399CCNA Self-Study: CCNA Basics (CCNAB) (Hardcover) -
C++ Builder 6 完全攻略$690$587 -
作業系統概念 (Operating System Concepts, 6/e Windows XP Update)$780$741 -
資料庫系統原理第三版 (Fundamentals of Database Systems, 3/e)$760$600 -
802.11 無線網路技術通論 (802.11 Wireless Networks: The Definitive Guide)$760$600 -
ASP.NET 程式設計徹底研究$590$466 -
鳥哥的 Linux 私房菜─基礎學習篇增訂版$560$504 -
C++ Templates 全覽 (C++ Templates: The Complete Guide)$680$537 -
人月神話：軟體專案管理之道 (20 週年紀念版)(The Mythical Man-Month: Essays on Software Engineering, Anniversary Edition, 2/e)$480$379 -
C++ 程式設計藝術 (C++ How to Program, 4/e)$820$738 -
ASP.NET 2.0 深度剖析範例集$650$507 -
C++ Primer, 4/e (中文版)$990$891 -
前進 Android Market！Google Android SDK 實戰演練$850$672
相關主題
商品描述
Description
Austern's book introduces you to the generic programming paradigm and to the most important instance of that paradigm--the C++ Standard Template Library (STL). This book reveals that the STL is more than a set of convenient container classes: It is also an extensible framework for generic and interoperable components. Austern explains the central ideas underlying generic programming--concepts, modeling, and refinement--and shows how these ideas lead to the fundamental concepts of the STL: iterators, containers, and function objects.
Appropriate Courses
C++ - Intermediate Programming.
Table Of Contents
Preface.
I. INTRODUCTION TO GENERIC PROGRAMMING.
1. A Tour of the STL.
A Simple Example.
Summary.
Summary.
2. Algorithms and Ranges.
Linear Search.
Concepts and Modeling.
Iterators.
Refinement.
Summary.
Linear Search in C.
Ranges.
Linear Search in C++.
Ranges.
Linear Search in C++.
Concepts and Modeling.
Iterators.
Input Iterators.
Output Iterators.
Forward Iterators.
Bidirectional Iterators.
Random Access Iterators.
Output Iterators.
Forward Iterators.
Bidirectional Iterators.
Random Access Iterators.
Refinement.
Summary.
3. More about Iterators.
Iterator Traits and Associated Types.
Defining New Components.
Summary.
Value Types.
Difference Type.
Reference and Pointer Types.
Dispatching Algorithms and Iterator Tags.
Putting It All Together.
Iterator Traits without iterator_traits.
Difference Type.
Reference and Pointer Types.
Dispatching Algorithms and Iterator Tags.
Putting It All Together.
Iterator Traits without iterator_traits.
Defining New Components.
Iterator Adaptors.
Advice for Defining an Iterator.
Advice for Defining an Algorithm.
Advice for Defining an Iterator.
Advice for Defining an Algorithm.
Summary.
4. Function Objects.
Generalizing Linear Search.
Function Object Concepts.
Function Object Adaptors.
Predefined Function Objects.
Summary.
Function Object Concepts.
Unary and Binary Function Objects.
Predicates and Binary Predicates.
Associated Types.
Predicates and Binary Predicates.
Associated Types.
Function Object Adaptors.
Predefined Function Objects.
Summary.
5. Containers.
A Simple Container.
Container Concepts.
Variable Size Container Concepts.
Summary.
An Array Class.
How It Works.
Finishing Touches.
How It Works.
Finishing Touches.
Container Concepts.
Containment of Elements.
Iterators.
The Hierarchy of Containers.
The Trivial Container.
Iterators.
The Hierarchy of Containers.
The Trivial Container.
Variable Size Container Concepts.
Sequences.
Associative Containers.
Allocators.
Associative Containers.
Allocators.
Summary.
Which Container Should You Use?
Defining Your Own Container.
Defining Your Own Container.
II. REFERENCE MANUAL: STL CONCEPTS.
6. Basic Concepts.
Assignable.
Default Constructible.
Equality Comparable.
Ordering.
Default Constructible.
Equality Comparable.
Ordering.
LessThan Comparable.
Strict Weakly Comparable.
Strict Weakly Comparable.
7. Iterators.
Trivial Iterator.
Input Iterator.
Output Iterator.
Forward Iterator.
Bidirectional Iterator.
Random Access Iterator.
Input Iterator.
Output Iterator.
Forward Iterator.
Bidirectional Iterator.
Random Access Iterator.
8. Function Objects.
Basic Function Objects.
Adaptable Function Objects.
Predicates.
Specialized Concepts.
Generator.
Unary Function.
Binary Function.
Unary Function.
Binary Function.
Adaptable Function Objects.
Adaptable Generator.
Adaptable Unary Function.
Adaptable Binary Function.
Adaptable Unary Function.
Adaptable Binary Function.
Predicates.
Predicate.
Binary Predicate.
Adaptable Predicate.
Adaptable Binary Predicate.
Strict Weak Ordering.
Binary Predicate.
Adaptable Predicate.
Adaptable Binary Predicate.
Strict Weak Ordering.
Specialized Concepts.
Random Number Generator.
Hash Function.
Hash Function.
9. Containers.
General Container Concepts.
Sequences.
Associative Containers.
Allocator.
Container.
Forward Container.
Reversible Container.
Random Access Container.
Forward Container.
Reversible Container.
Random Access Container.
Sequences.
Sequence.
Front Insertion Sequence.
Back Insertion Sequence.
Front Insertion Sequence.
Back Insertion Sequence.
Associative Containers.
Associative Container.
Unique Associative Container.
Multiple Associative Container.
Simple Associative Container.
Pair Associative Container.
Sorted Associative Container.
Hashed Associative Container.
Unique Associative Container.
Multiple Associative Container.
Simple Associative Container.
Pair Associative Container.
Sorted Associative Container.
Hashed Associative Container.
Allocator.
III. REFERENCED MANUAL: ALGORITHMS AND CLASSES.
10. Basic Components.
pair.
Iterator Primitives.
allocator.
Memory Management Primitives.
Temporary Buffers.
Iterator Primitives.
iterator_traits.
Iterator Tag Classes.
distance.
advance.
Iterator Base Class.
Iterator Tag Classes.
distance.
advance.
Iterator Base Class.
allocator.
Memory Management Primitives.
construct.
destroy.
uninitialized_copy.
uninitialized_fill.
uninitialized_fill_n.
destroy.
uninitialized_copy.
uninitialized_fill.
uninitialized_fill_n.
Temporary Buffers.
get_temporary_buffer.
return_temporary_buffer.
return_temporary_buffer.
11. Nonmutating Algorithms.
Linear Search.
Subsequence Matching.
Counting Elements.
for_each.
Comparing Two Ranges.
Minimum and Maximum.
find.
find_if.
adjacent_find.
find_first_of.
find_if.
adjacent_find.
find_first_of.
Subsequence Matching.
search.
find_end.
search_n.
find_end.
search_n.
Counting Elements.
count.
count_if.
count_if.
for_each.
Comparing Two Ranges.
equal.
mismatch.
lexicographical_compare.
mismatch.
lexicographical_compare.
Minimum and Maximum.
min.
max.
min_element.
max_element.
max.
min_element.
max_element.
12. Basic Mutating Algorithms.
Copying Ranges.
Swapping Elements.
transform.
Replacing Elements.
Filling Ranges.
Removing Elements.
Permuting Algorithms.
Partitions.
Random Shuffling and Sampling.
Generalized Numeric Algorithms.
copy.
copy_backward.
copy_backward.
Swapping Elements.
swap.
iter_swap.
swap_ranges.
iter_swap.
swap_ranges.
transform.
Replacing Elements.
replace.
replace_if.
replace_copy.
replace_copy_if.
replace_if.
replace_copy.
replace_copy_if.
Filling Ranges.
fill.
fill_n.
generate.
generate_n.
fill_n.
generate.
generate_n.
Removing Elements.
remove.
remove_if.
remove_copy.
remove_copy_if.
unique.
unique_copy.
remove_if.
remove_copy.
remove_copy_if.
unique.
unique_copy.
Permuting Algorithms.
reverse.
reverse_copy.
rotate.
rotate_copy.
next_permutation.
prev_permutation.
reverse_copy.
rotate.
rotate_copy.
next_permutation.
prev_permutation.
Partitions.
partition.
stable_partition.
stable_partition.
Random Shuffling and Sampling.
random_shuffle.
random_sample.
random_sample_n.
random_sample.
random_sample_n.
Generalized Numeric Algorithms.
accumulate.
inner_product.
partial_sum.
adjacent_difference.
inner_product.
partial_sum.
adjacent_difference.
13. Sorting and Searching.
Sorting Ranges.
Operations on Sorted Ranges.
Heap Operations.
sort.
stable_sort.
partial_sort.
partial_sort_copy.
nth_element.
is_sorted.
stable_sort.
partial_sort.
partial_sort_copy.
nth_element.
is_sorted.
Operations on Sorted Ranges.
Binary Search.
Merging Two Sorted Ranges.
Set Operations on Sorted Ranges.
Merging Two Sorted Ranges.
Set Operations on Sorted Ranges.
Heap Operations.
make_heap.
push_heap.
pop_heap.
sort_heap.
is_heap.
push_heap.
pop_heap.
sort_heap.
is_heap.
14. Iterator Classes.
Insert Iterators.
Stream Iterators.
reverse_iterator.
raw_storage_iterator.
front_insert_iterator.
back_insert_iterator.
insert_iterator.
back_insert_iterator.
insert_iterator.
Stream Iterators.
istream_iterator.
ostream_iterator.
istreambuf_iterator.
ostreambuf_iterator.
ostream_iterator.
istreambuf_iterator.
ostreambuf_iterator.
reverse_iterator.
raw_storage_iterator.
15. Function Object Classes.
Function Object Base Classes.
Arithmetic Operations.
Comparisons.
Logical Operations.
Identity and Projection.
Specialized Function Objects.
Member Function Adaptors.
Other Adaptors.
unary_function.
binary_function.
binary_function.
Arithmetic Operations.
plus.
minus.
multiplies.
divides.
modulus.
negate.
minus.
multiplies.
divides.
modulus.
negate.
Comparisons.
equal_to.
not_equal_to.
less.
greater.
less_equal.
greater_equal.
not_equal_to.
less.
greater.
less_equal.
greater_equal.
Logical Operations.
logical_and.
logical_or.
logical_not.
logical_or.
logical_not.
Identity and Projection.
identity.
project1st.
project2nd.
select1st.
select2nd.
project1st.
project2nd.
select1st.
select2nd.
Specialized Function Objects.
hash.
subtractive_rng.
subtractive_rng.
Member Function Adaptors.
mem_fun_t.
mem_fun_ref_t.
mem_fun1_t.
mem_fun1_ref_t.
const_mem_fun_t.
const_mem_fun_ref_t.
const_mem_fun1_t.
const_mem_fun1_ref_t.
mem_fun_ref_t.
mem_fun1_t.
mem_fun1_ref_t.
const_mem_fun_t.
const_mem_fun_ref_t.
const_mem_fun1_t.
const_mem_fun1_ref_t.
Other Adaptors.
binder1st.
binder2nd.
pointer_to_unary_function.
pointer_to_binary_function.
unary_negate.
binary_negate.
unary_compose.
binary_compose.
binder2nd.
pointer_to_unary_function.
pointer_to_binary_function.
unary_negate.
binary_negate.
unary_compose.
binary_compose.
16. Container Classes.
Sequences.
Associative Containers.
Container Adaptors.
vector.
list.
slist.
deque.
list.
slist.
deque.
Associative Containers.
set.
map.
multiset.
multimap.
hash_set.
hash_map.
hash_multiset.
hash_multimap.
map.
multiset.
multimap.
hash_set.
hash_map.
hash_multiset.
hash_multimap.
Container Adaptors.
stack.
queue.
priority_queue.
queue.
priority_queue.
Appendix A. Portability and Standardization.
Language Changes.
Library Changes.
Naming and Packaging.
The Template Compilation Model.
Default Template Parameters.
Member Templates.
Partial Specialization.
New Keywords.
Default Template Parameters.
Member Templates.
Partial Specialization.
New Keywords.
Library Changes.
Allocators.
Container Adaptors.
Minor Library Changes.
Container Adaptors.
Minor Library Changes.
Naming and Packaging.
Bibliography.
Index. 0201309564T04062001
商品描述(中文翻譯)
描述
Austern的書介紹了泛型編程範式以及該範式中最重要的實例 - C++標準模板庫（STL）。這本書揭示了STL不僅僅是一組方便的容器類：它還是一個可擴展的泛型和互操作組件框架。Austern解釋了泛型編程的核心思想 - 概念、建模和細化 - 並展示了這些思想如何導致STL的基本概念：迭代器、容器和函數對象。
適合的課程
C++ - 中級編程。
目錄
前言。
第一部分：泛型編程入門。
1. STL概述。
2. 算法和範圍。
3. 更多關於迭代器的內容。
（以下省略）
