Behavioral pattern: Difference between revisions

Revision as of 07:10, 17 March 2007

Latest revision as of 20:17, 8 June 2025

(45 intermediate revisions by 37 users not shown)

Line 1:

{{short description|Type of software design pattern}}

In [[software engineering]], '''behavioral design patterns''' are [[design pattern (computer science)|design pattern]]s that identify common communication patterns betweenamong objects and realize these patterns. By doing so, these patterns increase flexibility in carrying out this communication.

== Design patterns ==

Examples of this type of design pattern include:

;[[Blackboard design pattern]]

* [[Chain of responsibility pattern]]: Command objects are handled or passed on to other objects by logic-containing processing objects

: Provides a computational framework for the design and implementation of systems that integrate large and diverse specialized modules, and implement complex, non-deterministic control strategies

* [[Command pattern]]: Command objects encapsulate an action and its parameters

;[[Chain-of-responsibility pattern]]

* [[Interpreter pattern]]: Implement a specialized computer language to rapidly solve a specific set of problems

* [[Chain of responsibility pattern]]: Command objects are handled or passed on to other objects by logic-containing processing objects

* [[Iterator pattern]]: Iterators are used to access the elements of an aggregate object sequentially without exposing its underlying representation

* ;[[CreationalCommand pattern]]

* [[Mediator pattern]]: Provides a unified interface to a set of interfaces in a subsystem

* [[Command pattern]]: Command objects encapsulate an action and its parameters

* [[Memento pattern]]: Provides the ability to restore an object to its previous state (rollback)

;"Externalize the stack"

* [[Observer pattern]]: aka Publish/Subscribe or Event Listener. Objects register to observe an event which may be raised by another object

: Turn a [[Recursion (computer science)|recursive function]] into an [[iterative function]] that uses a [[call stack|stack]]<ref>{{cite web

* [[State pattern]]: A clean way for an object to partially change its type at runtime

|url = http://c2.com/

* [[Strategy pattern]]: Algorithms can be selected on the fly

|title = Externalize The Stack

* [[Template method pattern]]: Describes the [[program skeleton]] of a program

|date = 2010-01-19

* [[Visitor pattern]]: A way to separate an algorithm from an object

|publisher = c2.com

* [[Single-serving visitor pattern]]: Optimise the implementation of a visitor that is allocated, used only once, and then deleted

|archive-url = https://web.archive.org/web/20110303085751/http://c2.com/

* [[Hierarchical visitor pattern]]: Provide a way to visit every node in a hierarchical [[data structure]] such as a tree.

|archive-date = 2011-03-03

|access-date = 2012-05-21

|url-status = bot: unknown

}}</ref>

* ;[[ConcurrencyInterpreter pattern]]

* [[Interpreter pattern]]: Implement a specialized computer language to rapidly solve a specific set of problems

;[[Iterator pattern]]

*: [[Iterator pattern]]: Iteratorss are used to access the elements of an aggregate object sequentially without exposing its underlying representation

;[[Mediator pattern]]

* [[Mediator pattern]]: Provides a unified interface to a set of interfaces in a subsystem

;[[Memento pattern]]

* [[Memento pattern]]: Provides the ability to restore an object to its previous state (rollback)

;[[Null object pattern]]

: Designed to act as a default value of an object

<dl>

<dt>[[Observer pattern]]</dt>

<dd>Defines a one-to-many dependency between objects so that when one object changes state, all its dependents are notified and updated automatically. The variant '''weak reference pattern''' decouples an observer from an observable to avoid memory leaks in environments without automatic weak references.<ref>{{cite web |last=Nakashian |first=Ashod |date=2004-04-11 |title=Weak Reference Pattern |url=http://c2.com/ |url-status=bot: unknown |archive-url=https://web.archive.org/web/20110303085751/http://c2.com/ |archive-date=2011-03-03 |access-date=2012-05-21 |publisher=c2.com}}</ref></dd></dl>

;[[Protocol stack]]

: Communications are handled by multiple layers, which form an encapsulation hierarchy<ref>{{cite web

|url = http://c2.com/

|title = Protocol Stack

|date = 2006-09-05

|publisher = c2.com

|archive-url = https://web.archive.org/web/20110303085751/http://c2.com/

|archive-date = 2011-03-03

|access-date = 2012-05-21

|url-status = bot: unknown

}}</ref>

;[[Publish–subscribe pattern]]<dd>A messaging pattern where senders (publishers) and receivers (subscribers) are decoupled via message topics and brokers. Commonly used in distributed systems, this pattern supports asynchronous, many-to-many communication.</dd>

;[[Scheduled-task pattern]]

: A task is scheduled to be performed at a particular interval or clock time (used in [[real-time computing]])

;[[Single-serving visitor pattern]]

* [[Single-serving visitor pattern]]: Optimise the implementation of a visitor that is allocated, used only once, and then deleted

;[[Specification pattern]]

: Recombinable [[business logic]] in a [[boolean algebra|boolean]] fashion

;[[State pattern]]

* [[State pattern]]: A clean way for an object to partially change its type at runtime

;[[Strategy pattern]]

* [[Strategy pattern]]: Algorithms can be selected on the fly, using composition

;[[Template method pattern]]

: Describes the [[program skeleton|skeleton]] of a program; algorithms can be selected on the fly, using [[Inheritance (object-oriented programming)|inheritance]]

;[[Visitor pattern]]

* [[Visitor pattern]]: A way to separate an algorithm from an object

==See also==

* [[Concurrency pattern]]

* [[Creational pattern]]

* [[Structural pattern]]

* [[Creational pattern]]

* [[Concurrency pattern]]

==References==

{{comp-sci-stub}}

{{Reflist}}

{{Design Patterns patterns}}

[[Category:Software design patterns]]

[[uk:Шаблони поведінки]]