Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
Breadth first search of nexus tree using visitor to determine whether a node link matches
those searched for
Parameters:
file -
finder -
findFirst -
maintainOrder -
mon -
Returns:
map with full path as key and NodeLink as value
getUniqueDataNodes
public static java.util.Map<DataNode,java.lang.String> getUniqueDataNodes(GroupNode node)
Get a map of all the unique data nodes in a tree
Map keys are the data nodes, map values are the shortest path to each node
Parameters:
node -
Returns:
map
recursivelyLoadDataNodes
public static void recursivelyLoadDataNodes(GroupNode node)
Iterate though a tree and convert ILazyDatasets in DataNodes
to IDatasets, allowing the tree to be written into a file.
WARNING: only use on tree structures containing metadata not large datasets
as they will be loaded into memory
Parameters:
node -
getShortestUniqueSeparatorCrop
public int getShortestUniqueSeparatorCrop(java.util.Set<java.lang.String> names)