Levenshtein and Damerau-Levenshtein for MySQL
Levenshtein distance is a useful metric for creating a “Fuzzy” or “Nearest match” search function.
Levenshtein distance is a useful metric for creating a “Fuzzy” or “Nearest match” search function.
In mydap() version 4 we can query all members of a container, group, or organizational unit. LDAP pagination has also been incorporated, allowing results to exceed the 1000 limit.
PHP function that gets the members of an Active Directory group, and returns the data as an array. Additional function provided to get Users’ attributes.
In this version (Version 3) we can search groups across multiple OU’s– and even multiple AD servers (by closing and establishing a new connection).
This function queries a user’s memberOf attribute to get a list of groups. It then uses user’s primaryGroupID to retrieve the distinguishedName of the corresponding primary group. The results are returned in a single, neat, array. This function can have many applications including use with a login system.
PHP function that gets the members of an Active Directory group, and returns the Users’ attributes as an array.
PHP function that gets the members of an Active Directory group, and returns the data as an array.
Simple PHP login script that authenticates through Active Directory using LDAP. Checks user’s membership against two groups, and assigns permissions to a session variable.