If you do want to go through all of this, let me know. Basically things can be normalized and then we can examine code points if we have a Unicode table. I was really, really hoping when they did TLF they would expose some of this Unicode data to us at the flash player level. Even compressed and only holding the data we need, it is big.
-----Original Message----- From: Michael A. Labriola [mailto:labri...@digitalprimates.net] Sent: Tuesday, January 17, 2012 3:11 PM To: flex-dev@incubator.apache.org Subject: RE: Spark StringValidator It can be solved and I did solve it. I just can't solve it in a way that is super performant yet without a lot of supplemental data (like a Unicode table). By looking at the code point, you can determine what is a character... to an extent there is some argument here on what is truly a glyph. -----Original Message----- From: Omar Gonzalez [mailto:omarg.develo...@gmail.com] Sent: Monday, January 16, 2012 3:15 PM To: flex-dev@incubator.apache.org Subject: Re: Spark StringValidator I see what you're saying, same holds true for latin characters and accented characters like ñ. Its an interesting problem, not sure it can be solved at the moment. Will have to write some tests tonight and play with this. -omar Notice: This transmission is intended only for the use of the individual or entity to which it is addressed and may contain information that is privileged or confidential. Any dissemination, distribution or copying of this transmission by anyone other than the intended recipient is strictly prohibited. If you have received this transmission in error, please notify the sender immediately by e-mail or telephone and delete the original transmission. Thank you.
