bump libregraph/idm to lastest master

vendor/github.com/libregraph/idm/pkg/ldapserver/search.go

@@ -141,9 +141,17 @@ func parseSearchRequest(boundDN string, req *ber.Packet, controls *[]ldap.Contro
 		}
 		attributes = append(attributes, a)
 	}
-	searchReq := &ldap.SearchRequest{baseObject, scope,
-		derefAliases, sizeLimit, timeLimit,
-		typesOnly, filter, attributes, *controls}
+	searchReq := &ldap.SearchRequest{
+		BaseDN:       baseObject,
+		Scope:        scope,
+		DerefAliases: derefAliases,
+		SizeLimit:    sizeLimit,
+		TimeLimit:    timeLimit,
+		TypesOnly:    typesOnly,
+		Filter:       filter,
+		Attributes:   attributes,
+		Controls:     *controls,
+	}
 
 	return searchReq, nil
 }

vendor/github.com/libregraph/idm/pkg/ldapserver/server.go

@@ -210,7 +210,6 @@ listener:
 	return nil
 }
 
-//
 func (server *Server) handleConnection(conn net.Conn) {
 	boundDN := "" // "" == anonymous
 

vendor/github.com/libregraph/idm/pkg/ldbbolt/ldbbolt.go

@@ -6,16 +6,16 @@
 // Package ldbbolt provides the lower-level Database functions for managing LDAP Entries
 // in a	BoltDB database. Some implementation details:
 //
-// The database is currently separated in these three buckets
+// # The database is currently separated in these three buckets
 //
-// - id2entry: This bucket contains the GOB encoded ldap.Entry instances keyed
-//             by a unique 64bit ID
+//   - id2entry: This bucket contains the GOB encoded ldap.Entry instances keyed
+//     by a unique 64bit ID
 //
-// - dn2id: This bucket is used as an index to lookup the ID of an entry by its DN. The DN
-//          is used in an normalized (case-folded) form here.
+//   - dn2id: This bucket is used as an index to lookup the ID of an entry by its DN. The DN
+//     is used in an normalized (case-folded) form here.
 //
-// - id2children: This bucket uses the entry-ids as and index and the values contain a list
-//                of the entry ids of its direct childdren
+//   - id2children: This bucket uses the entry-ids as and index and the values contain a list
+//     of the entry ids of its direct childdren
 //
 // Additional buckets will likely be added in the future to create efficient search indexes
 package ldbbolt