State Design Pattern
The state pattern is a behavioral software design pattern, also known as the objects for states pattern. This pattern is used in computer programming to represent the state of an object. This is a clean way for an object to partially change its type at runtime
created by syam1224 on 2008-05-11 21:21:54
|
|
|
PHP Design Pattern Articles
List of articles explaining how Design patterns can be used in PHP Programming. PHP is a widely-used general-purpose scripting language that is especially suited for web development and can be embedded into HTML.
created by syam1224 on 2008-05-11 21:31:24
|
|
|
Post-order Tree Traversal Algorithm
To traverse a non-empty binary tree in postorder, perform the following operations recursively at each node, starting with the root node:
1. Traverse the left subtree.
2. Traverse the right subtree.
3. Visit the node.
created by syam1224 on 2008-05-11 05:10:40
|
|
|
Command Design Pattern
The Command design pattern encapsulates the concept of the command into an object. The issuer holds a reference to the command object rather than to the recipient. The issuer sends the command to the command object by executing a specific method on it. The command object is then responsible for dispatching the command to a specific recipient to get the job done.
created by syam1224 on 2008-05-08 21:33:18
|
|
|
Observer Design Pattern
The observer pattern (sometimes known as publish/subscribe) is a design pattern used in computer programming to observe the state of an object in a program. It is related to the principle of implicit invocation.
created by syam1224 on 2008-05-08 20:47:48
|
|
|
Chain of Responsibility : Design Pattern
In Object Oriented Design, the chain-of-responsibility pattern is a design pattern consisting of a source of command objects and a series of processing objects. Each processing object contains a set of logic that describes the types of command objects that it can handle, and how to pass off those that it cannot to the next processing object in the chain. A mechanism also exists for adding new processing objects to the end of this chain.
created by syam1224 on 2008-05-07 21:10:15
|
|
|
Memento Design Pattern
The memento pattern is a software design pattern that provides the ability to restore an object to its previous state (undo via rollback).
The memento pattern is used by two objects: the originator and a caretaker. The originator is some object that has an internal state. The caretaker is going to do something to the originator, but wants to be able to undo the change. The caretaker first asks the originator for a memento object. Then it does whatever operation (or sequence of operations) it was going to do. To roll back to the state before the operations, it returns the memento object to the originator. The memento object itself is an opaque object (one which the caretaker can not, or should not, change). When using this pattern, care should be taken if the originator may change other objects or resources - the memento pattern operates on a single object.
created by syam1224 on 2008-05-07 20:42:39
|
|
|
Autonomous Transactions : Oracle
Autonomous transactions allow you to leave the context of the calling transaction, perform an independant transaction, and return to the calling transaction without affecting it\'s state. The autonomous transaction has no link to the calling transaction, so only commited data can be shared by both transactions.
created by tom on 2008-05-05 21:55:28
|
|
|
Oracle RAC : Oracle Real Application Clusters
Oracle Real Application Clusters (RAC) is an option to the award-winning Oracle Database Enterprise Edition. Oracle RAC is a cluster database with a shared cache architecture that overcomes the limitations of traditional shared-nothing and shared-disk approaches to provide highly scalable and available database solutions for all your business applications.
created by syam1224 on 2008-04-25 06:03:37
|
|
|
BSF : Breadth First Search
In graph theory, breadth-first search (BFS) is a graph search algorithm that begins at the root node and explores all the neighboring nodes. Then for each of those nearest nodes, it explores their unexplored neighbor nodes, and so on, until it finds the goal.
created by syam1224 on 2008-04-23 21:30:20
|
|
|
Submit Link Here
