Big news for #Ruby teams! After 6 months of successful beta testing, our Rubygems ecosystem support is now generally available. Our enhanced security scanning catches supply chain threats in your Ruby dependencies that traditional tools miss.
Secure your Ruby dependencies today → https://socket.dev/blog/rubygems-ecosystem-support-now-generally-available #Rails
SocketRubygems Ecosystem Support Now Generally Available - SocketSocket's Rubygems ecosystem support is moving from beta to GA, featuring enhanced security scanning to detect supply chain threats beyond traditional ...
![class BinaryNode
attr_accessor :value, :parent, :left, :right
include Enumerable
def each(...) = each_breadth_first(...)
def initialize value, left = nil, right = nil
@value, @left, @right = value, left, right
children.each { it.parent = self }
end
def left? = (not left.nil?)
def right? = (not right.nil?)
def parent? = (not parent.nil?)
def root? = parent.nil?
def leaf? = (left.nil? and right.nil?)
def balanced? = (left? and right?)
def all_balanced? = all? { it.balanced? or it.leaf? }
def children = [left, right].compact
def ancestors = if root? then [] else parent.ancestors + [parent] end
def descendants = collect { it.children }.flatten
def depth = map { it.ancestors.size }.max + 1
def each_breadth_first(&block) = traverse :push, &block
def each_depth_first(&block) = traverse :unshift, &block
private def traverse method, &block
nodes = [self]
until nodes.empty?
current = nodes.shift
yield current
nodes.send(method, *current.children)
end
end
end](https://cdn.masto.host/rubysocial/media_attachments/files/113/999/156/392/441/217/original/aa14b29c29e46dc8.png "class BinaryNode
attr_accessor :value, :parent, :left, :right
include Enumerable
def each(...) = each_breadth_first(...)
def initialize value, left = nil, right = nil
@value, @left, @right = value, left, right
children.each { it.parent = self }
end
def left? = (not left.nil?)
def right? = (not right.nil?)
def parent? = (not parent.nil?)
def root? = parent.nil?
def leaf? = (left.nil? and right.nil?)
def balanced? = (left? and right?)
def all_balanced? = all? { it.balanced? or it.leaf? }
def children = [left, right].compact
def ancestors = if root? then [] else parent.ancestors + [parent] end
def descendants = collect { it.children }.flatten
def depth = map { it.ancestors.size }.max + 1
def each_breadth_first(&block) = traverse :push, &block
def each_depth_first(&block) = traverse :unshift, &block
private def traverse method, &block
nodes = [self]
until nodes.empty?
current = nodes.shift
yield current
nodes.send(method, *current.children)
end
end
end")
窓の杜 
