CSE687 - Object Oriented Design

This lecture covers template template policies and template traits. We will continue discussing the HashTable example. Syllabus
Describes topics to be covered, reading material for you to digest before coming to class, and due dates for the assigned projects. ../projects/pr1s10.doc ../projects/pr2s10.doc, ../code/graphhelp
Graphs with Depth-First-Search and Strong Component Algorithm. Here is a link that has a nice description of the original Tarjan algorithm for finding strong components, my favorite: www.cs.cmu.edu/afs/cs/academic/class/15451-s06/www/lectures/DFS-strong-components.pdf. ../presentations/xml.ppt ../presentations/xml.ppt, ../presentations/lectureNote.xml, ../presentations/XmlParseTree.vsd, Policy for due date extensions - only for certified illness and work or interview trips out of town: one week extension, with proof. Only one extension per project. ../presentations/templates.ppt
Templates are one of the terrific features of the C++ language. They are the basis of the Standard Template Library (STL) and are useful in day-to-day programming. ../code/templates ../code/stl Illustrates use of vectors, lists, sets, and maps. ../code/HashTable HashTables are fundamental and very useful data structures. At this time there are no hash-based containers in the STL. So here is my implementation - it's a good example of the use of templates.

../presentations/DesignOfIterators.ppt Look at HashTable<key,value,Hash> and HashIterator<key,value,Hash> classes. Draw some fairly general conclusions.

../presentations/TemplatePoliciesAndTraits.ppt Discusses policies and traits in the context of our HashTable project. ../code/TemplateTechniques Template members, template template parameters, partial template specialization and more...

../code/functors Functors are classes that define operator() - their syntax is similar to functions, but they are more powerful. The STL uses functors to support many of the algorithms defined on containers.

../code/smartptrrefcounting Smart pointers are useful tools, especially for holding onto heap resources indexted through an STL container. They are also a great illustration of many of the Template Techniques we've discussed in this course.

../code/TemplateMetaprogramming We will peek into this demo code for one or two small examples, leaving the rest for later in the semester. ../presentations/SoftwareDesign.ppt Design Goals and Attributes - used to measure designs.

../presentations/DesignStrategies.ppt Discusses styles of design and binding.

../presentations/DesignRules.ppt Small principles and useful techniques

../presentations/commonProblems.ppt Practical issues and problems of design and implementation ../presentations/namespaces.ppt
Basic information about how namespaces work. We will discuss why you want to use them.