Very efficient collection of ruby backtraces, even under heavy CPU load
require 'fast_stack'
def fib( n )
return n if ( 0..1 ).include? n
( fib( n - 1 ) + fib( n - 2 ) )
end
stacks = FastStack.profile do
fib(30)
end
puts stacks.count # => 30
This technique was conceived by https://github.com/tmm1 , big thank you.
Ruby 2.0 uses #backtrace_locations, 1.9.3 uses #backtrace
(gem template based on https://github.com/CodeMonkeySteve/fast_xor )
FAQs
Unknown package
We found that fast_stack demonstrated a not healthy version release cadence and project activity because the last version was released a year ago. It has 1 open source maintainer collaborating on the project.
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Research
Security News
Malicious Go packages are impersonating popular libraries to install hidden loader malware on Linux and macOS, targeting developers with obfuscated payloads.
Security News
Bybit's $1.46B hack by North Korea's Lazarus Group pushes 2025 crypto losses to $1.6B in just two months, already surpassing all of 2024's $1.49B total.
Security News
OpenSSF has published OSPS Baseline, an initiative designed to establish a minimum set of security-related best practices for open source software projects.