...
Generally speaking, the revert operation may be a simple one or a combinaison of a moddn and a add/delete operation, depending on the case.
There are 14 13 cases :
- The initial RDN is simple, the target RDN is simple, we don't delete the oldRDN : We just have to remove the newly added AVA if it's not present into the original entry
- The initial RDN is simple, the target RDN is simple, we delete the oldRDN : We have to add the old AVA and to remove the newly added AVA if it's not present into the original entry
- The initial RDN is composite, the target is simple, they don't overlap, we don't delete the oldRDN : We just have to remove the newly added AVA if it's not present into the original entry
- The initial RDN is composite, the target is simple, they don't overlap, we delete the oldRDN : We have to add the original AVAs, and to remove the newly added AVAs if it's not present into the original entry
- The initial RDN is composite, the target is simple, they overlap, we don't delete the oldRDN : Nothing special to doThe initial RDN is composite, the target is simple, they overlap, we delete the oldRDN : We have to add the removed AVAs except the one which is in the new RDN
- The initial RDN is simple, the target RDN is composite, they don't overlap, we don't delete the oldRDN : We have to remove all the new AVAs
- The initial RDN is simple, the target RDN is composite, they don't overlap, we delete the oldRDN : We have to remove all the new AVAs and to add the old AVA
- The initial RDN is simple, the target RDN is composite, they overlap, we don't delete the oldRDN : We have to remove all the new AVAs except the one whgich is in the old RDN
- The initial RDN is simple, the target RDN is composite, they overlap, we delete the oldRDN : We have to remove all the new AVAs except the one which is in the old RDN
- The initial RDN is composite, the target RDN is composite, they don't overlap, we don't delete the oldRDN : We have to remove all the new AVAs which are not present in the original entry
- The initial RDN is composite, the target RDN is composite, they don't overlap, we delete the oldRDN : We have to remove all the new AVAs which are not present in the original entry and add all the removed AVAs from the original entry
- The initial RDN is composite, the target RDN is composite, they overlap, we don't delete the oldRDN : We have to remove all the new AVAs which are not present in the original entry.
- The initial RDN is composite, the target RDN is composite, they overlap, we delete the oldRDN : We have to remove all the new AVAs which are not present in the original entry and add all the removed AVAs from the original entry
Case 11 and 13 are equivalent, so are case 12 and 14. They need two operations to be applied.
...
- The initial entry does not contain any of the RDN AVA
- The initial entry contains at least one of the RDN AVA which is not part of the original RDN
One special and important point : we can't use the deleteOldDN for composite operation, as this may lead to the deletion of a mandatory attribute, hence generating an error when applying the revert operation.
case | orginal entry | target RDN | deleteoldrdn | forward ldif | resulting entry | reverse ldif | |
1.1 | dn: cn=test,ou | ||||||
case | orginal entry | target RDN | deleteoldrdn | forward ldif | resulting entry | reverse ldif | |
1.1 | dn: cn=test,ou=system | cn=joe | no | dn: cn=test, ou=system | dn: cn=joe, ou=system | dn: cn=joe, ou=system | |
1.2 | dn: cn=test,ou=system | cn=small | no | dn: cn=test, ou=system | dn: cn=small, ou=system | dn: cn=small, ou=system | |
2.1 | dn: cn=test,ou=system | cn=joe | yes | dn: cn=test, ou=system | dn: cn=joe, ou=system | dn: cn=joe, ou=system | |
2.2 | dn: cn=test,ou=system | cn=small | yes | dn: cn=test, ou=system | dn: cn=small, ou=system | dn: cn=joe, ou=system | |
3 .1 | dn: cn=small+cn=test,ou=system | cn=joe | N/A no | dn: cn=small+cn=test, ou=system | dn: cn=joe, ou=system | dn: cn=joe, ou=system | |
3.2 | dn: cn=small+cn=test,ou=system | cn=big | no | dn: cn=small+cn=test, ou=system | dn: cn=big, ou=system | dn: cn=big, ou=system | |
4.1 | dn: cn=small+cn=test,ou=system | cn=joe | yes | dn: cn=small+cn=test, ou=system | dn: cn=joe, ou=system | dn: cn=joe, ou=system | |
[cn: small] | 4.2 | dn: cn=small+cn=test,ou=system | cn=big | yes | dn: cn=small+cn=test, ou=system | dn: cn=big, ou=system | dn: cn=bigjoe, ou=system |
5 4 | dn: cn=small+cn=test,ou=system | cn=test big | no N/A | dn: cn=small+cn=test, ou=system | dn: cn=testbig, ou=system | dn: cn=testbig, ou=system | |
6 5 | cn=small+cn=test | cn=test | yes N/A | dn: cn=small+cn=test, ou=system | dn: cn=test, ou=system | dn: cn=test, ou=system | |
7 6.1 | cn=test | cn=joe+cn=plumber | no | dn: cn=test, ou=system | dn: cn=joe+cn=plumber, ou=system | dn: cn=joe+cn=plumber, ou=system | |
7 6.2 | cn=test | cn=joe+cn=small | no | dn: cn=test, ou=system | dn: cn=joe+cn=small, ou=system | dn: cn=joe+cn=small, ou=system | |
8 7.1 | cn=test | cn=joe+cn=plumber | yes | dn: cn=test, ou=system | dn: cn=joe+cn=plumber, ou=system | dn: cn=joe+cn=plumber, ou=system | |
8 7.2 | cn=test | cn=joe+cn=small | yes | dn: cn=test, ou=system | dn: cn=joe+cn=small, ou=system | dn: cn=joe+cn=small, ou=system | |
9 8.1 | cn=test | cn=small+cn=test | no | dn: cn=test, ou=system | dn: cn=small+cn=test, ou=system | dn: cn=small+cn=test, ou=system | |
9 8.2 | cn=test | cn=big+cn=test+ | no | dn: cn=test, ou=system | dn: cn=big+cn=test+cn=small, | dn: cn=big+cn=test+cn=small, | |
10 9.1 | cn=test | cn=small+cn=test | yes | dn: cn=test, ou=system | dn: cn=small+cn=test, ou=system | dn: cn=small+cn=test,ou=system | |
10 9.2 | cn=test | cn=big+cn=test+ | yes | dn: cn=test, ou=system | dn: cn=big+cn=test+cn=small, | dn: cn=big+cn=test+cn=small, | |
11 10.1 | cn=small+cn=test | cn=joe+cn=plumber | no | dn: cn=small+cn=test, ou=system | dn: cn=joe+cn=plumber, ou=system | dn: cn=joe+cn=plumber, ou=system | |
11 10.2 | cn=small+cn=test | cn=joe+cn=big | no | dn: cn=small+cn=test, ou=system | dn: cn=joe+cn=big, ou=system | dn: cn=joe+cn=big, ou=system | |
12 11.1 | cn=small+cn=test | cn=joe+cn=plumber | yes | dn: cn=small+cn=test, ou=system | dn: cn=joe+cn=plumber, ou=system | dn: cn=joe+cn=plumber, ou=system | |
12 11.2 | cn=small+cn=test | cn=joe+cn=big | yes | dn: cn=small+cn=test, ou=system | dn: cn=joe+cn=big, ou=system | dn: cn=joe+cn=big, ou=system | |
13 12.1 | cn=small+cn=test | cn=joe+cn=test | no | dn: cn=small+cn=test, ou=system | dn: cn=joe+cn=test, ou=system | dn: cn=joe+cn=test, ou=system | |
13 12.2 | cn=small+cn=test | cn=big+cn=test | no | dn: cn=small+cn=test, ou=system | dn: cn=big+cn=test, ou=system | dn: cn=big+cn=test, ou=system | |
14 13.1 | cn=small+cn=test | cn=joe+cn=test | yes | dn: cn=small+cn=test, ou=system | dn: cn=joe+cn=test, ou=system | dn: cn=joe+cn=test, ou=system | |
14 13.2 | cn=small+cn=test | cn=big+cn=test | yes | dn: cn=small+cn=test, ou=system | dn: cn=big+cn=test, ou=system | dn: cn=big+cn=test, ou=system |
The following picture represent all the different cases as a decision tree :