Files
alfresco-community-repo/source/java/org/alfresco/repo/publishing/NodeRefMapper.java
Raluca Munteanu 86dc6f3402 Merged 5.1.1 (5.1.1) to 5.1.N (5.1.2)
125484 slanglois: MNT-16155 Update source headers - remove old Copyrights from Java and JSP dource files


git-svn-id: https://svn.alfresco.com/repos/alfresco-enterprise/alfresco/BRANCHES/DEV/5.1.N/root@125603 c4b6b30b-aa2e-2d43-bbcb-ca4b014f7261
2016-04-20 10:21:07 +00:00

108 lines
2.9 KiB
Java

package org.alfresco.repo.publishing;
import org.alfresco.service.cmr.repository.NodeRef;
/**
* @author Brian
* @since 4.0
*/
public class NodeRefMapper
{
public NodeRef mapSourceNodeRef(NodeRef node)
{
StringBuilder nodeId = new StringBuilder(node.getId());
if (nodeId.length() == 36)
{
for (int index = 35; index >= 0; --index)
{
int srcChar = nodeId.charAt(index);
if (srcChar == '-')
{
continue;
}
int destChar = srcCharToDestChar(srcChar);
if (destChar != srcChar)
{
nodeId.setCharAt(index, (char)destChar);
break;
}
}
}
else
{
nodeId.append('f');
}
return new NodeRef(node.getStoreRef(), nodeId.toString());
}
public NodeRef mapDestinationNodeRef(NodeRef node)
{
StringBuilder nodeId = new StringBuilder(node.getId());
if (node.getId().endsWith("f"))
{
nodeId.deleteCharAt(nodeId.length() - 1);
}
else
{
int lastDestCharIndex = nodeId.length();
int lastDestChar = 0;
for (int index = nodeId.length() - 1; index >= 0; --index)
{
int destChar = nodeId.charAt(index);
if (destChar == '-')
{
continue;
}
if (isDestChar(destChar))
{
lastDestCharIndex = index;
lastDestChar = destChar;
}
else
{
break;
}
}
if (lastDestCharIndex < nodeId.length())
{
int srcChar = destCharToSrcChar(lastDestChar);
nodeId.setCharAt(lastDestCharIndex, (char)srcChar);
}
}
return new NodeRef(node.getStoreRef(), nodeId.toString());
}
private int srcCharToDestChar(int ch)
{
int result = ch;
if (ch >= '0' && ch <= '9')
{
result = (ch - '0') + 'A';
}
else if (ch >= 'a' && ch <= 'f')
{
result = (ch - 'a') + 10 + 'A';
}
return result;
}
private int destCharToSrcChar(int ch)
{
int result = ch;
if (ch >= 'A' && ch <= 'J') //'J' is the 10th uppercase character
{
result = ch - 'A' + '0';
}
else if (ch >= 'K' && ch <= 'P') //'P' is the 16th uppercase character
{
result = ch - 'K' + 'a';
}
return result;
}
private boolean isDestChar(int ch)
{
return (ch >= 'A' && ch <= 'P');
}
}