CoreLinux++ Functional Requirement Document
Revision $Revision: 1.3 $
Last Modified : Thursday, May 11, 2000

Title : Template Method Pattern

Requirement ID: 6598
Analysis References:
Design References:
Cross References:

1. Introduction

Define the skeleton of an algorithm in an operation, deferring some steps to subclasses. Template Method lets subclasses redefine certain steps of an algorithm without changing the algorithms structure.

1.1 Deliverables Overview

The participants in the Template Method pattern include:

AbstractClass

Define abstract primitive operations that concrete subclasses define to implement steps of an algorithm.

This pattern is for description purposes only, CoreLinux++ team has already provided examples in the Allocator, AbstractAllocator implementations and a number of other library class patterns.

2. Functional Requirements

The requirements will vary based on your domain solution.

2.1 User Interface Specifications

Domain defined

2.2 Product Services

Domain defined

2.3 External Interfaces and Database Requirements

Domain defined

2.4 Error Handling

Domain defined

2.5 Foreseeable Functional Changes and Enhancements

NA

3. Non-Functional Requirements

Precondition constraints: None

Postcondition constraints: None

Invarient constraints: None

3.1 Performance Requirements

NA

3.2 User Documentation and Other User Aids

This Document

Analysis Use-Case diagrams

Design class diagrams

3.3 Development Requirements

Standards: CoreLinux++ C++ Standards and Guidelines

3.4 Foreseeable Non-Functional Changes

NA

4. Remarks and Guidelines for Later Life Cycle Phases

TBD

5. Term Glossary

TBD