skip to main | skip to sidebar

狭路相逢勇者胜

Sunday, October 28, 2007

Standard Templates

1. Stack

#include <. stack.>

stack <.T.> s;

s. push(t);
s.pop();
s.top();
s.empty();
s.size();
Posted by About me at 8:25 PM
Labels: STL

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)
View my complete profile

Blog Archive

  • ►  2009 (14)
    • ►  March (4)
    • ►  February (4)
    • ►  January (6)
  • ►  2008 (93)
    • ►  December (6)
    • ►  November (3)
    • ►  October (8)
    • ►  September (10)
    • ►  July (14)
    • ►  June (9)
    • ►  May (1)
    • ►  April (6)
    • ►  March (17)
    • ►  February (9)
    • ►  January (10)
  • ▼  2007 (103)
    • ►  December (7)
    • ►  November (22)
    • ▼  October (8)
      • Suffix Tree
      • Binary Search Tree
      • Dynamic Programming
      • Hash Tables
      • Recursion
      • Standard Templates
      • Sorting Algorithm
      • Recursion Vs Iteration
    • ►  July (1)
    • ►  June (63)
    • ►  May (1)
    • ►  April (1)

Labels

  • Algorithms
  • C Language
  • C++
  • CodeReview
  • Compiler_Design
  • Computer Systems
  • Data Structures
  • Database
  • Design Patterns
  • Health
  • Kernel
  • Multithread
  • Networking
  • Others
  • Performance
  • Script Language
  • STL
  • Tools
  • Ubuntu
  • Unix/Linux
  • VMWARE
  • 办公自动化
  • 股票

Books

  • C++ Gotcha
  • C++ In Action
  • Computer Systems
  • Effective C++
  • Inside the C++ Object Model
  • Introduction to Algorithms
  • Programming Applications for Microsoft Windows
  • Programming Pearls