/** * Compute a reverse LDIF of an AddRequest. It's simply a delete request * of the added entry * * @param dn the dn of the added entry * @return a reverse LDIF */ public static LdifEntry reverseAdd( DN dn ) { LdifEntry entry = new LdifEntry(); entry.setChangeType( ChangeType.Delete ); entry.setDn( dn ); return entry; }
/** * Compute a reverse LDIF of a DeleteRequest. We have to get the previous * entry in order to restore it. * * @param dn The deleted entry DN * @param deletedEntry The entry which has been deleted * @return A reverse LDIF */ public static LdifEntry reverseDel( DN dn, Entry deletedEntry ) throws LdapException { LdifEntry entry = new LdifEntry(); entry.setDn( dn ); entry.setChangeType( ChangeType.Add ); for ( EntryAttribute attribute : deletedEntry ) { entry.addAttribute( attribute ); } return entry; }
LdifEntry entry = new LdifEntry(); entry.setDn( dn );
LdifEntry reverted = new LdifEntry();
LdifEntry entry = new LdifEntry(); entry.setChangeType( ChangeType.Modify );
LdifEntry entry = new LdifEntry(); DN currentParent = null; RDN currentRdn = null;
LdifEntry restored = new LdifEntry(); restored.setChangeType( ChangeType.Modify );
RDN oldRdn, boolean deleteOldRdn ) throws LdapInvalidDnException LdifEntry reverted = new LdifEntry(); reverted.setChangeType( ChangeType.ModRdn );
DN newSuperior, RDN oldRdn, RDN newRdn ) throws LdapInvalidDnException LdifEntry reverted = new LdifEntry();