subTreeState._transient = _transient;
int subKeyDepth = rowKey.depth() - 1;
for (Iterator<TreeRowKey> iter = this.expandedNodes.iterator(); iter.hasNext(); ) {
TreeRowKey nextKey = iter.next();
if (nextKey != null && rowKey.isSubKey(nextKey)) {
subTreeState.expandedNodes.add(nextKey.getSubKey(subKeyDepth));
}
}
for (Iterator<Entry<TreeRowKey, NodeState>> iter = this.queuedNodeStates.entrySet().iterator();
iter.hasNext(); ) {
Entry<TreeRowKey, NodeState> entry = iter.next();
TreeRowKey nextKey = entry.getKey();
if (nextKey != null && rowKey.isSubKey(nextKey)) {
subTreeState.queuedNodeStates.put(nextKey.getSubKey(subKeyDepth),
entry.getValue());
}
}
return subTreeState;