| Age | Commit message (Collapse) | Author |
|
[Misc #19250]
Notes:
Merged-By: k0kubun <takashikkbn@gmail.com>
|
|
Prefer Array#unpack1 and Enumerable#sum.
I think the bitmask formula ``2 ** @width - 1`` would be clearer, but not faster for such small integers.
Notes:
Merged-By: k0kubun <takashikkbn@gmail.com>
|
|
|
|
access properly. Because the libclang node had two children, it wasn't
handled well by the pattern matching for the bit field case.
In addition to that, this bit field has a non-1 width. Because we're
returning true/false for a width-1 bit field, I added another behavior
that works like a char value for bit fields with width 2-8.
|
|
Notes:
Merged: https://github.com/ruby/ruby/pull/6418
|
|
106744107b made this possible.
|
|
Notes:
Merged-By: k0kubun <takashikkbn@gmail.com>
|