Flylib.com
Optimizing C ++
Optimizing C ++
ISBN: 0139774300
EAN: 2147483647
Year: 2005
Pages: 12
Authors:
Steve Heller
BUY ON AMAZON
Dedication
Acknowledgements
Prologue
A Supermarket Price Lookup System
A Mailing List System
Cn U Rd Ths (Qkly)? A Data Compression Utility
Free at Last: An Efficient Method of Handling Variable-Length Records
Heavenly Hash: A Dynamic Hashing Algorithm
Zensort: A Sorting Algorithm for Limited Memory
Mozart, No. Would You Believe Gershwin?
About the Author
Optimizing C ++
ISBN: 0139774300
EAN: 2147483647
Year: 2005
Pages: 12
Authors:
Steve Heller
BUY ON AMAZON
Database Modeling with MicrosoftВ® Visio for Enterprise Architects (The Morgan Kaufmann Series in Data Management Systems)
Configuring, Manipulating, and Reusing ORM Models
Generating a Physical Database Schema
Editing Logical Models”Intermediate Aspects
Editing Logical Models”Advanced Aspects
Other Features and Best Practices
SQL Hacks
Hack 12. Simplify Complicated Updates
Hack 14. Generate Combinations
Organizing Data
Hack 56. Play Matchmaker
Hack 80. Play Six Degrees of Kevin Bacon
The New Solution Selling: The Revolutionary Sales Process That Is Changing the Way People Sell [NEW SOLUTION SELLING 2/E]
Chapter Two Principles
Chapter Four Precall Planning and Research
Chapter Five Stimulating Interest
Chapter Eight Creating Visions Biased to Your Solution
Chapter Eleven Gaining Access to People with Power
Cisco ASA: All-in-One Firewall, IPS, and VPN Adaptive Security Appliance
Monitoring and Troubleshooting the Security Contexts
Directing Traffic to the AIP-SSM
Advanced Features and Configuration
Access Control Lists
Failover
PMP Practice Questions Exam Cram 2
Exam Prep Questions
Exam Prep Questions
Project Execution
Exam Prep Questions
Appendix A. CD Contents and Installation Instructions
Digital Character Animation 3 (No. 3)
Designing a Character
Finalizing Your Design
Facial Rigging
Chapter Five. Creating Strong Poses
The Mechanics of Walking
flylib.com © 2008-2017.
If you may any questions please contact us: flylib@qtcs.net
Privacy policy
This website uses cookies. Click
here
to find out more.
Accept cookies