...
case | deleteoldrdn | new superior | modifying ldif | resulting entry | reverse ldif | computing the re |
1 | no | none | dn: cn=test, dc=example, dc=com | dn: cn=joe, dc=example, dc=com | dn: cn=joe, dc=example, dc=com | if deleteol |
1 | yes | none | dn: cn=test, dc=example, dc=com | dn: cn=joe, dc=example, dc=com | dn: cn=joe, dc=example, dc=com |
|
1 | no | ou=system | dn: cn=test, dc=example, dc=org | dn: cn=joe, ou=system | dn: cn=joe, ou=system |
|
1 | yes | ou=system | dn: cn=test, dc=example, dc=org | dn: cn=joe, ou=system | dn: cn=joe, ou=system |
|
Computing the reverse LDIF for a ModifyDN request follows the algorithm :
No Format |
---|
reverseLdif.deleteOldRdn = *true*
*if* modifyDn.newSuperior not empty
*then* reverseLdif.newSuperior = modifyDn.dn minus the modifyDN.dn.getRDN
reverseLdif.newRdn = modifyDn.dn.getRDN
|