com.impetus.kundera.graph.Node Maven / Gradle / Ivy
/**
* Copyright 2012 Impetus Infotech.
*
* 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 com.impetus.kundera.graph;
import java.util.HashMap;
import java.util.Map;
import org.apache.commons.lang.builder.HashCodeBuilder;
import com.impetus.kundera.client.Client;
import com.impetus.kundera.lifecycle.NodeStateContext;
import com.impetus.kundera.lifecycle.states.NodeState;
import com.impetus.kundera.lifecycle.states.TransientState;
import com.impetus.kundera.persistence.PersistenceDelegator;
import com.impetus.kundera.persistence.context.PersistenceCache;
import com.impetus.kundera.utils.ObjectUtils;
/**
* Represents a node in object graph
*
* @author amresh.singh
*/
public class Node implements NodeStateContext
{
// ID of a node into object graph
private String nodeId;
// Primary key of entity data contained in this node
private Object entityId;
// Actual node data
private Object data;
// Current node state as defined in state machine
private NodeState currentNodeState;
// Class of actual node data
private Class dataClass;
// All parents of this node, Key is Node Link info and value is node itself
private Map parents;
// All children of this node, Key is Node Link info and value is node itself
private Map children;
// Whether this node has been traversed
private boolean traversed;
// Whether this node is dirty
private boolean dirty;
// Whether this is a head node
private boolean isHeadNode;
private boolean isUpdate;
/*
* Depth of this node in the tree Head node has a depth of 1 and so on.
*/
private int depth;
/** Client for this node */
Client client;
// Reference to Persistence cache where this node is stored
private PersistenceCache persistenceCache;
private boolean isGraphCompleted;
PersistenceDelegator pd;
private Node originalNode;
private boolean isProcessed;
public Node(String nodeId, Object data, PersistenceCache pc, Object primaryKey)
{
initializeNode(nodeId, data, primaryKey);
setPersistenceCache(pc);
// Initialize current node state to transient state
this.currentNodeState = new TransientState();
}
public Node(String nodeId, Object data, NodeState initialNodeState, PersistenceCache pc, Object primaryKey)
{
initializeNode(nodeId, data, primaryKey);
setPersistenceCache(pc);
// Initialize current node state
if (initialNodeState == null)
{
this.currentNodeState = new TransientState();
}
else
{
this.currentNodeState = initialNodeState;
}
}
public Node(String nodeId, Class nodeDataClass, NodeState initialNodeState, PersistenceCache pc,
Object primaryKey)
{
this.nodeId = nodeId;
this.dataClass = nodeDataClass;
this.entityId = primaryKey;
setPersistenceCache(pc);
// Initialize current node state
if (initialNodeState == null)
{
this.currentNodeState = new TransientState();
}
else
{
this.currentNodeState = initialNodeState;
}
}
private void initializeNode(String nodeId, Object data, Object primaryKey)
{
this.nodeId = nodeId;
this.data = data;
this.dataClass = data.getClass();
this.dirty = true;
this.entityId = primaryKey;
}
/**
* @return the nodeId
*/
@Override
public String getNodeId()
{
return nodeId;
}
/**
* @param nodeId
* the nodeId to set
*/
@Override
public void setNodeId(String nodeId)
{
this.nodeId = nodeId;
}
/**
* @return the data
*/
@Override
public Object getData()
{
return data;
}
/**
* @param data
* the data to set
*/
@Override
public void setData(Object data)
{
this.data = data;
}
/**
* @return the dataClass
*/
@Override
public Class getDataClass()
{
return dataClass;
}
/**
* @param dataClass
* the dataClass to set
*/
@Override
public void setDataClass(Class dataClass)
{
this.dataClass = dataClass;
}
/**
* @return the currentNodeState
*/
@Override
public NodeState getCurrentNodeState()
{
return currentNodeState;
}
/**
* @param currentNodeState
* the currentNodeState to set
*/
@Override
public void setCurrentNodeState(NodeState currentNodeState)
{
this.currentNodeState = currentNodeState;
}
/**
* @return the parents
*/
@Override
public Map getParents()
{
return parents;
}
/**
* @param parents
* the parents to set
*/
@Override
public void setParents(Map parents)
{
this.parents = parents;
}
/**
* @return the children
*/
@Override
public Map getChildren()
{
return children;
}
/**
* @param children
* the children to set
*/
@Override
public void setChildren(Map children)
{
this.children = children;
}
/**
* @return the isHeadNode
*/
public boolean isHeadNode()
{
return this != null && this.parents == null ? true : false;
}
/**
* Retrieves parent node of this node for a given parent node ID
*/
@Override
public Node getParentNode(String parentNodeId)
{
NodeLink link = new NodeLink(parentNodeId, getNodeId());
if (this.parents == null)
{
return null;
}
else
{
return this.parents.get(link);
}
}
/**
* Retrieves child node of this node for a given child node ID
*/
@Override
public Node getChildNode(String childNodeId)
{
NodeLink link = new NodeLink(getNodeId(), childNodeId);
if (this.children == null)
{
return null;
}
else
{
return this.children.get(link);
}
}
@Override
public void addParentNode(NodeLink nodeLink, Node node)
{
if (parents == null || parents.isEmpty())
{
parents = new HashMap();
}
parents.put(nodeLink, node);
}
@Override
public void addChildNode(NodeLink nodeLink, Node node)
{
if (children == null || children.isEmpty())
{
children = new HashMap();
}
children.put(nodeLink, node);
}
/**
* @return the traversed
*/
@Override
public boolean isTraversed()
{
return traversed;
}
/**
* @param traversed
* the traversed to set
*/
@Override
public void setTraversed(boolean traversed)
{
this.traversed = traversed;
}
/**
* @return the dirty
*/
@Override
public boolean isDirty()
{
return dirty;
}
/**
* @param dirty
* the dirty to set
*/
@Override
public void setDirty(boolean dirty)
{
this.dirty = dirty;
}
/**
* @return the depth
*/
public int getDepth()
{
return depth;
}
/**
* @param depth
* the depth to set
*/
public void setDepth(int depth)
{
this.depth = depth;
}
/**
* @return the client
*/
@Override
public Client getClient()
{
return client;
}
/**
* @param client
* the client to set
*/
@Override
public void setClient(Client client)
{
this.client = client;
}
@Override
public PersistenceDelegator getPersistenceDelegator()
{
return pd;
}
@Override
public void setPersistenceDelegator(PersistenceDelegator pd)
{
this.pd = pd;
}
@Override
public String toString()
{
return "[" + nodeId + "]" + nodeId;
}
@Override
public boolean equals(Object otherNode)
{
if (otherNode == null)
{
return false;
}
if (!(otherNode instanceof Node))
{
return false;
}
return this.nodeId.equals(((Node) otherNode).getNodeId());
}
@Override
public int hashCode()
{
return HashCodeBuilder.reflectionHashCode(this.nodeId);
}
// ////////////////////////////////////////
/* CRUD related operations on this node */
// ////////////////////////////////////////
@Override
public void persist()
{
getCurrentNodeState().handlePersist(this);
}
@Override
public void remove()
{
getCurrentNodeState().handleRemove(this);
}
@Override
public void refresh()
{
getCurrentNodeState().handleRefresh(this);
}
@Override
public void merge()
{
getCurrentNodeState().handleMerge(this);
}
@Override
public void detach()
{
getCurrentNodeState().handleDetach(this);
}
@Override
public void close()
{
getCurrentNodeState().handleClose(this);
}
@Override
public void lock()
{
getCurrentNodeState().handleLock(this);
}
@Override
public void commit()
{
getCurrentNodeState().handleCommit(this);
}
@Override
public void rollback()
{
getCurrentNodeState().handleRollback(this);
}
@Override
public void find()
{
getCurrentNodeState().handleFind(this);
}
@Override
public void getReference()
{
getCurrentNodeState().handleGetReference(this);
}
@Override
public void contains()
{
getCurrentNodeState().handleContains(this);
}
@Override
public void clear()
{
getCurrentNodeState().handleClear(this);
}
@Override
public void flush()
{
if (isDirty())
{
getCurrentNodeState().handleFlush(this);
this.isProcessed = true;
}
}
// Overridden methods from
@Override
public boolean isInState(Class stateClass)
{
return getCurrentNodeState().getClass().equals(stateClass);
}
@Override
public PersistenceCache getPersistenceCache()
{
return this.persistenceCache;
}
@Override
public void setPersistenceCache(PersistenceCache persistenceCache)
{
this.persistenceCache = persistenceCache;
}
/**
* @return the isGraphCompleted
*/
public boolean isGraphCompleted()
{
return isGraphCompleted;
}
/**
* @param isGraphCompleted
* the isGraphCompleted to set
*/
public void setGraphCompleted(boolean isGraphCompleted)
{
this.isGraphCompleted = isGraphCompleted;
}
/**
* @return the originalNode
*/
public Node getOriginalNode()
{
return originalNode;
}
/**
* @param originalNode
* the originalNode to set
*/
public void setOriginalNode(Node originalNode)
{
this.originalNode = originalNode;
}
/**
* @return the isProcessed
*/
public boolean isProcessed()
{
return isProcessed;
}
/**
* @return the isUpdate
*/
public boolean isUpdate()
{
return isUpdate;
}
/**
* @param isUpdate
* the isUpdate to set
*/
public void setUpdate(boolean isUpdate)
{
this.isUpdate = isUpdate;
}
@Override
public Node clone()
{
Node cloneCopy = new Node(this.nodeId, ObjectUtils.deepCopy(this.getData()), this.persistenceCache,
this.entityId);
cloneCopy.setChildren(this.children);
cloneCopy.setParents(this.parents);
cloneCopy.setDataClass(this.dataClass);
cloneCopy.setDepth(this.depth);
cloneCopy.setTraversed(this.traversed);
return cloneCopy;
}
@Override
public Object getEntityId()
{
return this.entityId;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy