Title: STL Tutorial and Reference Guide: C++ Programming with the Standard Template Library (2nd Edition) Author: David R. Musser / Gillmer J. Derge / Atul Saini / Gilmer J. Derge Publisher: Addison-Wesley Page: 560 Edition: 2nd edition (March 27, 2001) Format: PDF Summary: The Standard Template Library was created as the first library of genetic algorithms and data structures, with four ideas in mind: generic programming, abstractness without loss of efficiency, the Von Neumann computation model, and value semantics. This guide provides a tutorial, a description of each element of the library, and sample applications. The expanded second edition includes new code examples and demonstrations of the use of STL in real-world C++ software development it reflects changes made to STL for the final ANSI/ISO C++ language standard.
標簽： Programming Reference Standard Template
上傳時間： 2014-01-19
上傳用戶：netwolf
TwoEmbranchmentTree:As ancestor has its children , a tree has its leaves. we could check its leaves in terms of algorithm as preorder , midorder or postorder.
標簽： leaves its TwoEmbranchmentTree has
上傳時間： 2013-12-11
上傳用戶：電子世界
The same two-stage decoder as above. However, when transforming the symbols prior to Viterbi decoding, the amplitude information is ignored and only the phase of the received symbol is employed in the metric computation stage.
標簽： transforming two-stage However decoder
上傳時間： 2015-07-05
上傳用戶：sevenbestfei
The Viterbi algorithm is the same as the binary case with one main difference: The survivor sequences include the uncoded bits, which are decided at each trellis stage when selecting one of two parallel branches with the largest correlation metric. Presently, only 8-PSK modulation is considered. Extensions to higher-order modulations can be implemented following a similar procedure.
標簽： difference The algorithm the
上傳時間： 2015-07-05
上傳用戶：qiaoyue
K&R s saying with the history of C language. worth reading
標簽： language history reading saying
上傳時間： 2015-07-06
上傳用戶：asddsd
Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, "g++ -o span_forest span_forest.c". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper triangular part.
標簽： estimates incidence Computes forests
上傳時間： 2013-12-26
上傳用戶：com1com2
Sams Teach Yourself SQL in 10 Minutes has established itself as the gold standard for introductory SQL books, offering a fast-paced accessible tutorial to the major themes and techniques involved in applying the SQL language. Forta s examples are clear and his writing style is crisp and concise. 原版英文書！
標簽： introductory established Yourself standard
上傳時間： 2015-07-13
上傳用戶：miaochun888
The JBoss 4 Application Server Guide JBoss AS 4.0.4 Release 5
標簽： JBoss Application Release Server
上傳時間： 2015-07-17
上傳用戶：h886166
unice as a picture name
上傳時間： 2014-01-17
上傳用戶：冇尾飛鉈
header file of the specific codes for LPC2100 target boards user may modify it as ne
標簽： specific header boards modify
上傳時間： 2013-12-11
上傳用戶：h886166
