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
Huge repeat counts are considered as negative numbers (‘a’ x 9999999999999999999) #5279
Comments
From @AlexDanielCode: Result: What's interesting is that there is a check in place: Code: Result: Also, with even bigger numbers we get this: Code: Result: But the problem is that nqp::unbox_i returns a negative number: Code: Result: And that's probably why it is considered to be negative when using [x]. Also see this: Code: Result: Which is probably how it is supposed to work, but it looks like the check in [x] operator has to be done earlier. |
From @MasterDuke17On Sat Apr 30 03:37:46 2016, alex.jakimenko@gmail.com wrote:
I submitted a Rakudo PR (rakudo/rakudo#867), but after some discussion with jnthn (http://irclog.perlgeek.de/perl6-dev/2016-09-08#i_13173728), it looks like the PR may be obsoleted once a fix is applied in MoarVM. |
The RT System itself - Status changed from 'new' to 'open' |
From @samcv
PR has been merged in as of MoarVM/MoarVM@ad44958 and is now in Moar blead. Unfudging the test for MoarVM. Is this still an issue for JVM? I see |
From @MasterDuke17The JVM x method was aligned with the MoarVM version in Raku/nqp#358. It can't handle values to repeat as large as MoarVM can, but that's an issue with the JVM itself that would have to be worked around. Resolving this as I believe the original errors have been addressed. Anything new can be a new ticket. |
@MasterDuke17 - Status changed from 'open' to 'resolved' |
Migrated from rt.perl.org#128035 (status was 'resolved')
Searchable as RT128035$
The text was updated successfully, but these errors were encountered: