はてなブックマーク

Background¶ YJIT is a new open source JIT compiler for CRuby. The project is led by a small team at Shopify in collaboration with developers from GitHub. The key advantages of this project are that the compiler delivers very fast warm-up and has fine grain control over the entire compiler pipeline. This JIT translates YARV instructions to machine code and employs a technique known as Lazy Basic Bl

Rightward assignments have been introduced since 3.0. To be honest, I'm not a big fan of the syntax because it does not add a new dimension to Ruby. Why don't we bring Ruby to the next dimension? Proposal¶ I propose "downward assignments". p(2 * 3 * 7) #=> 42 ^^^^^var p var #=> 6 This new syntax intercepts the intermediate value of a subexpression. In the above example, the subexpression 2 * 3 is

ruby 2.8.0dev (2020-08-27T07:39:13Z v3_0_0_preview1~397 2038cc6cab) [x86_64-linux] One of the Rails CI, Active Job integration test with sidekiq, against Ruby 3.0.0 has been failing since August 30, 2020. According to git bisect is is triggered by 2038cc6cab6ceeffef3ec3a765c70ae684f829ed . Somehow this issue only reproduces with Ruby on Docker like rubylang/ruby:master-nightly-bionic It does not r

Abstract¶ How about introducing anonymous Struct literal such as ${a: 1, b: 2}? It is almost the same as Struct.new(:a, :b).new(1, 2). Proposal¶ Background¶ In many cases, people use hash objects to represent a set of values such as person = {name: "ko1", country: 'Japan'} and access its values through person[:name] and so on. It is not easy to write (three characters [:]!), and it easily introduc

I'm paranoid that the ends end Ruby. I hope Ruby is endless. With so many cancellations of events this year, we may not want to want to jinx ruby too much for the 3.0 release this year because then 3.0 itself may become the endless version! (Or we could skip it, like PHP skipped a version ... I was briefly tempted to propose this on this special day today, but I really don't want to jinx it. I do,

When using a socket or a pipe for writing select() cannot determine that the socket is closed. It tells you that it is ready to write but if you don't have data to write you cannot tell that it is in fact closed. ruby internally uses poll() which can tell when a write socket is closed (without attempting a write()) but presents the broken select() interface.

My early thinking about this syntax is it's a very narrow use-case. Is it anything more than . and no need for parentheses in some rare cases? There is also the RHS assignment which feels very unnatural to me. I think there is nothing wrong with having parentheses for Range, I think they actually help readability. Martin's desugared version which works today is actually shorter and I believe most

How about adding a syntax for one-line pattern matching: <expr> in <pattern> ? [1, 2, 3] in x, y, z #=> true (with assigning 1 to x, 2 to y, and 3 to z) [1, 2, 3] in 1, 2, 4 #=> false More realistic example: json = { name: "ko1", age: 39, address: { postal: 123, city: "Taito-ku" } } if json in { name:, age: (20..), address: { city: "Taito-ku" } } p name #=> "ko1" else raise "wrong format" end It i

Reproduce process¶ irb(main):002:0> require 'date' => true irb(main):003:0> Date.new(2019, 5, 1).jisx0301 => "H31.05.01" ruby version: trunk Result of reproduce process¶ irb(main):003:0> Date.new(2019, 5, 1).jisx0301 => "H31.05.01" Expected result and the reason why you expect¶ irb(main):002:0> require 'date' => true irb(main):003:0> Date.new(2019, 5, 1).jisx0301 => "R01.05.01" reason¶ new era (Re

I know Sam opened #9113 4 years ago to suggest this but I'm revisiting the topic to see if there's any movement here for Ruby 2.6 or 2.7. I supply a major piece of Ruby infrastructure (Sidekiq) and I keep hearing over and over how Ruby is terrible with memory, a huge memory hog with their Rails apps. My users switch to jemalloc and a miracle occurs: their memory usage drops massively. Some data po

Abstract¶ We propose to introduce "2nd" GC managed heap named "Transient heap" into MRI, instead of malloc management heap. Employied GC algorithm is similar to "generational" "copying" GC algorithm. This technique can reduce problems of malloc'ed heap. Background¶ MRI and malloc¶ MRI manages memory by GC managed heap and malloc'ed heap. Objects are allocated from GC managed heap. However, each ob

Ruby¶ NOTE: Please DO NOT report security issues via this system.¶ Please report through our bounty program page at HackerOne or send a mail to security@ruby-lang.org instead. Reported problems will be published after fixes. Contributions¶ Contributions Donation How to donate Ruby development. For Users¶ UpgradingRuby MJIT How to use Ruby's JIT compiler Also follow news announcements on www.ruby-l

I am interested to improve Fiber yield/resume performance. I've used this library before: http://software.schmorp.de/pkg/libcoro.html and handled millions of HTTP requests using it. I'd suggest to use that library. As this is used in many places in Ruby (e.g. enumerable) it could be a big performance win across the board. Here is a nice summary of what was done for RethinkDB: https://rethinkdb.com

I feel really uncomfortable raising the question again, but... In several months since 2.5 release I've written a lot of code with yield_self (using backports gem with earlier versions of Ruby when necessary), and explained it several times to students, and colleagues (and in this blog post which have gained pretty decent attention). I should say that I am still assured the name chosen is really n

File bug-14678.log bug-14678.log addedDescription updated (diff)Status changed from Open to FeedbackCould you show small code to reproduce it and/or show local variables with a debugger?

CircleCI で Alpine Linux を使って Ruby 2.5.0 で Rubocop を実行した時に遭遇した例外です(Ruby 2.4.3 では発生しませんでした)。 Ruby のバージョンによって、再帰が止められるまでの回数に大きな違いがあるのはなぜでしょうか？ これは、意図された挙動なのか、Ruby の変更によるものでは無く Alpine Linux 固有の問題なのか、教えていただく事は可能でしょうか？ Alpine Linux の Tread stack size が比較的小さい事で、Ruby 2.5.0 からこのような挙動になったのでしょうか？ https://wiki.musl-libc.org/functional-differences-from-glibc.html#Thread-stack-size 再現¶ 問題の再現のため、以下の様な再帰するコードを実行し

Refinements with method_missing and respond_to_missing? behaves very strangely. class C; end using Module.new { refine C do def x() p:x; end def method_missing(m, *args) m == :foo ? p(:fooo!) : super end def respond_to_missing?(m, include_private = false) (m == :foo) || super end end } C.new.x p C.new.respond_to? :foo C.new.foo The script above doesn't respond_to :foo nor run :foo as expected. Act

For the time being, I've shut off testing MJIT on ruby-loco, as (at least when I did so) tests seemed to be timing out. As mentioned earlier in https://bugs.ruby-lang.org/issues/14464, when I try to test locally, I have a temp folder issue, as my standard user name has a space, and the temp folder used is /Users/user name/AppData/Local/temp. This causes issues when building/compiling with MJIT. I

KeyError has readers for error details, receiver and key. They are convenient to process KeyError. We can set receiver and key to KeyError by rb_key_err_new() in C. But we can't set them in Ruby. Because receiver and key use no @ instance variables. How about adding KeyError#initialize that accepts receiver and key? Because KeyError is useful in pure Ruby libraries. For example, csv library uses K

Perhaps it helps if I further clarify this issue for those who are unfamiliar with it. As you probably already know, forking (but without exec'ing) in a multithreaded environment is inherently dangerous and the environment must be carefully written to support such a thing. Apple's Objective-C libraries have traditionally not supported being called in a forked (but not exec'd) child process at all,

If I understood it correctly, you mean to pass in an optional hash to be the second argument to system() right? I have nothing against it. I think it would change existing behaviour though, if I read http://ruby-doc.org/core-2.5.0/Kernel.html#method-i-system correctly, so perhaps this may have to be targeted for 3.0, if matz approves of it? Though it may be that I misunderstood the suggestion. To

Matsuda-san suggested me that public, protected and private should return their arguments instead of self, to write such code:` require "finalist" # see https://github.com/joker1007/finalist class Foo extend Finalist final private def foo end end I believe that it's reasonable request, and also believe that there is no product code which uses the return values of public, protected and private. Mat

CentOS 6.9（gcc (GCC) 4.4.7 20120313 (Red Hat 4.4.7-18)） にてrbenv - ruby-buildを使ってRuby 2.5.0のビルドを試みると失敗します。 [~]$ rbenv install 2.5.0 Downloading ruby-2.5.0.tar.bz2... -> https://cache.ruby-lang.org/pub/ruby/2.5/ruby-2.5.0.tar.bz2 Installing ruby-2.5.0... BUILD FAILED (CentOS release 6.9 (Final) using ruby-build 20171215-6-g3bd8c9a) Inspect or clean up the working tree at /tmp/ruby-build.201712260758

abstract¶ Speedup block.call where block is passed block parameter with a special object named "proxyblock" which responds to call and invoke passed block. background¶ Ruby 2.5 improved performance of passing a passed block parameter by lazy Proc creation ([Feature #14045]). However, block.call (block is a passed block parameter) is not optimized and need to create a Proc object immediately. propo

I plan to add "branch coverage" (and "method coverage") as new target types of coverage.so, the coverage measurement library. I'd like to introduce this feature for Ruby 2.5.0. Let me to hear your opinions. Basic Usage of the Coverage API¶ The sequence is the same as the current: (1) require "coverage.so", (2) start coverage measurement by Coverage.start, (3) load a program being measured (typical

CircleCI の docker 上で ruby 2.5.0-rc1 をビルドしてみたらエラーになりました。 make 時に多くの拡張ライブラリが "Could not be configured. It will not be installed" となっていて、 fileutilsで "Operation not permitted - copy_file_range" というメッセージが出ていました。 linking ruby make[2]: Leaving directory '/tmp/ruby-2.5.0-rc1' make[1]: Leaving directory '/tmp/ruby-2.5.0-rc1' make[1]: Entering directory '/tmp/ruby-2.5.0-rc1' *** Following extensions are not

When installing ruby 2.3.1 using rbenv I get the error below: Last 10 log lines: -- C level backtrace information ------------------------------------------- verconf.h updated compiling loadpath.c linking static-library libruby-static.a ar: `u' modifier ignored since `D' is the default (see `U') Segmentation fault (core dumped) uncommon.mk:654: recipe for target 'enc.mk' failed make: *** [enc.mk]

いくつかの gem をインストールした際にコアダンプしました。 --no-ri を付けるとコアダンプしないことから ri の何かが関係していそうです。 $ gem install bitclust-core # コアダンプ $ gem install --no-ri bitclust-core # コアダンプしない 標準出力、エラー出力を添付します。