Hmm. Here's my guestimation. In the worst case scenario of the serialized NameID the require space that Mahara would need is:
urllength(idpentityID)+urllength(spentityID)+2+28+19
where:
2 is the number of !
28 is the number of characters in the random bit of the NameID
19 is the number of characters for the ".deleted.1256600273"
If we use a 255 varchar the sum of the lengths of the urls would be 206 characters in total or 103 chars for each.
Hmm. Here's my guestimation. In the worst case scenario of the serialized NameID the require space that Mahara would need is: idpentityID) +urllength( spentityID) +2+28+19 1256600273"
urllength(
where:
2 is the number of !
28 is the number of characters in the random bit of the NameID
19 is the number of characters for the ".deleted.
If we use a 255 varchar the sum of the lengths of the urls would be 206 characters in total or 103 chars for each.
I think that should do.
PS. Here is an example of a serialized NameID.
!https:/ /idp2.uq. edu.au/ idp/shibboleth! https:/ /wiki.caudit. edu.au/ shibboleth! lq7q48crsqzyqeh etxahzcgi/ bc=
which is 105 chars long.