mirror of https://github.com/swig/swig.git
97 lines
2.4 KiB
Ruby
97 lines
2.4 KiB
Ruby
#!/usr/bin/env ruby
|
|
#
|
|
# This is a test of STL containers using proc
|
|
# objects to change the sorting function used in them. Same as a
|
|
# std::binary_predicate in C++.
|
|
#
|
|
#
|
|
#
|
|
#
|
|
#
|
|
|
|
require 'swig_assert'
|
|
require 'li_std_functors'
|
|
|
|
|
|
def _set(container)
|
|
swig_assert_each_line(<<EOF, binding)
|
|
cont = #{container}.new
|
|
[9,1,8,2,7,3,6,4,5].each { |x| cont.insert(x) }
|
|
i0 = cont.begin()
|
|
cont.to_a == [1,2,3,4,5,6,7,8,9]
|
|
cont = #{container}.new( proc { |a,b| b < a } )
|
|
[9,1,8,2,7,3,6,4,5].each { |x| cont.insert(x) }
|
|
cont.to_a == [9, 8, 7, 6, 5, 4, 3, 2, 1]
|
|
cont = #{container}.new( proc { |a,b| b > a } )
|
|
[9,1,8,2,7,3,6,4,5].each { |x| cont.insert(x) }
|
|
cont.to_a == [1, 2, 3, 4, 5, 6, 7, 8, 9]
|
|
cont = #{container}.new(proc { |a,b| b < a } )
|
|
cont.insert(1)
|
|
cont.to_a == [1]
|
|
i0 = cont.begin()
|
|
cont.erase(i0) # don't use i0 anymore, it is invalid now
|
|
cont.to_a == []
|
|
EOF
|
|
end
|
|
|
|
def b_lessthan_a(b, a)
|
|
res = b < a
|
|
# print b, "<", a, "=", res
|
|
return res
|
|
end
|
|
|
|
def _map(container)
|
|
swig_assert_each_line(<<EOF, binding)
|
|
cont = #{container}.new
|
|
cont['z'] = 9
|
|
cont['y'] = 1
|
|
cont['x'] = 8
|
|
cont['w'] = 2
|
|
cont.to_a == [['w',2],['x',8],['y',1],['z',9]]
|
|
|
|
cont = #{container}.new(proc { |a,b| b_lessthan_a(b, a) } )
|
|
cont['z'] = 9
|
|
cont['y'] = 1
|
|
cont['x'] = 8
|
|
cont['w'] = 2
|
|
cont.to_a == [['z',9],['y',1],['x',8],['w',2]]
|
|
EOF
|
|
end
|
|
|
|
def test
|
|
yield method(:_set), Li_std_functors::Set
|
|
yield method(:_map), Li_std_functors::Map
|
|
end
|
|
|
|
if RUBY_VERSION[0..2] == "2.6"
|
|
# This should raise and not segfault, but currently segfaults with Ruby 2.6
|
|
else
|
|
begin
|
|
Li_std_functors::Set.new('sd')
|
|
rescue
|
|
end
|
|
|
|
test do |proc, container|
|
|
proc.call(container)
|
|
end
|
|
|
|
# Regression test for #3385: a Ruby proc or object stored in an STL container
|
|
# is held by GC_VALUE as a raw VALUE. GC compaction must not move it, otherwise
|
|
# the next comparator call dereferences a stale VALUE and segfaults. Exercise it
|
|
# by keeping containers alive across forced compactions.
|
|
if GC.respond_to?(:verify_compaction_references)
|
|
maps = Array.new(40) { Li_std_functors::Map.new(proc { |a, b| b < a }) }
|
|
maps.each_with_index { |m, i| m["k#{i}"] = i }
|
|
GC.stress = true
|
|
15.times do |i|
|
|
begin
|
|
GC.verify_compaction_references(:expand_heap => true, :toward => :empty)
|
|
rescue ArgumentError, TypeError
|
|
GC.compact
|
|
end
|
|
maps.each_with_index { |m, j| m["x#{i}_#{j}"] = i }
|
|
end
|
|
GC.stress = false
|
|
end
|
|
end
|