Start line:  
End line:  

Snippet Preview

Snippet HTML Code

Stack Overflow Questions
Copyright (c) 2006-2010 Floggy Open Source Group. All rights reserved. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
 
 package net.sourceforge.floggy.persistence.beans;
 
 
DOCUMENT ME!

Author(s):
Thiago Moreira
Version:
$Revision$
 
 public class FloggyStack implements PersistableDeletable {
DOCUMENT ME!
 
 	protected Stack x;

DOCUMENT ME!

 
 	public void delete() throws FloggyException {
 		if ( != null) {
 			Enumeration enumeration = .elements();
 
 			while (enumeration.hasMoreElements()) {
 				Object object = (Objectenumeration.nextElement();
 
 				if (object instanceof Persistable) {
 					PersistableManager.getInstance().delete((Persistableobject);
 				}
 			}
 		}
 	}

DOCUMENT ME!

Parameters:
obj DOCUMENT ME!
Returns:
DOCUMENT ME!
 
 	public boolean equals(Object obj) {
 		if (this == obj)
 			return true;
 
 		if (obj == null)
 			return false;
 
 		if (getClass() != obj.getClass())
 			return false;
 
 		final FloggyStack other = (FloggyStackobj;
 
 		if ( == null) {
 			if (other.x != null)
 				return false;
 		} else if (!.equals(other.x))
 			return false;
 
 		return true;
 	}

DOCUMENT ME!

Returns:
DOCUMENT ME!
 
 	public Stack getX() {
 		return ;
 	}

DOCUMENT ME!

Returns:
DOCUMENT ME!
 
 	public int hashCode() {
		final int prime = 31;
		int result = 1;
		result = (prime * result) + (( == null) ? 0 : .hashCode());
		return result;
	}

DOCUMENT ME!

Parameters:
x DOCUMENT ME!
	public void setX(Stack x) {
		this. = x;
	}
New to GrepCode? Check out our FAQ X