pike.git / lib / modules / Protocols.pmod / LDAP.pmod / client.pike

version» Context lines:

pike.git/lib/modules/Protocols.pmod/LDAP.pmod/client.pike:1:   #pike __REAL_VERSION__      // LDAP client protocol implementation for Pike.   // - // $Id: client.pike,v 1.50 2004/07/08 16:58:42 grendel Exp $ + // $Id: client.pike,v 1.51 2004/08/23 20:35:34 mast Exp $   //   // Honza Petrous, hop@unibase.cz   //   // ----------------------------------------------------------------------   //   // History:   //   // v0.0 1998-05-25 Starting up!   // v1.0 1998-06-21 Core functions (open, bind, unbind, delete, add,   // compare, search), only V2 operations,
pike.git/lib/modules/Protocols.pmod/LDAP.pmod/client.pike:361:    //! @tt{"ldap://hostname/basedn?attrlist?scope?ext"@}    //!    //! @param context    //! TLS context of connection    //!    //! @seealso    //! @[LDAP.client.bind], @[LDAP.client.search]    void create(string|void url, object|void context)    {    -  info = ([ "code_revision" : ("$Revision: 1.50 $"/" ")[1] ]); +  info = ([ "code_revision" : ("$Revision: 1.51 $"/" ")[1] ]);       if(!url || !sizeof(url))    url = LDAP_DEFAULT_URL;       lauth = parse_url(url);       if(!stringp(lauth->scheme) ||    ((lauth->scheme != "ldap")   #if constant(SSL.sslfile)    && (lauth->scheme != "ldaps")
pike.git/lib/modules/Protocols.pmod/LDAP.pmod/client.pike:793:    ix = predef::search(filter[(op+1)..], "*");    if ((ix != -1) && (filter[op+ix] != '\\')) { // substring    object ohlp;    array oarr = ({}), ahlp = ({});    array filtval = filter[(op+1)..] / "*";       // escape processing    for(int cnt = 0; cnt < sizeof(filtval); cnt++) {    if(cnt) {    if(sizeof(filtval[cnt-1]) && filtval[cnt-1][-1] == '\\') -  ahlp[-1] = reverse(reverse(ahlp[-1])[1..]) + filtval[cnt]; +  ahlp[-1] = ahlp[-1][..sizeof (ahlp[-1]) - 2] + "*" + filtval[cnt];    else    ahlp += ({ filtval[cnt] });    } else    ahlp = ({ filtval[cnt] });    } // for       // filter elements processing (left, center & right)    ix = sizeof(ahlp);    for (int cnt = 0; cnt < ix; cnt++)    if(!cnt) { // leftmost element