| Package | Description |
|---|---|
| org.kuali.kra.medusa | |
| org.kuali.kra.medusa.service |
| Modifier and Type | Method and Description |
|---|---|
MedusaNode |
MedusaBean.getCurrentNode() |
| Modifier and Type | Method and Description |
|---|---|
List<MedusaNode> |
MedusaNode.getChildNodes() |
List<MedusaNode> |
MedusaBean.getParentNodes() |
| Modifier and Type | Method and Description |
|---|---|
int |
MedusaNodeComparator.compare(MedusaNode m1,
MedusaNode m2) |
void |
MedusaBean.setCurrentNode(MedusaNode currentNode) |
| Modifier and Type | Method and Description |
|---|---|
void |
MedusaNode.setChildNodes(List<MedusaNode> childNodes) |
void |
MedusaBean.setParentNodes(List<MedusaNode> parentNodes) |
| Modifier and Type | Method and Description |
|---|---|
MedusaNode |
MedusaServiceImpl.getMedusaNode(String moduleName,
Long moduleId) |
MedusaNode |
MedusaService.getMedusaNode(String moduleName,
Long moduleIdentifier)
Returns a single MedusaNode that can be used to render the lazy-loaded summary for the
BO contained in that node
|
protected MedusaNode |
MedusaServiceImpl.getNode(Award award) |
protected MedusaNode |
MedusaServiceImpl.getNode(org.kuali.rice.krad.bo.BusinessObject bo)
Creates a MedusaNode for the BO given the BO is supported by Medusa(Award, Dev Prop or Inst Prop).
|
protected MedusaNode |
MedusaServiceImpl.getNode(DevelopmentProposal proposal) |
protected MedusaNode |
MedusaServiceImpl.getNode(IacucProtocol protocol) |
protected MedusaNode |
MedusaServiceImpl.getNode(InstitutionalProposal proposal) |
protected MedusaNode |
MedusaServiceImpl.getNode(Negotiation negotiation) |
protected MedusaNode |
MedusaServiceImpl.getNode(Protocol protocol) |
protected MedusaNode |
MedusaServiceImpl.getNode(SubAward subAward) |
| Modifier and Type | Method and Description |
|---|---|
List<MedusaNode> |
MedusaServiceImpl.getMedusaByAward(String moduleName,
Long moduleIdentifier) |
List<MedusaNode> |
MedusaService.getMedusaByAward(String moduleName,
Long moduleIdentifier)
Returns a list of MedusaNode objects that describe the top level of
the tree-like structure of the Medusa object passed in using the Awards(if available)
as the top level nodes.
|
List<MedusaNode> |
MedusaServiceImpl.getMedusaByProposal(String moduleName,
Long moduleIdentifier) |
List<MedusaNode> |
MedusaService.getMedusaByProposal(String moduleName,
Long moduleIdentifier)
Returns a list of MedusaNode objects that describe the top level of
the tree-like structure of the Medusa object passed in using the Institutional Proposals(if available)
as the top level nodes.
|
protected List<MedusaNode> |
MedusaServiceImpl.getMedusaTree(String moduleName,
Long moduleIdentifier,
String preferredModule)
Builds the tree-like structure of MedusaNode objects using the module name and identifier
|
protected List<MedusaNode> |
MedusaServiceImpl.getParentNodes(HashMap<org.kuali.rice.krad.bo.BusinessObject,List<org.kuali.rice.krad.bo.BusinessObject>> graph,
String[] preferedOrder)
Searches through the graph using the preferred order for Bos to occupy the top level(or parent nodes)
and then populates all child nodes of each top level node.
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
MedusaServiceImpl.populateChildNodes(HashMap<org.kuali.rice.krad.bo.BusinessObject,List<org.kuali.rice.krad.bo.BusinessObject>> graph,
MedusaNode node,
List<MedusaNode> parentNodes)
Using the links defined in the graph hash, add all nodes linked to the current node
|
| Modifier and Type | Method and Description |
|---|---|
protected boolean |
MedusaServiceImpl.isBoInList(List<MedusaNode> nodes,
org.kuali.rice.krad.bo.BusinessObject bo)
Looks through the list of MedusaNodes to see if the BO is equal to the BO of one of the nodes.
|
protected void |
MedusaServiceImpl.populateChildNodes(HashMap<org.kuali.rice.krad.bo.BusinessObject,List<org.kuali.rice.krad.bo.BusinessObject>> graph,
MedusaNode node,
List<MedusaNode> parentNodes)
Using the links defined in the graph hash, add all nodes linked to the current node
|
Copyright © 2013 The Kuali Foundation. All Rights Reserved.