ldapsdk 0.0.1
LDAPModDNRequest.h
Go to the documentation of this file.
1// $OpenLDAP$
2/*
3 * Copyright 2000-2013 The OpenLDAP Foundation, All Rights Reserved.
4 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
5 */
6
7#ifndef LDAP_MOD_DN_REQUEST_H
8#define LDAP_MOD_DN_REQUEST_H
9
10#include <LDAPRequest.h>
11
13
14 public:
16 LDAPModDNRequest(const std::string& dn, const std::string& newRDN,
17 bool deleteOld, const std::string& newParentDN,
18 LDAPAsynConnection *connect, const LDAPConstraints *cons,
19 bool isReferral=false, const LDAPRequest* parent=0);
20 virtual ~LDAPModDNRequest();
21
22 virtual LDAPMessageQueue* sendRequest();
23 virtual LDAPRequest* followReferral(LDAPMsg* urls);
24
25 private:
26 std::string m_dn;
27 std::string m_newRDN;
28 std::string m_newParentDN;
29 bool m_deleteOld;
30};
31
32#endif // LDAP_MOD_DN_REQUEST_H
33
This class represents an asynchronous connection to an LDAP-Server.
Definition: LDAPAsynConnection.h:45
This class represents some options that can be set for a LDAPConnection operation.
Definition: LDAPConstraints.h:27
This class is created for the asynchronous LDAP-operations.
Definition: LDAPMessageQueue.h:27
Definition: LDAPModDNRequest.h:12
virtual LDAPMessageQueue * sendRequest()
This method encodes the request an calls the apprpriate functions of the C-API to send the Request to...
Definition: LDAPModDNRequest.cpp:50
virtual LDAPRequest * followReferral(LDAPMsg *urls)
Definition: LDAPModDNRequest.cpp:71
LDAPModDNRequest(const std::string &dn, const std::string &newRDN, bool deleteOld, const std::string &newParentDN, LDAPAsynConnection *connect, const LDAPConstraints *cons, bool isReferral=false, const LDAPRequest *parent=0)
LDAPModDNRequest(const LDAPModDNRequest &req)
Definition: LDAPModDNRequest.cpp:18
virtual ~LDAPModDNRequest()
Definition: LDAPModDNRequest.cpp:46
This class represents any type of LDAP- Message returned from the server.
Definition: LDAPMessage.h:23
For internal use only.
Definition: LDAPRequest.h:25
bool isReferral() const
Definition: LDAPRequest.cpp:111