suite.TestLDAPAttributesLookup(c)
				suite.TestLDAPCyrillicUser(c)
				suite.TestLDAPSlashDN(c)
				suite.TearDownSuite(c)
			},
		)
	}
}

// This test is for a fix added to handle non-normalized base DN values in the
// LDAP configuration. It runs the existing LDAP sub-tests with a non-normalized
// LDAP configuration.
func TestIAMWithLDAPNonNormalizedBaseDNConfigServerSuite(t *testing.T) {

  `You don't know much,' said the Duchess; `and that's a fact.'

  Alice did not at all like the tone of this remark, and thought
it would be as well to introduce some other subject of
conversation.  While she was trying to fix on one, the cook took
the cauldron of soup off the fire, and at once set to work
throwing everything within her reach at the Duchess and the baby
--the fire-irons came first; then followed a shower of saucepans,

pkg bufio, method (*Writer) Reset(io.Writer)
pkg compress/flate, method (*Writer) Reset(io.Writer)
pkg compress/gzip, method (*Writer) Reset(io.Writer)
pkg compress/zlib, method (*Writer) Reset(io.Writer)
pkg container/heap, func Fix(Interface, int)
pkg container/list, method (*List) MoveAfter(*Element, *Element)
pkg container/list, method (*List) MoveBefore(*Element, *Element)
pkg crypto, type PublicKey interface {}

k otherwise, where k is the // length in octets of the RSA modulus n." 🙄 // // This is extremely annoying, as all other encrypt and decrypt inputs are // always the exact same size as the modulus. Since it only happens for // weird modulus sizes, fix it by padding inefficiently. if emLen, k := len(em), priv.pub.Size(); emLen < k { emNew := make([]byte, k) copy(emNew[k-emLen:], em) em = emNew } return decrypt(priv, em, withCheck) } // VerifyPSS verifies sig with RSASSA-PSS automatically detecting...

k otherwise, where k is the // length in octets of the RSA modulus n." 🙄 // // This is extremely annoying, as all other encrypt and decrypt inputs are // always the exact same size as the modulus. Since it only happens for // weird modulus sizes, fix it by padding inefficiently. if emLen, k := len(em), priv.pub.Size(); emLen < k { emNew := make([]byte, k) copy(emNew[k-emLen:], em) em = emNew } return decrypt(priv, em, withCheck) } // VerifyPSS verifies sig with RSASSA-PSS automatically detecting...