New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Re: [LONG] Possible utf8 implementation #587
Comments
From The RT System itselfEach store starts with fetch, then changes the "value" part of HE. I
Even Perl's malloc is yet slower than even OP dispatch. So saving a Ilya |
From The RT System itselfIZ> As I already said, shared keys break this idea. Hmm, on the other For my edification, what would happen if two 'identical' keys with Is the shared keys a space optimization or a time optimization? If it <chaim> |
From The RT System itself
Unless of course you end up with a bunch of shared keys with only one mark (who wants to investigate that further... how to "guess" *cheaply* -- One ring to rule them all, one ring to find them, one ring to bring them all http://mark.mielke.cc/ |
@iabyn - Status changed from 'stalled' to 'resolved' |
@iabyn - Status changed from 'stalled' to 'resolved' |
1 similar comment
@iabyn - Status changed from 'stalled' to 'resolved' |
Migrated from rt.perl.org#1444 (status was 'resolved')
Searchable as RT1444$
The text was updated successfully, but these errors were encountered: